154 search results - page 6 / 31 » Routing with Confidence: Supporting Discretionary Routing Re... |
STOC
2004
ACM
14 years 1 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
NCA
2005
IEEE
14 years 1 months ago
2005
IEEE
Context-aware applications rely on the ability to perceive the state of the surrounding environment. In this paper, we address a class of such applications where real-time guarant...
CNSR
2008
IEEE
13 years 9 months ago
2008
IEEE
The communication performance in wireless networks is often heavily influenced by failures caused by node mobility and radio disturbance. Proactive linkstate routing protocols lik...
ICOIN
2001
Springer
14 years 11 days ago
2001
Springer
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
PADS
2005
ACM
14 years 1 months ago
2005
ACM
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...