1768 search results - page 185 / 354 » Optimal routing in Chord |
149
click to vote
SPAA
1994
ACM
15 years 5 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
108
click to vote
CAAN
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
123
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
CN
2006
15 years 1 months ago
2006
In this paper, we present MuSeQoR: a new multi-path routing protocol that tackles the twin issues of reliability (protection against failures of multiple paths) and security, whil...
INFORMS
2008
15 years 1 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...