A Rendezvous Router Decision Algorithm Considering Routing Table Size


The KIPS Transactions:PartC, Vol. 13, No. 7, pp. 905-912, Dec. 2006
10.3745/KIPSTC.2006.13.7.905,   PDF Download:

Abstract

Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-SM) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.


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]
K. S. Cho, H. S. Jang, D. W. Kim, "A Rendezvous Router Decision Algorithm Considering Routing Table Size," The KIPS Transactions:PartC, vol. 13, no. 7, pp. 905-912, 2006. DOI: 10.3745/KIPSTC.2006.13.7.905.

[ACM Style]
Kee Seong Cho, Hee Seon Jang, and Dong Whee Kim. 2006. A Rendezvous Router Decision Algorithm Considering Routing Table Size. The KIPS Transactions:PartC, 13, 7, (2006), 905-912. DOI: 10.3745/KIPSTC.2006.13.7.905.