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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Pai, V., Kumar, K., Tamilmani, K., Sambamurthy, V., & Mohr, A. E. (2005). Chainsaw: Eliminating trees from overlay multicast. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3640 LNCS, pp. 127–140). https://doi.org/10.1007/11558989_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
