Solving the Delay-Constrained Least-Cost routing problem using Tabu Search with Edge Betweenness
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 networ...
Main Authors: | Boudjelida Amina, Lemouari Ali |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2021-01-01
|
Series: | E3S Web of Conferences |
Subjects: | |
Online Access: | https://www.e3s-conferences.org/articles/e3sconf/pdf/2021/05/e3sconf_iccsre2021_01009.pdf |
Similar Items
-
A hybrid ACO/PSO based algorithm for QoS multicast routing problem
by: Manoj Kumar Patel, et al.
Published: (2014-03-01) -
Routing protocols for wireless sensor networks: What the literature says?
by: Amit Sarkar, et al.
Published: (2016-12-01) -
A Survey of QoS Routing Protocols for Ad Hoc Networks
by: Igli Tafa
Published: (2011-01-01) -
Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees
by: Tahir Muhammad Atif, et al.
Published: (2015-12-01) -
Adaptation Of The Variable Neighborhood Search Heuristic To Solve The Vehicle Routing Problem
by: Arif Imran, et al.
Published: (2012-03-01)