满足QoS约束可靠的适应性多播路由算法

文章考虑了在通信网络中节点和边都存在生存概率的情况下,权衡可靠性和延迟这两个性能指标而提出的一种接近最小成本的适应性算法。利用该算法,可以避免在有些节点或边失效(或不满足某种可靠性要求)的情况下依旧选择这些节点和边的可能,有效地减少了信息传送和缩短了传输时延。这是以往多播(multicast)算法中很少考虑的情况。数值实验表明,这种算法是快速而有效的。且算法的时间复杂度为O(m｜D｜logn)。

An Adaptive and Reliable Algorithm Satisfying QoS for Multicast

In this paper,an adaptive algorithm,in multicast communication networks with nodes and edges having living probability,is present.It tradeoffs the two performance criterions of reliability and delay,and can find a sub-optimal cost multicast tree meeting delay-and-reliability constraint.It can dynamically modify the tree to adapt the changes of desti-nations and the demands of reliability.It also overcomes the shortcoming of the existent algorithms which deal with the nodes or edges failed,and effectively reduces the transmission of information and the delay of propagation.The computa-tion results demonstrate that the algorithm is effective.And its time complexity is O(m｜D｜log n).