Sciweavers

364 search results - page 20 / 73
» Shortest-path network interdiction
Sort
View
LCN
2006
IEEE
14 years 1 months ago
An Interior Path Vector Routing Protocol
Today’s intra-domain protocols are limited in their scalability. We examine these limitations and propose an alternative in the form of an IGP based on path vectors. Taking adva...
Conor Creagh, Cormac J. Sreenan
CORR
2011
Springer
536views Education» more  CORR 2011»
13 years 2 months ago
Performance Analysis of AODV under Black Hole Attack through Use of OPNET Simulator
— Mobile ad hoc networks (MANETs) are dynamic wireless networks without any infrastructure. These networks are weak against many types of attacks. One of these attacks is the bla...
H. A. Esmaili, M. R. Khalili Shoja, Hossein Gharae...
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
14 years 1 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
NETWORKS
2002
13 years 7 months ago
Shortest-path network interdiction
Eitan Israeli, R. Kevin Wood
INFOCOM
2011
IEEE
12 years 11 months ago
Analysis and algorithms for partial protection in mesh networks
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...
Greg Kuperman, Eytan Modiano, Aradhana Narula-Tam