Resource optimization algorithms for virtual private networks using the hose model

Virtual private networks (VPNs) provide a secure and reliable communication between customer sites over a shared network. With increase in number and size of VPNs, service providers need efficient provisioning techniques that adapt to customer demands. The recently proposed hose model for VPN alleviates the scalability problem of the pipe model by reserving for aggregate ingress and egress bandwidths instead of between every pair of VPN endpoints. Existing studies on quality of service guarantees in the hose model either deal only with bandwidth requirements or regard the delay limit as the main objective ignoring the bandwidth cost. In this work we propose a new approach to enhance the hose model to guarantee delay limits between endpoints while optimizing the provisioning cost. We connect VPN endpoints using a tree structure and our algorithm attempts to optimize the total bandwidth reserved on edges of the VPN tree. Further, we introduce a fast and efficient algorithm in finding the shared VPN tree to reduce the total provisioning cost compared to the results proposed in previous works. Our proposed approach takes into account the user preferences in meeting the delay limits and provisioning cost to find the optimal solution of resource allocation problem. Our simulation results indicate that the VPN trees constructed by our proposed algorithm meet maximum end-to-end delay limits while reducing the bandwidth requirements as compared to previously proposed algorithms.

[1]  Rajeev Rastogi,et al.  Restoration algorithms for virtual private networks in the hose model , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Monia Ghobadi,et al.  Resource Optimization to Provision a Virtual Private Network Using the Hose Model , 2007, 2007 IEEE International Conference on Communications.

[3]  K. K. Ramakrishnan,et al.  Resource Management for Virtual Private Networks , 2007, IEEE Communications Magazine.

[4]  W. Timothy Strayer,et al.  Virtual Private Networks: Technologies and Solutions , 2001 .

[5]  Jeff T. Buckwalter.  Frame Relay: Technology and Practice , 1999 .

[6]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[7]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

[8]  Kwan Lawrence Yeung,et al.  Routing algorithm for provisioning symmetric virtual private networks in the hose model , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[9]  Thomas Erlebach,et al.  Optimal bandwidth reservation in hose-model VPNs with multi-path routing , 2004, IEEE INFOCOM 2004.

[10]  Huzur Saran,et al.  Capacity management and routing policies for voice over IP traffic , 2000 .

[11]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

[12]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[13]  Lei Zhang,et al.  Provisioning virtual private networks in the hose model with delay requirements , 2005, 2005 International Conference on Parallel Processing (ICPP'05).

[14]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[15]  Takeaki Uno,et al.  An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs , 1997, SIAM J. Comput..

[16]  Luigi Fratta,et al.  ATM virtual private networks , 1995, CACM.

[17]  Andrew G. Malis,et al.  A Framework for IP Based Virtual Private Networks , 2000, RFC.

[18]  S. Hakimi,et al.  On p -Centers in Networks , 1978 .

[19]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM.

[20]  Tim Roughgarden,et al.  Simpler and better approximation algorithms for network design , 2003, STOC '03.

[21]  Scott Firestone,et al.  Voice and Video Conferencing Fundamentals , 2007 .

[22]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[23]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[24]  Haibo. Wang,et al.  Provisioning virtual private networks in the hose model , 2007 .

[25]  GhobadiMonia,et al.  Resource optimization algorithms for virtual private networks using the hose model , 2008 .

[26]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[27]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[28]  István Szabó,et al.  On bandwidth efficiency of the hose resource management model in virtual private networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[29]  Monia Ghobadi,et al.  Hierarchical Provisioning Algorithm for Virtual Private Networks Using the Hose Model , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.