QoS Guaranteed and Reliable Network Architecture for Real-Time Applications over the Connection Oriented Internet

Connection oriented packet networks such as IP/MPLS can better meet QoS guarantees in terms of delay jitter, bandwidth etc. These connection oriented networks are more vulnerable to failures that could be classified into link/path and degraded failures. Virtual path hopping (VPH) concept discussed here eliminates terminations of data communications in data plane due to degraded failures detected by control plane timers. Dynamic virtual path allocation (DVPA) algorithm proposed here can achieve very fast recovery for premium traffic (PT) from link/path failures while keeping efficiency of network high. This recovery time consists of two main parts; time taken to detect failures and time taken to activate backup path. DVPA algorithm virtually makes time taken to activate backup path `zero' for PT as it uses active backup path. DVPA algorithm maintains a VP-pool between ingress and egress and two or more VPs will be active at any given time, depending on traffic. Also DVPA algorithm makes sure that active backup path is always occupied by best effort traffic (BET) when there are no failures, increasing efficiency of network. According to simulation results, implementing DVPA algorithm in conjunction with VPH concept can achieve a very high availability for PT in future IP/MPLS

[1]  Vishal Sharma,et al.  Framework for Multi-Protocol Label Switching (MPLS)-based Recovery , 2003, RFC.

[2]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1999, TNET.

[3]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[4]  G. Liu,et al.  Performance Evaluation of K Shortest Path Algorithms in MPLS Traffic Engineering , 2004 .

[5]  Katherine Guo,et al.  Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks , 2022 .

[6]  Wayne D. Grover,et al.  Availability analysis of span-restorable mesh networks , 2002, IEEE J. Sel. Areas Commun..

[7]  Chen-Nee Chuah,et al.  Analysis of link failures in an IP backbone , 2002, IMW '02.

[8]  Alia Atlas,et al.  Fast Reroute Extensions to RSVP-TE for LSP Tunnels , 2005, RFC.

[9]  T. Miki,et al.  Virtual path hopping to overcome network failures due to control plane failures in connection oriented networks , 2004, APCC/MDMC '04. The 2004 Joint Conference of the 10th Asia-Pacific Conference on Communications and the 5th International Symposium on Multi-Dimensional Mobile Communications Proceeding.

[10]  Andrew Malis,et al.  Graceful Restart Mechanism for LDP , 2001 .

[11]  Yuchun Guo,et al.  Link‐disjoint paths for reliable QoS routing , 2003, Int. J. Commun. Syst..

[12]  Tetsuya Miki,et al.  Implementation of Virtual Path Hopping (VPH) as a Solution for Control Plane Failures in Connection Oriented Networks and an Analysis of Traffic Distribution of VPH , 2005, QoS-IP.

[13]  Enke Chen,et al.  Graceful Restart Mechanism for BGP , 2007, RFC.

[14]  Andreas Pitsillides,et al.  Addressing network survivability issues by finding the K-best paths through a trellis graph , 1997, Proceedings of INFOCOM '97.