Sciweavers

272 search results - page 24 / 55
» Predictable Routing
Sort
View
NCA
2007
IEEE
15 years 4 months ago
On the Evaluation of Shortest Journeys in Dynamic Networks
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
Afonso Ferreira, Alfredo Goldman, Julian Monteiro
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
14 years 11 months ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling
FPGA
2011
ACM
321views FPGA» more  FPGA 2011»
14 years 1 months ago
An analytical model relating FPGA architecture parameters to routability
We present an analytical model relating FPGA architectural parameters to the routability of the FPGA. The inputs to the model include the channel width and connection and switch b...
Joydip Das, Steven J. E. Wilton
ECBS
2008
IEEE
86views Hardware» more  ECBS 2008»
15 years 4 months ago
A Formal Model for Network-Wide Security Analysis
Network designers perform challenging tasks with so many configuration options that it is often hard or even impossible for a human to predict all potentially dangerous situation...
Petr Matousek, Jaroslav Ráb, Ondrej Rysavy,...
IJNSEC
2008
127views more  IJNSEC 2008»
14 years 9 months ago
Inter-domain Routing Stability Dynamics During Infrastructure Stress Events: The Internet Worm Menace
The Internet is crucial to business, government, education and many other facets of society and its continuing scalability places serious challenges on the routing system's c...
Francesco Palmieri