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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Mitra, D., Ziedins: Hierarchical Virtual Partitioning: Algorithms for Virtual Private Networking. In: IEEE GLOBECOMM 1997 (1997)
Erlebach, T., Ruegg, M.: Optimal Bandwidth Reservation in Hose-Model VPNs with Multipath Routing. In: Proceedings of IEEE INFOCOM (2004)
Juttner, Szabo, Szentesi: On Bandwidth Efficiency of the Hose Resource Management Model in VPNs. In: Proceedings of IEEE INFOCOM (2003)
McDysan, V.P.N.: Applications Guide. J. Wiley & Sons, Inc., Chichester
Duffield, N.G., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K.K.: A Flexible Model for Resource Management in Virtual Private Networks. In: Proc. ACM SIGCOMM (September 1999)
Kohen, R., Kaempfer, G.: On the Cost of Virtual Private Networks. IEEE Transactions on Networking 8(6) (December 2000)
Hota, C., Raghurama, G.: A Heuristic Algorithm for QoS Path Computation in VPNs. In: International Conference on Information Technology (CIT), Bhubaneswar, India (December 2003)
Italiano, G., Rastogi, R., Yener, B.: Restoration Algorithms for Virtual Private Networks in the Hose Model. In: Proceedings of IEEE INFOCOM (2002)
Gabow, H.N., Galil, Z., Spencer, T., Tarjan, R.E.: Efficient Algorithms for Finding Minimal Spanning Trees in Undirected and Directed Graphs. Combinatorica 6(2), 109–122 (1986)
Hac, A., Zhou, K.: A New Heuristic Algorithm for Finding Minimal Cost Multicast Trees with Bounded Path Delays. In: IJONM, pp. 265–278 (1999)
Lau, W., Jha, S.: Failure Oriented Path Restoration Algorithms for Survivable Networks. In: NOMS, Korea (2004)
Kodialam, M., Lakshman, T.V.: Dynamic Routing of Restorable Bandwidth-Guaranteed Tunnels Using Aggregated Network Resource Usage Information. IEEE Transactions on Networking 11(3) (June 2003)
Hyong, Konstantopoulos: Dynamic Capacity Resizing for Fair Bandwidth Sharing in VPNs. IEICE Transactions on Communications E86-B(5) (May 2003)
Takahashi, Matsuyama: An Approximate Solution for the Stenier Problem in Graphs. Math. Japonica 24, 573–577 (1980)
Singhal, N.K., Sahasrabuddhe, L.H., Mukherjee, B.: Provisioning of Survivable Multicast Sessions Against Single Link Failures in Optical WDM Mesh Networks. Journal of Lightwave Technology 21(11) (November 2003)
Chandra, Anupam: Building Edge Failure Resilient Networks. In: 9th IPCOC, Cambridge, MA
Kumar, A., Rastogi, Silberschatz, Yener: Algorithms for Provisioning VPNs in the Hose Model. In: Proceedings of ACM SIGCOMM 2001 (2001)
Hakimi: Steiner Problem in Graphs and its’ Implications. Networks 1 (1971)
Bremler Barr, A., Afek, Y., Kaplan, H., Cohen, E., Merritt, M.: Restoration by Path Concatenation: Fast Recovery of MPLS Paths. In: Proceedings of ACM SIGMETRICS (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hota, C., Jha, S.K., Raghurama, G. (2004). Restoration of Virtual Private Networks with QoS Guarantees in the Pipe Model. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds) Distributed Computing - IWDC 2004. IWDC 2004. Lecture Notes in Computer Science, vol 3326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30536-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-30536-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24076-1
Online ISBN: 978-3-540-30536-1
eBook Packages: Computer ScienceComputer Science (R0)