306 search results - page 19 / 62 » Routing Algorithms for Anycast Messages |
54
Voted
TODAES
2008
14 years 11 months ago
2008
We present an extension of Duato's necessary and sufficient condition a routing function must satisfy in order to be deadlock-free, to support environment constraints inducing...
110
click to vote
ITNG
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput, and simple routing algori...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
106
click to vote
IPPS
1998
IEEE
15 years 4 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...