Cette thèse porte sur l'efficacité des algorithmes distribués de partage des ressources et des algorithmes de découvert de chemin en ligne. Dans la première partie de la thèse, nous analysons un jeu dans lequel les utilisateurs paient pour utiliser une ressource partagée. La ressource allouée à un utilisateur est directement proportionnel à son paiement. Chaque utilisateur veut minimiser son paiement en assurant une certaine qualité de service. Ce problème est modélisé comme un jeu non-coopératif de partage des ressources. A cause du manque des expressions analytiques de la discipline de file d'attente sous-jacente, nous pouvons résoudre le jeu que sous certaines hypothèses. Pour le cas général, nous développons une approximation basée sur un résultat fort trafic et nous validons la précision de l'approximation numériquement.Dans la deuxième partie, nous étudions l'efficacité des jeux de balance de charge, c'est à dire, nous comparons la perte de performance de routage non coopératif décentralisé avec un routage centralisé. Nous montrons que le PoA est une mesure très pessimiste car il est atteint que dans des cas pathologiques. Dans la plupart des scénarios, les implémentations distribués de balance de charge effectuent presque aussi bien que la mise en œuvre centralisée optimale.Dans la dernière partie de la thèse, nous analysons problème de découverte chemin optimal dans les graphes complets. En ce problème, les valeurs des arêtes sont inconnues, mais peuvent être interrogés. Pour une fonction donnée qui est appliquée à des chemins, l'objectif est de trouver un meilleur chemin de valeur à partir d'une source vers une destination donnée interrogation le plus petit nombre de bords. Nous vous proposons le rapport de requête en tant que mesure de l'efficacité des algorithmes qui permettent de résoudre ce problème. Nous prouvons une limite inférieure pour ne importe quel algorithme qui résout ce problème et nous avons proposé un algorithme avec un rapport de requête strictement inférieure à 2. / This thesis deals with the efficiency of distributed resource sharing algorithms and of online path discovery algorithms. In the first part of the thesis, we analyse a game in which users pay for using a shared resource. The allocated resource to a user is directly proportional to its payment. Each user wants to minimize its payment while ensuring a certain quality of service. This problem is modelled as a non-cooperative resource-sharing game. Due to lack of analytical expressions for the underlying queuing discipline, we are able to give the solution of the game only under some assumptions. For the general case, we develop an approximation based on a heavy-traffic result and we validate the accuracy of the approximation numerically. In the second part, we study the efficiency of load balancing games, i.e., we compare the loss in performance of noncooperative decentralized routing with a centralized routing. We show that the PoA is very pessimistic measure since it is achieved in only pathological cases. In most scenarios, distributed implementations of load-balancing perform nearly as well as the optimal centralized implementation. In the last part of the thesis, we analyse the optimal path discovery problem in complete graphs. In this problem, the values of the edges are unknown but can be queried. For a given function that is applied to paths, the goal is to find a best value path from a source to a given destination querying the least number of edges. We propose the query ratio as efficiency measure of algorithms that solve this problem. We prove a lower-bound for any algorithm that solves this problem and we proposed an algorithm with query ratio strictly less than 2.

No description available.

No description available.

For any business, surviving in a competitive market while maintaining all the operational performance indices up to mark is very crucial. There are several theories and techniques to improve the efficiency of the operational performances. Line balancing is one of those well practiced techniques used daily in most of the industries. Line balancing helps balance the assembly lines with regards to man, machine, takt times, etc. This thesis research was done with Electrolux laundry systems, Ljungby in Sweden. With the varying customer demands the case company was balancing its line manually using basic methods. As a part of lean development schemes, Electrolux Ljungby, wanted to transform the line balancing techniques from manual to a fully automated software. The purpose of this research is to determine the company-specific line balancing criteria which should be considered before performing line balancing. This research furthermore lays out a guideline to follow a smooth transition from the manual system of LB to an automated software by concluding the features the software must handle to perform the LB according to required objectives. A case study approach was utilized to collect all the required data to achieve the results. Using the data collection techniques such as interviews, observations and historical analysis we arrived at the data required to design the guidelines with regards to line balancing software features.  The findings suggest that the desired line balancing constraints which are very important in the multi model single sided straight-line balancing problems are flow of materials, assembly precedence, physical constraints, product demand, bill of materials, restricted processes, man power and desired line balancing objectives. Keeping these constraints into consideration the features which are desired in an onlooking line balancing software are the Integration of data and documents/ maximum control, mixed model and option intelligence and analysis, multiple resources, smart variant management, scenario management, yamazumi chart, constraints and reporting tabs. The findings of this thesis can be used as guidelines by any manufacturing industry while they consider buying a new software which can handle Line balancing problems. This research is one of its kind which talks purely about the constraints and desired features only in a specific line balancing scenario. Practitioners can use this as a base for conducting further research on constraints and features pertaining to it, for different line balancing scenarios.

