论文信息 - Design of trees in the hose model: The balanced case

Design of trees in the hose model: The balanced case

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^[email protected]?"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.

Gianpaolo Oriolo | Giuseppe F. Italiano | Stefano Leonardi

[1] Amit Kumar,et al. Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

[2] Gianpaolo Oriolo,et al. Hardness of robust network design , 2007 .

[3] Subhash Suri,et al. Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.

[4] Martin Skutella,et al. New Approaches for Virtual Private Network Design , 2005, ICALP.

[5] Tim Roughgarden,et al. Simpler and better approximation algorithms for network design , 2003, STOC '03.

[6] Judith Keijsper,et al. Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks , 2005, SIAM J. Discret. Math..

[7] Albert G. Greenberg,et al. A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[8] Thomas Erlebach,et al. Optimal bandwidth reservation in hose-model VPNs with multi-path routing , 2004, IEEE INFOCOM 2004.

[9] Walid Ben-Ameur,et al. Routing of Uncertain Traffic Demands , 2005 .

[10] Arkadi Nemirovski,et al. Robust Convex Optimization , 1998, Math. Oper. Res..

[11] Friedrich Eisenbrand,et al. An improved approximation algorithm for virtual private network design , 2005, SODA '05.