Chainsaw: Eliminating Trees from Overlay Multicast (2005)
Cached
Download Links
- [iptps05.cs.cornell.edu]
- [mnl.cs.sunysb.edu]
- [www.cs.washington.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | in IPTPS |
| Citations: | 109 - 1 self |
BibTeX
@INPROCEEDINGS{Pai05chainsaw:eliminating,
author = {Vinay Pai and Kapil Kumar and Karthik Tamilmani and Vinay Sambamurthy and Alexander E. Mohr and Er E. Mohr},
title = {Chainsaw: Eliminating Trees from Overlay Multicast},
booktitle = {in IPTPS},
year = {2005},
pages = {127--140}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we present Chainsaw, a p2p overlay multicast system that completely eliminates trees. Peers are notified of new packets by their neighbors and must explicitly request a packet from a neighbor in order to receive it. This way, duplicate data can be eliminated and a peer can ensure it receives all packets. We show with simulations that Chainsaw has a short startup time, good resilience to catastrophic failure and essentially no packet loss. We support this argument with real-world experiments on Planetlab and compare Chainsaw to Bullet and Splitstream using MACEDON.
