Sciweavers

364 search results - page 53 / 73
» Shortest-path network interdiction
Sort
View
PODC
2006
ACM
14 years 1 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
SIMUTOOLS
2008
13 years 9 months ago
An OMNeT++ model for the evaluation of OBS routing strategies
Optical Burst Switching (OBS) has been proposed as a costeffective paradigm for supporting, with adequate flexibility, the increasingly high transmission capacity required by the ...
A. L. Barradas, M. C. R. Medeiros
NETWORKS
2002
13 years 7 months ago
Superconnected digraphs and graphs with small conditional diameters
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
Camino Balbuena, Josep Fàbrega, Xavier Marc...
EUROMICRO
2007
IEEE
14 years 2 months ago
A Light-Weight Implementation Scheme of the Tree Morphing Protocol for Mobile Multicast Sources
Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer application...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...
ICNP
1998
IEEE
13 years 12 months ago
Statistical Anomaly Detection for Link-State Routing Protocols
The JiNao project at MCNC/NCSU focuses on detecting intrusions, especially insider attacks, against OSPF (Open Shortest Path First) routing protocol. This paper presents the imple...
D. Qu, Brain Vetter, Feiyi Wang, R. Narayan, Shyht...