Multicast Routing in GMPLS Networks with Unequal Branching Capability

Download PDF
Open Webpage

Peigang Hu, Yaohui Jin, Weisheng Hu, Yikai Su, Wei Guo, Chunlei Zhang, Hao He, Weiqiang Sun

Published: 01 Jan 2005, Last Modified: 06 Aug 2024IEICE Trans. Commun. 2005EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this letter, we study dynamic multicasting in GMPLS networks with unequal branching capability. An overlapped multicasting tree is proposed to reduce blocking probability, which can utilize the branching capabilities more efficiently than the traditional Steiner tree. A nearest node branch first heuristic is developed to find such an overlapped tree.