By Topic

Scalable hybrid path computation procedure for PCE-based multi-domain WSON Networks

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
$33 $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

6 Author(s)
G. Hernández-Sola ; Advanced Broadband Communications Center (CCABA), Universitat Politècnica de Catalunya (UPC), Jordi Girona, 1-3, 08034, Barcelona (Spain) ; J. Perelló ; F. Agraz ; S. Spadaro
more authors

In the Hierarchical Path Computation Element (H-PCE) architecture, an optimum end-to-end path is computed using a hierarchical relationship among PCEs. An H-PCE-based path computation procedure provides low network blocking probability meanwhile it results on a great amount of control overhead messages. In this paper we propose a hybrid path computation procedure based on the H-PCE architecture and the Backward Recursive PCE-Based Computation (BRPC). Extensive simulation results show that the proposed approach performs better than H-PCE in terms of network control overhead.

Published in:

2011 13th International Conference on Transparent Optical Networks

Date of Conference:

26-30 June 2011