Chainsaw: eliminating trees from overlay multicast

  • Authors:
  • Vinay Pai;Kapil Kumar;Karthik Tamilmani;Vinay Sambamurthy;Alexander E. Mohr

  • Affiliations:
  • Department of Computer Science, Stony Brook University;Department of Computer Science, Stony Brook University;Department of Computer Science, Stony Brook University;Department of Computer Science, Stony Brook University;Department of Computer Science, Stony Brook University

  • Venue:
  • IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.