Restoration of virtual private networks with qos guarantees in the pipe model

Authors:
Chittaranjan Hota;Sanjay Kumar Jha;G. Raghurama
Affiliations:
Computer Science and Information Systems Group, Birla Institute of Technology and Science, Pilani, Rajasthan, India;School of Computer Science & Engineering, University of New South Wales, Sydney, NSW, Australia;Electrical and Electronics Engineering Group, Birla Institute of Technology and Science, Pilani, Rajasthan, India
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 8
Cited 0

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
A flexible model for resource management in virtual private networks

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay

International Journal of Network Management
On the cost of virtual private networks

IEEE/ACM Transactions on Networking (TON)
Restoration path concatenation: fast recovery of MPLS paths

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Algorithms for provisioning virtual private networks in the hose model

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Building Edge-Failure Resilient Networks

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose heuristic algorithms to compute efficient restorable tunnel paths for IP Virtual Private Networks (IPVPNs). We first propose a Customer Premises Equipment (CPE) based solution to the problem and then optimize it by activating selectively few core ISP routers. We consider link cost as a function of bandwidth and loss over the link. The VPN tunnel paths are computed taking into account two parameters, the link cost and the cost of core routers that serve as end points of the tunnel. These paths we then call as Active Paths. Reliability of a VPN depends on the reliability of links in the Active path. To guarantee service quality and VPN availability to the Corporate users, seamless recovery from failures is mandatory. For the sake of survivability we propose heuristics for computing optimal backup path. We assume that the residual capacity available over the links for the VPN is sufficient to satisfy the Service Level Agreement (SLA). The problem of finding optimal paths for both Active and Backup is similar to constructing a directed steiner tree routed at source and spanning all the destinations which is NP-hard. Our heuristic algorithms provide an efficient solution to this problem with polynomial computation time.