Authors:
Anastasios Bikos
1
;
Christos Bouras
2
and
Kostas Stamos
3
Affiliations:
1
University of Patras, Greece
;
2
Research Academic Computer Technology Institute and University of Patras, Greece
;
3
Research Academic Computer Technology Institute, University of Patras and Technological Educational Institute of Patra, Greece
Keyword(s):
GMPLS, Link failure probability, Link delay-constrained Algorithm, LSP routing, Path protection.
Related
Ontology
Subjects/Areas/Topics:
Communication and Software Technologies and Architectures
;
Data Communication Networking
;
e-Business
;
Enterprise Information Systems
;
Information and Systems Security
;
Network and Service Management
;
Network Management
;
Network Protocols
;
Performance Evaluation
;
Routing and Flow Control in Lans, Wans and Pans
;
Software Engineering
;
Software Project Management
;
Telecommunications
;
Wireless Information Networks and Systems
Abstract:
It is widely accepted that GMPLS (Generalized MPLS) will be a key technology in the evolution of the next generation of reliable Internet Protocol (IP) backbone networks. Conventional GMPLS-based optical-switching network fault recovery only provides resiliency in terms of path segment selection instead of constraint-based calculation. This can create severe impact on the protocol’s transport plane when a fault occurs to a link or path with many optical connections attached to it. This paper proposes the implementation of an improved GMPLS recovery algorithm based on the metric of optical link delay which is achieved through the pre or post selection of a safer and more stable protection path with fewer connections attached to it, and therefore with a lesser link delay metric compared to other possible paths. The improved recovery algorithm is evaluated using the network simulator ns-2 and more particularly a specialized simulator add-on for GMPLS, called ASONS (Automatically Switche
d Optical Network Simulator). The results indicate improved resiliency, increased fault avoidance, and reduced packet loss.
(More)