论文部分内容阅读
实时多媒体网络中,带延迟与延迟抖动约束的斯坦利树问题是一个研究热点.这种带约束的斯坦利树被证明是NP-完全问题.提出了一种基于禁忌搜索的带延迟与延迟抖动约束最小代价组播路由算法.实验结果表明,该算法对于实际网络是有效的.这种方法使得IP组播把数据同时发送到组成员时有效地利用了网络资源.
In real-time multimedia networks, the Stanley tree problem with delay and delay jitter constraints is a research hotspot. This constrained Stanley tree proved to be NP-complete. A tabu search based delay and delay jitter Constrained multicast routing algorithm with minimum cost.Experimental results show that this algorithm is effective for practical networks.This method makes IP multicast effectively use network resources when sending data to group members at the same time.