The Ordered Core Based Tree Protocol
نویسندگان
چکیده
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. 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.
منابع مشابه
The HIP Protocol for Hierarchical Multicast Routing
This paper presents a new, exible approach to inter-domain multicast routing. The HIP protocol introduces the idea of \virtual routers" as a method of organizing the control of an entire domain so as to appear as a single router on a higherlevel shared tree. HIP then routes between domains using the Ordered Core Based Tree (OCBT) protocol, and allows recursive application of virtual routers to ...
متن کاملTransient Change in Core Strength, Endurance, and Upper Limb Isometric Strength after Core Stabilisation Knockdown Protocol in Female Athletes
Objective- We assessed the effect of change in core isometric strength and endurance on upper limb isometric strength in female athletes. Methods- In this experimental study, 32 female athletes aged 18-25 years were recruited based on the inclusion criteria. (17 cases in the experimental group and 15 cases in the control group). Before and after the core stabilization knockdown protocol, parti...
متن کاملDistributed Center-Location Algorithms
Recent multicast routing protocol proposals such as protocol independent multicast (PIM) and core-based trees (CBT) have been based on the notion of group-shared trees. Since construction of a minimal-cost tree spanning all members of a group is difficult, they rely on center-based trees and distribute packets from all sources over a single shortest-path tree rooted at some center. PIM and CBT ...
متن کاملA Source Tree Reliable Multicast Protocol for Ad-Hoc Networks (STRM)
Multicasting is an essential service for ad-hoc wireless networks. Many reliable multicast schemes were studied in order to reduce packet losses in the network. This paper describes our effort to build a source tree reliable multicast protocol for ad-hoc networks. Source tree reliable multicast protocol provides the delivery of an ordered contiguous sequence of data packets from one sender to m...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کامل