Share Email Print

Proceedings Paper

Bandwidth analysis of tree-based reliable multicast transport protocols
Author(s): Christian Maihofer; Kurt Rothermel
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, an analytical bandwidth evaluation of generic tree-based reliable multicast protocols is presented. Our analysis is based on a realistic system model, including data packet and control packet loss, asynchronous local clocks and imperfect scope-limited local groups. Two of the four considered protocol classes use aggregated acknowledgments (AAKs). With AAKs they are able to provide reliability even in case of node failures. All tree-based protocols provide good scalability for large receiver groups. Relating to protocols with aggregated acknowledgments, the analysis shows only little additional bandwidth overhead and therefore high throughput rates. Finally, we have analyzed the influence of the branching factor on a protocol's performance. Our results show that the optimal branching factor depends mainly on the probability for receiving messages from other local groups. If local groups are assigned to a separate multicast address, the optimal branching factor is 2. On the other hand, if TTL scoping is used as in RMTP or TMTP and therefore the probability for receiving messages from other local groups is greater than zero, larger local groups provide better performance.

Paper Details

Date Published: 25 July 2001
PDF: 15 pages
Proc. SPIE 4526, Scalability and Traffic Control in IP Networks, (25 July 2001); doi: 10.1117/12.434411
Show Author Affiliations
Christian Maihofer, Univ. of Stuttgart (Germany)
Kurt Rothermel, Univ. of Stuttgart (Germany)

Published in SPIE Proceedings Vol. 4526:
Scalability and Traffic Control in IP Networks
Sonia Fahmy; Kihong Park, Editor(s)

© SPIE. Terms of Use
Back to Top