Tabu search algorithm to solve a logical topology design problem in WDM networks considering implementation cost

2002 ◽  
Author(s):  
Josue Kuri ◽  
Nicolas Puech ◽  
Maurice Gagnaire
Keyword(s):  
Tabu Search ◽  
Design Problem ◽  
Search Algorithm ◽  
Wdm Networks ◽  
Topology Design ◽  
Tabu Search Algorithm ◽  
Implementation Cost ◽  
Logical Topology Design ◽  
Logical Topology

Logical Topology Design for WDM Networks Using Tabu Search

2012 ◽  
pp. 424-427 ◽  
Author(s):  
Quazi Rahman ◽  
Ashutosh Sood ◽  
Yash Aneja ◽  
Subir Bandyopadhyay ◽  
Arunita Jaekel
Keyword(s):  
Tabu Search ◽  
Wdm Networks ◽  
Topology Design ◽  
Logical Topology Design ◽  
Logical Topology

Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows

2010 ◽  
Vol 56 (1) ◽  
pp. 41-48 ◽  
Author(s):  
Jakub Gładysz ◽  
Krzysztof Walkowiak
Keyword(s):  
Tabu Search ◽  
Network Design ◽  
Design Problem ◽  
Search Algorithm ◽  
Branch And Cut ◽  
Network Design Problem ◽  
Tabu Search Algorithm ◽  
Survivable Network Design ◽  
Network Cost ◽  
Survivable Network

Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast FlowsIn this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.

Sign in / Sign up

Export Citation Format

Share Document