Abstract
Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefits on performance have been recognized, an uneven overlay zone distribution has emerged. Recent work has shown that topology-aware neighbor selection during construction can aggravate the unbalance of zone distribution while it reduces routing path length. The imbalance in zone sizes may lead to performance decrease and an unfair load distribution.
In this paper, we present an even topology-aware peer-to-peer network based on De Bruijn Graph by developing a dynamic zone-balancing approach.
Supported by the Project from Beijing Municipal Commission of Education No.KM200510005015.
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
Zhuge, H., Liu, J., Feng, L., Sun, X., He, C.: Query routing in a peer-to-peer semantic link network. Computational Intelligence 21(2), 197–216 (2005)
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 ACM SIGCOMM 2001 Conference, San Diego, California (2001)
Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 395–406. ACM Press, New York (2003)
Kaashoek, F., Karger, D.R.: Koorde: A simple degree-optimal hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. vol. 2735, Springer, Heidelberg (2003)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proceedings of IEEE INFOCOM 2002 (2002)
Waldvogel, M., Rinaldi, R.: Efficient topology-aware overlay network. ACM Computer Communication Review 33(1) (2003)
Xu, Z., Tang, C., Zhang, Z.: Building topology-aware overlays using global soft-state. In: ICDCS 2003 (2002)
Winter, R., Zahn, T., Schiller, J.: Topology-aware overlay construction in dynamic networks (2004)
Wang, X., Zhang, Y., Li, X., Loguinov, D.: On zone-balancing of peer-to-peer networks: analysis of random node join. In: SIGMETRICS 2004/PERFORMANCE 2004: Proceedings of the joint international conference on Measurement and modeling of computer systems, New York, NY, USA, pp. 211–222. ACM Press, New York (2004)
Gil, T., Li, J., Kaashoek, F., Morris, R.: p2psim: a simulator for peer-to-peer (p2p) protocols (2003), http://pdos.lcs.mit.edu/p2psim/
Gummadi, K., Saroiu, S., Gribble, S.: King estimating latency between arbitrary internet end hosts (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, G., Liu, J. (2005). Dynamic Zone-Balancing of Topology-Aware Peer-to-Peer Networks. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_116
Download citation
DOI: https://doi.org/10.1007/11590354_116
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)