Reliable multi-user tree setup with local identifiers

A protocol for setting up a tree connection for the purpose of multicast communication over a high-speed packet switched network is presented. The tree connection is based on the use of local identifiers, which are swapped at every intermediate node of the tree. Local identifiers are simple to manage, provide fast access to the routing tables, and are very efficient in terms of the size of the resulting routing space. The authors consider a high-speed network in which the local label swapping on data messages is performed in hardware by the switching subsystem, while the connection set-up is done in software by the switch control subsystem. A reliable protocol for setting up the tree connection is presented, and its correctness is formally proved. The protocol ensures the integrity of the tree and when failures occur, it is gracefully degraded into a smaller tree.<<ETX>>

[1]  Adrian Segall,et al.  Reliable link initialization procedures , 1988, IEEE Trans. Commun..

[2]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[3]  Yoram Ofek,et al.  Reliable Multiuser Tree Setup with Local Identifiers , 1991, IEEE J. Sel. Areas Commun..

[4]  Baruch Awerbuch,et al.  Distributed control for PARIS , 1990, PODC '90.

[5]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[6]  Adrian Segall,et al.  Route Setup with Local Indentifiers , 1986, IEEE Trans. Commun..

[7]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

[8]  George Markowsky,et al.  An Evaluation of Local Path ID Swapping in Computer Networks , 1981, IEEE Trans. Commun..