Reliable Multiuser Tree Setup with Local Identifiers

The authors present a reliable protocol for setting up a tree connection for the purpose of multicast communication over a high-speed packet switched network. The tree connection is based on the use of local identifiers that 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 context of the present work is a high-speed network in which the local label swapping on data messages is performed in hardware by the switching subsystem, while the connection setup is done in software by the switch control subsystem. The correctness of the protocol is formally proved. The protocol ensures the integrity of the tree, and, when failures occur, the tree is gracefully degraded into a smaller tree. >

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

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

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

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

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

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

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

[8]  Yoram Ofek,et al.  Reliable multi-user tree setup with local identifiers , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.