一种基于可用带宽的QoS多播路由算法

QoS multicast routing algorithm based on available bandwidth

设计一个加权最大可用带宽多播树求解模型,将可用带宽作为主度量并同时兼顾时延、时延抖动和包丢失率3个QoS约束构建多播树。各QoS度量的重要性可根据实际的服务需求灵活调整,算法具有多项式复杂度,并通过仿真证明其有效性。

A weighted model is proposed to construct quality-of-service multicast routing tree with widest available bandwidth paths under the constraints of end-to-end delay, delay variation and packet-loss rate, in which available bandwidth is really considered as prime metric. The importance of the metrics is adjusted to different real-time applications. Simulation results and analysis prove the effectiveness of the algorithm and its polynomial time complexity.