Performance analysis of distributed adaptive routing algorithm

Distributed adaptive routing, which routes through alternative paths in presence of faulty network components, is an important subject in the research of fault tolerant multicomputer systems. In this paper, we study the performance of routing scheme under the model in which each network node has independent failure probability. We concentrate on two different routing scheme on the mesh-connected multicomputer systems. We develop new techniques that enable us to derive formally proven success probability for these routing schemes, and compare and analyze their performance. The formal study shows that distributed adaptive routing schemes have the clear advantage over centralized adaptive routing schemes, not only for the well-known facts that distributed routing schemes require no global knowledge of network faults and computationally more efficient, but also because the distributed routing schemes have higher success probability and are more robust to node failure probability and to network size.