Communications of the ACM
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
SIAM Journal on Computing
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Frame relay: technology and practice
Frame relay: technology and practice
MPLS: technology and applications
MPLS: technology and applications
Virtual private networks: technologies and solutions
Virtual private networks: technologies and solutions
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms for provisioning virtual private networks in the hose model
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Algorithms for provisioning virtual private networks in the hose model
IEEE/ACM Transactions on Networking (TON)
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Provisioning Virtual Private Networks in the Hose Model with Delay Requirements
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
Voice and video conferencing fundamentals
Voice and video conferencing fundamentals
Resource Management for Virtual Private Networks
IEEE Communications Magazine
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Capacity management and routing policies for voice over IP traffic
IEEE Network: The Magazine of Global Internetworking
Cooperative operating control based on virtual resources and user-suited HCI
CDVE'09 Proceedings of the 6th international conference on Cooperative design, visualization, and engineering
Resource reconstruction algorithms for on-demand allocation in virtual computing resource pool
International Journal of Automation and Computing
Hi-index | 0.00 |
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.