In recent years there has been a large increase in the connection of photovoltaic generators to the low voltage distribution network in urban residential areas. In the future, it is predicted that this trend will continue and be accompanied with a rise in the uptake and connection of electric vehicles and heat pumps. Recently, monitoring trials have found widespread current unbalance in the feeders that transmit electrical energy to and from these urban residential areas. This unbalance is likely to be accentuated by the gradual and piecemeal uptake of the aforementioned devices. The combined impact of the changes and present day unbalance is likely to be more frequent thermal and voltage constraint violations unless new strategies are adopted to manage the flow of electrical energy. Here, a novel device named the 'phase switcher' that has no customer compliance requirements is proposed as a new tool for distribution network operators to manage the thermal and voltage constraints of cables. The phase switcher is shown to unlock cable ampacity and maximise voltage headroom and it achieves this through phase balancing in real time. A centralised local feeder controller is simulated to employ dynamic and scheduled phase switcher control algorithms on a real network model, and it's ability to unlock cable ampacity and reduce cable losses is quantified. Also, a small model based controller algorithm is presented and shown to perform almost as well as others despite having a very limited sensing and communication system requirement. Phase switchers are also quantified for their ability to increase feeder voltage headroom when employed to improve the balance of photovoltaic distributed generators across phases. To this end, an exhaustive offline photovoltaic capacity prediction technique is documented which shows that when phase switchers are placed explicitly to a known photovoltaic installation scenario, an almost linear relationship exists between the penetration level and maximum node voltage when PSs or phase conductor rejointing is considered as an option for implementation. Finally, a fast feeder assessment algorithm is detailed that is found to be better and more robust at estimating extreme maximum and minimum photovoltaic penetration level scenarios that cause over-voltage. All the work is presented within a new general mathematical framework that facilitates formulation of the problem and calculation of device phase connections for networks containing phase switchers.

This thesis deals with balancing of rotary machines in one plane. It is divided into a theoretical part and a practical part. The theoretical part is deals with the basics of vibrostatics and operational balancing, with emphasis on the evaluation of machine vibration. The practical part deals with SW solution in Matlab environment. It explains the functionality of individual parts, their arrangement, connection and mutual continuity, and layout of the program. The programmed solution is tested on a series of measurements in which the balancing itself is evalated and compared with the classical method used in balancing rotary machines in one plane.

