Heterogeneous Bandwidth-constrained dynamic Hierarchical Multicast Routing

This paper presents a framework called Heterogeneous Bandwidth-constrained dynamic Hierarchical Multicast Routing (HBHMR), which achieves scalability by means of hierarchical multicast routing schemes. In addition to the authors' previous work on QoS-based hierarchical multicast routing, a group-specific information of the highest receivable layer of on-tree nodes and its effective aggregation method are defined. Then based on those aggregated information, a hierarchical multicast routing algorithm is designed to find a feasible tree branch satisfying a new member with its heterogeneous QoS requirement in terms of data layer and corresponding bandwidth. Simulation results demonstrate that HBHMR obtains the scalability by significantly reducing both the information maintained at a router and the packets exchanged between routers, also, achieves comparable routing performance to the flat QoS-based multicast routing on the bandwidth blocking ratio and the bandwidth usage of the multicast tree.