Optimal design and evaluation of survivable WDM transport networks

Miyao, Yasuhiro; Saitō, Hiroshi

doi:10.1109/49.725189

Cited by 117 publications

(59 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Survivability further increases the complexity of the design of optical WDM networks. Survivable design of WDM networks under static traffic was studied in [14], [15], [16], [17], [18], [19], [20], and [21]. Most of the current approaches solve the survivable routing problem in WDM networks either by directly solving complex ILP formulations that are extremely time consuming or by using heuristics or meta heuristics such as tabu-search, which do not provide any guarantee on the optimality of the solution obtained.…”

mentioning

confidence: 99%

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Todimala

Ramamurthy

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are N P-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature.In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures.It further increases the complexity of network design and presents network designers with more formidable challenges.In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.

show abstract

mentioning

confidence: 99%

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Todimala

Ramamurthy

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

“…NSFNet has however only terrestrial links, a much larger geographical extension and lower connectivity, with 14 nodes and 22 links. Traffic demand is composed of 360 unidirectional connection requests, distributed in order that traffic is symmetric, derived from realistic traffic measurements reported in [29]. Fig.…”

Section: Case-study Analysismentioning

confidence: 99%

Availability design of optical transport networks

Tornatore

Maier²,

Pattavina

2005

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-A design technique for reliable optical transport networks is presented. The network is first dimensioned in order to carry a given set of static protected optical connections, each one routed maximizing its availability. The network can be further optimized by minimizing the number of fibers to be installed, while keeping a control on connection availability, which can remain the same or decrease by a prefixed margin factor. Design and optimization algorithms are provided for networks adopting dedicated and shared path-protection. The optimization approach is heuristic. Results obtained by applying the proposed technique to two casestudy networks are shown and discussed. These two case-study experiments are carried out exploiting a realistic model to evaluate terrestrial and submarine optical link availability.Index Terms-Deterministic network calculus, mathematical programming/optimization, system design.

show abstract

“…Section 2 describes the assumptions and definitions of this paper. Section 3 addresses the proposed GQoR algorithm and fault recovery method that deals with link failure [9][10], node failure and channel failure [11]. Section 4 shows and discusses the simulation results in terms of the blocking probability and the mean hop number comparison for the proposed GQoR mechanism vs. QoP mechanism [8].…”

Section: Introductionmentioning

confidence: 99%

Guaranteed Quality of Recovery in WDM Mesh Networks

Hwang

Huang²,

Shie

2009

Current Research Progress of Optical Networks

View full text Add to dashboard Cite

This study proposes a mechanism of guaranteed quality of recovery (GQoR) for Wavelength Division Multiplexing (WDM) mesh networks. Four GQoR levels are used to support customized services, and each of them is mapped to the adaptive recovery methodology. Once a failure occurs, the control system activates the recovery mechanism in compliance with the GQoR level. If the protection procedure fails as well, the proposed algorithm will then execute the restoration mechanism. Consequently, the recovery success rate is increased. This paper examines the shared segment recovery methods to establish backup path; therefore, it is well suited for large-scale networks and also increases the bandwidth utilization of the networks. Furthermore, a node deals only with its own routing information by employing the distributed control, so the fault recovery procedure can be speeded up. Simulation results reveal that the proposed method has greater performance of lower blocking probability and mean hop number than other methods previously reported in the literature.

show abstract

Optimal design and evaluation of survivable WDM transport networks

Cited by 117 publications

References 18 publications

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Availability design of optical transport networks

Guaranteed Quality of Recovery in WDM Mesh Networks

Contact Info

Product

Resources

About