The ordered core based tree protocol

Author

Shields, Clay ; Garcia-Luna-Aceves, J.J.

Author_Institution

Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA

Volume

2

fYear

1997

fDate

7-12 Apr 1997

Firstpage

884

Abstract

This paper presents a new protocol, the ordered core based tree (OCBT) protocol, which remedies several shortcomings of the core based tree (CBT) multicast protocol. We show that the CBT protocol can form loops during periods of routing instability, and that it can consistently fail to build a connected multicast tree, even when the underlying routing is stable. The OCBT protocol provably eliminates these deficiencies and reduces the latency of tree repair following a link or core failure. The OCBT also improves scalability by allowing flexible placement of the cores that serve as points of connection to a multicast tree. Simulation results show that the amount of control traffic in OCBT is comparable to that in CBT

Keywords

protocols; telecommunication links; telecommunication network routing; trees (mathematics); core failure; link failure; multicast routing protocol; multicast tree; ordered core based tree protocol; routing instability; simulation results; tree repair latency; Delay; Multicast protocols; Routing protocols; Scalability; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE

Conference_Location

Kobe

ISSN

0743-166X

Print_ISBN

0-8186-7780-5

Type

conf

DOI

10.1109/INFCOM.1997.644571

Filename

644571