By Topic

A throughput analysis of reliable multicast transport protocols

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
C. Maihofer ; Inst. of Parallel & Distributed High Performance Syst., Stuttgart Univ., Germany ; K. Rothermel ; N. Mantei

Tree-based reliable multicast protocols are known to provide better scalability than the protocols based on pure sender- and receiver-initiated schemes. However, previous analytical work that has provided these results is based on a system model which assumes reliable control message delivery and synchronized local clocks. These assumptions are questionable simplifications, since they favor protocols using multicasted negative acknowledgments with a NAK avoidance scheme. In this paper, we extend the previous analysis by taking into account control data loss and asynchronous local clocks. We further analyze a new protocol class with particular importance, the tree-based approach with aggregated acknowledgments. In contrast to other approaches, this class provides reliability not only in case of message loss but also in case of node failures. Our results show that the additional overhead to cope with node failures is very low and therefore acceptable for reliable multicast implementations

Published in:

Computer Communications and Networks, 2000. Proceedings. Ninth International Conference on

Date of Conference:

2000