{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:27Z","timestamp":1740109347014,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RPIGN 253645"],"award-info":[{"award-number":["RPIGN 253645"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00446-016-0266-y","type":"journal-article","created":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T02:20:53Z","timestamp":1459995653000},"page":"143-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A simple approach for adapting continuous load balancing processes to discrete settings"],"prefix":"10.1007","volume":"29","author":[{"given":"Hoda","family":"Akbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Berenbrink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,7]]},"reference":[{"key":"266_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., Berenbrink, P., Fischer, S., Hoefer, M.: Concurrent imitation dynamics in congestion games. In: PODC, pp. 63\u201372. ACM (2009)","DOI":"10.1145\/1582716.1582732"},{"key":"266_CR2","doi-asserted-by":"crossref","unstructured":"Adolphs, C.P.J., Berenbrink, P.: Distributed selfish load balancing with weights and speeds. In: PODC, pp. 135\u2013144. ACM (2012)","DOI":"10.1145\/2332432.2332460"},{"key":"266_CR3","doi-asserted-by":"crossref","unstructured":"Adolphs, C.P.J., Berenbrink, P.: Improved bounds for discrete diffusive load balancing. In: IPDPS, pp. 820\u2013826. IEEE Computer Society (2012)","DOI":"10.1109\/IPDPS.2012.78"},{"key":"266_CR4","doi-asserted-by":"crossref","unstructured":"Aiello, W., Awerbuch, B., Maggs, B., Rao, S.: Approximate load balancing on dynamic and asynchronous networks. In: STOC, pp. 632\u2013641. ACM (1993)","DOI":"10.1145\/167088.167250"},{"key":"266_CR5","doi-asserted-by":"crossref","unstructured":"Akbari, H., Berenbrink, P.: Parallel rotor walks on finite graphs and applications in discrete load balancing. In: SPAA, page to appear. ACM (2013)","DOI":"10.1145\/2486159.2486178"},{"key":"266_CR6","doi-asserted-by":"crossref","unstructured":"Akbari H., Berenbrink P., Sauerwald, T.: A simple approach for adapting continuous load balancing processes to discrete settings. In: PODC, pp. 271\u2013280 (2012)","DOI":"10.1145\/2332432.2332486"},{"issue":"5","key":"266_CR7","doi-asserted-by":"crossref","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J Aspnes","year":"1994","unstructured":"Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. J. ACM 41(5), 1020\u20131048 (1994)","journal-title":"J. ACM"},{"key":"266_CR8","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Cooper, C., Friedetzky, T., Friedrich, T., Sauerwald, T.: Randomized diffusion for indivisible loads. In: SODA, pp. 429\u2013439. SIAM (2011)","DOI":"10.1137\/1.9781611973082.34"},{"issue":"6","key":"266_CR9","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1137\/S009753970444435X","volume":"35","author":"P Berenbrink","year":"2006","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: the heavily loaded case. SIAM J. Comput. 35(6), 1350\u20131385 (2006)","journal-title":"SIAM J. Comput."},{"issue":"3\u20134","key":"266_CR10","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s00453-010-9482-1","volume":"62","author":"P Berenbrink","year":"2012","unstructured":"Berenbrink, P., Friedetzky, T., Hajirasouliha, I., Hu, Z.: Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. Algorithmica 62(3\u20134), 767\u2013786 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"266_CR11","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.jpdc.2008.05.005","volume":"69","author":"P Berenbrink","year":"2009","unstructured":"Berenbrink, P., Friedetzky, T., Hu, Z.: A new analytical method for parallel, diffusion-type load balancing. J. Parallel Distrib. Comput. 69(1), 54\u201361 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"key":"266_CR12","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Hoefer, M., Sauerwald, T.: Distributed selfish load balancing on networks. In: SODA, pp. 1487\u20131497. SIAM (2011)","DOI":"10.1137\/1.9781611973082.116"},{"key":"266_CR13","first-page":"289","volume":"2","author":"JE Boillat","year":"1990","unstructured":"Boillat, J.E.: Load balancing and poisson equation in a graph. Concurr Comput: Pract Exp 2, 289\u2013314 (1990)","journal-title":"Concurr Comput: Pract Exp"},{"issue":"3","key":"266_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/rsa.20314","volume":"37","author":"JN Cooper","year":"2010","unstructured":"Cooper, J.N., Doerr, B., Friedrich, T., Spencer, J.: Deterministic random walks on regular trees. Random Struct Algorithms 37(3), 353\u2013366 (2010)","journal-title":"Random Struct Algorithms"},{"key":"266_CR15","doi-asserted-by":"crossref","unstructured":"Cooper, J.N., Doerr, B., Spencer, J., Tardos, G.: Deterministic Random Walks on the Integers, vol.\u00a028. pp. 2072\u20132090. Academic Press Ltd (2007)","DOI":"10.1016\/j.ejc.2007.04.018"},{"key":"266_CR16","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."},{"issue":"1\u20132","key":"266_CR17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1017\/S0963548308009589","volume":"18","author":"B Doerr","year":"2009","unstructured":"Doerr, B., Friedrich, T.: Deterministic random walks on the two-dimensional grid. Comb. Probab. Comput. 18(1\u20132), 123\u2013144 (2009)","journal-title":"Comb. Probab. Comput."},{"key":"266_CR18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M","volume":"13","author":"D Dubhashi","year":"1996","unstructured":"Dubhashi, D., Ranjan, D.: Balls and bins: a study in negative dependence. Random Struct. Algorithms 13, 99\u2013124 (1996)","journal-title":"Random Struct. Algorithms"},{"key":"266_CR19","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R., Monien, B.: Load balancing of unit size tokens and expansion properties of graphs. In: SPAA, pp. 266\u2013273 (2003)","DOI":"10.1145\/777412.777461"},{"issue":"3","key":"266_CR20","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(3), 305\u2013320 (2002)","journal-title":"Theory Comput. Syst."},{"key":"266_CR21","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R., Monien, B., Schamberger, S.: Distributing unit size workload packages in heterogeneous networks. J. Graph Algorithms Appl. 10(1), 51\u201368 (2006)","DOI":"10.7155\/jgaa.00118"},{"key":"266_CR22","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R., Sauerwald, T.: Discrete load balancing is (almost) as easy as continuous load balancing. In: PODC, pp. 346\u2013354 (2010)","DOI":"10.1145\/1835698.1835780"},{"key":"266_CR23","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibrium in load balancing. ACM Trans. Algorithms 3(3) (2007)","DOI":"10.1145\/1273340.1273348"},{"key":"266_CR24","unstructured":"Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: SODA, pp. 772\u2013781. SIAM (2005)"},{"issue":"4","key":"266_CR25","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1137\/100799216","volume":"41","author":"T Friedrich","year":"2012","unstructured":"Friedrich, T., Gairing, M., Sauerwald, T.: Quasirandom load balancing. SIAM J. Comput. 41(4), 747\u2013771 (2012)","journal-title":"SIAM J. Comput."},{"key":"266_CR26","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Sauerwald, T.: Near-perfect load balancing by randomized rounding. In: STOC pp. 121\u2013130 (2009)","DOI":"10.1145\/1536414.1536433"},{"key":"266_CR27","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Sauerwald, T.: The cover time of deterministic random walks. Electr. J. Comb. 17(1) (2010)","DOI":"10.1007\/978-3-642-14031-0_16"},{"issue":"1","key":"266_CR28","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1137\/S0097539795292208","volume":"29","author":"B Ghosh","year":"1999","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. SIAM J. Comput. 29(1), 29\u201364 (1999)","journal-title":"SIAM J. Comput."},{"key":"266_CR29","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."},{"issue":"301","key":"266_CR30","first-page":"13","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Parallel Distrib. Comput. 58(301), 13\u201330 (1963)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"266_CR31","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0743-7315(90)90025-K","volume":"10","author":"SH Hosseini","year":"1990","unstructured":"Hosseini, S.H., Litow, B., Malkawi, M., McPherson, J., Vairavan, K.: Analysis of a graph coloring based distributed load balancing algorithm. J. Parallel Distrib. Comput. 10(2), 160\u2013166 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"key":"266_CR32","unstructured":"Hosseini, S.H., Litow, B.E., Malkawi, M.I., Vairavan, K.: Distributed algorithms for load balancing in very large homogeneous systems. In: Proceedings of the 1987 Fall Joint Computer Conference on Exploring Technology: Today and Tomorrow, ACM \u201987, pp. 397\u2013404. IEEE Computer Society (1987)"},{"key":"266_CR33","doi-asserted-by":"crossref","unstructured":"Kijima S., Koga, K., Makino, K.: Deterministic random walks on finite graphs. In: ANALCO, pp. 16\u201325 (2012)","DOI":"10.1137\/1.9781611973020.3"},{"issue":"5","key":"266_CR34","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s004539900023","volume":"15","author":"F Meyer auf der Heide","year":"1996","unstructured":"Meyer auf der Heide, F., Oesterdiekhoff, B., Wanka, R.: Strongly adaptive token distribution. Algorithmica 15(5), 413\u2013427 (1996)","journal-title":"Algorithmica"},{"issue":"4","key":"266_CR35","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(4), 331\u2013354 (1998)","journal-title":"Theory Comput. Syst."},{"key":"266_CR36","doi-asserted-by":"crossref","unstructured":"Panconesi, A., Srinivasan, A.: Improved distributed algorithms for coloring and network decomposition problems. In: STOC, pp. 581\u2013592. ACM (1992)","DOI":"10.1145\/129712.129769"},{"issue":"2","key":"266_CR37","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/S0097539793250767","volume":"26","author":"A Panconesi","year":"1997","unstructured":"Panconesi, A., Srinivasan, A.: Randomized distributed edge coloring via an extension of the chernoff-hoeffding bounds. SIAM J. Comput. 26(2), 350\u2013368 (1997)","journal-title":"SIAM J. Comput."},{"key":"266_CR38","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: FOCS, pp. 694\u2013703. IEEE Computer Society (1998)","DOI":"10.1109\/SFCS.1998.743520"},{"key":"266_CR39","doi-asserted-by":"crossref","unstructured":"Sauerwald, T., Sun, H.: Tight bounds for randomized load balancing on arbitrary network topologies. In: FOCS, pp. 341\u2013350. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.86"},{"key":"266_CR40","doi-asserted-by":"crossref","unstructured":"Subramanian, R., Scherson, I.D.: An analysis of diffusive load-balancing. In: SPAA, pp. 220\u2013225. ACM (1994)","DOI":"10.1145\/181014.181361"},{"key":"266_CR41","doi-asserted-by":"crossref","unstructured":"Talwar, K., Wieder, U.: Balanced allocations: a simple proof for the heavily loaded case. In: ICALP, pp. 979\u2013990 (2014)","DOI":"10.1007\/978-3-662-43948-7_81"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0266-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0266-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0266-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T05:48:28Z","timestamp":1567748908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0266-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["266"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0266-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2016,4]]}}}