一种具有时延约束的组播路由算法研究  

New delay-bounded constraint multicast routing algorithm

作　　者：周贤伟[1] 刘臻臻[1] 林琳[1] 刘涛[1] 王超[1] 

机构地区：[1]北京科技大学信息工程学院通信工程系,北京100083

出　　处：《计算机应用研究》2009年第9期3259-3262,共4页Application Research of Computers

基　　金：国家"863"计划资助项目(2007AA01Z213);国家自然科学基金资助项目(60773074);北京市自然科学基金资助项目(4082020)

摘　　要：对于多媒体应用等实时组播业务而言,组播路由算法不仅要考虑优化代价,还要考虑时延约束。针对这一问题,提出一种支持动态组播的时延受限低代价组播路由启发式算法(delay-constrained multicast algorithm,DCMA)。该算法基于DDMC算法进行扩展,采用新的指示函数和链路选择函数,综合考虑了时延和代价,有效保证了组播树的性能,而且时间复杂度低,可用于实际的应用系统中。For real-time multicast business such as multimedia applications, muhicast routing algorithms must optimize both cost and delay. In response to this problem, proposed a heuristic algorithm DCMA, which joined destination nodes to the mul- ticast tree dynamically. This algorithm was based on DDMC algorithm and improved by using new indicator function and link choice function. Considering the optimization of delay and cost, the algorithm efficiently guarantees the performance of multicast tree, with advantage of low time complexity and easy operation in real system.

关 键 词：组播路由算法 时延约束 STEINER树 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]