Artikel in Tagungsband INPROC-2000-10

Bibliograph.
Daten
Maihöfer, Christian: Scalable and Reliable Multicast ACK Tree Construction wit the Token Repository Service.
In: IEEE (Hrsg): Proceedings of the 8th IEEE International Conference on Networks (ICON 2000).
Universität Stuttgart, Fakultät Informatik.
S. 351-358, englisch.
Singapore: IEEE Press, September 2000.
Artikel in Tagungsband (Konferenz-Beitrag).
CR-Klassif.C.2 (Computer-Communication Networks)
Kurzfassung

Reliable multicast is realized in a scalable way by tree based approaches, where the receivers are organized in an ACK tree. Usually, expanding ring search (ERS) is used to create such ACK trees. However, ERS has some shortcomings like poor scalability, strong dependency on the multicast routing protocol and the need for bidirectional multicast capable networks, which makes it difficult to use ERS as the Internet standard mechanism. In this paper we propose the Token Repository Service (TRS), which is based on a token repository and a modification of ERS. The TRS stores tokens, which represents the right for a joining node to connect to a certain parent node in the ACK tree. Performance evaluations show that the TRS approach has several advantageous compared to ERS, like improved scalability and independence of the routing protocol.

Volltext und
andere Links
PDF (159195 Bytes)
PostScript (916389 Bytes)
CopyrightDue to copyright restrictions, the provided ps/pdf file might be not the final version.
Kontaktchristian.maihoefer@informatik.uni-stuttgart.de
Abteilung(en)Universität Stuttgart, Institut für Parallele und Verteilte Höchstleistungsrechner, Verteilte Systeme
Eingabedatum20. Juli 2001
   Publ. Abteilung   Publ. Institut   Publ. Informatik