A DESTINATION TAG ROUTING SCHEME TO REDUCE HOT SPOT AND SWITCH FAULT EFFECTS IN CGI NETWORKS

Abstract

The , -presence of hot spots / faulty. switches in. the Multistage Interconnection Network can affect the system'performance. The Cyclic Gamma Interconnection Network .(CGIN) ' with connecting -pattern between stages exhibiting a cyclic feature is able -to tolerate any arbitrary single fault. However to make routing. and rerouting- efficient a two bit state based destination tag scheme is applied, efficiently using the cyclic nature of CGIN. The rerouting is done using two methods viz. Dynamic Rerouting and Dynamic Rerouting. with Backtrack Algorithm. A look ahead mechanism called Backtrack algorithm is used to evade blockages due to switch failure or control function failure. It computes a blockage free path for rerouting the packet. Extensive simulation has been conductedto -evaluate the performance of the Backtrack algorithm and the Dynamic Rerouting method under varying input loads and varying switch faults / hot spots in the network._ Results show that the Dynamic -Rerouting with Backtrack Algorithm is more -effective under all input and network conditions