Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Asian Journal of Information Technology
Year: 2007  |  Volume: 6  |  Issue: 10  |  Page No.: 1035 - 1040

Enhanced Restoration Algorithm in Virtual Private Network with Qos Support

R. Ravi and S. Radhakrishnan    

Abstract: A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of VPN are connected using abstractions such as Virtual Channels (VCs). Reliability of an end-to-end VPN connection depends on the reliability of the links and nodes. VPN service providers provide new services with Quality of Service (QoS), guarantees are also resilient to failures. Supporting QoS connections requires the existence of routing mechanisms that computes the QoS paths, where these paths satisfy the QoS constraints. Resilience to failures, on the other hand, is achieved by providing, each primary QoS path, a set of alternative QoS paths, upon a failure of either a link or a node. We aim at to minimize the total bandwidth reserved on the backup edges. The above objectives, coupled with the need to minimize the global use of network resources, imply that the cost of both the primary path and the restoration topology should be a major consideration of the routing process. It turns out that the widely used approach of disjoint primary, restoration paths is not an optimal strategy. Hence, the proposed approximation restoration algorithms construct a restoration topology and this topology protects a portion of the primary QoS path. This approach guarantees to find a restoration topology with optimal cost which satisfies the QoS constraints.

Fulltext    |   Related Articles   |   Back
  Related Articles

Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility