A genetic algorithm for solving virtual topology configuration transition problem in WDM network

Din, Der-Rong

doi:10.1016/j.comcom.2006.09.009

Cited by 15 publications

(16 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Given the physical network, demand matrix, two (current and new) virtual topologies, the goal is to find an optimal transition sequence (from old to new) such that the objective cost can be minimized. The objective cost considered in this article is the average weighted delay (AWD) which is more accurate than those proposed in [28,38]. This problem is denoted as WDM virtual topology transition sequence problem (WVTTSP) in which goal is to find the optimal transition sequence such that the AWD can be minimized.…”

Section: Studied Problemmentioning

confidence: 99%

“…Given the traffic demand from the upper layers, the current and new virtual topologies, the goal is to find an optimal transition sequence (from current to new) such that the objective cost can be minimized. The objective cost considered in [38] is the average weighted hop distance which is more accurate than the one proposed in [28]. A genetic algorithm was proposed to solve the WVTCTP.…”

Section: Transition Sequence Problemmentioning

confidence: 99%

“…In [38], the WDM virtual topology configuration transition problem (WVTCTP) with static traffic is defined and studied. Given the traffic demand from the upper layers, the current and new virtual topologies, the goal is to find an optimal transition sequence (from current to new) such that the objective cost can be minimized.…”

Section: Transition Sequence Problemmentioning

confidence: 99%

See 2 more Smart Citations

Virtual topology transition sequence problem on WDM networks with dedicated protection

Din

2008

Photon Netw Commun

Self Cite

View full text Add to dashboard Cite

Wavelength-division multiplexing (WDM) technology has emerged as a promising technology for backbone networks. The set of all-optical communication channels (lightpaths) in the optical layer defines the virtual topology for the upper layer applications. Since the traffic demand of upper layer applications fluctuates from time to time, it is required to reconfigure the underlying virtual topology in the optical layer accordingly. However, the reconfiguration for the virtual topology is reluctantly disruptive to the network since some lightpaths should be torn down and some traffic has to be buffered or rerouted during the reconfiguration process. Therefore, it needs to have an efficient transition method to shift the current virtual topology to the new one so as to minimize the effect of the reconfiguration on the upper layer traffic. In this article, the WDM virtual topology transition sequence problem (WVTTSP) which minimizes the average weighted delay (AWD) is studied. Since the WVTTSP is NP-hard, a heuristic solution model is proposed to solve it. Simulation results show that the proposed least weighted distance first (LWDF) method can find the best result and the time spent by it is less than 4 s for a middle-sized network with 100 links and with 30 wavelengths per link.

show abstract

Section: Studied Problemmentioning

confidence: 99%

Section: Transition Sequence Problemmentioning

confidence: 99%

Section: Transition Sequence Problemmentioning

confidence: 99%

See 1 more Smart Citation

Virtual topology transition sequence problem on WDM networks with dedicated protection

Din

2008

Photon Netw Commun

Self Cite

View full text Add to dashboard Cite

show abstract

“…Der-Rong [2] proposed the WDM Virtual Topology Configuration Transition Problem (WVTCTP) which minimizes the average weighted hop distance is studied. Since the WVTCTP is NP-hard, a Genetic Algorithm (GA) is proposed to solve it.…”

Section: Related Workmentioning

confidence: 99%

Ga-Based Dynamic Routing in WDM Optical Networks

Ramesh¹,

Vadivelu²

2013

IJRET

View full text Add to dashboard Cite

show abstract

“…Since the traffic demand of upper layer applications fluctuates from time to time, it is required to reconfigure the underlying virtual topology in the optical layer accordingly. Din (2004Din ( , 2007 has used genetic algorithms to solve the optimal multiple multicast problem on wavelength division multiplexing ring networks, without wavelength conversion and the virtual topology configuration transition problem. Also, Le et al (2006) have dealt with the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion.…”

Section: Introductionmentioning

confidence: 99%

A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

Cortés

Muñuzuri

Onieva

et al. 2011

Applied Soft Computing

View full text Add to dashboard Cite

This paper deals with the dynamic routing problem in ATM cell-switching networks. We present a mathematical programming model based on cell loss and a Tabu Search algorithm with short-term memory that is reinforced with a long-term memory procedure. The estimation of the quality of the solutions is fast, due to the specific encoding of the feasible solutions. The Tabu Search algorithm reaches good quality solutions, outperforming other approaches such as Genetic Algorithms and the Minimum Switching Path heuristic, regarding both cell loss and the CPU time consumption. The best results were found for the more complex networks with a high number of switches and links.

show abstract

A genetic algorithm for solving virtual topology configuration transition problem in WDM network

Cited by 15 publications

References 23 publications

Virtual topology transition sequence problem on WDM networks with dedicated protection

Virtual topology transition sequence problem on WDM networks with dedicated protection

Ga-Based Dynamic Routing in WDM Optical Networks

A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

Contact Info

Product

Resources

About