Multicast Routing in GMPLS Networks with Unequal Branching Capability

摘要

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.