Journal of Systems Engineering and Electronics

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

T-QoS-aware based parallel ant colony algorithm for services composition

Lin Zhang1,2,*, Kaili Rao1, and Ruchuan Wang1,3,4   

  1. 1. College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;
    2. Institute of Computer Technology, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;
    3. Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing 210003, China;
    4. Key Lab of Broadband Wireless Communication and Sensor Network Technology, Nangjing University of Posts and Telecommunications, Nangjing 210003, China
  • Online:2015-10-24 Published:2010-01-03

Abstract:

In order to make cloud users get credible, high-quality composition of services, the trust quality of service aware (TQoS-aware) based parallel ant colony algorithm is proposed. Our approach takes the service credibility as the weight of the quality of service, then calculates the trust service quality T-QoS for each service, making the service composition situated in a credible environment. Through the establishment on a per-service T-QoS initialization pheromone matrix, we can reduce the colony’s initial search time. By modifying the pheromone updating rules and introducing two ant colonies to search from different angles in parallel, we can avoid falling into the local optimal solution, and quickly find the optimal combination of global solutions. Experiments show that our approach can combine high-quality services and the improvement of the operational success rate. Also, the convergence rate and the accuracy of optimal combination are improved.