Abstract
There has been a considerable amount of recent research on load balancing for distributed hash tables (DHTs), a fundamental tool in Peer-to-Peer networks. Previous work in this area makes the assumption of homogeneous processors, where each processor has the same power. Here, we study load balancing strategies for a class of DHTs, called hypercubic DHTs, with heterogenous processors. We assume that each processor has a size, representing its resource capabilities, and our objective is to balance the load density (load divided by size) over the processors in the system. Our main focus is the offline version of this load balancing problem, where all of the processor sizes are known in advance. This reduces to a natural question concerning the construction of binary trees. Our main result is an efficient algorithm for this problem. The algorithm is simple to describe, but proving that it does in fact solve our binary tree construction problem is not so simple. We also give upper and lower bounds on the competitive ratio of the online version of the problem.
This work supported by NSF grants EIA-0080119, CCR-0133664, and ITR-0325726.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aberer, K., Datta, A., Hauswirth, M.: The quest for balancing peer load in structured peer-to-peer systems (2003)
Adler, M., Halperin, E., Karp, R.M., Vazirani, V.V.: A stochastic process on the hypercube with applications to peer-to-peer networks. In: Proceedings of the thirty-fifth ACM symposium on Theory of computing, pp. 575–584. ACM Press, New York (2003)
Mondal, M.K.A., Goda, K.: Effective load balancing of peer-to-peer systems. In: IEICE workshop on Data engineering, number 2-B-01 (2003)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Byers, J., Considine, J., Mitzenmacher, M.: Simple load balancing for distributed hash tables
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York (1991)
Ruhl, M., Karger, D.R.: New algorithms for load balancing in peer-to-peer systems. Technical Report LCS-TR-911, UC Berkeley (July 2003)
Evans, W.S., Kirkpatrick, D.G.: Restructuring ordered binary trees. In: Symposium on Discrete Algorithms, pp. 477–486 (2000)
Gagie: New ways to construct binary search trees. In: ISAAC: 14th International Symposium on Algorithms and Computation (formerly SIGAL International Symposium on Algorithms), Organized by Special Interest Group on Algorithms (SIGAL) of the Information Processing Society of Japan (IPSJ) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers (IEICE)) (2003)
Golin, M.J., Kenyon, C., Young, N.E.: Huffman coding with unequal letter costs (extended abstract)
Golumbic, M.: Combinatorial merging. IEEE Transactions on Computers 24, 1164–1167 (1976)
Frans Kaashoek, M., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table
Liu, J., Adler, M.: Marked-union algorithm for load balancing in hypercubic distributed hash tables with heterogeneous processors. Technical Report University of Massachusetts, Amherst Computer Science Technical Report TR04- 43 (June 2004)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (2002)
Naor, M., Wieder, U.: Novel architectures for p2p applications: the continuous-discrete approach (2002)
Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in structured p2p systems (2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM 2001 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, pp. 149–160. ACM Press, New York (2001)
van Leeuwen, J.: On the construction of Huffman trees. In: Proceedings of the 3rd International Colloquium on Automata, Languages, and Programming, pp. 382–410 (1976)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley (April 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Adler, M. (2004). Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive