A Method of Selecting Core for the Shared-Tree based Multicast Routing


The KIPS Transactions:PartC, Vol. 10, No. 7, pp. 885-890, Dec. 2003
10.3745/KIPSTC.2003.10.7.885,   PDF Download:

Abstract

The Core Base Tree (CBT) multicast routing architecture is a multicast routing protocol for the internet. The CBT establishes a single shared tree for a multicast connection. The shared tree is rooted at a center node called core. The location of the core may affect the cost and performance of the CBT. The core placement method requires the knowledge of the network topology. In this paper, we propose a simple and effective method for selecting the core. This method requires the distance vector information. in addition, we used results that calculated sample correlation coefficient. And then we select suitable routing algorithm according to member’s arrangement states in muliticast group. we select core node that have minimum average cost or PIM-SM protocol is selected. The performance of this method is compared with several other methods by extensive simulations (i.e mean delay, maximum delay, and total cost). Our results shows that this method for Selecting Core is very effective.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. S. Hwan and Y. S. Dae, "A Method of Selecting Core for the Shared-Tree based Multicast Routing," The KIPS Transactions:PartC, vol. 10, no. 7, pp. 885-890, 2003. DOI: 10.3745/KIPSTC.2003.10.7.885.

[ACM Style]
Hwang Sun Hwan and Yun Seong Dae. 2003. A Method of Selecting Core for the Shared-Tree based Multicast Routing. The KIPS Transactions:PartC, 10, 7, (2003), 885-890. DOI: 10.3745/KIPSTC.2003.10.7.885.