TOPOLOGICAL DESIGN OF COMPUTER NETWORKS
Avneesh Gour, Saurabh Kumar · Journal of Emerging Technologies and Innovative Research · 2015
An important aspect of communication network development has been the reduction in cost and the improvement in speed and quality of transmission link .A topological network design problem is solved by selecting the subset of links while minimizing the total cost subject to k connectivity and diameter constraint. Diameter is set to two links only as we want to design a fast network whose speed would be comparable to the complete connected network (having the diameter of one link) at low cost. A fault tolerant network is able to maintain connectivity under the failure condition only if there are multiple links disjoint paths for each node pair. Designing is a well known optimization problem and difficult to solve. For N number of nodes, maximum numbers of links are n*(n-1)/2, and the maximum number of topological configurations of n nodes are 2n*(n-1).