Heuristic Fault-Tolerant Routing in Mesh using Minimal-Connected-Component Fault Blocks
Document Type
Article
Publication Date
2-1-2004
Abstract
Rectangular fault block model is designated to solve the problem of fault-tolerant route in mesh and was improved as Minimal-Connected-Component (MCC) model. Based on MCC, we construct an overlapping graph and give a set of algorithm according to the graph to work out the route as short as possible to avoid the appearance of fault block when Manhattan route does not exist. The simulated test shows that the route found by the algorithm mentioned above is nearly the shortest one. Hence compared to other methods costing much more time, this new heuristic fault-tolerant algorithm is of no doubt a better method in finding the shortest route.
Montclair State University Digital Commons Citation
Chen, Gui Hai; Du, Peng; Wang, Dajin; and Xie, Li, "Heuristic Fault-Tolerant Routing in Mesh using Minimal-Connected-Component Fault Blocks" (2004). Department of Computer Science Faculty Scholarship and Creative Works. 319.
https://digitalcommons.montclair.edu/compusci-facpubs/319