5 search results - page 1 / 1 » Fault Free Shortest Path Routing on the de Bruijn Networks |
ICN
2005
Springer
13 years 10 months ago
2005
Springer
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classiï¬...
NETWORKS
2000
13 years 4 months ago
2000
DSN
2004
IEEE
13 years 8 months ago
2004
IEEE
In this paper we present a data dissemination protocol for efficiently distributing data through a sensor network in the face of node and link failures. Our work is motivated by t...
ICS
1994
Tsinghua U.
13 years 9 months ago
1994
Tsinghua U.
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...
NETWORKS
2007
13 years 4 months ago
2007
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...