Inter-Domain Path Computation with Multiple Constraints

The interest for providing services with performance guarantees across domain boundaries has driven recent technical solutions allowing the computation of constrained inter-domain paths. The computation of optimal paths subject to multiple constraints is an NP-complete problem for which efficient exact solutions exist in the intra-domain case. However, these solutions cannot be used for inter-domain path computations, because of confidentiality and scalability constraints. Thus, the present paper investigates the problem of computing inter-domain paths subject to multiple constraints. We describe the information exchanges required between the domains for optimal computations. We extend existing algorithms for inter-domain computations, and describe new heuristics approximating exact solutions. We propose an exact solution, named pID-MCP, allowing the precomputation of path segments in the domains. After proving the correctness and the complexity of exact solutions, we evaluate by simulation the performance of the algorithms and the heuristics proposed. Our solutions allow the computation of inter-domain paths subject to multiple constraints without breaking the confidentiality constraints of the domains. Moreover, the heuristics can be used in large-scale networks. Key-words: Inter-domain routing, multi-constrained path computation

[1]  Ning Wang,et al.  End-to-end quality of service provisioning through inter-provider traffic engineering , 2006, Comput. Commun..

[2]  Klara Nahrstedt,et al.  Topology aggregation and routing in bandwidth-delay sensitive networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

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

[4]  Olivier Bonaventure,et al.  A performance evaluation of BGP-based traffic engineering , 2005, Int. J. Netw. Manag..

[5]  Edwin K. P. Chong,et al.  A MULTICONSTRAINT QOS ROUTING SCHEME USING A MODIFIED DIJKSTRA'S ALGORITHM , 2002 .

[6]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[7]  Huiying Xu,et al.  Path Computation Architectures Overview in Multi-Domain Optical Networks Based on ITU-T ASON and IETF PCE , 2008, NOMS Workshops 2008 - IEEE Network Operations and Management Symposium Workshops.

[8]  Rajeev Rastogi,et al.  Optimal configuration for BGP route selection , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Youjian Zhao,et al.  Scalable BGP QoS Extension with Multiple Metrics , 2006, International conference on Networking and Services (ICNS'06).

[10]  Qian Xu,et al.  On Cooperative Inter-Domain Path Computation , 2006, 11th IEEE Symposium on Computers and Communications (ISCC'06).

[11]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[12]  Performance Analysis of Inter-Domain Path Computation Methodologies , 2009, RFC.

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

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

[17]  J. Rexford,et al.  MIRO: multi-path interdomain routing , 2006, SIGCOMM.

[18]  P. Van Mieghem,et al.  A multiple quality of service routing algorithm for PNNI , 1998 .

[19]  Piet Van Mieghem,et al.  TAMCRA: a tunable accuracy multiple constraints routing algorithm , 2000, Comput. Commun..

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

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

[22]  Olivier Bonaventure,et al.  Path Selection Techniques to Establish Constrained Interdomain MPLS LSPs , 2006, Networking.

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

[24]  Andrzej Beben,et al.  EQ-BGP: an efficient inter-domain QoS routing protocol , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

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

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

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

[28]  Gerard Hooghiemstra,et al.  A scaling law for the hopcount in internet , 2000 .

[29]  Klara Nahrstedt,et al.  QoS extension to BGP , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[30]  Samphel Norden,et al.  Inter-domain routing: Algorithms for QoS guarantees , 2005, Comput. Networks.

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

[32]  A. Terzis,et al.  QoS Enhancements to BGP in Support of Multiple Classes of Service , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[33]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .