Optimizing the QoS Performance of Fast Rerouting

A fast rerouting scheme is proposed to guarantee the QoS performance of rerouted path when handling link and node failures. The new scheme is based on deflection routing mechanism and improves on two aspects: first, it can promptly handle single node failure as well as single link failure, second, QoS metric is taken into accounted when calculating recovery routes. Simulation results show that the proposed scheme could achieve as optimal performance as constrained Bellman-Ford algorithm.

[1]  Tibor Cinkler,et al.  Joint Quantification of Resilience and Quality of Service , 2006, 2006 IEEE International Conference on Communications.

[2]  Zheng Wang,et al.  Internet QoS: Architectures and Mechanisms for Quality of Service , 2001 .

[3]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[4]  T. Cinkler,et al.  Quality of resilience (QoR): NOBEL approach to the multi-service resilience characterization , 2005, 2nd International Conference on Broadband Networks, 2005..

[5]  Achim Autenrieth,et al.  Resilience Differentiated QoS - Extensions to RSVP and DiffServ to Signal End-to-End IP Resilience Requirements , 2001, DRCN.

[6]  Ossama Younis,et al.  Constraint-based routing in the internet: Basic principles and recent research , 2003, IEEE Communications Surveys & Tutorials.

[7]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[8]  Andreas Kirstädter,et al.  Engineering end-to-end IP resilience using resilience-differentiated QoS , 2002, IEEE Commun. Mag..

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

[10]  Siridhar Vellanki.  Improving service availability during link failure transients through alternate routing , 2003 .

[11]  Rajeev Rastogi,et al.  Algorithms for computing QoS paths with restoration , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  B. Bellur,et al.  Quality-of-service routing using maximally disjoint paths , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[13]  Piet Van Mieghem,et al.  Performance evaluation of constraint-based path selection algorithms , 2004, IEEE Network.

[14]  G. Manimaran,et al.  Reliability constrained routing in QoS networks , 2005, IEEE/ACM Transactions on Networking.