This is a bachelor thesis which handles a balancing problem in a manual assembly line for mixed models. Many product variations that are assembled in an assembly line have different cycle times in each operation in the process. The products that are assembled in the line have also large variations in their lead times. This leads to large balancing losses leading to reduced productivity and efficiency. Many balancing losses occur due to the inefficient time that one of the products causes. Other balancing losses occur due to bottlenecks that occur in some operations. The purpose of this study is to investigate the balancing losses in a manual assembly line with mixed models. The goal is to develop a proposal for a balanced layout, as well as to minimize balancing losses and waste and maximize productivity as much as possible. Two research questions have been developed as guidelines for the study: RQ1: What factors can lead to balancing losses in a mixed-model assembly line? RQ2: How can a mixed-model assembly line be balanced without leading to other types of losses? The study is a case study that looks for problems in one case company. It is based on a literature study and the collection of real-world data, which has been collected at the case company by observations, interviews and documents that include data about production times and balancing reports.  A proposal on how balancing losses can be reduced in the best possible way has been developed. The inefficient time has been reduced and the assembly line has become more efficient and productive. With help of this improvement proposal, other types of losses could be avoided, such as losses of human resources and financial resources. This study aimed to reduce the balancing losses that one product causes in the assembly line. No rebalancing of the other products was done, but other products were considered so that the balancing of the product does not lead to extra imbalance on the other products in the line. It was important for the fall company to be able to implement a solution that does not lead to a lot of other losses. Based on the three solutions proposed, this solution was the most suitable for what the company wants. A new layout for the product’s stations has been proposed. With this layout, efficiency will increase, and downtime will decrease, thus increasing productivity. Proposal three shows that it is possible to balance a mixed-model assembly line, by terminating a product and removing it earlier from the assembly line.   Keywords: Line balancing, manual assembly, balancing loss, mixed products, mixed-model assembly / Det här är ett examensarbete på grundnivå, som behandlar ett balanseringsproblem i en manuell monteringslinje för mixade modeller. Det monteras många produktkonfigurationer som har olika cykeltider i varje station i processen. Produkterna som monteras i linan har även stora variationer i deras ledtider. Detta medför stora balanseringsförluster som leder till minskad produktivitet och effektivitet. Många balanseringsförluster uppstår på grund av den ineffektiva tiden som en av produkterna orsakar. Andra balanseringsförluster uppstår på grund av flaskhalsar som förekommer i vissa stationer.  Syftet med denna studie är att undersöka balansringsförlusterna i en manuell monteringslinje med mixade modeller. Målet är att ta fram ett förslag på en balanserad layout, samt att minimera balanseringsförlusterna och slöseri och maximera produktiviteten så mycket som möjligt.   Två forskningsfrågor har tagits fram som riktlinjer för studien: F1: Vilka faktorer kan leda till balanseringsförluster i en mixad-modellmonteringslinje?  F2: Hur kan en mixad-modellmonteringslina balanseras utan att leda till andra typer av förluster? Studien är en fallstudie som undersöker problem hos ett fallföretag. Studien är baserad på en initial litteraturstudie och insamlad data, som har samlats in från fallföretaget via observationer, intervjuer samt dokument med data om produktionstider och balansrapporter.  Ett förslag på hur balanseringsförlusterna kan minskas på bästa möjliga sätt har tagits fram. Den ineffektiva tiden har minskats och monteringslinan har blivit effektivare och produktivare. Med hjälp av det här förbättringsförslaget, kunde andra typer av förluster undvikas, som exempelvis förluster av mänskliga resurser och ekonomiska resurser.   Denna studie är gjord för att minska balanseringsförlusterna som en av produkterna orsakar i monteringslinjen. Ingen ombalansering på de andra produkterna gjordes, men det togs hänsyn till andra produkter så att balanseringen av den produkten inte leder till extra obalans på de andra produkter i linan. Det var viktigt för fallföretaget att kunna implementera en lösning som inte leder till massa andra förluster. Utifrån de tre lösningarna som föreslagits var denna lösning den mest lämplig för vad företaget önskar sig. En ny layout på produktens stationer har tagits fram. Med denna layout kommer effektiviteten att öka och dötiden minska, och därmed ökas produktiviteten. Förslag tre visar sig att det är möjligt att kunna balansera en mixad-modellmonteringslina, genom att avsluta en produkt och ta ut den tidigare ur monteringslinan.   Nyckelord: Line balancing, manuell montering, balanseringsförluster, mixed products, mixed-model assembly line.

