优化的多媒体流多播选路的试探算法  

An Optimized Routing Algorithm for Multicasting Multimedia-streams

作　　者：王东[1] 朱晓洁[1] 张大方[1] 

机构地区：[1]湖南大学计算机与通信学院,长沙410082

出　　处：《计算机工程与应用》2005年第3期145-148,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(编号:69973016;60273070)资助

摘　　要：在网络实时应用如远程教育、视频会议等系统中,对多播多媒体流的每一个流,不仅有严格的端到端时延限制,还有网络带宽的约束。网络在满足应用服务请求的同时,还应尽可能地降低资源的消耗。因此需要研究优化网络资源利用的多媒体流多播路由算法。论文采用优化的试探方法解决多播路由多媒体流分发问题。实验结果表明优化后的算法,与已有算法比较起来,使客户端接收视频流的满意度提高5%～8%,链路带宽节余8%～20%。In the real-time multimedia applications like as remote education and videoconference,it not only considers the delay of end-to-end,but also constrains bandwidth for each flow of multicast multimedia-stream.The network must reduce consumption of network resource and content to the request of services.So it needs a multicast routing arithmetic.In this study,the authors propose an optimized heuristic algorithm to solve this distribution problem for multicast-streams.The experiment shows that it is better than other existing algorithms.

关 键 词：多播路由 贪婪算法 Tabu—search NP完全问题 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]