Invited paper in Proceedings of the IEEE International Symposium on Service-Oriented System Engineering
(SOSE '08), IEEE Computer Society Press, Los Alamitos, CA, pp. 166-171 (2008)

Toward Scalable Statistical Service Selection 1

Lijun Mei 2 , W.K. Chan 3 , and T.H. Tse 2

[paper from IEEE Xplore | paper from IEEE digital library | technical report TR-2008-17]


Selecting quality services over the Internet is tedious because it requires looking up of potential services, and yet the qualities of these services may evolve with time. Existing techniques have not studied the contextual effect of service composition with a view to selecting better member services to lower such overhead. In this paper, we propose a new dynamic service selection technique based on perceived successful invocations of individual services. We associate every service with an average perceived failure rate, and select a service into a candidate pool for a service consumer inversely proportional to such averages. The service consumer further selects a service from the candidate pool according to the relative chances of perceived successful counts based on its local invocation history. A member service will also receive the perception of failed or successful invocations to maintain its perceived failure rate. The experimental results show that our proposal significantly outperforms (in terms of service failure rates) a technique which only uses consumer-side information for service selection.

1. This research is supported in part by the General Research Fund of the Research Grant Council of Hong Kong (project nos. 111107, 717308, and 717506).
2. Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong.
3. (Corresponding author.)
Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Hong Kong.


  Cumulative visitor count