Rights accessRestricted access - publisher's policy
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.
CitationHernández-Sola, G. [et al.]. Scalable hybrid path computation procedure for PCE-based multi-domain WSON networks. A: International Conference on Transparent Optical Networks. "2011 13th International Conference on Transparent Optical Networks". Stockholm: IEEE, 2011, p. 1-4.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com