Name
Abstract | ||
|---|---|---|
For hypercube networks which have faulty nodes, a few efficient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two improved versions of the algorithm of Chiu and Wu by using the notion of full reachability. A fully reachable node means that the node can reach all nonfaulty nodes which have Hamming distance h from the node via a path of length h. The simulation shows that the algorithms give sufficient effect when they are applied to low-dimensional hypercubes. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/IPPS.1999.760464 | IPPS/SPDP |
Keywords | Field | DocType |
full reachability,length h,hypercube network,hypercube networks,nonfaulty node,fault-tolerant routing algorithms,efficient dynamic routing algorithm,faulty node,simulation shows,improved version,distance h,reachable node,hypercubes,fault tolerance,routing,dynamic routing,hamming distance | Computer science,Parallel computing,Computer network,Reachability,Fault tolerance,Hamming distance,Adaptive routing,Hypercube,Routing algorithm | Conference |
ISSN | ISBN | Citations |
1063-7133 | 0-7695-0143-5 | 1 |
PageRank | References | Authors |
0.35 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Keiichi Kaneko | 1 | 189 | 39.19 |
| Hideo Ito | 2 | 22 | 7.95 |