A novel algorithm for node‐encircling and link candidate p‐cycles design in WDM mesh network

Zhao, Taifei; Yu, Hongfang; Li, Lemin

doi:10.1080/02533839.2006.9671224

Cited by 5 publications

(6 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Several publications propose careful construction of a set of candidates' cycles P & P full (Liu and Ruan, 2004;Zhao et al, 2006). SLA and GROW are the most referenced and studied algorithms to generate candidates' cycles (Colman et al, 2008a,b,c;Doucette et al, 2003;Farkas et al, 2005).…”

Section: Generating Candidate Cyclesmentioning

confidence: 99%

“…SLA and GROW are the most referenced and studied algorithms to generate candidates' cycles (Colman et al, 2008a,b,c;Doucette et al, 2003;Farkas et al, 2005). Both approaches calculate a set of efficient cycles' candidates adaptable to topologies of different sizes, nodes, and number of links (Doucette et al, 2003;Farkas et al, 2005;Zhao et al, 2006).…”

Section: Generating Candidate Cyclesmentioning

confidence: 99%

See 1 more Smart Citation

Multiobjective Optimization in Optical Networks

Barán

Pinto-Roa

2015

Bio-Inspired Computation in Telecommunications

View full text Add to dashboard Cite

Section: Generating Candidate Cyclesmentioning

confidence: 99%

Section: Generating Candidate Cyclesmentioning

confidence: 99%

Multiobjective Optimization in Optical Networks

Barán

Pinto-Roa

2015

Bio-Inspired Computation in Telecommunications

View full text Add to dashboard Cite

“…Varios trabajos proponen la construcción cuidadosa de un conjunto de ciclos candidatos P'⊂ P full [5,6]. Este conjunto debe estar formado por los "mejores" ciclos a efectos de conseguir soluciones próximas a las óptimas, sin tener que analizar el total de los ciclos posibles.…”

Section: IIIunclassified

Optimal Selection of p-cycles on WDM Optical Networks with Shared Risk Link Group Independent Restorability using Genetic Algorithm

Talia

Villalba

Dávalos

et al. 2012

IEEE Latin Am. Trans.

View full text Add to dashboard Cite

The techniques for protection against failures in optical networks have been discussed in many scientific papers. In the case of Wavelength Division Multiplexing (WDM) optical networks, the p-cycles strategy of protection is a promising approach that combines the speed of ring protection and efficiency of resource utilization in mesh protection. In real networks, several optical links may fail at the same time when nodes or ducts failures happen. These sets of links with simultaneous fails can be determined a priori, and they are called Shared Risk Link Groups (SRLG). This paper proposes an approach based on Genetic Algorithm to find the best set of p-cycles that protects the network traffic against SRLG. Independent SRLG restoration is also achieved for better and faster network recovery in case of failures. This makes recovery faster and more efficiently. In addition we present a new algorithm for selecting candidates cycles, specific to this problem. The experimental results show viability of the proposed approach by achieving good performance in comparison to an exact algorithm of the state of the art. Enrique Dávalos, Máster en Ingeniería en Sistemas por la UNA. Ingeniero Electromecánico por la UNA. Programador de Computadores por la Universidad Nacional del Este-Paraguay. Docente Investigador en la FP-UNA.Diego P. Pinto-Roa, Ingeniero Electrónico por la Universidad Católica de Asunción. Alumno del Doctorado en Ciencias de la Computación y Docente Investigador por la FP-UNA.

show abstract

“…For large network topologies, calculating a set of full candidate cycles P full is unpractical [14]. Several works have proposed a careful construction of a set of non-full candidate cycles P  P full [9,11]. SLA and GROW algorithms generate a lot of candidate cycles [14].…”

Section: Generator Of Candidate Cyclesmentioning

confidence: 99%

“…The excellent performance of CIDA algorithm together with SLA and GROW approaches are studied in [6,14] and compared to other techniques such as ILP. Experimental results have demonstrated the potential of CIDA algorithm [9,11], which is presented below as Algorithm 1.…”

Section: Capacitated Iterative Design Algorithmmentioning

confidence: 99%

Optimal Selection of sigma-Cycle for Optical Networks. An approach based on Genetic Algorithm

Colmán

Pinto

Barán

2009

CLEIej

View full text Add to dashboard Cite

The study of prevention and protection against failures is a central problem in Optical Networks due to the growth of capacity demand for data transmission, especially with the Internet traffic. Without protection, failures of links or nodes cause huge losses of data. The ρ-Cycle protection is a novel approach based on pre-configured protection cycles to provide a fast recovery for single link failure. This work proposes a Genetic Algorithm to solve the ρ-Cycle protection question. Experimental tests carried out on different topologies have shown that this new proposal is a promising approach to achieve better results when compared to a well-known state-of-the-art alternative called Capacitated Iterative Design Algorithm - CIDA.

show abstract

A novel algorithm for node‐encircling and link candidate p‐cycles design in WDM mesh network

Cited by 5 publications

References 2 publications

Multiobjective Optimization in Optical Networks

Multiobjective Optimization in Optical Networks

Optimal Selection of p-cycles on WDM Optical Networks with Shared Risk Link Group Independent Restorability using Genetic Algorithm

Optimal Selection of sigma-Cycle for Optical Networks. An approach based on Genetic Algorithm

Contact Info

Product

Resources

About