caa a22 4500 445355182 CHVBK 20180317142857.0 cr unu---uuuuu 170323e20110401xx s 000 0 eng 10.1007/s00446-010-0125-1 doi (NATIONALLICENCE)springer-10.1007/s00446-010-0125-1 Distributed algorithms for QoS load balancing [Elektronische Daten] [Heiner Ackermann, Simon Fischer, Martin Hoefer, Marcel Schöngens] We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decreases with the number of users that allocate the resource. In our dynamic, concurrent model, users may reallocate resources in a round-based fashion. As opposed to various settings analyzed in the literature, we assume that users have quality of service demands. A user has zero utility when falling short of a certain minimum performance threshold and having positive utility otherwise. Whereas various load-balancing protocols have been proposed for the setting without quality of service requirements, we consider protocols that satisfy an additional locality constraint: The behavior of a user depends merely on the state of the resource it currently allocates. This property is particularly useful in scenarios where the state of other resources is not readily accessible. For instance, if resources represent channels in a mobile network, then accessing channel information may require time-intensive measurements. We consider several variants of the model, where the quality of service demands may depend on the user, the resource, or both. For all cases we present protocols for which the dynamics converge to a state in which all users are satisfied. More importantly, the time to reach such a state scales nicely. It is only logarithmic in the number of users, which makes our protocols applicable in large-scale systems. Springer-Verlag, 2010 Ackermann Heiner Fraunhofer Institute for Industrial Mathematics ITWM, Kaiserslautern, Germany aut Fischer Simon Department of Computer Science, RWTH Aachen University, Aachen, Germany aut Hoefer Martin Department of Computer Science, RWTH Aachen University, Aachen, Germany aut Schöngens Marcel Institute of Theoretical Computer Science, ETH Zürich, Zurich, Switzerland aut Distributed Computing Springer-Verlag 23/5-6(2011-04-01), 321-330 0178-2770 23:5-6<321 2011 23 446 https://doi.org/10.1007/s00446-010-0125-1 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00446-010-0125-1 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Ackermann Heiner Fraunhofer Institute for Industrial Mathematics ITWM, Kaiserslautern, Germany aut NATIONALLICENCE 700 1- Fischer Simon Department of Computer Science, RWTH Aachen University, Aachen, Germany aut NATIONALLICENCE 700 1- Hoefer Martin Department of Computer Science, RWTH Aachen University, Aachen, Germany aut NATIONALLICENCE 700 1- Schöngens Marcel Institute of Theoretical Computer Science, ETH Zürich, Zurich, Switzerland aut NATIONALLICENCE 773 0- Distributed Computing Springer-Verlag 23/5-6(2011-04-01), 321-330 0178-2770 23:5-6<321 2011 23 446 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer