Optimizing routing in structured peer-to-peer overlay networks using routing table redundancy

Proceedings of the IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems

Volumn 2003-January, Issue , 2003, Pages 315-321

  Zhang, Rongmei ^a   Hu, Y C ^a   Druschel, P ^b  

^a Purdue University   (United States)

^b Rice University   (United States)

Author keywords

Application software; Character generation; Computer networks; Computer science; Fault tolerant systems; Intelligent networks; Large scale systems; Peer to peer computing; Redundancy; Routing

Indexed keywords

APPLICATION PROGRAMS; COMPUTER NETWORKS; COMPUTER SCIENCE; DISTRIBUTED PARAMETER NETWORKS; ELECTRIC NETWORK TOPOLOGY; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; INTELLIGENT NETWORKS; LARGE SCALE SYSTEMS; NETWORK ARCHITECTURE; NETWORK MANAGEMENT; NETWORK ROUTING; OVERLAY NETWORKS; PEER TO PEER NETWORKS; REDUNDANCY; TOPOLOGY;

CHARACTER GENERATION; FAULT TOLERANT SYSTEMS; LARGE SCALE SIMULATIONS; PEER-TO-PEER APPLICATION; PEER-TO-PEER COMPUTING; ROUTING; SELF-ORGANIZING SUBSTRATE; STRUCTURED PEER-TO-PEER;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84945183281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FTDCS.2003.1204353     Document Type: Conference Paper

References (10)

1. W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs. In Proceedings of SIGMETRICS, pages 34-43, 2000.
2. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Exploiting network proximity in peer-to-peer overlay networks. Technical report, Technical report MSR-TR-2002-82, 2002.
3. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A Scalable Content-Addressable Network. In Proceedings of ACM SIGCOMM, August 2001.
4. A. Rowstron and P. Druschel. PAST: A large-scale, persistent peer-to-peer storage utility. In 18th ACM Symposium on Operating Systems Principles, October 2001.
5. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In International Conference on Distributed Systems Platforms (Middleware), November 2001.
6. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceedings of ACM SIGCOMM, San Diego, California, August 2001.
7. H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The Impact of Routing Policy on Internet Paths. In Proceedings of IEEE INFOCOM, Alaska, USA, April 2001.
8. E. Zegura, K. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proceedings of IEEE INFOCOM, March 1996.
9. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An Infrastructure for Fault-Resilient Wide-area Location and Routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley, April 2001.
10. S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. Kubiatowicz. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-Area Data Dissemination. In Proceedings of the Eleventh International Workshop on Network and Operating System Support for Digital Audio and Video, June 2001.