基于多核单向共享树的选播路由算法的研究  

Research on Anycast Routing Algorithm Based on Multi-Cores Uni-Directional Shared Trees

作　　者：张园园[1] 余镇危[1] 

机构地区：[1]中国矿业大学(北京),北京100083

出　　处：《微电子学与计算机》2012年第6期7-9,13,共4页Microelectronics & Computer

摘　　要：为了更好地在应用层实现选播通信.在对已有选播路由算法PIA-SM和CBT的优缺点分析的基础上,提出了一种基于多核单向共享树的选播路由算法,并给出了核节点和选播组成员的选择策略,实验表明,本算法能有效平衡网络和服务器负载,并在网络负载较重的情况下,有效地降低数据包的传送时延.For the purpose of realizing the anycast communicate more efficiently, the article is proposed an anycast routing algorithm based on Multi-Cores Uni-Directional Shared Trees based on the analysis of advantages and disadvantages about the existing anycast routing algorithm PIASM and CBT, and presented the choice strategy of the core nodes and the anycast group members. The experiments show that the algorithm can balance the network and server load, and reduce the transmission delay efficiently under the heavy network load.

关 键 词：PIA-SMCBT 多核单向共享树 时延 网络负载 

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