VChord: Constructing peer-to-peer overlay network by exploiting heterogeneity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3207, Issue , 2004, Pages 1096-1106

  Hong, Feng ^a   Li, Minglu ^a   Lu, Xinda ^a   Wang, Yi ^a   Yu, Jiadi ^a   Li, Ying ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Chord; Heterogeneity; Load balance; Peer to peer; Routing efficiency; VChord

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; EFFICIENCY; INFORMATION USE; OVERLAY NETWORKS; UBIQUITOUS COMPUTING;

CHORD; HETEROGENEITY; LOAD BALANCE; PEER TO PEER; ROUTING EFFICIENCY; VCHORD;

PEER TO PEER NETWORKS;

EID: 29144458970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30121-9_105     Document Type: Article

References (10)

1. B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph: 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)
2. A. Rowstron and P. Druschel: 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)
3. S. Ratnasamy, P. Francis, and M. Handley: A scalable content-addressable network. In Proceedings of NGC'01(2001)
4. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan: Chord: A scalable peer-to-peer lookup service for internet, IEEE/ACM Transactions on Networking, Vol. 11, No. 1,(2003)17-32
5. S. Saroiu, P. K. Gummadi, and S. D. Gribble: A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Conferencing and Networking(2002)
6. S. Ratnasamy, S. Shenker, and I. Stoica: Routing algorithms for dhts: Some open questions. In First International Workshop on Peer-to-Peer Systems (IPTPS'02)(2002)
7. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy: 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)
8. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica: Wide-area cooperative storage with CFS, ACM SOSP 2001(2001)
9. M. Castro, P. Druschel, Y. C. Hu and A. Rowstron: Exploiting network proximity in peer-to-peer overlay networks, Technical report MSR-TR-2002-82(2002)
10. p2psim,http://www.pdos.lcs.mit.edu/p2psim/