DocumentCode
2901508
Title
Fault-tolerant communication with partitioned dimension-order routers with complex faults
Author
Fahmy, Hossam M A ; Ghoneim, Salma A. ; Pacha, Abdou
Author_Institution
Dept. of Comput. & Syst. Eng., Ain Shams Univ., Cairo, Egypt
fYear
2001
fDate
2001
Firstpage
361
Lastpage
366
Abstract
In this paper we propose a routing algorithm to handle complex faults in multicomputer networks with dimension-order routers. Simple changes to router structure and routing logic are proposed. Our technique can be applied to current implementations in which a router is partitioned into multiple modules. While assuming local knowledge of faults, the new technique can handle complex faults effectively irrespective of their shape. By simulation we have applied it to a torus network and have shown that its performance in terms of bisection utilization and message latency is challenging. The obtained results show that the new technique performs with acceptable bisection utilization, and high adaptability to faults. Several case studies considered fault shapes such as L-shape, +-shape, and N-shape
Keywords
computer network reliability; fault tolerance; telecommunication network routing; L-shape faults; N-shape faults; bisection utilization; complex faults; fault-tolerant communication; message latency; multicomputer networks; partitioned dimension-order router; plus-shape faults; router structure; routing algorithm; routing logic; torus network; Adaptive algorithm; Delay; Fault detection; Fault tolerance; Fault tolerant systems; Logic; Routing; Shape; System recovery; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Networking, 2001. Proceedings. 15th International Conference on
Conference_Location
Beppu City, Oita
Print_ISBN
0-7695-0951-7
Type
conf
DOI
10.1109/ICOIN.2001.905452
Filename
905452
Link To Document