基于禁忌搜索的组播路由算法(英文)  

Multicast routing algorithm based on tabu search

作　　者：黄林[1,2] 赖俊峰[3] 侯剑[1] 杜学武[1] 

机构地区：[1]大连理工大学数学科学学院,辽宁大连116024 [2]中国计量学院数学系,浙江杭州310018 [3]内蒙古工业大学理学院,内蒙古呼和浩特010021

出　　处：《大连理工大学学报》2010年第5期801-805,共5页Journal of Dalian University of Technology

基　　金：Fund of Inner Mongolia University of Technology(X200829)~~

摘　　要：实时多媒体网络中,带延迟与延迟抖动约束的斯坦利树问题是一个研究热点.这种带约束的斯坦利树被证明是NP-完全问题.提出了一种基于禁忌搜索的带延迟与延迟抖动约束最小代价组播路由算法.实验结果表明,该算法对于实际网络是有效的.这种方法使得IP组播把数据同时发送到组成员时有效地利用了网络资源.The delay and delay variation-bounded Steiner tree problem is an important multicast routing issue in real-time multimedia networks.Such a constrained Steiner tree problem is known to be NP-complete.A multicast routing algorithm is presented,which is based on tabu search to produce routing trees having a minimal network cost under delay and delay variation constraints.The simulation shows that the algorithm is efficient for actual networks.This approach makes IP multicast utilize resources efficiently in delivering data to a group of members simultaneously.

关 键 词：组播 禁忌搜索 延迟约束 延迟抖动约束 

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