The Hierarchical Multicast Routing with Multiple QoS Constraints
多QoS约束的层次多播路由算法框架

In order to deal with the scalability problem of network routing,large networks are often structured hierarchically by grouping nodes into different domains.Topology aggregation is the process of summarizing the topological state information of the domains.Based on topology aggregation,QoS-aware hierarchical multicast routing algorithms are used to construct a multicast tree satisfying QoS requirements among network domains.The existing QoS-aware hierarchical multicast routing algorithms don't take into account more than two QoS metrics during their topology aggregations and route computations.In this paper,we propose an algorithm framework of hierarchical multicast routing with multiple QoS constraints,called HMRMQ,which provides both new schemes for topological state aggregation and state information representation based on multiple QoS metrics and a novel hierarchical multicast routing algorithm with multiple QoS constraints.The schemes of representing and aggregating multiple QoS metrics are very scalable,and the distributed routing algorithm is facile to implement certain security policies.Our theoretical analysis and simulation results not only prove the correctness and availability of HMRMQ,but also show that HMRMQ achieves the routing scalability and the improved routing performance in terms of routing success ratio,average network cost and average message overhead.