“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 10999 |
|
||||
| Abstract: | |||||
|
This paper presents a fault tolerant routing algorithmfor the star graph. The algorithm is based on the conceptof unsafety vectors originally proposed for binary n-cubes[Unsafety vectors: a new Fault-Tolerant Routing for the Binary n-cube]. Each node starts by computing a first level unsafetyset, composed of the set of unreachable neighbours. It thenperforms some exchanges with its neighbours todetermine the unsafety nodes. After that all of the nodeshave the addresses of all faulty nodes. Based on theinformation gathered in each node, fault-tolearnt routingbetween a source node and a destination node is raelised.
Download TeX format |
|||||
| back to top | |||||
