Application-level multicast using Content-Addressable Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2233 LNCS, Issue , 2001, Pages 14-29

  Ratnasamy, Sylvia ^a,b   Handley, Mark ^b   Karp, Richard ^a,b   Shenker, Scott ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ICSI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; SCALABILITY; TREES (MATHEMATICS); ROUTING PROTOCOLS;

ADDITIONAL COSTS; APPLICATION LEVEL; APPLICATION-LEVEL MULTICAST; CONTENT-ADDRESSABLE NETWORKS; DISTANCE VECTOR; DISTRIBUTED INFRASTRUCTURE; DISTRIBUTION TREE; MULTICAST SERVICES;

MULTICASTING;

EID: 84867479172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45546-9_2     Document Type: Conference Paper

References (11)

1. Y. Chawathe, S. McCanne, and E. Brewer. An architecture for internet content distribution as an infrastructure service. Available at http://www.cs.berkeley.edu/~yatin/papers, 2000.
2. S. E. Deering. Multicast Routing in a Datagram Internetwork. PhD thesis, Stanford University, Dec. 1991.
3. P. Francis. Yoid: Extendingthe internet multicast architecture. Unpublished paper, available at http://www.aciri.org/yoid/docs/index.html, Apr. 2000.
4. Y. hua Chu, S. Rao, and H. Zhang. A case for end system multicast. In Proceedings of SIGMETRICS 2000, Santa Clara, CA, June 2000.
5. J. Jannotti, D. Gifford, K. Johnson, F. Kaashoek, and J. O'Toole. Overcast: Reliable multicastingwit h an overlay network. In Proceedings of the Fourth Symposium on Operating Systems Design and Implementation, San Diego, CA, Oct. 2000.
6. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of SIGCOMM 2001, Aug. 2001.
7. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routingfor large-scale peer-to-peer systems. Available at http://research.microsoft.com/~antr/PAST/, 2001.
8. 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 SIGCOMM 2001, Aug. 2001.
9. E. Zegura, K. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proceedings IEEE Infocom '96, San Francisco, CA, May 1996.
10. B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for faulttolerant wide-area location and routing. Available at http://www.cs.berkeley.edu/~ravenben/tapestry/, 2001.
11. S. Q. Zhuang, B. Zhao, A. Joseph, R. 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 OS Support for Digital Audio and Video, New York, July 2001. ACM