Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-2468
|Title:||A delay analysis of tree-based reliable multicast protocols|
|Series/Report no.:||Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2001,3|
|Abstract:||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 acknowledgment 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. An important aspect of our work is to be of practical relevance rather than being of only theoretical nature. Therefore, we have compared the analytical results with a RMTP and TMTP simulation. Both show similar results which confirms that our analysis can help to choose a suitable protocol and to tune them for improved performance.|
|Appears in Collections:||05 Fakultät Informatik, Elektrotechnik und Informationstechnik|
Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.