一种基于时延限制的分布式组播路由选择算法  

A Distributed Routing Algorithm Based on Delay-Limiting

作　　者：李博[1] 

机构地区：[1]广东水利电力职业技术学院电教计算机信息中心,广东广州510635

出　　处：《华南农业大学学报》2003年第4期96-99,共4页Journal of South China Agricultural University

摘　　要：基于最短路径算法提出了主树的概念,并且利用组播树的代价和时延限制的定义给出了一种分布式组播路由选择算法.可以在时延限制的前提下使组播树的代价接近最优.最后,说明了本文方法的有效性.This paper introduces the concept of main tree based on shortest path algorithm, and by applying the concept of the multicast tree cost and delay-limiting, it maces a presentation of the distributed heuristic routing algorithm which can optimize the cost of multicast tree under the condition of delay-limiting. Finally, it states the validity of the method in this text.

关 键 词：分布式组播 路由选择算法 时延限制 节点 通信 

分 类 号：TN948.6[电子电信—信号与信息处理]