Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-2429
Authors: Rothermel, Kurt
Maihöfer, Christian
Title: A robust and efficient mechanism for constructing multicast acknowledgment trees
Issue Date: 1999
metadata.ubs.publikation.typ: Arbeitspapier
Series/Report no.: Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;1999,7
URI: http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-4781
http://elib.uni-stuttgart.de/handle/11682/2446
http://dx.doi.org/10.18419/opus-2429
Abstract: A great variety of todays networked applications require a reliable multicast service. A number of the proposed reliable multicast protocols use a positive acknowledgment scheme, which returns ACKs to the sender to confirm correct delivery. To avoid the well-known implosion problem in the case of large receiver groups, often a tree-based approach is used, i.e., receivers are organized in a tree and ACK messages are passed along the edges of this so-called ACK tree. For building up this tree variations of the Expanding Ring Search (ERS) scheme have been proposed. However, our simulations show that ERS scales poorly. In this paper, we propose an alternative scheme for building up ACK trees. This scheme is based on a so-called token repository service, wherena token represents the right to connect to a certain node in the corresponding ACK tree. Nodes that want to join a group just request a token for this group from the (distributed) token repository service. Our simulations show that our scheme causes a much lower message overhead than ERS. Moreover, the quality of the resulting ACK trees in terms of delay and reliability is in many cases higher if generated with our scheme.
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
478_1.pdf91,58 kBAdobe PDFView/Open


Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.