Diameter restricted fault tolerant network design

Abstract

Low transmission delay, high fault tolerance and low design cost are the three main properties of any network which are best described by its topology. Transmission delay can be decreased by restricting the diameter of the network. Very few methods in literature have considered the importance of the diameter of the network to decrease the transmission delay. Fault tolerance in the network depends on the number of disjoint paths between a node pair. Designing a k-connected fault tolerant network subject to connectivity and diameter constraint at minimal cost is a NP hard problem. In this paper, an efficient constructive heuristic algorithm is proposed for designing a k-connected network while optimizing the cost of the network subject to the connectivity and diameter constraints. Diameter of resultant network would be of two links regardless of network size to get the speed comparable to complete connected network at low cost. Effectiveness of the proposed approach is also evaluated using different examples. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.