Sciweavers

763 search results - page 114 / 153
» Engineering Shortest Path Algorithms
Sort
View
INFOCOM
2003
IEEE
14 years 2 months ago
Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...
Frédéric Giroire, Antonio Nucci, Nin...
KI
2001
Springer
14 years 2 months ago
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
Stefan Edelkamp, Ulrich Meyer
ICNP
1998
IEEE
14 years 1 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...
SDM
2008
SIAM
129views Data Mining» more  SDM 2008»
13 years 11 months ago
Statistical Density Prediction in Traffic Networks
Recently, modern tracking methods started to allow capturing the position of massive numbers of moving objects. Given this information, it is possible to analyze and predict the t...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
WSC
2004
13 years 11 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol