Reliability analysis and optimization of computer communication network based on genetic algorithm

Abstract

Summary In this paper, the design of reliable communication network is solved by genetic algorithm. In order to solve this problem, we must first provide the lowest acceptable network reliability. There are many methods to satisfy the network reliability constraints. The penalty function may produce an invalid solution, so it is not suitable to solve the problem. In order to overcome these difficulties, this paper proposes a heuristic repair method, which is based on the number of spanning trees in the graph. Compared with the heuristic maintenance method with lower cost, this method can generate a better solution with less computation. When the population size is 25, the hybridization rate is 0.96, and the mutation rate is 0.07, the best results can be obtained. This paper analyzes the node fault, grasps the influence rule of the fault on the network, and improves the network reliability. This paper summarizes and classifies the failure modes of communication network nodes. Combined with the classic BA network model in the complex network theory, through the simulation design of MATLAB and OPNET, the influence of node function failure and performance failure on network reliability is studied.

Computation of Connected Safe Set of Cycle-Related Networks and Applications

“…The reliability of a network is its ability to remain operational in the presence of faults. The process of efficient design of the such network is referred to as network topology optimization [20]. Its application can be seen in several fields such as in wireless sensor networks [15], computer networks [7], and so forth.…”