A Hybrid End-to-End QoS Path Computation Algorithm for PCE-Based Multi-Domain Networks

Inter-domain quality of service (QoS) routing is a challenging problem for today’s Internet. This problem requires the computation of paths that cross multiple domains and meet different QoS constraints. In addition, the used computation methods must meet the constraints of confidentiality and autonomy imposed by the domains of different operators. Path computation element (PCE)-based architecture offers a promising solution for inter-domain QoS routing. It ensures the computation of end-to-end QoS paths while preserving the confidentiality and the autonomy of the domains. In this paper, we propose a novel hybrid end-to-end QoS path computation algorithm, named HID-MCP, for PCE-based networks. HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Moreover, it integrates a crankback mechanism for improving path computation results in a single domain or in multiple domains based on the PCE architecture. Detailed analyses are provided to assess the performance of our algorithm in terms of success rate and computational complexity. The simulation results show that our algorithm has an acceptance rate of the requests very close to the optimal solution; precisely, the difference is lower than 1 % in a realistic network. Moreover, HID-MCP has a low computational complexity. Besides, our solution relies on the PCE architecture to overcome the limitations related to inter-domain routing such as domain autonomy and confidentiality.

[1]  Ahmed Frikha,et al.  Performance evaluation of pre-computation algorithms for inter-domain QoS routing , 2011, 2011 18th International Conference on Telecommunications.

[2]  Bernard Cousin,et al.  Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic , 2011, 2011 IEEE 36th Conference on Local Computer Networks.

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

[4]  W. Marsden.  I and J , 2012 .

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

[6]  Klara Nahrstedt,et al.  Analysis of Topology Aggregation techniques for QoS routing , 2007, CSUR.

[7]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[8]  Raimo Kantola,et al.  Influence of link state updating on the performance and cost of QoS routing in an intranet , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

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

[10]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Yufeng Xin,et al.  A Performance Analysis of Inter-Domain QoS Routing Schemes Based on Path Computation Elements , 2008, 2008 International Symposium on High Capacity Optical Networks and Enabling Technologies.

[12]  Samer Lahoud,et al.  A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths , 2009, EUNICE.

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

[15]  Ashwin Gumaste,et al.  Enhanced crankback signaling for multi-domain IP/MPLS networks , 2010, Comput. Commun..

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

[17]  Ahmed Frikha,et al.  Pre-computation based heuristic for inter-domain QoS routing , 2010, 2010 IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems.

[18]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[20]  Miklós Molnár.  Hierarchies for Constrained Partial Spanning Problems in Graphs , 2008 .

[21]  Jean-Louis Le Roux,et al.  Path Computation Element (PCE) Communication Protocol Generic Requirements , 2006, RFC.

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

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

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

[25]  Bernard Cousin,et al.  Candidate-cycle-based heuristic algorithm for node-and-link protection of dynamic multicast traffic in optical DWDM networks , 2012, The International Conference on Information Network 2012.

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

[27]  Ahmed Frikha,et al.  Hybrid Inter-Domain QoS Routing based on Look-Ahead Information , 2010 .

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

[29]  B. Cousin,et al.  Reliable multicast sessions provisioning in sparse light-splitting DWDM networks using p-cycles , 2012, 2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR).

[30]  Bernard Cousin,et al.  Hybrid Inter-Domain QoS Routing with Crankback Mechanisms , 2011, NEW2AN.

[31]  Jordi Domingo-Pascual,et al.  On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains , 2006, IEEE Communications Magazine.

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