12 search results - page 1 / 3 » Shortest path routing and fault-tolerant routing on de Bruij... |
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 5 months ago
2000
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
DSN
2004
IEEE
13 years 9 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...
SIROCCO
2003
13 years 6 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...