Efficient routing for peer-to-peer overlays

1st Symposium on Networked Systems Design and Implementation, NSDI 2004

Volumn , Issue , 2004, Pages

  Gupta, Anjali ^a   Liskov, Barbara ^a   Rodrigues, Rodrigo ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; INFORMATION DISSEMINATION; NETWORK ROUTING; ROUTING PROTOCOLS; SYSTEMS ANALYSIS;

ANALYTIC MODELING; BANDWIDTH REQUIREMENT; EFFICIENT ROUTING; MEMBERSHIP INFORMATION; PEER-TO-PEER OVERLAYS; PEER-TO-PEER ROUTING; ROUTING INFORMATION; ROUTING SCHEME;

LARGE SCALE SYSTEMS;

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

References (19)

1. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. SCRIBE: A large-scale and decentralised application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC), 2002.
2. J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer. Reclaiming space from duplicate files in a serverless distributed file system. In Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems, July 2002.
3. S. Floyd, V. Jacobson, C.-G. Liu, S. McCanne, and L. Zhang. A reliable multicast framework for light-weight sessions and application level framing. IEEE/ACM Transactions on Networking, 5(6):784-803, 1997.
4. T. Gil, F. Kaashoek, J. Li, R. Morris, and J. Stribling. p2psim: A simulator for peer-to-peer protocols. http://www.pdos.lcs.mit.edu/p2psim/.
5. K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: Estimating latency between arbitrary internet end hosts. In Proceedings of the SIGCOMM Internet Measurement Workshop (IMW 2002), Marseille, France, November 2002.
6. I. Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), Feb. 2003.
7. D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the evolution of peer-to-peer systems. In Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing (PODC 2002), 2002.
8. J. C. Lin and S. Paul. RMTP: A reliable multicast transport protocol. In Proceedings IEEE INFOCOM'96, pages 1414-1424, San Francisco, CA, Mar. 1996.
9. R. Mahajan, M. Castro, and A. Rowstron. Controlling the cost of reliability in peer-to-peer overlays. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), Feb. 2003.
10. A. Mizrak, Y. Cheng, V. Kumar, and S. Savage. Structured superpeers: Leveraging heterogeneity to provide constant-time lookup. In IEEE Workshop on Internet Applications, 2003.
11. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In ACM SIGCOMM, Aug. 2001.
12. R. Rodrigues, B. Liskov, and L. Shrira. The design of a robust peer-to-peer system. In Proceedings of the 10th SIGOPS European Workshop, Sept. 2002.
13. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In IFIP/ACM Middle-ware, Nov. 2001.
14. S. Saroiu, P. K. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN'02), Jan. 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 ACM SIGCOMM, Aug. 2001.
16. I. Stoica, R. Morris, D. Karger, M. F. Kaashoeki, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. Technical Report MIT-LCS-TR-819, MIT, Mar. 2001.
17. B. Zhao, Y. Duan, L. Huang, A. Joseph, and J. Kubiatowicz. Brocade: Landmark routing on overlay networks. In Proceedings of 1st International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, USA, Mar. 2002.
18. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, Apr. 2001.
19. S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. D. Kubiatowicz. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In Network and Operating System Support for Digital Audio and Video, 11th International Workshop, NOSSDAV 2001, June 2001.