Sciweavers

46 search results - page 4 / 10
» Provisioning a virtual private network: a network design pro...
Sort
View
COCOA
2008
Springer
13 years 7 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
ICALP
2010
Springer
13 years 10 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
OSDI
2006
ACM
14 years 6 months ago
Making Information Flow Explicit in HiStar
HiStar is a new operating system designed to minimize the amount of code that must be trusted. HiStar provides strict information flow control, which allows users to specify preci...
David Mazières, Eddie Kohler, Nickolai Zeld...
SIAMDM
2010
113views more  SIAMDM 2010»
13 years 16 days ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
WWW
2010
ACM
14 years 23 days ago
Distributing private data in challenged network environments
Developing countries face significant challenges in network access, making even simple network tasks unpleasant. Many standard techniques—caching and predictive prefetching— ...
Azarias Reda, Brian D. Noble, Yidnekachew Haile