AS-level source routing for multi-provider connection-oriented services

In this paper, we study the inter-domain Autonomous System (AS)-level routing problem within an alliance of ASs. We first describe the framework of our work, based on the introduction of a service plane for automatic multi-domain service provisioning. We adopt an abstract representation of domain relationships by means of directional metrics which are applied to a triplet (ingress point, transit AS, egress point) where the ingress and egress points can be ASs or routers. Then, we focus on the point-to-point and multipoint AS-level routing problems that arise in such an architecture. We propose an original approach that reaches near optimal solutions with tractable computation times. A further contribution of this paper is that a heavy step in the proposed heuristic can be precomputed, independently of the service demands. Moreover, we describe how in this context AS-level path diversity can be considered, and present the related extension of our heuristic. By extensive tests on AS graphs derived from the Internet, we show that our heuristic is often equal or a few percent close to the optimal, and that, in the case of precomputation, its time consumption can be much lower than with other well-known algorithms.

[1]  Stefano Secci,et al.  AS Tree Selection for Inter-Domain Multipoint MPLS Tunnels , 2008, 2008 IEEE International Conference on Communications.

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

[3]  Ariel Orda,et al.  Precomputation schemes for QoS routing , 2003, TNET.

[4]  Konstantina Papagiannaki,et al.  Analysis of point-to-point packet delay in an operational network , 2004, IEEE INFOCOM 2004.

[5]  Konstantina Papagiannaki,et al.  Analysis of point-to-point packet delay in an operational network , 2007, Comput. Networks.

[6]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

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

[8]  Raouf Boutaba,et al.  QoS-aware service composition and adaptation in autonomic communication , 2005, IEEE Journal on Selected Areas in Communications.

[9]  Adrian Farrel,et al.  Applicability of the Path Computation Element (PCE) to Point-to-Multipoint (P2MP) Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Traffic Engineering (TE) , 2009 .

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

[11]  M. R. Rao,et al.  The Steiner tree problem I: Formulations, compositions and extension of facets , 1994, Math. Program..

[12]  Seisho Yasukawa Requirements for Point to Multipoint Traffic Engineered MPLS LSPs , 2004 .

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

[14]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[15]  Seisho Yasukawa,et al.  Signaling Requirements for Point-to-Multipoint Traffic-Engineered MPLS Label Switched Paths (LSPs) , 2006, RFC.

[16]  A. Pattavina,et al.  On the selection of optimal diverse AS-paths for inter-domain IP/(G)MPLS tunnel provisioning , 2008, 2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks.

[17]  Arie M. C. A. Koster,et al.  The partial constraint satisfaction problem: Facets and lifting theorems , 1998, Oper. Res. Lett..

[18]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  Stefano Secci,et al.  Testbed implementation of control plane extensions for inter-carrier GMPLS LSP provisioning , 2009, 2009 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities and Workshops.

[20]  Adrian Farrel,et al.  Inter-Domain MPLS and GMPLS Traffic Engineering - Resource Reservation Protocol-Traffic Engineering (RSVP-TE) Extensions , 2008, RFC.

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

[22]  Dimitri Papadimitriou,et al.  Policy-Enabled Path Computation Framework , 2008, RFC.

[23]  Lou Berger,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions , 2003, RFC.