Ulysses: A robust, low-diameter, low-latency peer-to-peer network

Proceedings - International Conference on Network Protocols, ICNP

Volumn 2003-January, Issue , 2003, Pages 258-267

  Kumar, A ^a   Merugu, S ^a   Xu, Jun ^a   Yu, Xingxing ^b  

^a Georgia Institute of Technology   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Delay; Network topology; Peer to peer computing; Performance analysis; Protocols; Robustness; Routing; Scalability; Telecommunication traffic; Traffic control

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC NETWORK TOPOLOGY; NETWORK PROTOCOLS; NETWORK ROUTING; ROBUSTNESS (CONTROL SYSTEMS); SCALABILITY; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; TOPOLOGY; TRAFFIC CONTROL;

DELAY; NETWORK TOPOLOGY; PEER-TO-PEER COMPUTING; PERFORMANCE ANALYSIS; ROUTING;

PEER TO PEER NETWORKS;

EID: 84943572398     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2003.1249776     Document Type: Conference Paper

References (18)

1. IRIS: Infrastructure for Resilient Internet Systems. http://www.project-iris.net.
2. M. Castro, P. Druschel, Y. Hu, and A. Rowstron. Exploiting Network Proximity in Distributed Hash Tables. In International Workshop on Future Directions in Distributed Computing, 2002.
3. P. Francis. Yoid: Extending the Internet Multicast Architecture. Unrefereed report, 38 pages, Apr 2000.
4. M. F. Kaashoek and D. R. Krager. Koorde: A simple degree-optimal distributed hash table. In IPTPS, Feb 2003.
5. L. Kleinrock. Queueing Systems, volume I and II. J. Wiley and Sons, 1975.
6. A. Kumar, S. Merugu, J. Xu, E. Zegura, and X. Yu. Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network. Technical Report GIT-CC-03-30, College of Computing, Georgia Institute of Technology, 2003.
7. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proc. of ACM PODC, 2002.
8. M. Naor and U. Wieder. A Simple Fault Tolerant Distributed Hash Table. In IPTPS, Feb 2003.
9. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In Proc. of ACM SPAA, 1997.
10. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proc. of ACM SIGCOMM, 2001.
11. S. Ratnasamy, S. Shenker, and I. Stoica. Routing Algorithms for DHTs: Some Open Questions. In Proc. of 1st Workshop on Peer-to-Peer Systems (IPTPS '02), 2002.
12. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001.
13. H. J. Siegel. Interconnection networks for SIMD machines. Computer, 12(6), 1979.
14. I. Stoica, D. Adkins, S. Zhaung, S. Shenker, and S. Surana. Internet Indirection Infrastructure. In Proc. of ACM SIGCOMM '02, 2002.
15. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proc. of ACM SIGCOMM '01, 2001.
16. J. Xu. On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks. In Proc. of IEEE Infocom, 2003.
17. E. Zegura, K. Calvert, and M. J. Donahoo. A Quantitative Comparison of Graph-based Models for Internet Topology. IEEE/ACM Transactions on Networking, 5(6), Dec 1997.
18. B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical report, U.C. Berkeley Tech. Report UCB/CSD-01-1141, 2001.