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

作　　者：Lin Zhang Kaili Rao Ruchuan Wang 

机构地区：[1]College of Computer, Nanjing University of Posts and Telecommunications [2]Institute of Computer Technology, Nanjing University of Posts and Telecommunications [3]Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks [4]Key Lab of Broadband Wireless Communication and Sensor Network Technology, Nangjing University of Posts and Telecommunications

出　　处：《Journal of Systems Science & Complexity》2015年第5期1100-1106,共7页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(61402241;61170065;61373017;61171053;61103195;61203217;61201163;61202004;61202354);Scientific&Technological Support Project(Industry)of Jiangsu Province(BE2012183;BE2012755);Natural Science Key Fund for Colleges and Universities of Jiangsu Province(11KJA520001;12KJA520002);the Natural Science Fund for Colleges and Universities of Jiangsu Province(13KJB520017);Scientific Research&Industry Promotion Project for Higher Education Institutions(JHB2012-7);the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD)(yx002001)

摘　　要：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.

关 键 词：services composition trust service quality ant colonyalgorithm PARALLEL 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论] TP301.6[自动化与计算机技术—计算机科学与技术]