Abstract
Load balancing emerges as an important problem that affects the performance of structured peer-to-peer systems. This paper presents a peer-to-peer system relying on the partitionning of a de Bruijn graph. The proposed system integrates mechanisms that perform index and storage load balancing. Index load refers to the network traffic incurred by a peer in managing an object index, while storage load refers to the storage space and network traffic required to store objects. The proposed mechanisms allow to effectively distribute both index load and storage load according to the peers’ capacities.
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.
References
Bienkowski, M., Korzeniowski, M., auf der Heide, F.M.: Dynamic load balancing in distributed hash tables. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 217–225. Springer, Heidelberg (2005)
Byers, J., Considine, J., Mitzenmacher, M.: Simple load balancing for distributed hash table. In: IPTPS 2003 (February 2003)
Fraigniaud, P., Gauron, P.: Brief announcement: An overview of the content-addressable network d2b. In: ACM PODC 2003, July 2003, p. 151 (2003)
Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: IPTPS 2003 (February 2003)
Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: ACM SPAA 2004, June 2004, pp. 36–43 (2004)
Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peerto-peer systems: Routing distance and fault resilience. In: ACM SIGCOMM 2003 (August 2003)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: ACM PODC 2002, July 2002, pp. 183–192 (2002)
Manku, G.S.: Balanced binary trees for id management and load balance in distributed hash tables. In: ACM PODC 2004, July 2004, pp. 197–205 (2004)
Naor, M., Weider, U.: Novel architectures for p2p application: the continuous-discrete approach. In: ACM SPAA 2003 (June 2003)
Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in structured p2p systems. In: IPTPS 2003 (February 2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalabale contentaddressable network. In: ACM SIGCOMM 2001, August 2001, pp. 161–172 (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, p. 329. Springer, Heidelberg (2001)
Rowstron, A., Druschel, P.: Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In: ACM SOSP 2001 (October 2001)
Stoica, I., Moris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM 2001, August 2001, pp. 149–160 (2001)
Wang, X., Zhang, Y., Li, X., Loguinov, D.: On zone-balancing of peer-to-peer networks: Analysis of random node join. In: ACM SIGMETRICS 2004 (June 2004)
Zhang, Z., Shi, S.-M., Zhu, J.: Self-balanced p2p expressways: When marxism meets confucian. Technical Report MSR-TR-2002-72, Microsoft Research (2002)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerance wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California Berkeley (April 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le, VD., Babin, G., Kropf, P. (2006). A Structured Peer-to-Peer System with Integrated Index and Storage Load Balancing. In: Bui, A., Bui, M., Böhme, T., Unger, H. (eds) Innovative Internet Community Systems. IICS 2005. Lecture Notes in Computer Science, vol 3908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11749776_4
Download citation
DOI: https://doi.org/10.1007/11749776_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33973-1
Online ISBN: 978-3-540-33974-8
eBook Packages: Computer ScienceComputer Science (R0)