Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rosen, E., et al.: Multi Protocol Label Switching Architecture. IETF RFC 3031 (January 2001)
Sharma, V., et al.: Framework for Multi-Protocol Label Switching (MPLS)-based Recovery. IETF RFC 3469 (January 2003)
Gamage, M., et al.: Virtual Path Hopping to overcome Network Failures due to Control Plane Failures in Connection Oriented Networks. In: Proceedings of joint conference of the 10th APCC and the 5th MDMC (August 2004)
Anderson, L., et al.: LDP Specification. IETF RFC 3036 (January 2001)
Iannaccone, G., et al.: Analysis of link failures in a IP backbone. In: Proceedings of Internet Measurement Workshop (2002), http://www.icir.org/vern/imw-2002/imw2002-papers/202.pdf
Wu, J., Montuno, D.Y., Mouftah, H.T., Wang, G., Dasylva, A.C.: Improving the Reliability of the Label Distribution Protocol. In: Proceedings of the 26th Annual IEEE conference on Local Computer Networks (2001)
Awduche, D., et al.: RSVP-TE: Extensions to RSVP for LSP Tunnels. IETF RFC 3209 (December 2001)
Kuo, G.-S., Lai, C.T.: A new architecture for transmission of MPEG-4 video on MPLS networks. In: ICC 2001 - IEEE International Conference on Communications, June, vol. 5, pp. 1556–1560 (2001)
Xiong, Y., Mason, L.G.: Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Transactions on Networking 7(1), 98–110 (1999)
Kodialam, M., Lakshman, T.V.: Dynamic routing of restorable bandwidthguaranteed tunnels using aggregated network resource usage information. IEEE/ACM Transactions on Networking 11(3), 399–410 (2003)
Xu, D., Qiao, C., Xiong, Y.: An Ultra-fast Shared Path Protection Scheme-Distributed Partial Information, Part II. In: Proceedings of the 10th ICNP 2002- IEEE International Conference on Network Protocols (June 2002)
Liu, Y., Tipper, D., Siripongwutikorn, P.: Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing. In: Proceedings of IEEE INFOCOM (2001)
Dijkstra’s shortest path algorithm, http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
Pan, P., Swallow, G., Atlas, A.: Fast Reroute Extensions to RSVP-TE for LSP Tunnels, http://www.ietf.org/internet-drafts/draft-ietf-mpls-rsvp-lsp-fastreroute-07.txt
Li, L., Buddhikot, M.M., Chekuri, C., Guo, K.: Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks. In: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)
Nikolopoulos, S.D., Pitsillides, A., Tipper, D.: Addressing Network Survivability Issues by Finding the K-best Paths through a Trellis Graph. In: Proceediings of IEEE INFOCOM (1997)
Szviatovszki, B., Szentesi, A., Juttner, A.: On the Effectiveness of Restoration Path Computation Methods, http://www.cs.elte.hu/~alpar/publications/proc/RestoPath.pdf
Guo, Y., Kuipers, F., Van Mieghem, P.: Link-Disjoint Paths for Reliable QoS Routing, http://www.nas.its.tudelft.nl/people/Piet/papers/dimcra.pdf
Bejerano, Y., et al.: Algorithms for Computing QoS paths with Restoration, http://citeseer.ist.psu.edu/cache/papers/cs/29147/
http://www.zSzzSztiger.technion.ac.ilzSz/~spalexzSzpubzSzTM-restoration.pdf/bejerano02algorithms.pdf
Clouqueur, M., Grover, W.D.: Availability Analysis of Span-Restorable Mesh Networks. IEEE Jurnal on Selected Areas in Communications 20(4) (May 2002)
Andersson, L., Swallow, G.: RSVP The Multiprotocol Label Switching (MPLS) Working Group decision on MPLS signaling protocols. IETF RFC 3468 (February 2003)
Braden, R., et al.: Resource ReServation Protocol (RSVP). IETF RFC 2205 (September 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gamage, M., Hayasaka, M., Miki, T. (2005). 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. In: Ajmone Marsan, M., Bianchi, G., Listanti, M., Meo, M. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2004. Lecture Notes in Computer Science, vol 3375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30573-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30573-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24557-5
Online ISBN: 978-3-540-30573-6
eBook Packages: Computer ScienceComputer Science (R0)