scispace - formally typeset
Open AccessProceedings ArticleDOI

Connection rerouting/network reconfiguration

N. Jose, +1 more
- pp 23-30
TLDR
This paper proposes a methodology for minimizing the disruption time and the number of disruptions in the network during connection rerouting, and it is critical that the connections have minimal disruption times during network reconfiguration.
Abstract
Optical networks employing wavelength division multiplexing can carry huge volumes of traffic, hence maintaining a high level of service availability is important. This makes fault tolerance an important issue. In general the failed connections need to be rerouted. After a link or node failure, alternate paths for restoration of the failed connections may exist only if the network is reconfigured. In addition to link or node failure scenarios, connection rerouting or network reconfiguration may also prove helpful for accommodating new requests which may otherwise be blocked. Since connections on backbone optical networks, have longer call durations, it is crucial to accommodate new blocked requests through alternate means, instead of blocking them till existing connections terminate and make a path available. These situations make network reconfiguration important. Since most connections plying on todays backbone networks are high data rate connections, it is critical that the connections have minimal disruption times during network reconfiguration. In this paper, we propose a methodology for minimizing the disruption time and the number of disruptions in the network during connection rerouting.

read more

Citations
More filters
Journal ArticleDOI

Dynamic and Adaptive Bandwidth Defragmentation in Spectrum-Sliced Elastic Optical Networks With Time-Varying Traffic

TL;DR: This paper investigates dynamic and adaptive bandwidth defragmentation in EONs with time-varying traffic using connection reconfigurations and proposes intelligent timing selection and adaptive DF ratio selection methods to tackle the tradeoff between the bandwidth blocking probability (BBP) performance and operational complexity.
Proceedings ArticleDOI

Bandwidth defragmentation in dynamic elastic optical networks with minimum traffic disruptions

TL;DR: Simulation results indicate that in order to make the bandwidth blocking probability (BBP) comparable with that from the Greenfield scenario, the proposed algorithm only needs to reroute ~30% existing connections.
Journal ArticleDOI

Demonstrations of Efficient Online Spectrum Defragmentation in Software-Defined Elastic Optical Networks

TL;DR: This paper investigates how to overcome spectrum fragmentation in SD-EONs with OpenFlow-controlled online spectrum defragmentation (DF), and conducts system implementations to facilitate highly-efficient online DF.
Journal ArticleDOI

Lightpath Reconfiguration in WDM Networks

TL;DR: In this paper, the authors focus on minimizing the number of simultaneously disrupted connections at any time during the reconfiguration process, and propose a mixed-integer program (MIP) model, an exact algorithm, and a heuristic for solving the problem considering their objective.
Journal ArticleDOI

A survey of WDM network reconfiguration: Strategies and triggering methods

TL;DR: There are gaps in research and in field trials, which must be addressed, so that the great potentials of WDM network reconfiguration may be realized to add significant flexibility in network operations.
References
More filters
Book

Optical Networks: A Practical Perspective

TL;DR: The second edition of Optical Networks: A Practical Perspective succeeds the first as the authoritative source for information on optical networking technologies and techniques as discussed by the authors, covering componentry and transmission in detail but also emphasizing the practical networking issues that affect organizations as they evaluate, deploy, or develop optical solutions.
Book

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Narsingh Deo
TL;DR: This outstanding introductory treatment of graph theory and its applications has had a long life in the instruction of advanced undergraduates and graduate students in all areas that require knowledge of this subject.
Journal ArticleDOI

Finding All the Elementary Circuits of a Directed Graph

TL;DR: An algorithm is presented which finds all the elementary circuits of a directed graph in time bounded by O(n + e)(c + 1) and space bounded by $O( n + e) where there are n vertices, e edges and c elementary circuits in the graph.
Journal ArticleDOI

Graph theory with applications to engineering and computer science

TL;DR: Graph Theory and Its Applications to Problems of Society and its Applications to Algorithms and Computer Science.
Journal ArticleDOI

Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study

TL;DR: It is demonstrated that the entire optical network design problem can be considerably simplified and made computationally tractable, and that terminating the optimization within the first few iterations of the branch-and-bound method provides high-quality solutions.
Related Papers (5)