A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths

The fundamental Quality of Service (QoS) routing problem, which consists in determining paths subject to multiple QoS constraints, has been extensively investigated in the intra-domain context. However, few solutions exist for the inter-domain case, despite the importance of this problem to enable the delivery of services with QoS across domain boundaries. We propose a method that distributes the operations to compute inter-domain constrained paths. This method relies on a per-domain formulation that is compatible with the path computation element framework. It enables us to propose the first algorithm that guarantees to find optimal paths subject to an arbitrary number of constraints. These paths ensure the best QoS performance with respect to the constraints.

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

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

[3]  Arunabha Sen,et al.  Finding a Path Subject to Many Additive QoS Constraints , 2007, IEEE/ACM Transactions on Networking.

[4]  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.

[5]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

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

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

[8]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[11]  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).

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

[13]  Piet Van Mieghem,et al.  The impact of correlated link weights on QoS routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[15]  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).