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

Tahir, Muhammad, Jamshed, Asif, Rehman, Habib-ur and Daadaa, Yassine (2015) Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees. Journal of Intelligent Systems, 24 (4). pp. 479-489. ISSN 0334-1860

Full text not available from this repository.

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	Dynamic multicast routing; quality of service (QoS); evolutionary computing; heuristics; graph theory and algorithms; network optimization; real-time data traffic; WCCAIS2014
Subjects:	G900 Others in Mathematical and Computing Sciences
Department:	Faculties > Engineering and Environment > Computer and Information Sciences
Depositing User:	Paul Burns
Date Deposited:	20 Oct 2015 15:34
Last Modified:	11 Oct 2019 14:31
URI:	http://nrl.northumbria.ac.uk/id/eprint/24062

Downloads