延时受限启发式组播路由算法  

A Delay-constrained Multicast Routing Heuristic Algorithm

作　　者：刘莹[1] 吴建平[1] 王颖[2] 

机构地区：[1]清华大学计算机科学与技术系,北京100084 [2]中国铁道建筑总公司,北京100855

出　　处：《高技术通讯》2003年第9期1-4,共4页Chinese High Technology Letters

基　　金：863计划(2001AA121013);国家自然科学基金(69725003;90104002)资助项目。

摘　　要：给出了一种带延时约束的组播路由算法,旨在确定组播路由,不仅要使网络通信的费用达到最小,而且要保证源节点到每个目的节点的延时满足给定约束。此算法具有易于实现、计算量小且所需传递信息量小等优点。仿真结果表明此算法性能良好。Delay-constrained multicast routing algorithm proposed in this paper aims to determine a minimal cost multicast routing tree in which the accumulated delay from the source node to any destination node along the tree dose not exceed a pre-specified delay bound. The algorithm is easy to utilize and needs little amount of computation and information. Experimental results show that the proposed algorithm performs well.

关 键 词：延时受限 启发式算法 组播路由 最短路算法 网络 

分 类 号：TN915[电子电信—通信与信息系统]