Designing least-cost nonblocking broadband networks
Journal of Algorithms
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
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
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximability of robust network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
New approaches for virtual private network design
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Provisioning a virtual private network under the presence of non-communicating groups
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Design of trees in the hose model: The balanced case
Operations Research Letters
| Hi-index | 0.00 |
A basic question in Virtual Private Network (VPN) design is if the symmetric version of the problem always has an optimal solution which is a tree network. An affirmative answer would imply that the symmetric VPN problem is solvable in polynomial time. We give an affirmative answer in case the communication network within which to create the VPN is a circuit. This seems to be an important step towards an answer to the general question. The proof relies on a dual pair of linear programs and actually implies an even stronger property of VPNs. We show that this property also holds for some other special cases of the problem.