K-NODE SET RELIABILITY OPTIMIZATION OF A DISTRIBUTED COMPUTING SYSTEM USING PARTICLE SWARM ALGORITHM

A discrete Particle Swarm algorithm is proposed to solve a typical combinatorial optimization problem: K-Node Set Reliability (KNR) optimization of a distributed computing system (DCS) which is a well-known NP-hard problem is presented in this paper. The reliability of a subset of network nodes of a DCS is determined such that the reliability is maximized and specified capacity constraint is satisfied. The proposed algorithm is demonstrated on an 8 node 11 link DCS topology. The test results show that the proposed algorithm can achieve good solution quality and convergence characteristics.