Fault Tolerance Studies for Wormhole Routing in Multiconnected Double-Loop Networks

Abstract

MCDL networks are generally preferred owing to their grater reliability and less latency in packet transfer. Though routing in these networks can be done through different techniques, the wormhole routing algorithm is generally used because of its’ low buffer requirements. However, wormhole routing does not guarantee deadlock or livelock free routing. Moreover, additional algorithms to deal with faults in the network need to be studied. We propose in this paper a simple fault tolerant algorithm that requires only local fault information and works well for small networks with few faults. A MCDL network has been simulated and the variance in the performance of the algorithm to changes in network configuration and network traffic is studied.