A Reliable Web Services Selection Method for Concurrent Requests

Guiming Lu, Yan Hai, Yaoyao Sun

Abstract


Current methods of service selection based on quality of service (QoS) usually focus on a single service request at a time, or let the users in a waiting queue wait for Web services when the same functional Web service has more than one requests, and then choose the Web service with the best QoS for the current request according to its own needs. However, there are multiple service requests for the same functional web service at a time in practice and we cannot choose the best service for users every time because of the service’s load. This paper aims at solving the Web Services selection for concurrent requests and developing a global optimal selection method for multiple similar service requesters to optimize the system resources. It proposes the improved social cognitive (ISCO) algorithm which uses genetic algorithm for observational learning and uses deviating degree to evaluate the solution. Furthermore, to enhance the efficiency of ISCO, the elite strategy is used in ISCO algorithm. We evaluate performance of the ISCO algorithm and the selection method through simulations. The simulation results demonstrate that the ISCO is valid for optimization problems with discrete data and more effective than ACO and GA.


Full Text:

PDF


DOI: http://dx.doi.org/10.12928/telkomnika.v12i4.786

Article Metrics

Abstract view : 0 times
PDF - 0 times

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120
Fax: +62 274 564604

View TELKOMNIKA Stats