LEO卫星IP网络组播路由算法  

Multicast routing algorithm for LEO satellite IP networks

作　　者：郭代[1] 晏坚[1] 刘序明[1] 

机构地区：[1]清华大学电子工程系微波与数字通信技术国家重点实验室,北京100084

出　　处：《清华大学学报（自然科学版）》2007年第4期559-563,共5页Journal of Tsinghua University(Science and Technology)

摘　　要：为了解决低轨(low earth orbit,LEO)卫星网络中需要快速高效组播路由协议的问题,提出一种新型LEO卫星IP网络组播路由算法。在分析建立LEO卫星网络拓扑模型的基础上,该算法利用LEO卫星网络的自身特点,采用分布式迭代的计算模式,生成基于源端的组播路由树,大幅度地降低了算法的计算复杂度。仿真结果表明:与传统的LEO卫星网络组播路由算法相比,该算法具有较低的计算复杂度,生成的组播路由树具有较小的开销。相比于传统MRA算法,该算法生成的组播树中源点到组播成员节点的平均延时大约为前者的90%。A specialized multicast routing algorithm （MRA） was developed to provide efficient multicast routing in low earth orbit （LEO） satellite networks. The fast distributed iterative multicast routing algorithm based on a topological model describing the characteristics of LEO satellite networks generates a source-based multicast routing tree to significantly reduce the computing complexity. Simulations show that the computing complexity and the tree cost are lower than the traditional multicast routing algorithm for LEO satellite networks. The average delay from the source to all destinations in the tree generated by the algorithm is about 90% of the traditional MRA algorithm.

关 键 词：卫星通信 组播路由 源端组播树 分布式迭代算法 

分 类 号：TN927.2[电子电信—通信与信息系统]