An Evaluation of Scalable Application-Level Multicast Built Using Peer-to-Peer Overlays (2003)
Cached
Download Links
- [www.ieee-infocom.org]
- [www.cs.huji.ac.il]
- [www.cs.usask.ca]
- [www.research.microsoft.com]
- [www.research.microsoft.com]
- [research.microsoft.com]
- [www.cs.rice.edu]
- [research.microsoft.com]
- [research.microsoft.com]
- [www.comp.nus.edu.sg]
- [www.research.microsoft.com]
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [www.eecs.harvard.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Infocom’03 |
| Citations: | 120 - 13 self |
BibTeX
@INPROCEEDINGS{Castro03anevaluation,
author = {Miguel Castro and Michael B. Jones and Anne-Marie Kermarrec and Antony Rowstron and Marvin Theimer and Helen Wang and Alec Wolman},
title = {An Evaluation of Scalable Application-Level Multicast Built Using Peer-to-Peer Overlays},
booktitle = {In Infocom’03},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building and flooding. This paper evaluates these two approaches using two different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Chord, Pastry and Tapestry, and 2) overlays which use a numerical distance metric to route through a Cartesian hyper-space, e.g., CAN. Pastry and CAN are chosen as the representatives of each type of overlay.
