Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-2439
Authors: Maihöfer, Christian
Rothermel, Kurt
Title: Constructing height-balanced multicast acknowledgment trees with the token repository service
Issue Date: 1999
metadata.ubs.publikation.typ: Arbeitspapier
Series/Report no.: Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;1999,15
URI: http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-5673
http://elib.uni-stuttgart.de/handle/11682/2456
http://dx.doi.org/10.18419/opus-2439
Abstract: Many reliable multicast protocols use so-called ACK-trees to avoid the well-known acknowledgment implosion problem in case of large multicast groups. For constructing ACK trees, usually expanding ring search techniques are applied. Our simulation results show that those techniques have scalability problems itself. In this paper, we propose a novel approach for building ACK trees, the token repository service (TRS). The basic concept of our approach is a token, which represents the right to connect to a certain node in the corresponding ACK tree. For each node in the ACK tree TRS stores a token for each potential successor this node can accept. A node that wants to join a group requests TRS for an appropriate token. The TRS protocol described in this paper provides for height-balanced ACK trees. Our simulation results show that the created height-balanced ACK trees have significant benefits. They reduce round trip delay and optimize reliability in case of node failures. Moreover, compared to expanding ring search, TRS results in a much lower message overhead.
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
TR-1999-15.pdf165,52 kBAdobe PDFView/Open


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