摘要
提出一种基于本地域QoS信息的时延约束Steiner树算法,通过最短代价路径构造组播树,源节点根据目的节点及源区域边界路由器提供的最短时延路径信息,对剩余目的进行集中式路由计算,并由控制消息完成组播树的配置及环路删除。该算法不依赖于全局性的QoS信息,从而避免大量控制开销与陈旧QoS信息的影响。仿真实验结果表明,该算法具有较高的加入成功率以及较合理的控制开销。
A novel delay-constrained Steiner tree algorithm based on locai domain QoS information is presented, which constructs a multicast tree along the shortest cost paths, and on the basis of the least delay path information provided by group members and Source Area Border Routers（SABR）, the source node computes the best routes for remain members. Then, the control messages are sent out to configure the multicast tree and break loops. This algorithm is not dependent on global QoS information, so it can cut down control overheads greatly and be immune from stale QoS information. Simulation experimental results show this algorithm has high join success rate and reasonable control overheads.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第6期97-99,共3页
Computer Engineering
基金
中国下一代互联网(CNGI)示范工程基金资助项目(CNGI-04-10-1D)
