Design of a survivable WDM photonic network

Armitage, J.R.; Crochat, Olivier; Boudec, J.-Y. Le

doi:10.1109/infcom.1997.635136

Cited by 54 publications

(46 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the most efficient and widely used techniques to solve a survivable mapping problem is Tabu Search. Our implementation of Tabu Search follows the one in [12]; we will refer to it as Tabu97. Since Tabu Search turned out to be substantially faster than the ILP approach (described in the previous section), we carried out the simulations for relatively large graphs and studied the scalability of Tabu Search, FastSurv and SMART.…”

Section: Resultsmentioning

confidence: 99%

“…The problem of finding a survivable mapping was first defined in [12], and many algorithms solving this problem (with different variations) have been proposed since then. In general, they can be divided into two groups: exact algorithms based on Integer Linear Programming (ILP), and heuristics.…”

Section: Failure Protection and Restoration In Ip-over-wdm Networkmentioning

confidence: 99%

“…This is because the survivable mapping problem is NP-complete [16]. To avoid this prohibitive complexity, the second line of approach uses various heuristics, such as Tabu Search [12,17,18,14], Simulated Annealing [19] and others [20,21].…”

Section: Failure Protection and Restoration In Ip-over-wdm Networkmentioning

confidence: 99%

See 2 more Smart Citations

Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks

Ducatelle

Gambardella

Kurant

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in the presence of false and missing alarms. Next, we present two efficient algorithms for mapping an IP network on an optical network in such a way that it is protected against failures at the optical layer. The first algorithm offers a method to formally verify the existence of a solution, contrary to all other heuristics known to date. The second algorithm is a heuristic search that takes capacity constraints in account. Both algorithms are shown to be faster by orders of magnitude than existing solutions. Finally, we develop a new routing algorithm for wireless mobile ad hoc networks, adopting ideas from the Ant Colony Optimization metaheuristic. The routing scheme can adapt to network and traffic changes and uses multipath routing and an efficient local repair mechanism to improve failure resilience.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Failure Protection and Restoration In Ip-over-wdm Networkmentioning

confidence: 99%

See 1 more Smart Citation

Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks

Ducatelle

Gambardella

Kurant

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…c sd = 1 if there is a clear-channel between source node s and destination node d. A solution to the problem is obtained when each clear-channel of C is mapped onto a path in the physical graph. So, for each c sd ∈ C, an N × N mapping matrix R sd = (r (1) The problem as it is described above does not take into account wavelength assignment. If we consider wavelengths, there are two extra constraints: the distinct wavelength constraint and the wavelength continuity constraint [13].…”

Section: Formal Problem Definitionmentioning

confidence: 99%

A scalable algorithm for survivable routing in IP-over-WDM networks

Ducatelle

Gambardella

First International Conference on Broadband Networks

View full text Add to dashboard Cite

show abstract

“…The work in [53] [57], [58] and [59]. [57] considered backup multiplexing-based lightpath routing techniques to provide dependable connections in WDM networks with dynamic traffic demand.…”

Section: Introductionmentioning

confidence: 99%

Traffic grooming and wavelength conversion in optical networks

Thiagarajan

View full text Add to dashboard Cite

This manuscript has been reproduced from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer.The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction.In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand corner and continuing from left to right in equal sections with small overlaps.

show abstract

Design of a survivable WDM photonic network

Cited by 54 publications

References 14 publications

Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks

Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks

A scalable algorithm for survivable routing in IP-over-WDM networks

Traffic grooming and wavelength conversion in optical networks

Contact Info

Product

Resources

About