Trusted Web Service Discovery Based on a Swarm Intelligence Algorithm

The number of services on the internet has experienced explosive growth, and the rapid and accurate discovery of required services among a vast array of similarly functioning services with differing degrees of quality has become a critical and challenging aspect of service computing. In this paper, we propose a trusted service discovery algorithm based on an ant colony system (TSDA-ACS). The algorithm integrates a credibility-based trust model with the ant colony search algorithm to facilitate the discovery of trusted web services. During the evaluation process, the trust model employs a pseudo-stochastic proportion to select nodes, where nodes with higher reputation have a greater probability of being chosen. The ant colony uses a voting method to calculate the credibility of service nodes, factoring in both credibility and non-credibility from the query node’s perspective. The algorithm employs an information acquisition strategy, a trust information merging strategy, a routing strategy, and a random wave strategy to guide ant search. To evaluate the effectiveness of the TSDA-ACS, this paper introduces the random walk search algorithm (RW), the classic max–min ant colony algorithm (MMAS), and a trustworthy service discovery based on a modified ant colony algorithm (TSDMACS) for comparison with the TSDA-ACS algorithm. The experiments demonstrate that this method can achieve the discovery of trusted web services with high recall and precision rates. Finally, the efficacy of the proposed algorithm is validated through comparison experiments across various network environments.