English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-24A0-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0025-BDFB-2
Genre: Conference Paper

Files

show Files
hide Files
:
Provisioning_a_Virtual_Private_Network_Under_the_Presence_of_Non-communicating_Groups.pdf (Any fulltext), 452KB
 
File Permalink:
-
Name:
Provisioning_a_Virtual_Private_Network_Under_the_Presence_of_Non-communicating_Groups.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Eisenbrand, Friedrich1, Author           
Happ, Edda2, Author           
Affiliations:
1Discrete Optimization, MPI for Informatics, Max Planck Society, ou_1116548              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2007-03-0420062006
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 520594
URI: http://www.springerlink.com/content/q54kw24681t1066p/fulltext.pdf
DOI: 10.1007/11758471_13
Other: Local-ID: C1256BDD00205AD6-E04BE74189D7F96BC125712B003B6880-Happ2006
 Degree: -

Event

show
hide
Title: 6th Italian Conference on Algorithms and Complexity
Place of Event: Rome, Italy
Start-/End Date: 2006-05-29 - 2006-05-31

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms and Complexity
  Abbreviation : CIAC 2006
  Subtitle : 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings
Source Genre: Proceedings
 Creator(s):
Calamoneri, Tiziana1, Editor
Finocchi, Irene1, Editor
Italiano, Giuseppe F.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 105 - 114 Identifier: ISBN: 978-3-540-34375-2

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 3998 Sequence Number: - Start / End Page: - Identifier: ISSN: 0302-9743