Cycloid: A constant-degree and lookup-efficient P2P overlay network

Performance Evaluation

Volumn 63, Issue 3, 2006, Pages 195-216

  Shen, Haiying ^a   Xu, Cheng Zhong ^a,c,d,e   Chen, Guihai ^b  

^a Wayne State University   (United States)

^b NANJING UNIVERSITY   (China)

^c WAYNE STATE UNIVERSITY   (United States)

^d IEEE   (United States)

^e ACM   (United States)

Author keywords

Constant degree DHT; Cycloid; Distributed hash table; Koorde; Peer to peer; Viceroy

Indexed keywords

CONSTANT-DEGREE DHT; CYCLOID; DISTRIBUTED HASH TABLE; KOORDE; PEER-TO-PEER; VICEROY;

COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; DATA REDUCTION; ROUTERS;

TELECOMMUNICATION NETWORKS;

EID: 28244466716     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2005.01.004     Document Type: Article

References (22)

1. Freenet. http://freenet.sourceforge.net.
2. Gnutella. http://www.gnutella.com.
3. F. Annexstein, M. Baumslag, and A.L. Rosenberg Group action graphs and parallel architecture SIAM J. Comput. 19 1990 544 569
4. G. Chen, C. Xu, and H. Shen P2P overlay networks of constant degree Proceedings of the International Workshop on Grid and Cooperative Computing, Lecture Notes in Computer Science, vol. 2975 2003
5. I. Clarke, A distributed decentralised information storage and retrieval system, Technical Report, Division of Informatics, University of Edinburgh, UK, 1999.
6. I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong Freenet: a distributed anonymous information storage and retrieval system Proceedings of the ICSI Workshop on Design Issues in Anonymity and Un-observability 2000
7. Clip2. com. The Gnutella protocol specification v0.4., 2000. http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf.
8. R. Feldmann, and W. Unger The cube-connected cycles network is a subgraph of the butterfly network Parallel Process. Lett. 2 1 1991 13 19
9. M.F. Kaashoek, and R. Karger Koorde: a simple degree-optimal distributed hash table Proceedings of the Second International Workshop on P2P Systems (IPIPS) 2003
10. Q. Lv, and S. Shenker Search and replication in unstructured peer-to-peer networks Proceedings of ACM SIGGRAPH August 2002
11. N. Lynch, D. Malkhi, and D. Ratajczak Atomic data access in distributed hash tables Proceedings of the International Peer-to-Peer Symposium 2002
12. D. Malkhi, M. Naor, and D. Ratajczak Viceroy: a Scalable and Dynamic Emulation of the Butterfly Proceedings of Principles of Distributed Computing (PODC'02) 2002
13. P. Maymounkov, and D. Mazires Kademlia: A peer-to-peer information system based on the xor metric Proceedings of the 1st Interational Workshop on Peer-to-Peer Systems (IPTPS) 2002
14. C. Plaxton, R. Rajaraman, and A. Richa Accessing nearby copies of replicated objects in a distributed environment Proceedings of ACM SPAA 1997 311 320
15. F.P. Preparata, and J. Vuillemin The cube-connected cycles: A versatile network for parallel computation Commun. ACM 24 5 1981 300 309
16. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker A scalable content-addressable network Proceedings of ACM SIGCOMM 2001 329 350
17. A. Rowstron, and P. Druschel Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware) 2001
18. H. Shen, A. Brodie, C. Xu, and W. Shi Scalable and secure P2P overlay networks J. Wu Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks 2004 CRC Press Boca Raton, FL
19. I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan Chord: a scalable peer-to-peer lookup protocol for Internet applications IEEE/ACM Trans. Networking 11 1 2003 17 32
20. J. Xu, A. Kumar, and X. Yu On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks IEEE J. Sel. Area Commun. 22 1 2003 151 163
21. B. Yang, and H. Garcia-Molina Comparing hybrid peer-to-peer systems Proceedings of the 27th International Conference on Very Large Databases 2001
22. B. Zhao, J. Kubiatowicz, A. Joseph, Tapestry: an infrastructure for fault-tolerant wide-area location and routing, Technical Report UCB/CSD-01-1141, Computer Science Division, UC Berkeley, 2001.