Sciweavers

Share
MM
1996
ACM

The Case for Reliable Concurrent Multicasting Using Shared Ack Trees

10 years 3 months ago
The Case for Reliable Concurrent Multicasting Using Shared Ack Trees
Such interactive, distributed multimedia applications as shared whiteboards, group editors, and simulations require reliable concurrent multicast services, i.e., the reliable dissemination of information from multiple sources to all the members of a group. Furthermore, it makes sense to offer that service on top of the increasingly available IP multicast service, which offers unreliable multicasting. This paper establishes that concurrent reliable multicasting over the Internet should be based on reliable multicast protocols based on a shared acknowledgment tree. First, we show that organizing the receivers of a reliable multicast group into an acknowledgment tree and using NAK-avoidance with periodic polling in local groups inside such a tree provides the highest maximum throughput among all classes of reliable multicast protocols proposed to date. Second, we introduce Lorax, which demonstrates the viability of implementing a reliable multicasting approach in the Internet based on ac...
Brian Neil Levine, David B. Lavo, J. J. Garcia-Lun
Added 08 Aug 2010
Updated 08 Aug 2010
Type Conference
Year 1996
Where MM
Authors Brian Neil Levine, David B. Lavo, J. J. Garcia-Luna-Aceves
Comments (0)
books