83 search results - page 8 / 17 » Fault-Tolerant Routing Algorithms for Hypercube Networks |
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topo...
SIROCCO
2003
13 years 9 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...
ICN
2005
Springer
14 years 1 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ï¬...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Although several analytical models have been proposed in the literature for different interconnection networks with different routing algorithms, there is only one work dealing wi...
MSN
2007
Springer
14 years 1 months ago
2007
Springer
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...