Chainsaw: Eliminating Trees from Overlay Multicast | Zendy

Vinay U. Pai | Zendy; Kapil Kumar | Zendy; Karthik Tamilmani | Zendy; Vinay Sambamurthy | Zendy; A.E. Mohr | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Chainsaw: Eliminating Trees from Overlay Multicast

Author(s) -

Vinay U. Pai,

Kapil Kumar,

Karthik Tamilmani,

Vinay Sambamurthy,

A.E. Mohr

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29068-0

DOI - 10.1007/11558989_12

Subject(s) - computer science , planetlab , multicast , network packet , computer network , resilience (materials science) , overlay , distributed computing , the internet , world wide web , operating system , physics , thermodynamics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research