To what extent the structure of the players’ strategic space influences the efficiency of decentralized solutions in congestion games? In this work, we investigate whether better performance are possible when restricting to load balancing games in which players can only choose among single resources. We consider three different solutions concepts, namely, approximate pure Nash equilibria, appro...

We prove an exact lower bound of 2 1 m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2 1 m for randomized algorithms for small m and 2 2 m+1 for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2 O( log logm logm )...

We consider load balancing of temporary tasks on m machines in the restricted assignment model. It is known that the best competitive ratio for this problem is Θ( √ m). This bound is not achieved by the greedy algorithm whose competitive ratio is known to be Ω(m 2 3 ). We give an alternative analysis to the greedy algorithm which is better than the known analysis for relatively small values of ...

We introduce self-interested evolutionary market agents, which act on behalf of service providers in a large decentralised system, to adaptively price their resources over time. Our agents competitively co-evolve in the live market, driving it towards the Bertrand equilibrium, the non-cooperative Nash equilibrium, at which all sellers charge their reserve price and share the market equally. We ...

Load balancing in distributed computer systems is the process of redistributing the work load among processors in the system to improve system performance. Most of previous research in using fuzzy logic for the purpose of load balancing has only concentrated in utilizing fuzzy logic concepts in describing processors load and tasks execution length. The responsibility of the fuzzy-based load bal...

Dynamic load balancing is an important factor affecting the parallel computing performance in a multiprocessor system. On the basis of an introduction to the principle of dynamic load balancing algorithm, we will find the rated efficiency, throughput, speedup, performance of the multiprocessor systems , in case of load balancing we finds through analysis that the basic reason for overhead occur...

Internet traffic is highly dynamic and difficult to predict in current network scenarios, which enormously complicates network management and resources optimization. To address this uncertainty in a robust and efficient way, two almost antagonist Traffic Engineering (TE) techniques have been proposed in the last years: Robust Routing and Dynamic Load-Balancing. Robust Routing (RR) copes with tr...

{ We nd two interesting thresholds for the number of tasks generated under a new model of on-line task assignment and load balancing environment, in which tasks are assigned without any information on current load status, and load balancing is achieved together with task assignment. It is shown that balanced task assignment can be obtained deterministically when the number of tasks exceeds the ...

There is a wide range of industrial activities involving load balancing problems and there is currently no general approach to such problems. The genetic algorithm, (Holland 1975), has proved to be successful on optimisation problems and is often used in conjunction with other methods. This paper describes and compares two methods which use the genetic algorithm to balance the load of the press...

In wireless sensor networks, many routing algorithms are designed to implement energy-efficient mechanisms. Among those, some focus on maximising an important performance index called network lifetime, which is the number of messages successfully delivered in the network before a failure. In this paper, we propose a new online algorithm taking the goal of prolonging network lifetime. When makin...