{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:08Z","timestamp":1759638968138,"version":"3.33.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,11,1]],"date-time":"2007-11-01T00:00:00Z","timestamp":1193875200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00453-007-9081-y","type":"journal-article","created":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T16:27:56Z","timestamp":1194020876000},"page":"329-350","source":"Crossref","is-referenced-by-count":5,"title":["On the Stability of Dynamic Diffusion Load Balancing"],"prefix":"10.1007","volume":"50","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[]},{"given":"Tom","family":"Friedetzky","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,1]]},"reference":[{"key":"9081_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., Awerbuch, B., Maggs, B., Rao, S.: Approximate load balancing on dynamic and asynchronous networks. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC 1993), pp. 632\u2013641 (1993)","DOI":"10.1145\/167088.167250"},{"key":"9081_CR2","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1006\/jcss.1999.1681","volume":"60","author":"W. Aiello","year":"2000","unstructured":"Aiello, W., Kushilevitz, E., Ostrovsky, R., Rosen, A.: Adaptive packet routing for bursty adversarial traffic. J. Comput. Syst. Sci. 60, 482\u2013509 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"9081_CR3","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Kirsch, A., Upfal, E.: Stability and efficiency of a random local load balancing protocol. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 472\u2013481 (2003)","DOI":"10.1109\/SFCS.2003.1238220"},{"key":"9081_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Kempe, D., Kleinberg, J.: Stability of load balancing algorithms in dynamic adversarial systems. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 399\u2013406 (2002)","DOI":"10.1145\/509907.509968"},{"key":"9081_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Berenbrink, P., Brinkmann, A., Scheideler, C.: Simple routing strategies for adversarial systems. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 158\u2013167 (2001)","DOI":"10.1109\/SFCS.2001.959890"},{"key":"9081_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Leighton, T.: A simple local control algorithm for multi-commodity flow. In: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 459\u2013468 (1993)","DOI":"10.1109\/SFCS.1993.366841"},{"key":"9081_CR7","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Leighton, T.: Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), pp. 487\u2013496 (1994)","DOI":"10.1145\/195058.195238"},{"key":"9081_CR8","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1137\/S0097539701399551","volume":"32","author":"P. Berenbrink","year":"2003","unstructured":"Berenbrink, P., Friedetzky, T., Goldberg, L.A.: The natural work-stealing algorithm is stable. SIAM J. Comput. 32, 1260\u20131279 (2003)","journal-title":"SIAM J. Comput."},{"key":"9081_CR9","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Friedetzky, T., Mayr, E.W.: Parallel continuous randomized load balancing. In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA\u201998), pp.192\u2013201 (1998)","DOI":"10.1145\/277651.277685"},{"key":"9081_CR10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/cpe.4330020403","volume":"2","author":"J.E. Boillat","year":"1990","unstructured":"Boillat, J.E.: Load balancing and Poisson equation in a graph. Concurr. Pract. Exp. 2, 289\u2013313 (1990)","journal-title":"Concurr. Pract. Exp."},{"key":"9081_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","volume":"7","author":"G. Cybenko","year":"1989","unstructured":"Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7, 279\u2013301 (1989)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9081_CR12","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0167-8191(99)00018-6","volume":"25","author":"R. Diekmann","year":"1999","unstructured":"Diekmann, R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing. J.\u00a0Parallel Comput. 25, 789\u2013812 (1999)","journal-title":"J.\u00a0Parallel Comput."},{"key":"9081_CR13","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R., Monien, B.: Load balancing of unit size tokens and expansion properties of graphs. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 266\u2013273 (2003)","DOI":"10.1145\/777412.777461"},{"key":"9081_CR14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s00224-002-1056-4","volume":"35","author":"R. Els\u00e4sser","year":"2002","unstructured":"Els\u00e4sser, R., Monien, B., Preis, R.: Diffusion schemes for load balancing on heterogeneous networks. Theory Comput. Syst. 35, 305\u2013320 (2002)","journal-title":"Theory Comput. Syst."},{"key":"9081_CR15","doi-asserted-by":"crossref","unstructured":"Ghosh, B., Leighton, F.T., Maggs, B.M., Muthukrishnan, S., Plaxton, C.G., Rajaraman, R., Richa, A.W., Tarjan, R.E., Zuckerman, D.: Tight analyses of two local load balancing algorithms. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 548\u2013558 (1995)","DOI":"10.1145\/225058.225272"},{"key":"9081_CR16","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1006\/jcss.1996.0075","volume":"53","author":"B. Ghosh","year":"1996","unstructured":"Ghosh, B., Muthukrishnan, S.: Dynamic load balancing by random matchings. J. Comput. Syst. Sci. 53, 357\u2013370 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"9081_CR17","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01955042","volume":"15","author":"F.M. auf der Heide","year":"1996","unstructured":"auf der Heide, F.M., Oesterdiekhoff, B., Wanka, R.: Strongly adaptive token distribution. Algorithmica 15, 413\u2013427 (1996)","journal-title":"Algorithmica"},{"key":"9081_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(96)00032-1","volume":"162","author":"F.M. Heide auf der","year":"1996","unstructured":"auf der Heide, F.M., Scheideler, C., Stemann, V.: Exploiting storage redundancy to speed up randomized shared memory simulations. Theor. Comput. Sci. 162, 245\u2013281 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9081_CR19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s002240000092","volume":"31","author":"S. Muthukrishnan","year":"1998","unstructured":"Muthukrishnan, S., Ghosh, B., Schultz, M.H.: First- and second-order diffusive methods for rapid, coarse, distributed load balancing. Theory Comput. Syst. 31, 331\u2013354 (1998)","journal-title":"Theory Comput. Syst."},{"key":"9081_CR20","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Rajaraman, R.: An adversarial model for distributed load balancing. In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp.\u00a047\u201354 (1998)","DOI":"10.1145\/277651.277669"},{"key":"9081_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0218015","volume":"18","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: The token distribution problem. SIAM J. Comput. 18, 229\u2013243 (1989)","journal-title":"SIAM J. Comput."},{"key":"9081_CR22","doi-asserted-by":"crossref","unstructured":"Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of Markov chains and the analysis of iterative load-balancing schemes. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 694\u2013703 (1998)","DOI":"10.1109\/SFCS.1998.743520"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9081-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9081-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9081-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T02:13:28Z","timestamp":1737512008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9081-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,1]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9081"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9081-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2007,11,1]]}}}