Abstract
The performance of large distributed systems crucially depends on efficiently balancing their load. This has motivated a large amount of theoretical research how an imbalanced load vector can be smoothed with local algorithms. For technical reasons, the vast majority of previous work focuses on regular (or almost regular) graphs including symmetric topologies such as grids and hypercubes, and ignores the fact that large networks are often highly heterogenous.
We model large scale-free networks by Chung-Lu random graphs and analyze a simple local algorithm for iterative load balancing. On n-node graphs our distributed algorithm balances the load within \(\mathcal {O}((\log \log n)^2)\) steps. It does not need to know the exponent \(\beta \in (2,3)\) of the power-law degree distribution or the weights \(w_i\) of the graph model. To the best of our knowledge, this is the first result which shows that load-balancing can be done in double-logarithmic time on realistic graph classes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Boillat, J.E.: Load balancing and poisson equation in a graph. Concurrency: Pract. Exper., 2, 289–313 (1990)
Borgs, C., Brautbar, M., Chayes, J., Khanna, S., Lucier, B.: The power of local information in social networks. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 406–419. Springer, Heidelberg (2012)
Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proceedings of the National Academy of Sciences 99, 15879–15882 (2002)
Cohen, R., Havlin, S.: Scale-free networks are ultrasmall. Phys. Rev. Lett. 90, 058701 (2003)
Cooper, C., Radzik, T., Siantos, Y.: A fast algorithm to find all high degree vertices in graphs with a power law degree sequence. In: Bonato, A., Janssen, J. (eds.) WAW 2012. LNCS, vol. 7323, pp. 165–178. Springer, Heidelberg (2012)
Cybenko, G.: Load balancing for distributed memory multiprocessors. J. Parallel and Distributed Comput. 7, 279–301 (1989)
Diekmann, R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing. Parallel Computing 25, 789–812 (1999)
Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press (2009)
Elsässer, R., Sauerwald, T.: Discrete load balancing is (almost) as easy as continuous load balancing. In: 29th Symp. Principles of Distributed Computing (PODC), pp. 346–354 (2010)
Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in social networks. In: 23rd Symp. Discrete Algorithms (SODA), pp. 1642–1660 (2012)
Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in Facebook: A case study of unbiased sampling of OSNs. In: 29th IEEE Conf. Computer Communications (INFOCOM), pp. 2498–2506 (2010)
Graham, F.C., Radcliffe, M.: On the spectra of general random graphs. Electr. J. Comb. 18 (2011)
Huebner, K.H., Dewhirst, D.L., Smith, D.E., Byrom, T.G.: The Finite Element Methods for Engineers. Wiley (2001)
Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS (2008)
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)
Subramanian, R., Scherson, I.D.: An analysis of diffusive load-balancing. In: 6th Symp. Parallelism in Algorithms and Architectures (SPAA), pp. 220–225 (1994)
Surana, S., Godfrey, B., Lakshminarayanan, K., Karp, R., Stoica, I.: Load balancing in dynamic structured peer-to-peer systems. Performance Evaluation 63, 217–240 (2006)
van der Hofstad, R.: Random graphs and complex networks (2011). www.win.tue.nl/rhofstad/NotesRGCN.pdf
Zhanga, D., Jianga, C., Li, S.: A fast adaptive load balancing method for parallel particle-based simulations. Simulation Modelling Practice and Theory 17, 1032–1042 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bringmann, K., Friedrich, T., Hoefer, M., Rothenberger, R., Sauerwald, T. (2015). Ultra-Fast Load Balancing on Scale-Free Networks. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47666-6_41
Download citation
DOI: https://doi.org/10.1007/978-3-662-47666-6_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47665-9
Online ISBN: 978-3-662-47666-6
eBook Packages: Computer ScienceComputer Science (R0)