Abstract
High heterogeneity is an unignoring factor for large-scale peer-to-peer system which leads to the born of VChord. VChord is a peer-to-peer overlay network constructed on Chord aimed to exploit heterogeneity. The fundamental idea of VChord is to expand the use of virtual nodes of Chord to describe the heterogeneity of the real nodes’ capability, working with its special lookup algorithm and load transfer scheme to make full use of information of the virtual nodes. The simulation shows that VChord has achieved better routing efficiency and load distribution than standard Chord protocol.
This research is supported by National Basic Research Program of China (grant No.2002CB312002), ChinaGrid Project and Grand Project of the Science and Technology Commission of Shanghai Municipality (grant No.03dz15027).
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
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (2001)
Ratnasamy, S., Francis, P., Handley, M.: A scalable content-addressable network. In: Proceedings of NGC 2001 (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-topeer file sharing systems. In: Proceedings of Multimedia Conferencing and Networking (2002)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for dhts: Some open questions. In: First International Workshop on Peer-to-Peer Systems, IPTPS 2002 (2002)
Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (1997)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: ACM SOSP 2001 (2001)
Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in peer-to-peer overlay networks, Technical report MSR-TR-2002-82 (2002)
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
Hong, F., Li, M., Lu, X., Wang, Y., Yu, J., Li, Y. (2004). VChord: Constructing Peer-to-Peer Overlay Network by Exploiting Heterogeneity. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_105
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_105
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive