Computation of Multi-Constrained Paths in Multi-Domain MPLS-TE Networks

The present paper proposes a novel method for computing inter-domain paths subject to multiple independent additive constraints in MPLS-TE networks. An efficient solution to this problem is a key element for providing services with guaranteed performance across domain boundaries. However, the inherent hardness of the multi-constrained path computation as well as inter-domain scalability and security constraints complicate the computation problem. We propose a novel algorithm named kID-MCP that tackles the computational complexity of the problem by reducing the number of paths included in the computation process. kID-MCP is compatible with existing techniques and fulfills the security requirements. We undergo a complexity analysis that shows that kID-MCP scales well. Moreover, a simulation study reveals that kID-MCP finds a solution in most situations. These results indicate that the computation of inter-domain multi-constrained paths is tractable in practice, which opens interesting perspectives for QoS routing and traffic engineering among multiple operators.

[1]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[2]  George Pavlou,et al.  Interdomain Routing through QoS-Class Planes , 2007 .

[3]  Jean-Louis Le Roux,et al.  Path Computation Element (PCE) Communication Protocol (PCEP) , 2009, RFC.

[4]  Piet Van Mieghem,et al.  Concepts of exact QoS routing algorithms , 2004, IEEE/ACM Transactions on Networking.

[5]  Piet Van Mieghem,et al.  Hop-by-hop quality of service routing , 2001, Comput. Networks.

[6]  Ratul Mahajan,et al.  Towards Coordinated Interdomain Traffic Engineering , 2004 .

[7]  Jean-Louis Le Roux,et al.  A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths , 2009, RFC.

[8]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Adrian Farrel,et al.  A Path Computation Element (PCE)-Based Architecture , 2006, RFC.

[10]  Samer Lahoud,et al.  Inter-Domain Path Computation with Multiple Constraints , 2008 .

[11]  Panos M. Pardalos,et al.  Handbook of Optimization in Telecommunications , 2006 .

[12]  Jean-Louis Le Roux,et al.  Network Working Group Encoding of Objective Functions in the Path Computation Element Communication Protocol (pcep) , 2009 .

[13]  Adrian Farrel,et al.  Network Working Group A. Farrel Request for Comments: 4726 Old Dog Consulting Category: Informational a Framework for Inter-domain Multiprotocol Label Switching Traffic Engineering , 2022 .

[14]  M. Liljenstam,et al.  Development of an Internet backbone topology for large-scale network simulations , 2003 .

[15]  Adrian Farrel,et al.  Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based Mechanism , 2009, RFC.

[16]  Samer Lahoud,et al.  Inter-Domain Path Computation with Multiple QoS Constraints , 2008 .

[17]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  Paola Festa,et al.  Shortest Path Algorithms , 2006, Handbook of Optimization in Telecommunications.

[19]  David M. Nicol,et al.  Simulation of large scale networks II: development of an internet backbone topology for large-scale network simulations , 2003, WSC '03.

[20]  B. Quoitin,et al.  A cooperative approach to interdomain traffic engineering , 2005, Next Generation Internet Networks, 2005.

[21]  Dipl.-Ing. Thomas Martin Knoll.  BGP Extended Community Attribute for QoS Marking , 2008 .

[22]  Jean-Philippe Vasseur,et al.  Path-Computation-Element-Based Architecture for Interdomain MPLS/GMPLS Traffic Engineering: Overview and Performance , 2007, IEEE Network.

[23]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[24]  Jean-Philippe Vasseur,et al.  A Per-Domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE) Label Switched Paths (LSPs) , 2008, RFC.

[25]  H.T. Mouftah,et al.  Constraint-based routing across multi-domain optical WDM networks , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[26]  Stefano Secci,et al.  A service plane over the PCE architecture for automatic multidomain connection-oriented services , 2008, IEEE Communications Magazine.

[27]  Ning Wang,et al.  Interdomain routing through QoS-class planes [Quality-of-Service-Based Routing Algorithms for Heterogeneous Networks] , 2007, IEEE Communications Magazine.

[28]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.