Abstract
The ability of computing optimal routes poses new challenges when extending it to larger multi-domain network scenarios, as the quality of these computed end-to-end inter-domain routes depends on the selection of the domain sequence to be traversed. In the scope of the Internet Engineering Task Force (IETF), the Path Computation Element (PCE) Working Group has not provided definitive solutions to address the domain sequence selection problem, being still a work in progress. To this goal, the Path Computation Flooding (PCF) approach appears as a possible extension to Backward Recursive PCE-based Computation (BRPC) to calculate optimal end-to-end inter-domain paths without requiring a pre-configured domain sequence. Nonetheless, PCF presents major scalability issues in terms of network control overhead and path computation complexity, thus pleading for more accurate domain sequence selection techniques. This paper describes two novel mechanisms to establish inter-domain paths calculating the sequence of domains to be crossed when it is not known in advance. Both procedures make a good trade-off between the control overhead introduced and the accuracy of the computed end-to-end route. The obtained simulation results show the benefits of the proposed contributions, drastically reducing the control overhead while keeping the connection blocking probability close to the optimal values.
Similar content being viewed by others
References
Mannie, E.: Generalized multi-protocol label switching (GMPLS) architecture, RFC 3945, October 2004
Farrel, A., Vasseur, J.P., Ash, J.: A path computation element (PCE)-based architecture, RFC 4655, August 2006
Vasseur, J.P., Ayyangar, A., Zhang, R.: A per-domain path computation method for establishing inter-domain traffic engineering (TE) label switched paths (LSPs), RFC 5152, February 2008
Vasseur, J.P., Zhang, R., Bitar, N., Le Roux, J.L.: A backward-recursive PCE-based computation (BRPC) procedure to compute shortest constrained inter-domain traffic engineering label switched paths, RFC 5441, April 2009
King, D., Farrel, A.: The application of the PCE architecture to the determination of a sequence of domains in MPLS & GMPLS, IETF draft draft-king-pce-hierarchy-fwk-04.txt, July 2010
Le Roux, J.-L., Vasseur, J.-P., Boyle, J. (eds.): Requirements for inter-area MPLS traffic engineering, RFC 4105, June 2005
Zhang, R., Vasseur, J.-P. (eds.): MPLS inter-autonomous system (AS) traffic engineering (TE) requirements, RFC 4216, November 2005
Rekhter, Y., Li, T.: A border gateway protocol 4 (BGP-4), RFC 4271 (2006)
Saad, T., Mouftah, H.T.: Inter-domain wavelength routing in optical WDM networks. In: IEEE Networks 2004, June 2004
Liu, Q., Kok, M.A., Ghani, N., Muthalaly, V.M., Wang, M.: Hierarchical inter-domain routing in optical DWDM networks. In: INFOCOM 2006, 25th IEEE International Conference on Computer Communications Proceedings, pp. 1–5, 23–29 April 2006
Wan, X., Chen, Y., Zhang, H., Zheng, X.: Dynamic domain-sequencing scheme for inter-domain path computation in WDM networks. Proc. SPIE 7633, 76330X (2009). doi:10.1117/12.851332
Chamania M., Chen X., Jukan A., Rambach F., Hoffmann M.: An adaptive inter-domain PCE framework to improve resource utilization and reduce inter-domain signaling. Opt. Switch. Netw. 6(4), 259–267 (2009)
Bradford, R., Vasseur, J.P., Farrel, A.: Preserving topology confidentiality in inter domain path computation using a key based mechanism, RFC 5520, April 2009
Vasseur, J.P., Le Roux, J.L.: Path computation element (PCE) communication protocol (PCEP), RFC 5440, March 2009
Le Roux, J.L.: Requirements for path computation element (PCE) discovery, RFC 4674, October 2006
Casellas R., Martínez R., Muñoz R., Gunreben S.: Enhanced backwards recursive path computation for multi-area wavelength switched optical networks under wavelength continuity constraint. J. Opt. Commun. Netw. 1, A180–A193 (2009)
OMNeT++, http://www.omnetpp.org/
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hernández-Sola, G., Perelló, J., Agraz, F. et al. Enhanced domain disjoint backward recursive TE path computation for PCE-based multi-domain networks. Photon Netw Commun 21, 141–151 (2011). https://doi.org/10.1007/s11107-010-0288-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-010-0288-5