E3S Web Conf.
Volume 229, 2021The 3rd International Conference of Computer Science and Renewable Energies (ICCSRE’2020)
|Number of page(s)||7|
|Published online||25 January 2021|
Solving the Delay-Constrained Least-Cost routing problem using Tabu Search with Edge Betweenness
Laboratory of Mathematics and Applied Mathematics University of Jijel of Mathematics and Applied Mathematics (LMAM) Jijel
2 Laboratory of Mathematics and Applied Mathematics University of Jijel of Mathematics and Applied Mathematics (LMAM) Jijel
Multicast routing consists of concurrently sending the same information from a source to a subset of all possible destinations in a computer network thus becomes an important technology communication. To solve the problem, a current approach for efficiently supporting a multicast session in a network consists of establishing a multicast tree that covers the source and all terminal nodes. This problem can be reduced to a minimal Steiner tree problem (MST) which aims to look for a tree that covers a set of nodes with a minimum total cost, the problem is NP-hard. In this paper, we investigate metaheuristics approaches for the Delay-Constrained Least-Cost (DCLC) problem, we propose a novel algorithm based on Tabu Search procedure with the Edge Betweenness (EB). The EB heuristic used first to improve KMB heuristic, able to measure the edge value to being included in a given path. The obtained solution improved using the tabu search method. The performance of the proposed algorithm is evaluated by experiments on a number of benchmark instances from the Steiner library. Experimental results show that the proposed metaheuristic gives competitive results in terms of cost and delay compared to the optimal results in Steiner library and other existing algorithms in the literature.
Key words: Multicast Routing / DCLC / QOS / Optimization / Heuristic / Metaheuristic
© The Authors, published by EDP Sciences, 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.