Design of trees in the hose model: The balanced case

Authors:
Giuseppe Italiano;Stefano Leonardi;Gianpaolo Oriolo
Affiliations:
Dipartimento di Informatica, Sistemi e Produzione, Universitá di Tor Vergata, Roma, Italy;Dipartimento di Informatica e Sistemistica, Universitá La Sapienza, Roma, Italy;Dipartimento di Ingegneria dell'Impresa, Universitá di Tor Vergata, Roma, Italy
Venue:
Operations Research Letters
Year:
2006

Citing 8
Cited 11

Designing least-cost nonblocking broadband networks

Journal of Algorithms
Robust Convex Optimization

Mathematics of Operations Research
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
Simpler and better approximation algorithms for network design

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An improved approximation algorithm for virtual private network design

SODA '05 Proceedings of the sixteenth 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
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

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

ACM SIGACT News
The VPN conjecture is true

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
Approximability of robust network design

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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 VPN Problem with Concave Costs

SIAM Journal on Discrete Mathematics
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk

Mathematics of Operations Research
Competitive and deterministic embeddings of virtual networks

ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
A short proof of the VPN Tree Routing Conjecture on ring networks

Operations Research Letters
The VPN Conjecture Is True

Journal of the ACM (JACM)
Competitive and deterministic embeddings of virtual networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the hose model we are given upper bounds b"u^-/b"u^+ on the amount of traffic entering/leaving a node. We show that when @?"u"@?"Vb"u^+=@?"v"@?"Vb"u^-, designing a minimum cost tree network is easy and the cost of an optimal tree reservation is within a factor of three of the cost of any reservation.