Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

Authors:
C. A. J. Hurkens;J. C. M. Keijsper;L. Stougie
Affiliations:
-;-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2007

Citing 0
Cited 10

Routing and network design with robustness to changing or uncertain traffic demands

ACM SIGACT News
On the Complexity of the Asymmetric VPN Problem

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Network design via core detouring for problems without a core

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations

INFORMS Journal on Computing
The VPN Problem with Concave Costs

SIAM Journal on Discrete Mathematics
Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE

Computers and Operations Research
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk

Mathematics of Operations Research
A short proof of the VPN Tree Routing Conjecture on ring networks

Operations Research Letters
Static and dynamic routing under disjoint dominant extreme demands

Operations Research Letters
The VPN Conjecture Is True

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 the VPN must be created, is a circuit. This seems to be an important step towards answering 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, in particular when the network is a tree of rings.