A connection-oriented network architecture with guaranteed QoS for future real-time applications over the internet

Authors:
Manodha Gamage;Mitsuo Hayasaka;Tetsuya Miki
Affiliations:
The Department of Electronics, The National University of Electro-Communications, Chofu-Shi, Tokyo, Japan;The Department of Electronics, The National University of Electro-Communications, Chofu-Shi, Tokyo, Japan;The Department of Electronics, The National University of Electro-Communications, Chofu-Shi, Tokyo, Japan
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Year:
2006

Citing 6
Cited 0

Restoration strategies and spare capacity requirements in self-healing ATM networks

IEEE/ACM Transactions on Networking (TON)
Analysis of link failures in an IP backbone

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Addressing Network Survivability Issues by Finding the K-best Paths through a Trellis Graph

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
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

QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Availability analysis of span-restorable mesh networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.02

Visualization

Abstract

The QoS provided by today's best effort Internet is not good enough, especially for real-time interactive traffic categorized as Premium Traffic (PT). It is believed that QoS guarantees could be better provided by connection-oriented networks such as IP/MPLS. However, these connection-oriented networks are inherently more prone to network failures. Failures of connection-oriented MPLS can be broadly classified into two types namely: link/path failures and degraded failures. Degraded failures that account for about 50% of total failures are detected by the timers maintained at the control plane peers. The control plane and the data plane of IP/MPLS packet networks are logically separated and therefore a failure in the control plane should not immediately disconnect the communications in the data plane. The Virtual Path Hopping (VPH) concept in this study distinguishes these two types of failures and avoids the disconnections of communications in the data plane due to degraded failures. Thereby it reduces the number of failures in the data plane. Computer simulations were performed and the results indicate that VPH is a proactive technique that minimizes failures in the dala plane. The proposed Dynamic Virtual Path Allocation (DVPA) algorithm improves the availability of the connection-oriented networks by overcoming link/path failures, especially for PT, without compromising the network resource utilization efficiency. Comprehensive simulations were performed to evaluate the DVPA algorithm and the results show the improvements that DVPA can achieve. Therefore implementation of the DVPA algorithm in conjunction with VPH would improve the reliability and availability aspects of QoS in connection-oriented IP/MPLS packet networks.