在overlay网络上的负载平衡多播路由算法  

Load balance multicast routing algorithms on overlay network

作　　者：张晓瑜[1] 张光昭[1] 

机构地区：[1]中山大学电子与通信工程系,广州广东510275

出　　处：《通信学报》2009年第4期86-92,共7页Journal on Communications

摘　　要：针对基于代理服务器的overlay网络的负载平衡多播路由算法被提出。它能均衡利用overlay网络的有限资源,并能满足多播应用的延迟限制需求。首先用具有延迟约束的Steiner树问题对路由问题进行建模;然后采用预计算方法将计算复杂度集中在预备的单点路径计算上,使由这些单点路径所构成的网络更易于构建负载平衡路由树;预计算只计算一次,结果使用多次,因此降低了总体的计算复杂度。仿真实验的结果表明,相对于其他的快速启发式算法,该算法能提供更为优越的性能。整体而言,基于预计算的负载平衡多播路由算法在性能和计算复杂度方面取得了很好的平衡。Overlay networks had been recently developed to support multicast framework. Specially, overlay architectures based on proxies and leased lines could provide applications with optimal performance in terms of bandwidth, reliability, delay guarantee, etc. A balanced multicast routing algorithm for these proxy-based overlay architectures was proposed to utilize the network resources efficiently while keeping the delay guarantee for each multicast session. First, the routing problem was modeled as a delay-constraint Steiner tree problem. Then, a balanced solution with the aid of precomputing was proposed. The precomputing performed once with high complexity. However, its outcome was used multiple times in the later low complexity tree forming algorithm. Hence, the overall complexity was lowered. Extensive simulations show that the multicast routing algorithm provides superior performance with respect to other heuristics.

关 键 词：OVERLAY网络 多播路由算法 负载平衡 预计算 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]