QOS-AWARE WEB SERVICE SELECTION ALGORITHMS BASED ON SMALL-WORLDS NETWORK

作     者：Xiaoming XU,Nan JIANG,Qiuling DING College of Information Science and Technology, Nanjing University of Aeronautice and Astronautiec,Nanjing,210016,China 

会议名称：《第八届分布式计算及其应用国际学术研讨会》

会议日期：1000年

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

关 键 词：Web Service Selection QoS-aware Small-world Network Ant Colony Algorithm 

摘      要：In this paper,a theory based on the small world of a QoS-aware Web Service Selection Algorithm was proposed. This algorithm use small-world network theory and ant colony algorithm,not only provide better optimization path rapidly, but also optimize load balancing on the service *** solves the shortcoming that only considering the choice of the optimal path the common algorithm,losing sight of making the optimal path becoming the hottest path because of the frequent choice of the optimal path,on the contrary,that making optimal path turn into the bottleneck of the system’s. Simulation and experiment showed that the algorithm has efficient services selection performance.