1768 search results - page 25 / 354 » Optimal routing in Chord |
ISPA
2004
Springer
14 years 3 months ago
2004
Springer
The dynamic changes of the topology caused by the movement of nodes makes routing become one of the key problems in the mobile Ad Hoc Networks (MANET). So how to optimize routing b...
ICOIN
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
GD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Orthogonal connectors are used in a variety of common network diagrams. Most interactive diagram editors provide orthogonal connectors with some form of automatic connect...
ICNP
1998
IEEE
14 years 2 months ago
1998
IEEE
Quality-of-service (QoS) routing satisfiesapplication performance requirements and optimizes network resource usage but effective path-selection schemes require the distribution o...
OPODIS
2008
13 years 11 months ago
2008
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...