Date Added: Dec 2009
This paper describes a new fault tolerance routing algorithm for Hex-Cell networks. Hex-Cell is an interconnection network topology that employs an efficient routing algorithm and combines attractive features which make it a good candidate to be used for many applications. The Fault Tolerance Routing algorithm for Hex-cell networks (FTRH) presented in this paper focuses on component software failures and guaranteed message delivery from source to destination even with the presence node and link failure. Through the analysis of the algorithm, the paper demonstrates that the proposed routing protocol finds routing paths that are close to optimal in most cases.