Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees

Journal of Intelligent Systems

Jamshed Asif¹  Daadaa Yassine²  Rehman Habib-ur²  Tahir Muhammad Atif³ 

[1] ;College of Computer and Information Sciences, Al Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11432, KSA;School of Computer Science and Digital Technologies, Northumbria University, Newcastle upon Tyne, NE1 8ST , UK;

关键词: dynamic multicast routing;    quality of service (qos);    evolutionary computing;    heuristics;    graph theory and algorithms;    network optimization;    real-time data traffic;    wccais2014;    68t20;    94c15;   

DOI  :  10.1515/jisys-2014-0043

来源: DOAJ

【 摘 要 】

In a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service (QoS) measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. The simulation results show that, on a large number of events, i.e., where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties.

【 授权许可】

Unknown