Sciweavers

4037 search results - page 213 / 808
» Routing without ordering
Sort
View
NETWORKING
2007
14 years 5 days ago
Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm
Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost a...
Benoit Donnet, Bradley Huffaker, Timur Friedman, K...
MONET
2006
102views more  MONET 2006»
13 years 10 months ago
Locating and Bypassing Holes in Sensor Networks
In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we ...
Qing Fang, Jie Gao, Leonidas J. Guibas
CCR
2005
89views more  CCR 2005»
13 years 10 months ago
Achieving sub-second IGP convergence in large IP networks
We describe and analyse in details the various factors that influence the convergence time of intradomain link state routing protocols. This convergence time reflects the time req...
Pierre François, Clarence Filsfils, John Ev...
SIGMETRICS
2002
ACM
118views Hardware» more  SIGMETRICS 2002»
13 years 10 months ago
Robust traffic engineering: game theoretic perspective
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
Vladimir Marbukh
HCI
2009
13 years 8 months ago
Identifying Proper Scales on Digital Maps for In-Vehicle Navigation Systems
Abstract. Current commercial mobile navigation systems often use a predetermined scale selection schema without considering differences in spatial complexity of locations. To ident...
Anna Wu, Xiaolong Zhang