Journal ArticleDOI
Protection interoperability for WDM optical networks
Reads0
Chats0
TLDR
This work analyzes three types of failure propagation, called "bottleneck," "connectivity," and "multiple groups," and presents a solution based on the definition of appropriate requirements at network design and a WDM channel placement algorithm, protection interoperability for WDM (PIW).Abstract:
The failure of a single optical link or node in a wavelength division multiplexing (WDM) network may cause the simultaneous failure of several optical channels. In some cases, this simultaneity may make it impossible for the higher level (SONET or IP) to restore service. This occurs when the higher level is not aware of the internal details of network design at the WDM level. We call this phenomenon "failure propagation." We analyze three types of failure propagation, called "bottleneck," "connectivity," and "multiple groups." Then we present a solution based on the definition of appropriate requirements at network design and a WDM channel placement algorithm, protection interoperability for WDM (PIW). Our method does not require the higher level to be aware of WDM internals, but still avoids the three types of failure propagation mentioned above. We finally show the result on various network examples.read more
Citations
More filters
Journal ArticleDOI
Survivable WDM mesh networks
TL;DR: In this paper, the authors examined different approaches to protect a mesh-based WDM optical network from such failures and proposed distributed protocols for path and link restoration, and formulated a model of protection-switching times for different protection schemes based on a fully distributed control network.
Journal ArticleDOI
New and improved approaches for shared-path protection in WDM mesh networks
TL;DR: It is proved that the problem of finding an eligible pair of working and backup paths for a new lightpath request requiring shared-path protection under the current network state is NP-complete and a heuristic is developed to compute a feasible solution with high probability.
Journal ArticleDOI
Approximating optimal spare capacity allocation by successive survivable routing
TL;DR: Numerical results comparing several SCA algorithms show that SSR has the best trade-off between solution optimality and computation speed.
Journal ArticleDOI
Optical layer survivability-an implementation perspective
Ori Gerstel,Rajiv Ramaswami +1 more
TL;DR: The factors that affect the complexity of optical protection schemes, such as supporting mesh instead of ring protection, handling low-priority traffic, and dealing with multiple types of failures are discussed.
Journal ArticleDOI
The resilience of WDM networks to probabilistic geographical failures
Pankaj K. Agarwal,Alon Efrat,Shashidhara K. Ganjugunte,David Hay,Swaminathan Sankararaman,Gil Zussman +5 more
TL;DR: This work provides a unified framework to model network vulnerability when the event has a probabilistic nature, defined by an arbitrary probability density function and uses computational geometric tools to provide efficient algorithms to identify vulnerable points within the network under various metrics.
References
More filters
Journal ArticleDOI
Dense wavelength division multiplexing networks: principles and applications
TL;DR: Recent progress in multiwavelength networks are reviewed, some of the limitations which affect the performance of such networks are discussed, and examples of several network and switch proposals based on these ideas are presented.
Requirements for Traffic Engineering Over MPLS
TL;DR: This document identifies the functional capabilities required to implement policies that facilitate efficient and reliable network operations in an MPLS domain and can be used to optimize the utilization of network resources and to enhance traffic oriented performance characteristics.
Journal ArticleDOI
On the Complexity of Timetable and Multicommodity Flow Problems
Shimon Even,Alon Itai,Adi Shamir +2 more
TL;DR: A very primitive version of Gotlieb’s timetable problem is shown to be NP-complete, and therefore all the common timetable problems areNP-complete.
Journal ArticleDOI
A user's guide to tabu search
TL;DR: This presentation demonstrates that a well-tuned implementation of tabu search makes it possible to obtain solutions of high quality for difficult problems, yielding outcomes in some settings that have not been matched by other known techniques.