Scalable hybrid path computation procedure for PCE-based

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.