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

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 343-352

  Shen, Haiying ^a   Xu, Cheng Zhong ^a   Chen, Guihai ^b  

^a Wayne State University   (United States)

^b NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CUBE-CONNECTED CYCLES (CCC); DISTRIBUTED HASH TABLES (DHT); ROUTING ALGORITHM; ROUTING TABLES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; ROUTERS; SET THEORY;

DATA STRUCTURES;

EID: 12444332029     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Gnutella. http://www.gnutella.com.
2. P. Annexstein, M. Baumslag, and A. L. Rosenberg. Group action graphs and parallel architecture. SIAM J. Computing, 19:544-569, 1990.
3. G. Chen, C. Xu, H. Shen, and D. Chen. P2p overlay networks of constant degree. In Lecture Notes in Computer Science: Proc. of the Int'l Workshop on Grid and Cooperative Computing, pages 285-192, December 2003.
4. I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Proc. of the ICSI Workshop on Design Issues in Anonymity and Un-observability, 2000.
5. R. Feldmann and W. Unger. The cube-connected cycles network is a subgraph of the bufferfly network. Parallel Processing Letters, 2(1): 13-19, 1991.
6. M. F. Kaashoek and R. Karger. Koorde: A simple degree-optimal distributed hash table. In 2nd International workshop on P2P Systems(IPIPS'03), 2003.
7. Q. Lv and S. Shenker. Search and Replication in Unstructured Peer-to-Peer Networks. In Proceedings of ACM SIGGRAPH; 02, August 2002.
8. N. Lynch, D. Malkhi, and D. Ratajczak. Atomic Data Access in Distributed Hash Tables. In Proc. of the International Peer-to-Peer Symposium, 2002.
9. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proc. of Principles of Distributed Computing (PODC 2002), 2002.
10. P. Maymounkov and D. Mazires. Kademlia: A peer-to-peer information system based on the xor metric. The 1st Interational Workshop on Peer-to-Peer Systems (IPTPS'02), 2002.
11. C. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc. of ACM SPAA, pages 311-320, 1997.
12. F. Preparata and J. Vuillemin. The cube-connected cycles: A versatile network for parallel computation. CACM, 24(5):300-309, 1981.
13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, pages 329-350, 2001.
14. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. 18th IFIP/ACM Int'l Conf. on Distributed Systems Platfoms(Middleware 2001), 2001.
15. I. Stoica, R. Morris, D. Liben-Nowell, Kaashoek M. F. Karger, D. R. Karger, F. Dabek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup protocol for Internet applications. In IEEE/ACMTrans. on Networking, 2002. for internet applications. In Proc. SIGCOMM (2001), August 2001.
16. B.Y. Zhao, J. Kubiatowicz, and A.D. Oseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California at Berkeley, 2001.