Cart (Loading....) | Create Account
Close category search window
 

Experimental Assessment of Bulk Path Restoration in Multi-layer Networks Using PCE-based Global Concurrent Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Castro, A. ; Opt. Commun. Group (GCO), Univ. Politec. de Catalunya (UPC), Barcelona, Spain ; Martinez, R. ; Casellas, R. ; Velasco, L.
more authors

Generalized multi-protocol label switching-based multi-layer networks (MLN) combining packet and optical switching lead to jointly leverage intrinsic per-layer benefits such as statistical multiplexing and huge transport capacity. By doing so, efficient network resource utilization is attained through MLN traffic engineering (TE) strategies, i.e. grooming. In this context, an optical link failure may cause the disruption of multiple groomed packet label switched paths (LSPs). Thereby, efficient recovery schemes such as restoration are required. In dynamic restoration, the centralized path computation element (PCE) sequentially computes backup paths for the set of failed packet LSPs using the TE database (TED). Since the TED is not updated until an LSP is actually set up, it is very likely that the PCE assigns the same network resources to different backup paths. This does increase resource contention and not fully exploits the potential grooming opportunities among the backup LSPs; consequently, the restorability metric performs poorly. To improve this, a designed PCE global concurrent optimization (GCO) architecture is implemented favoring grooming and lowering resource contention. The addressed problem, referred to as bulk path restoration in multi-layer optical networks (BAREMO), is formally modeled and stated using a mixed integer linear programming formulation. Then, a heuristic algorithm solving the BAREMO problem is devised. The experimental performance evaluation is conducted within the ADRENALINE testbed. Besides validating the PCE GCO architecture, its performance is compared with a sequential PCE for several traffic loads and failure rates. The results show that the PCE GCO improves remarkably restorability compared to the sequential PCE at the expenses, however, of increasing the restoration time.

Published in:

Lightwave Technology, Journal of  (Volume:32 ,  Issue: 1 )

Date of Publication:

Jan.1, 2014

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.