Multicasting Tabu Search Mechanism with near optimum multicast tree on OpenFlow

10.7125/40.5 ◽  
2015 ◽  
Vol 40 (0) ◽  
pp. 29
Author(s):  
ALAA MOHAMMED ATTIA ALLAKANY ◽  
Koji Okamura
Keyword(s):  
Tabu Search ◽  
Multicast Tree ◽  
Search Mechanism

QoS-driven multicast tree generation using Tabu search

2002 ◽  
Vol 25 (11-12) ◽  
pp. 1140-1149 ◽  
Author(s):  
Habib Youssef ◽  
Abdulaziz Al-Mulhem ◽  
Sadiq M. Sait ◽  
Muhammad Atif Tahir
Keyword(s):  
Tabu Search ◽  
Multicast Tree ◽  
Tree Generation

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

2021 ◽  
Vol 229 ◽  
pp. 01009
Author(s):  
Amina Boudjelida ◽  
Ali Lemouari
Keyword(s):  
Tabu Search ◽  
Computer Network ◽  
Multicast Routing ◽  
Current Approach ◽  
Multicast Tree ◽  
Steiner Tree Problem ◽  
Routing Problem ◽  
Edge Betweenness ◽  
Tabu Search Method ◽  
Minimal Steiner Tree

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.

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

2015 ◽  
Vol 24 (4) ◽  
pp. 479-489
Author(s):  
Muhammad Atif Tahir ◽  
Asif Jamshed ◽  
Habib-ur Rehman ◽  
Yassine Daadaa
Keyword(s):  
Quality Of Service ◽  
Tabu Search ◽  
Multicast Routing ◽  
Low Cost ◽  
Multicast Tree ◽  
Source Node ◽  
Delay Constraint ◽  
Routing Problem ◽  
Dynamic Multicast

AbstractIn 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.

WDM Multicast Tree Construction Algorithms and Their Comparative Evaluations

2010 ◽  
Vol E93-B (9) ◽  
pp. 2282-2290
Author(s):  
Tsutomu MAKABE ◽  
Taiju MIKOSHI ◽  
Toyofumi TAKENAKA
Keyword(s):  
Multicast Tree ◽  
Tree Construction ◽  
Construction Algorithms ◽  
Multicast Tree Construction
Sign in / Sign up

Export Citation Format

Share Document