OSA's Digital Library

Journal of Lightwave Technology

Journal of Lightwave Technology


  • Vol. 32, Iss. 1 — Jan. 1, 2014
  • pp: 81–90

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

A. Castro, R. Martínez, R. Casellas, L. Velasco, R. Muñoz, R. Vilalta, and J. Comellas

Journal of Lightwave Technology, Vol. 32, Issue 1, pp. 81-90 (2014)

View Full Text Article

Acrobat PDF (952 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

  • Export Citation/Save Click for help


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.

© 2013 IEEE

A. Castro, R. Martínez, R. Casellas, L. Velasco, R. Muñoz, R. Vilalta, and J. Comellas, "Experimental Assessment of Bulk Path Restoration in Multi-layer Networks Using PCE-based Global Concurrent Optimization," J. Lightwave Technol. 32, 81-90 (2014)

Sort:  Year  |  Journal  |  Reset


  1. Requirements for GMPLS-based multi-region and multi-layer networks (MRN/MLN) IETF RFC 5212, 2008.
  2. A path computation element (PCE)-based architecture IETF RFC 4655, 2006.
  3. P. Cholda, A. Jajszczyk, "Recovery and Its quality in multilayer networks," J. Lightw. Technol. 28, 372-389 (2010).
  4. M. Clouqueur, W. Grover, " Availability analysis of span-restorable mesh networks," IEEE J. Sel. Areas Commun. 20, 810-821 (2002).
  5. Path computation element communication protocol (PCEP) requirements and protocol extensions in support of global concurrent optimization IETF RFC 5557, 2009.
  6. M. Ruiz, O. Pedrola, L. Velasco, D. Careglio, J. Fernández-Palacios, G. Junyent, "Survivable IP/MPLS-Over-WSON multilayer network optimization," J. Opt. Commun. Netw. 3, 629-640 (2011).
  7. K. Krishnan, R. Doverspike, C. Pack, "Improved survivability with multi-layer dynamic routing," IEEE Commun. Mag. 33, 62-68 (1995).
  8. L. Velasco, F. Agraz, R. Martínez, R. Casellas, S. Spadaro, R. Muñoz, G. Junyent, "GMPLS-based multi-domain restoration: Analysis, strategies, policies and experimental assessment," J. Opt. Commun. Netw. 2, 427-441 (2010).
  9. R. Ghimire, S. Mohan, M. Leary, T. Tidwell, "Concurrent multi-layer restoration scheme for GMPLS based WDM networks ," Proc. Adv. Netw. Telecommun. Syst. (2008) pp. 1-3.
  10. K. Lu, G. Xiao, I. Chlamtac, "Analysis of blocking probability for distributed lightpath establishment in WDM optical networks," IEEE/ACM Trans. Netw. 13, 187-197 (2005).
  11. N. Sambo, A. Giorgetti, I. Cerutti, P. Castoldi, "A contention detection scheme for lightpath restoration in GMPLS networks," IEEE Commun. Lett. 11, 820-822 (2007).
  12. D. Alvarez, V. Lopez, J. Anamuro, J. Lopez, O. Gonzalez, J. Aracil, "Utilization of temporary reservation of path computed resources for multi-domain path computation element protocols in WDM networks," Proc. Netw. Future (2011) pp. 102-106 .
  13. A. Giorgetti, L. Valcarenghi, F. Cugini, P. Castoldi, "PCE-based dynamic restoration in wavelength switched optical networks ," Proc. IEEE Int. Conf. Commun. (2010) pp. 1-6.
  14. J. Ahmed, C. Cavdar, P. Monti, L. Wosinska, "A dynamic bulk provisioning framework for concurrent optimization in PCE-based WDM networks," J. Lightw. Technol. 30, 2229-2239 (2012).
  15. R. Muñoz, R. Casellas, R. Martínez, "An open GMPLS-enabled control plane testbed for remote development and experimentation of PCE-based path computation algorithms," Proc. Future Netw. Mobile Summit (2011) pp. 1 -8.
  16. X. Zhang, F. Shen, L. Wang, S. Wang, L. Li, H. Luo, "Two-layer mesh network optimization based on inter-layer decomposition," Photon. Netw. Commun. 21, 310-320 (2011).
  17. M. Pióro, D. Medhi, "Routing, flow, and capacity design in communication and computer networks," Morgan Kaufmann (2004).
  18. CPLEX. (Nov. 2013). [Online]. Available: http://www-01.ibm.com/software/commerce/optimization/ cplex-optimizer/.
  19. Path computation element (PCE) communication protocol , Internet Eng. Task Force Request For Comments IETF RFC 5540, Mar. 2009.
  20. Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions, Internet Eng. Task Force Request For Comments IETF RFC 5521, 2009 .

Cited By

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited