Dynamic multicast trees

Author

Cobb, Jorge A.

Author_Institution

Dept. of Comput. Sci., Texas Univ., Richardson, TX, USA

fYear

1999

fDate

28 Sept.-1 Oct. 1999

Firstpage

29

Lastpage

36

Abstract

We present a family of protocols to build a multicast tree in a network of processes. No processing or storage overhead is required for processes not included in the tree. The overhead of processes in the tree consists solely of the periodic exchange of a pair of messages with their parent in the tree. To choose the processes that constitute the tree, we take advantage of the existing multicast routing tables. In addition, our protocol family distinguishes itself from other protocols in three ways. First, the protocols are proven correct. Second, the integrity of the multicast tree is preserved as the tree adapts to changes in the unicast routing table. Third the protocols are self-stabilizing, i.e., they tolerate all transient faults.

Keywords

fault tolerance; multicast communication; protocols; telecommunication network routing; trees (mathematics); dynamic multicast trees; multicast routing tables; self-stabilizing protocols; transient fault tolerance; unicast routing table; Audio databases; Communication channels; Computer science; Fluctuations; Multicast algorithms; Multicast protocols; Read only memory; Routing protocols; Unicast; Videoconference;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks, 1999. (ICON '99) Proceedings. IEEE International Conference on

Print_ISBN

0-7695-0243-1

Type

conf

DOI

10.1109/ICON.1999.796156

Filename

796156