Fabrizio Grandoni
580 California St., Suite 400
San Francisco, CA, 94104
New Approaches for Virtual Private Network Design
2007, SIAM Journal on Computing
Sign up for access to the world's latest research
Abstract
AI
AI
This paper addresses the NP-hard problem of virtual private network design (VPND) represented as a weighted graph. The focus is on determining optimal capacities at minimal costs while specifying paths for ordered pairs of nodes, ensuring all valid traffic matrices can be routed. New contributions include a lower bound using Hu's 2-commodity flow theorem, an improved upper bound for a routing scheme, a new randomized algorithm that yields a non-tree structured solution, and a combination of the new algorithm and simple routing yielding an expected performance ratio of 3.55.
References (16)
- M. Andrews and L. Zhang. The access network design problem. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science(FOCS-98), pages 40-49, Los Alamitos, CA, Nov.8-11 1998. IEEE Computer Society.
- B. Awerbuch and Y. Azar. Buy-at-bulk network design. In 38th Annual Symposium on Foundations of Computer Science, pages 542-547, Miami Beach, Florida, 20-22 Oct. 1997. IEEE.
- G. Brightwell, G. Oriolo, and F. B. Shepherd. Reserving resilient capacity in a network. SIAM J. Discrete Math., 14(4):524-539, 2001.
- S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1:195-207, 1971/72.
- N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan, and J. E. van der Merive. A flexible model for resource management in virtual private net- works. In Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pages 95-108. ACM Press, 1999.
- F. Eisenbrand and F. Grandoni. An improved approximation algorithm for vir- tual private network design. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, SODA 05, pages 928-932, 2005.
- S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicom- modity flow problems. SIAM Journal on Computing, 5(4):691-703, 1976.
- J. A. Fingerhut, S. Suri, and J. S. Turner. Designing least-cost nonblocking broad- band networks. Journal of Algorithms, 24(2):287-309, 1997.
- A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener. Provisioning a virtual private network: a network design problem for multicommodity flow. In ACM Symposium on the Theory of Computing, pages 389-398, 2001.
- A. Gupta, A. Kumar, and T. Roughgarden. Simpler and better approximation algorithms for network design. In ACM, editor, Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9-11, 2003, pages 365-372, New York, NY, USA, 2003. ACM Press.
- T. Hu. Multi-commodity network flows. Operations Research, 11:344-360, 1963.
- C. Hurkens, J. Keijsper, and L. Stougie. Virtual private network design: A proof of the tree routing conjecture on ring networks. In Proceedings of the eleventh Conference on Integer Programming and Combinatorial Optimization, IPCO XI, 2005. to appear.
- G. Italiano, S. Leonardi, and G. Oriolo. Design of networks in the hose model. In Proceedings of ARACNE 2002, pages pp 65-76, 2002.
- G. F. Italiano, R. Rastogi, and B. Yener. Restoration algorithms for virtual private networks in the hose model. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-02), volume 1 of Proceedings IEEE INFOCOM 2002, pages 131-139. IEEE Computer Society, 2002.
- G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs. In Proceedings of the eleventh annual ACM-SIAM Symposium on Discrete Algorithms, SODA'00, pages 770-779, 2000.
- A. Schrijver. Combinatorial optimization. Polyhedra and efficiency (3 volumes). Algorithms and Combinatorics 24. Berlin: Springer., 2003.