DYNAMIC ROUTING SYSTEM A FAULT TOLERANT APPROACH IN NETWORK ROUTING

Abstract

With the current trend in distributed computing, large supercomputers are becoming scarce, and are being replaced by smaller computers coupled together by networks to achieve the same objective at substantially lower cost. This replacement heavily relies on the network. This dissertation discusses, a network routing algorithm, which provides fault tolerance, to relatively smaller networks by proactively monitoring network communication links between servers. Link status verification occurs every X seconds, where X is a configurable setting, and affects the speed, an error is detected and also the network overhead incurred. Simulation model, of the network, implementing the "DYANMIC ROUTING SYSTEM" has been developed. Simulation results show that Dynamic Routing System can monitor the network in significantly less time, and discover the reachability to any server in the network, even before the application performance is affected. The Software has been written in C Language and runs successfully under the UNIX environment.