Optimal Design of Single Fault Tolerant Candidate Set for a Communication Network

The cost and reliability of a network are very much affected by its topology. Moreover, the network parameters like path length and link load are also dependent on the topology used for a network. These parameters are vital for any network. Hence constructing a set of topology candidates prior to evaluation is crucial. However, constructing candidate set is a time consuming task and this time is greatly increased as the size of the network grows. Hence, computational time of an algorithm also plays a critical role in selection of the algorithm. In this paper an approach is proposed to construct candidate set for a communication network so that it can survive at least one link failure and the computational time is less than existing algorithms.