English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups

MPS-Authors
/persons/resource/persons44373

Eisenbrand,  Friedrich
Discrete Optimization, MPI for Informatics, Max Planck Society;

/persons/resource/persons44584

Happ,  Edda
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Eisenbrand, F., & Happ, E. (2006). Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. In T. Calamoneri, I. Finocchi, & G. F. Italiano (Eds.), Algorithms and Complexity (pp. 105-114). Berlin: Springer. doi:10.1007/11758471_13.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-24A0-4
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. \noindent 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. \noindent Our main result is a 4.74 approximation algorithm for this problem.