Merging source and shared trees multicast in MPLS networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

Multicast and MPLS are two complementary technologies. Merging MPLS and multicast technologies can acquire two advantages: Multicast saving bandwidth and MPLS supporting high-speed, QoS and traffic engineering, VPN. Implementation of MPLS multicast has two key expectations: how to construct multicast tree over MPLS domain and how to enhance multicast scalability. In this paper, we design a scalable MPLS multicast algorithm. The algorithm uses tunneling technology and branching nodes technology, which can merge source and shared trees multicast in MPLS networks. Using tunneling technology to implement multipoint-to-multipoint (MP2MP) shared-tree multicast can solve one of the difficulties of MPLS multicast: MP2MP label distribution. Using branching nodes technology can reduce multicast forwarding state in routers and enhance multicast scalability. We also evaluate our proposal in terms of scalability and efficiency and present some simulation results based on NS-2.

Original languageEnglish
Title of host publicationProceedings - Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006
Pages23-28
Number of pages6
DOIs
StatePublished - 2006
Event7th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006 - Taipei, Taiwan, Province of China
Duration: 4 Dec 20067 Dec 2006

Publication series

NameParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

Conference

Conference7th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006
Country/TerritoryTaiwan, Province of China
CityTaipei
Period4/12/067/12/06

Fingerprint

Dive into the research topics of 'Merging source and shared trees multicast in MPLS networks'. Together they form a unique fingerprint.

Cite this