Artikel in Tagungsband INPROC-2001-45

Maihöfer, Christian; Rothermel, Kurt: A Delay Analysis of Tree-based Reliable Multicast Protocols.
In: IEEE (Hrsg): Proceedings of the International Conference on Computer Communications and Networks (ICCCN 01).
Universität Stuttgart, Fakultät Informatik.
S. 274-281, englisch.
Scottsdale, Arizona, USA: IEEE Press, Januar 2001.
Artikel in Tagungsband (Konferenz-Beitrag).
CR-Klassif.C.2 (Computer-Communication Networks)

We present a comparative delay analysis of tree-based reliable multicast protocols and show the influence of varying sending rates, group sizes, packet loss probabilities and branching factors of the control tree. Besides the average delivery delay we consider the delay to reliably deliver all packets and the round trip delay. The former two examines the delay between generation of a packet at the sender and correct reception at a randomly chosen receiver or all receivers, respectively. The latter is the delay between generation of a packet at the sender and reception of all acknowledgement packets at the sender. Our numerical results show that all tree-based protocols provide low delays and good scalability. From the four considered protocol classes, NAK-based protocols achieve the best scalability but ACK-based protocols achieve the lowest delays.

Volltext und
andere Links
PostScript (2623435 Bytes)
CopyrightDue to copyright restrictions, the provided ps/pdf version might be not the final version.
Abteilung(en)Universität Stuttgart, Institut für Parallele und Verteilte Höchstleistungsrechner, Verteilte Systeme
Eingabedatum25. Januar 2002
   Publ. Abteilung   Publ. Institut   Publ. Informatik