As more online services are migrated from monolithic systems into decoupled distributed micro services, the need for efficient internal load balancing solutions increases. Today, there exists two main approaches for load balancing internal traffic between micro services. One approach uses either a central or sidecar proxy to load balance queries over all available server endpoints. The other approach lets client themselves decide which of all available endpoints to send queries to. This study investigates a new approach called lookaside load balancing. This approach consists of a load balancer that uses the control plane to gather a list of service endpoints and their current load. The load balancer can then dynamically provide clients with a subset of suitable endpoints they connect to directly. The endpoint distribution is controlled by a lookaside load balancing algorithm. This study presents such an algorithm that works by changing the endpoint assignment in order to keep current load between an upper and lower bound. In order to compare each of these three load balancing approaches, a test environment in Kubernetes is constructed and modeled to be similar to a real service mesh. With this test environment, we perform four experiments. The first experiment aims at finding suitable settings for the lookaside load balancing algorithm as well as a baseline load configuration for clients and servers. The second experiments evaluates the underlying network infrastructure to test for possible bias in latency measurements. The final two experiments evaluate each load balancing approach in both high and low load scenarios. Results show that lookaside load balancing can achieve similar performance as client-side load balancing in terms of latency and load distribution, but with a smaller CPU and memory footprint. When load is high and uneven, or when compute resource usage should be minimized, the centralized proxy approach is better. With regards to traffic flow control and failure resilience, we can show that lookaside load balancing is better than client-side load balancing. We draw the conclusion that lookaside load balancing can be an alternative approach to client-side load balancing as well as proxy load balancing for some scenarios. / Då fler online tjänster flyttas från monolitsystem till uppdelade distribuerade mikrotjänster, ökas behovet av intern lastbalansering. Idag existerar det två huvudsakliga tillvägagångssätt för intern lastbalansering mellan interna mikrotjänster. Ett sätt använder sig antingen utav en central- eller sido-proxy for att lastbalansera trafik över alla tillgängliga serverinstanser. Det andra sättet låter klienter själva välja vilken utav alla serverinstanser att skicka trafik till. Denna studie undersöker ett nytt tillvägagångssätt kallat extern lastbalansering. Detta tillvägagångssätt består av en lastbalanserare som använder kontrollplanet för att hämta en lista av alla serverinstanser och deras aktuella last. Lastbalanseraren kan då dynamiskt tillsätta en delmängd av alla serverinstanser till klienter och låta dom skapa direktkopplingar. Tillsättningen av serverinstanser kontrolleras av en extern lastbalanseringsalgoritm. Denna studie presenterar en sådan algoritm som fungerar genom att ändra på tillsättningen av serverinstanser för att kunna hålla lasten mellan en övre och lägre gräns. För att kunna jämföra dessa tre tillvägagångssätt för lastbalansering konstrueras och modelleras en testmiljö i Kubernetes till att vara lik ett riktigt service mesh. Med denna testmiljö utför vi fyra experiment. Det första experimentet har som syfte att hitta passande inställningar till den externa lastbalanseringsalgoritmen, samt att hitta en baskonfiguration för last hos klienter or servrar. Det andra experimentet evaluerar den underliggande nätverksinfrastrukturen för att testa efter potentiell partiskhet i latensmätningar. De sista två experimenten evaluerar varje tillvägagångssätt av lastbalansering i både scenarier med hög och låg belastning. Resultaten visar att extern lastbalansering kan uppnå liknande prestanda som klientlastbalansering avseende latens och lastdistribution, men med lägre CPU- och minnesanvändning. När belastningen är hög och ojämn, eller när beräkningsresurserna borde minimeras, är den centraliserade proxy-metoden bättre. Med hänsyn till kontroll över trafikflöde och resistans till systemfel kan vi visa att extern lastbalansering är bättre än klientlastbalansering. Vi drar slutsatsen att extern lastbalansering kan vara ett alternativ till klientlastbalansering samt proxylastbalansering i vissa fall.

No / In the telecommunication networks the introduction of Next Generation Wireless Networks (NGWN) has been described as the most significant change in wireless communication. The convergence of different access networks in NGWN allows generalized mobility, consistency and ubiquitous provision of services to mobile users. The general target of NGWN is to transport different types of information like voice, data, and other media like video in packets form like IP. The NGWNs offer significant savings in costs to the operators along with new and interesting services to the consumers. Major challenges in NGWN are efficient resource utilization, maintaining service quality, reliability and the security. This paper proposes a solution for seamless load aware Radio Access Technology (RAT) selection based on interworking of different RATs in NGWN. In this paper novel load balancing algorithms have been proposed which have been simulated on the target network architecture for TCP data services. The IEEE 802.21 Media Independent Handover (MIH) is utilized in load balancing specifically for mobility management, which enable low handover latency by reducing the target network detection time. The proposed method considers the network type, signal strength, data rate and network load as primary decision parameters for RAT selection process and consists of two different algorithms, one located in the mobile terminal and the other at the network side. The network architecture, the proposed load balancing framework and RAT selection algorithms were simulated using NS2. Different attributes like load distribution in the wireless networks and average throughput to evaluate the effects of load balancing in considered scenarios.

No / The ever increasing user QoS demands and emergence of new user applications make job of network operators and manufacturers more challenging for efficiently optimisation and managing radio resources in radio the radio resources pools of different wireless networks. A group of strategies or mechanisms which are collectively responsible for efficient utilisation of radio resources available within the Radio Access Technologies (RAT) are termed as Radio Resource Management (RRM). The traditional RRM strategies are implemented independently in each RAT, as each RRM strategy considers attributes of a particular access technology. Therefore traditional RRM strategies are not suitable for heterogeneous wireless networks. Common Radio Resource Management (CRRM) or joint radio resource management (JRRM) strategies are proposed for coordinating radio resource management between multiple RATs in an improved manner. In this paper a fuzzy algorithm based CRRM strategy is presented to efficiently utilise the available radio resources in heterogeneous wireless networks. The proposed CRRM strategy balances the load in heterogeneous wireless networks and avoids the unwanted congestion situation. The results such as load distribution, packet drop rate and average throughput at mobile nodes are used to demonstrate the benefits of load balancing in heterogeneous wireless networks using proposed strategy.