Restoration in multi-domain GMPLS-based networks

Abstract

In this paper we evaluate the efficiency of using restoration mechanisms in a dynamic multi-domain GMPLS network. Major challenges and solutions are introduced and two well-known restoration schemes (End-to-End and Local-to-End) are evaluated. Additionally, new restoration mechanisms are introduced: one based on the position of a failed link, called Location-Based, and another based on minimizing the additional resources consumed during restoration, called Shortest-New. A complete set of simulations in different network scenarios show where each mechanism is more efficient in terms, such as, resource overbuild or recovery delay.

A heuristic approach for border node selection and traffic routing in multi-domain optical networks

“…The network model is based on the ITU-T Automatic Switched Optical Network (ASON) architecture [2] and the network management is based on the procedures of the IETF control plane Generalized Multi-Protocol Label Switching (GMPLS) [2,13]. The traffic routing is based on the IETF BRPC procedure, which means that domains inform only a set of shortest paths strictly essential to route the traffic.…”

“…As these standardized protocols allow improvements and the importance of efficiently managing multi-domain resources has attracted increasing attention, several useful approaches have been reported, including routing and wavelength assignment (RWA) schemes [4,7,[10][11][12], network survivability [13,14], network reconfiguration [15], and multi-domain traffic grooming [16]. A further issue that is part of this challenging field of research is the network design, planning, and management [17][18][19][20], due to its importance in reducing costs and maintaining the profitability of service providers while providing quality of service to their users.…”