基于Dijistra算法的多约束多播路由算法的研究

Research and Implementation on Multiple Constraints Multicast Routing Algorithm Based on Dijistra

多播业务已被广泛应用于各种流媒体,这些业务对QoS提出了一定的要求,多约束多播路由算法成为解决多播业务QoS问题的研究热点。该文提出的多约束多播路由算法以带宽和时延作为多约束条件,首先消去不符合带宽要求的所有链路,接着用Dijistra最短路径算法选择从源节点到目的节点之间满足时延最小的路径。通过设计一包含6个网络节点的拓扑结构,用网络仿真工具对该网络中各条链路利用率的统计,证明了该算法找到的路径和理论值完全一致,验证了该算法的有效性和简单性。

Multicast business has been widely applied in all kinds of streaming media. These business need more QoS requirement. In order to solve the QoS problem, the multiple constraints multicast routing has become a very important research field. The multiple constraints include bandwidth and delay. In this algorithm,first,all the links are traversed and those links do not meet the bandwidth requiremerits are eliminated. Then, the algorithm selects the links meet the minimum delay from the source node to the destination node to component the final path in the rest links. Through designing one network topology including six nodes, using a network simulation tool to gather statistics of each link utilization, the result verifies the validity and simplicity of the algorithm.