Sciweavers

1432 search results - page 242 / 287
» Hardness of robust network design
Sort
View
IWCMC
2010
ACM
15 years 11 months ago
Only the short die old: route optimization in MANETs by dynamic subconnection shrinking
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha
DSN
2002
IEEE
15 years 11 months ago
Reducing the Cost of Group Communication with Semantic View Synchrony
View Synchrony (VS) is a powerful abstraction in the design and implementation of dependable distributed systems. By ensuring that processes deliver the same set of messages in ea...
José Orlando Pereira, Luís Rodrigues...
IMC
2007
ACM
15 years 7 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
CMS
2006
15 years 7 months ago
TAO: Protecting Against Hitlist Worms Using Transparent Address Obfuscation
Abstract. Sophisticated worms that use precomputed hitlists of vulnerable targets are especially hard to contain, since they are harder to detect, and spread at rates where even au...
Spyros Antonatos, Kostas G. Anagnostakis
GIS
2008
ACM
15 years 7 months ago
Automatic extraction of road intersection position, connectivity, and orientations from raster maps
The road network is one of the most important types of information on raster maps. In particular, the set of road intersection templates, which consists of the road intersection p...
Yao-Yi Chiang, Craig A. Knoblock