Internet Multicast Routing Protocol Model using MPLS Networks


The KIPS Transactions:PartC, Vol. 10, No. 1, pp. 77-86, Feb. 2003
10.3745/KIPSTC.2003.10.1.77,   PDF Download:

Abstract

This paper describes the new method for Internet multicast routing protocols using MPLS (Multiprotocol Label Switching) networks. Internet multicast routing protocols are divided into three categories in terms of tree types and tree characteristics a shortest path tree, a shared tree and hybrid tree types. MPLS should support various multicast mechanisms because of extremely different IP multicast architectures, such as uni-/bi-directional link, Flooding/Prune tree maintenance mechanism, the existence of different tree types with the same group, etc. There are so many problems over MPLS multicast that the solutions can큧 be easily figured out. In this paper, we make a few assumptions on which the solutions of IP multicast routing protocols over MPLS networks are given. A broadcasting label is defined for the shortest path tree types. Cell interleaving problems of the shared tree types is solved by using block-based transmission mechanism. Finally, the existing hybrid-type multicast routing protocol is reasonably modified Shortest path tree type to support MPLS multicast. It has been shown that these modifications give better performance (transmission delay) than the orignal method.


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]
Y. J. Kim, "Internet Multicast Routing Protocol Model using MPLS Networks," The KIPS Transactions:PartC, vol. 10, no. 1, pp. 77-86, 2003. DOI: 10.3745/KIPSTC.2003.10.1.77.

[ACM Style]
Young Jun Kim. 2003. Internet Multicast Routing Protocol Model using MPLS Networks. The KIPS Transactions:PartC, 10, 1, (2003), 77-86. DOI: 10.3745/KIPSTC.2003.10.1.77.