A Novel Method for Optimizing Multi-User Service Selection
Hua Jin, Hua Zou, Fangchun Yang, Rongheng Lin, Tianping Shuai · Journal of Convergence Information Technology · 2012
Web service selection technology based on quality of service (QoS) has been a research focus for a while. Current researchers are trying to find a service selection solution for single user to get the optimal QoS utility value. However, there is a condition in which multiple users may raise their requests with same functional requirements. These requests will cause a heavy load on service nodes that can provide better QoS. In addition, service composite solutions for users are various because each user’s personal preferences are different. From the perspective of network, network operator wishes to increase the QoS utility of overall network, instead of just satisfying few people’s needs. Because traditional single user service selection is weak on solving above problem, this paper proposes a novel method based on Ant Colony System and KM algorithm (ACK) to meet all above requirements. This method first decomposes the global QoS constrains global C into local constrains local c of each service class. Secondly, each local c is taken as a global constraint for users and further decomposed in user dimension. After above two steps, a global selection problem is transformed into a local selection problem .Finally the overall optimal service solution for users will be found out based on decomposed constraints. Experimental results show that our method outperforms traditional solutions in terms of computation time while achieving close-to-optimal results. Results demonstrate that our method is particularly suitable for situation of large-scale users and services selection.