Performance evaluation of pre-computation algorithms for inter-domain QoS routing

Inter-domain QoS routing is a very challenging problem area. This problem combines the complexity of QoS routing, with the limitations of inter-domain routing, such as domain heterogeneity and information confidentiality. The pre-computation offers a very promising solution for addressing this problem. Although the pre-computation scheme has been investigated in several previous studies for a single routing domain, applying pre-computation on an inter-domain level is not straightforward and necessitates deeper investigation. In this work, we study different algorithms for QoS routing based on pre-computation. First, we investigate an exact algorithm. This algorithm provides an optimal solution for the QoS routing problem. However, its application in large scale networks is not always practical. Second, heuristic solutions are also investigated in this work. Particularly, a detailed study of the ID-MEFPA and the ID-PPPA heuristics is provided. Analytical studies and extensive simulations confirm that the exact algorithm achieves the best success rate, but has a very high computational complexity. The ID-MEFPA heuristic has a lower complexity and provides a success rate always close to the exact algorithm. When inter-domain connectivity is high, the ID-PPPA heuristic is the most appropriate with the lowest computation complexity and a success rate very close to the exact algorithm.

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

[2]  Ning Wang.  Recent Advances in Providing Qos and Reliability in the Future Internet Backbone , 2011 .

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

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

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

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

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

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

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

[10]  Ke Xu,et al.  Precomputation for multiconstrained QoS routing in high-speed networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

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

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

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

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

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