1768 search results - page 49 / 354 » Optimal routing in Chord |
SIGCOMM
1999
ACM
14 years 3 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
IPPS
1998
IEEE
14 years 3 months ago
1998
IEEE
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
ICC
2011
IEEE
12 years 10 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
CN
2010
13 years 11 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
INFOCOM
2005
IEEE
14 years 4 months ago
2005
IEEE
— In this paper, we model and characterize the performance of multihop radio networks in the presence of energy constraints, and design routing algorithms to optimally utilize th...