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
Resource management with hoses: point-to-cloud services for virtual private networks
IEEE/ACM Transactions on Networking (TON)
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
(Almost) tight bounds and existence theorems for confluent flows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Traffic engineering of management flows by link augmentations on confluent trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Cost-optimal design of VoIP networks using the VPN concept
Computer Networks: The International Journal of Computer and Telecommunications Networking
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM (JACM)
Reliability as an interdomain service
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A restorable MPLS-based hose-model VPN network
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new approach for building secure applications based on internet infrastructure
International Journal of Computer Applications in Technology
Measurement-based characterization of IP VPNs
IEEE/ACM Transactions on Networking (TON)
New architecture and algorithms for fast construction of hose-model VPNs
IEEE/ACM Transactions on Networking (TON)
Resource optimization algorithms for virtual private networks using the hose model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Oblivious routing of highly variable traffic in service overlays and IP backbones
IEEE/ACM Transactions on Networking (TON)
Locally restorable routing of highly variable traffic
IEEE/ACM Transactions on Networking (TON)
Optimal link weights for IP-based networks supporting hose-model VPNs
IEEE/ACM Transactions on Networking (TON)
Cost-optimal design of VoIP networks using the VPN concept
Computer Networks: The International Journal of Computer and Telecommunications Networking
Guaranteed performance routing of unpredictable traffic with fast path restoration
IEEE/ACM Transactions on Networking (TON)
Performance comparisons of optimal routing by pipe, hose, and intermediate models
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Fine two-phase routing over shortest paths with traffic matrix
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimizing server placement in distributed systems in the presence of competition
Journal of Parallel and Distributed Computing
INFORMS Journal on Computing
Traffic-oblivious routing in the hose model
IEEE/ACM Transactions on Networking (TON)
End-to-end restorable oblivious routing of hose model traffic
IEEE/ACM Transactions on Networking (TON)
Restoration of virtual private networks with qos guarantees in the pipe model
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Provisioning VPN over shared network infrastructure
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
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.