e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
MPLS: technology and applications
MPLS: technology and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Designing BGP-based outbound traffic engineering techniques for stub ASes
ACM SIGCOMM Computer Communication Review
Capacity planning in IP virtual private networks under mixed traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Multi-path routing versus tree routing for VPN bandwidth provisioning in the hose model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cloud control with distributed rate limiting
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Extensions to P2MP RSVP-TE for VPN-specific state provisioning with fair resource sharing
Computer Communications
Fully decentralized emulation of best-effort and processor sharing queues
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Resource optimization algorithms for virtual private networks using the hose model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Capacity planning in IP Virtual Private Networks under mixed traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
A genetic algorithm for optimization of bandwidth assignment in hose-modeled VPN
ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
Forward-Looking WDM Network Reconfiguration with Per-Link Congestion Control
Journal of Network and Systems Management
Virtual private network design: a proof of the tree routing conjecture on ring networks
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Design and deployment of IP virtual private networks: a case study
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
A resource management mechanism for hose model based VPN qos provisioning
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
ViNEYard: virtual network embedding algorithms with coordinated node and link mapping
IEEE/ACM Transactions on Networking (TON)
Competitive and deterministic embeddings of virtual networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
High-performance routing for hose-based VPNs in multi-domain backbone networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of the ACM (JACM)
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science
| Hi-index | 0.00 |
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for greater flexibility since it permits traffic to and from a hose endpoint to be arbitrarily distributed to other endpoints. In this paper, we develop novel algorithms for provisioning VPNs in the hose model. We connect VPN endpoints using a tree structure and our algorithms attempt to optimize the total bandwidth reserved on edges of the VPN tree. We show that even for the simple scenario in which network links are assumed to have infinite capacity, the general problem of computing the optimal VPN tree is NP-hard. Fortunately, for the special case when the ingress and egress bandwidths for each VPN endpoint are equal, we can devise an algorithm for computing the optimal tree whose time complexity is O(mn), where m and n are the number of links and nodes in the network, respectively. We present a novel integer programming formulation for the general VPN tree computation problem (that is, when ingress and egress bandwidths of VPN endpoints are arbitrary) and develop an algorithm that is based on the primal-dual method. Our experimental results with synthetic network graphs indicate that the VPN trees constructed by our proposed algorithms dramatically reduce bandwidth requirements (in many instances, by more than a factor of 2) compared to scenarios in which Steiner trees are employed to connect VPN endpoints.