Sciweavers

25 search results - page 3 / 5
» Virtual Private Networks Coping with Complexity
Sort
View
GLOBECOM
2009
IEEE
15 years 4 months ago
A Distributed Constraint Satisfaction Problem for Virtual Device Composition in Mobile Ad Hoc Networks
— The dynamic composition of systems of networked appliances, or virtual devices, enables users to generate complex strong specific systems. Current prominent MANET-based composi...
Eric Karmouch, Amiya Nayak
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
15 years 4 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
CCGRID
2004
IEEE
15 years 1 months ago
Distributed virtual computers (DVC): simplifying the development of high performance Grid applications
Distributed Virtual Computer (DVC) is a computing environment which simplifies the development and execution of distributed applications on computational grids. DVC provides a sim...
Nut Taesombut, Andrew A. Chien
ICALP
2010
Springer
15 years 2 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ß
ADT
2011
14 years 1 months ago
Virtual networks: isolation, performance, and trends
Currently, there is a strong effort of the research community in rethinking the Internet architecture to cope with its current limitations and support new requirements. Many resea...
Natalia Castro Fernandes, Marcelo D. D. Moreira, I...