306 search results - page 9 / 62 » Routing Algorithms for Anycast Messages |
ISPAN
2000
IEEE
15 years 4 months ago
2000
IEEE
We present an adaptive fault-tolerant wormhole routing algorithm for 2D meshes. The main feature is that with the algorithm, a normal routing message, when blocked by some faulty ...
CIIT
2004
15 years 1 months ago
2004
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
106
click to vote
SAPIR
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...