Designing of Combinatorial Communication Networks Using Efficient Heuristic Tabu Search Algorithm

Designing a good network is a well-known NP-hard problem that involves in the selection of subset of possible links or network topology in order to minimize the network overhead and cost subdue to reliability constraint we need to design the topological framework for the fixed node network. To overcome this problem, we are using a novel algorithm based on the cloud computing techniques for designing the communication networks, considering both throughput and reliability. The proposed method is known as Tabu search algorithm. For showing the efficiency and results (compared to those obtained results from the conventional approaches)of the combinatorial TSA algorithm, a heuristic approach is applied to test with different topology network systems, i.e., genetic algorithm (GA) and Tabu search algorithm (TSA). In this article we are applying the heuristic Tabu search algorithm to maintain the reliable communication topological network in which we are comparing the performance and throughput of this algorithm with conventional Tabu search method. TSA uses the hill climbing approach for finding the optimal solution for a reliable network Various simulated results are obtained to test the problems with the various constraints. Here we have shown that the proposed approach perform better, scalable and also is superior to the conventional approaches in terms of solution quality and computational time.