Abstract
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one another. Each terminal is equipped with an upper bound on the amount of traffic that the terminal can send or receive. The task is to install capacities at minimum cost and to compute paths for each unordered terminal pair such that each valid traffic matrix can be routed along those paths.
In this paper we consider a variant of the virtual private network design problem which generalizes the previously studied symmetric and asymmetric case. In our model the terminal set is partitioned into a number of groups, where terminals of each group do not communicate with each other.
Our main result is a 4.74 approximation algorithm for this problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Duffield, N.G., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K.K., van der Merive, J.E.: A flexible model for resource management in virtual private networks. In: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp. 95–108. ACM Press, New York (1999)
Fingerhut, J.A., Suri, S., Turner, J.S.: Designing least-cost nonblocking broadband networks. Journal of Algorithms 24(2), 287–309 (1997)
Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow, pp. 389–398 (2001)
Hurkens, C., Keijsper, J., Stougie, L.: Virtual private network design: A proof of the tree routing conjecture on ring networks. In: Jünger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol. 3509, pp. 407–421. Springer, Heidelberg (2005)
Erlebach, T., Regg, M.: Optimal bandwidth reservation in hose-model vpns with multi-path routing. In: INFOCOM (2004)
Altin, A., Amaldi, E., Belotti, P., Pinar, M.: Provisioning virtual private networks under traffic uncertainty. In: Proceedings of the 3rd Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW 2004). Electronic Notes in Discrete Mathematics, vol. 17, pp. 19–22 (2004)
Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: ACM (ed.) Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9–11, pp. 365–372. ACM Press, New York (2003)
Eisenbrand, F., Grandoni, F.: An improved approximation algorithm for virtual private network design. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, SODA 2005, pp. 928–932 (2005)
Eisenbrand, F., Grandoni, F., Oriolo, G., Skutella, M.: New approaches for virtual private network design. In: Proceedings of ICALP 2005 (to appear)
Italiano, G., Leonardi, S., Oriolo, G.: Design of networks in the hose model. In: Proceedings of ARACNE 2002, pp. 65–76 (2002)
Reich, G., Widmayer, P.: Beyond Steiner’s problem: A VLSI oriented generalization. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 196–210. Springer, Heidelberg (1990)
Ihler, E.: The complexity of approximating the class Steiner tree problem. Technical report, Institut für Informatik, Albert-Ludwigs-Universität Freiburg (1991)
Feige, U.: A threshold of ln n for approximating set cover. In: Proc. of the ACM sympository on the Theory of Computing, pp. 314–318 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eisenbrand, F., Happ, E. (2006). Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds) Algorithms and Complexity. CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758471_13
Download citation
DOI: https://doi.org/10.1007/11758471_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34375-2
Online ISBN: 978-3-540-34378-3
eBook Packages: Computer ScienceComputer Science (R0)