摘要
在分析IP域中支持QoS的基于边缘簇的组播树构造算法的基础上,针对该算法生成的组播树的总体路径费用较高的问题,提出了一种改进的基于边缘簇的组播树构造算法IECT,该算法可在承载组播流量的网络核心域构造出总体路径费用较小的组播分发树。
Analyzes ECT, the Edge Clustered Tree algorithm for building QoS multicast distribution tree in IP domain. Aiming at the problem of the total path cost of multicast tree built by ECT is high, it proposes IECT, the Improved Edge Clustered Tree-building algorithm, which can build a multicast tree with lower total path cost in core domain network carrying multicast traffic.
出处
《计算机应用研究》
CSCD
北大核心
2005年第8期187-189,195,共4页
Application Research of Computers
基金
国家"863"计划资助项目(2003AA103510)
关键词
组播
服务质量
簇树算法
Multicast
Quality of Service(QoS)
Edge Clustered Tree(ECT)