Solving the Delay-Constrained Least-Cost routing problem using Tabu Search with Edge Betweenness

Amina Boudjelida,Ali Lemouari,S Krit

doi:10.1051/e3sconf/202122901009

Amina Boudjelida, Ali Lemouari + Show 1 more

Open Access

https://doi.org/10.1051/e3sconf/202122901009

Copy DOI

Abstract

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.

Highlights

Depending on the number of destinations, network routing can be categorized into three basic types: unicast, broadcast and multicast
A new heuristic named TSEB is introduced for single-objective multicast routing problem (MRP) and adapted for multi-objective Delay-Constrained Least-Cost (DCLC) problem where both constraints: cost and delay are considered
Our TSEB-MRP proposition is based on the Tabu search (TS) procedure which uses the Edge Betweenness heuristic to construct the initial solution, and uses the movements of TS to diversify the research space

Summary

Introduction

Depending on the number of destinations, network routing can be categorized into three basic types: unicast (one-toone), broadcast (one-to-all) and multicast (one-to-many). A host group is a set of network entities sharing a common identifying multicast address, all receiving any data packets addressed to this multicast address by senders (sources) that may or may not be members of the same group and have no knowledge of the groups’ membership [2]. This definition implies that, from the sender’s point of view, this model reduces the multicast service interface to a unicast one, multicast routing can utilize network resources more efficiently, as a data packet traverses each link only once, and some of the links are shared [2], [3]

Objectives

Results

Conclusion