Abstract
Rapid expansion of Internet increases the complexity of QoS-based multicast routing. To achieve scalability, a QoS-based Hierarchical Multicast Routing Framework-QHMR is presented in this paper. Based on the hierarchical partition to the whole network by Hierarchical Multicast Routing (HMR), QHMR solves the key issues of how to aggregate the three classes of information i.e., the network topology, bandwidth and multicast tree distribution. And the hierarchical multicast routing algorithm is designed based on the aggregated information. The simulation results demonstrate that QHMR 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 success ratio and cost of the multicast tree.
Original language | English |
---|---|
Pages (from-to) | 772-781 |
Number of pages | 10 |
Journal | Jisuanji Xuebao/Chinese Journal of Computers |
Volume | 27 |
Issue number | 6 |
Publication status | Published - Jun 2004 |
Externally published | Yes |
Keywords
- Bandwidth constraint
- Hierarchical routing
- Multicast routing
- QoS-based multicast routing