By Topic

Resource Optimization to Provision a Virtual Private Network Using the Hose Model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. Ghobadi ; Univ. of Victoria, Victoria ; S. Ganti ; G. C. Shoja

Virtual private networks (VPN) provide a secure and reliable communication between customer sites over a shared network. With increase in number and size of VPNs, 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 its aggregate ingress and egress bandwidth 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 requirement as the main objective ignoring the bandwidth cost. In this work we propose a new approach to enhance the hose model to guarantee delay requirements between endpoints while optimizing the provisioning bandwidth 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. Our proposed approach takes into account the user preferences in meeting the delay requirements and provisioning cost to find the optimal solution of resource allocation problem. Our experimental results indicate that the VPN trees constructed by our proposed algorithm meet minimum delay requirements while reducing the bandwidth requirements as compared to previously proposed algorithms.

Published in:

2007 IEEE International Conference on Communications

Date of Conference:

24-28 June 2007