{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T06:02:40Z","timestamp":1699423360259},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2010,12,24]],"date-time":"2010-12-24T00:00:00Z","timestamp":1293148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00446-010-0125-1","type":"journal-article","created":{"date-parts":[[2010,12,23]],"date-time":"2010-12-23T14:54:11Z","timestamp":1293116051000},"page":"321-330","source":"Crossref","is-referenced-by-count":15,"title":["Distributed algorithms for QoS load balancing"],"prefix":"10.1007","volume":"23","author":[{"given":"Heiner","family":"Ackermann","sequence":"first","affiliation":[]},{"given":"Simon","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[]},{"given":"Marcel","family":"Sch\u00f6ngens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,24]]},"reference":[{"key":"125_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., Berenbrink, P., Fischer, S., Hoefer, M.: Concurrent imitation dynamics in congestion games. In: Proceedings of 28th Symposium on Principles of Distributed Computing (PODC), pp. 63\u201372 (2009)","DOI":"10.1145\/1582716.1582732"},{"key":"125_CR2","doi-asserted-by":"crossref","unstructured":"Ackermann, H., Fischer, S., Hoefer, M.: Distributed algorithms for QoS load balancing. In: Proceedings of 21st Sympsosium on Parallelism in Algorithms and Architectures (SPAA), pp. 197\u2013203 (2009)","DOI":"10.1145\/1583991.1584046"},{"key":"125_CR3","unstructured":"Awerbuch, B., Azar, Y., Khandekar, R.: Fast load balancing via bounded best response. In: Proceedings of 19th Symposium on Discrete Algorithms (SODA), pp. 314\u2013322 (2008)"},{"issue":"4","key":"125_CR4","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1137\/060660345","volume":"37","author":"P. Berenbrink","year":"2007","unstructured":"Berenbrink P., Friedetzky T., Goldberg L.A., Goldberg P., Hu Z., Martin R.: Distributed selfish load balancing. SIAM J. Comput. 37(4), 1163\u20131181 (2007)","journal-title":"SIAM J. Comput."},{"key":"125_CR5","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Friedetzky, T., Hajirasouliha, I., Hu, Z.: Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. In: Proceedings of 15th European Symposium on Algorithms (ESA), pp. 41\u201352 (2007)","DOI":"10.1007\/978-3-540-75520-3_6"},{"key":"125_CR6","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Hoefer, M., Sauerwald, T.: Distributed selfish load balancing on networks. In: Proceedings of 22nd Symposium on Discrete Algorithms (SODA) (2011, to appear)","DOI":"10.1137\/1.9781611973082.116"},{"key":"125_CR7","doi-asserted-by":"crossref","unstructured":"Doerr, B., Goldberg, L.: Drift analysis with tail bounds. In: Proceedings of 11th International Conference on Parallel Problem Solving from Nature (PPSN), vol. 1, pp. 174\u2013183 (2010)","DOI":"10.1007\/978-3-642-15844-5_18"},{"key":"125_CR8","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R., Monien, B.: Load balancing of unit size tokens and expansion properties of graphs. In: Proceedings of 15th Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 266\u2013273 (2003)","DOI":"10.1145\/777412.777461"},{"issue":"1","key":"125_CR9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7155\/jgaa.00118","volume":"10","author":"R. Els\u00e4sser","year":"2006","unstructured":"Els\u00e4sser R., Monien B., Schamberger S.: Distributing unit size workload packages in heterogeneous networks. J. Graph Alg. Appl. 10(1), 51\u201368 (2006)","journal-title":"J. Graph Alg. Appl."},{"key":"125_CR10","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R., Sauerwald, T.: Discrete load balancing is (almost) as easy as continuous load balancing. In: Proceedings of 29th Symposium on Principles of Distributed Computing (PODC), pp. 346\u2013354 (2010)","DOI":"10.1145\/1835698.1835780"},{"key":"125_CR11","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibria in load balancing. ACM Trans. Algorithms 3(3) (2007)","DOI":"10.1145\/1273340.1273348"},{"key":"125_CR12","unstructured":"Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proceedings of 16th Symposium on Discrete Algorithms (SODA), pp. 772\u2013781 (2005)"},{"key":"125_CR13","doi-asserted-by":"crossref","unstructured":"Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Proceedings of 30th International Colloquium, Automata, Languages and Programming (ICALP), pp. 514\u2013526 (2003)","DOI":"10.1007\/3-540-45061-0_42"},{"key":"125_CR14","unstructured":"Fischer, S.: Dynamic Selfish Routing. PhD thesis, Lehrstuhl f\u00fcr Algorithmen und Komplexit\u00e4t, RWTH Aachen (2007)"},{"key":"125_CR15","doi-asserted-by":"crossref","unstructured":"Fischer, S., M\u00e4h\u00f6nen, P., Sch\u00f6ngens, M., V\u00f6cking, B.: Load balancing for dynamic spectrum assignment with local information for secondary users. In: Proceedings of Symposium on Dynamic Spectrum Access Networks (DySPAN) (2008)","DOI":"10.1109\/DYSPAN.2008.38"},{"issue":"1","key":"125_CR16","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s00224-009-9198-2","volume":"47","author":"D. Fotakis","year":"2010","unstructured":"Fotakis D., Kaporis A., Spirakis P.: Atomic congestion games: Fast, myopic and concurrent. Theory Comput. Syst. 47(1), 38\u201349 (2010)","journal-title":"Theory Comput. Syst."},{"key":"125_CR17","doi-asserted-by":"crossref","unstructured":"Goldberg, P.: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In: Proceedings of 23rd Symposium on Principles of Distributed Computing (PODC), pp. 131\u2013140 (2004)","DOI":"10.1145\/1011767.1011787"},{"issue":"2","key":"125_CR18","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P. Gupta","year":"2000","unstructured":"Gupta P., Kumar P.R.: The capacity of wireless networks. IEEE Trans. Inf. Theory 46(2), 388\u2013404 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"125_CR19","doi-asserted-by":"crossref","first-page":"502","DOI":"10.2307\/1426671","volume":"13","author":"B. Hajek","year":"1982","unstructured":"Hajek B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Prob. 13, 502\u2013525 (1982)","journal-title":"Adv. Appl. Prob."},{"key":"125_CR20","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Piliouras, G., Tardos, \u00c9.: Load balancing without regret in the bulletin board model. In: Proceedings of 28th Symposium on Principles of Distributed Computing (PODC), pp. 56\u201362 (2009)","DOI":"10.1145\/1582716.1582731"},{"issue":"2","key":"125_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias E., Papadimitriou C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"125_CR22","doi-asserted-by":"crossref","unstructured":"Petrova, M., Olano, N., M\u00e4h\u00f6nen, P.: Balls and bins distributed load balancing algorithm for channel allocation. In: Proceedings of 7th Conference on Wireless on Demand Network Systems and Services (WONS) (2010)","DOI":"10.1109\/WONS.2010.5437136"},{"key":"125_CR23","volume-title":"Algorithmic Game Theory, chapter 20","author":"B. V\u00f6cking","year":"2007","unstructured":"V\u00f6cking B.: Selfish load balancing. In: Nisan, N., Tardos, \u00c9., Roughgarden, T., Vazirani, V. (eds) Algorithmic Game Theory, chapter 20, Cambridge University Press, Cambridge (2007)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0125-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-010-0125-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0125-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T04:39:36Z","timestamp":1559882376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-010-0125-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,24]]},"references-count":23,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["125"],"URL":"https:\/\/doi.org\/10.1007\/s00446-010-0125-1","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,24]]}}}