A Tabu Search Based Algorithm for Multicast Routing with QoS Constraints
A Tabu Search Based Algorithm for Multicast Routing with QoS Constraints
复制标题
DOI：
10.1109/icit.2006.22
复制
发表时间：
2006-12
期刊：
影响因子：
--
通讯作者：
N. Ghaboosi;A. Haghighat
中科院分区：
文献类型：
--
作者：
N. Ghaboosi;A. Haghighat
高速网络中各种实时多媒体应用的出现，促使基于服务质量（QoS）的组播路由及其背后的约束斯坦纳树的数学结构成为必要，这是一个众所周知的np完全问题。两个重要的QoS约束是带宽约束和端到端延迟约束。提出了一种基于禁忌搜索（TS）的带宽延迟约束下最小代价组播路由算法。对各种随机生成网络的计算结果表明，该算法优于现有的基于ts的算法和启发式算法。
The advent of various real-time multimedia applications in high-speed networks prompt the necessity of quality of service (QoS) based multicast routing and the constrained Steiner tree as the mathematical structure behind it which is a well- known NP-complete problem. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. In this paper, an algorithm is proposed to solve the bandwidth-delay- constrained least-cost multicast routing problem based on Tabu Search (TS). Computational results for various random generated networks show that the proposed algorithm outperforms other existing TS-based algorithms and heuristics.