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

A connection oriented next generation Internet could guarantee the QoS preferred by the emerging real time applications. These connection oriented networks are inherently more prone to network failures: link/path failures and degraded failures. The control and the data plane of connection oriented networks such as MPLS are logically separated. Therefore a failure in the control plane should not always immediately affect the communications in the data plane. Control plane failures are usually detected using Timers. If any of the Timers expire, the control plane session is terminated resulting failures in the corresponding data plane. This paper discusses in detail the implementation of VPH concept that intent to eliminate the degraded type failures in the data plane and its advantages. Also this evaluates a more efficient, non-periodic VPH concept. The results of the computer simulations show VPH is a proactive technique to eliminate degraded type failures and improve the availability of the networks.

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

[2]  Ariel Orda,et al.  Algorithms for computing QoS paths with restoration , 2005, IEEE/ACM Transactions on Networking.

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

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

[5]  Ina Minei,et al.  LDP Specification , 2007, RFC.

[6]  Chunming Qiao,et al.  An ultra-fast shared path protection scheme - distributed partial information management, part II , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

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

[8]  Murali S. Kodialam,et al.  Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information , 2003, TNET.

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

[10]  R. Braden,et al.  Resource reSer Vation Protocol (RSVP) , 1997 .

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

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

[13]  Jingchao Chen.  Dijkstra's Shortest Path Algorithm , 2003 .

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

[15]  Loa Andersson,et al.  The Multiprotocol Label Switching (MPLS) Working Group decision on MPLS signaling protocols , 2003, RFC.

[16]  Geng-Sheng Kuo,et al.  A new architecture for transmission of MPEG-4 video on MPLS networks , 2002 .

[17]  Subhash Suri,et al.  Routing bandwidth-guaranteed paths with restoration in label-switched networks , 2004, Comput. Networks.

[18]  Alpár Jüttner,et al.  On the effectiveness of restoration path computation methods , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[19]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

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

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

[22]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[23]  H. T. Mouftah,et al.  Improving the reliability of the label distribution protocol , 2001, Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks.