Cooperative mixed strategy for service selection in service oriented architecture

In service oriented architecture (SOA), service brokers could find many service providers which offer same function with different quality of service (QoS). Under this condition, users may encounter difficulty to decide how to choose from the candidates to obtain optimal service quality. This paper tackles the service selection problem (SSP) of time-sensitive services using the theory of games creatively. Pure strategies proposed by current studies are proved to be improper to this problem because the decision conflicts among the users result in poor performance. A novel cooperative mixed strategy (CMS) with good computability is developed in this paper to solve such inconstant-sum non-cooperative n-person dynamic game. Unlike related researches, CMS offers users an optimized probability mass function instead of a deterministic decision to select a proper provider from the candidates. Therefore it is able to eliminate the fluctuation of queue length, and raise the overall performance of SOA significantly. Furthermore, the stability and equilibrium of CMS are proved by simulations.

[1]  Raymond A. Paul,et al.  Architecture classification for SOA-based applications , 2006, Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06).

[2]  Tao Yu,et al.  Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints , 2005, ICSOC.

[3]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[4]  Karl Aberer,et al.  QoS-Based Service Selection and Ranking with Trust and Reputation Management , 2005, OTM Conferences.

[5]  Mike P. Papazoglou,et al.  Service-oriented computing: concepts, characteristics and directions , 2003, Proceedings of the Fourth International Conference on Web Information Systems Engineering, 2003. WISE 2003..

[6]  Shensheng Zhang,et al.  A New Methodology of QoS Evaluation and Service Selection for Ubiquitous Computing , 2006, WASA.

[7]  H. Frederic Bohnenblust,et al.  The Theory of Games , 1950 .

[8]  Fangchun Yang,et al.  On Distributed Service Selection for QoS Driven Service Composition , 2006, EC-Web.

[9]  Hwa-Young Jeong,et al.  Best Web Service Selection Based on the Decision Making Between QoS Criteria of Service , 2005, ICESS.

[10]  Julie A. McCann,et al.  Using real-time dependability in adaptive service selection , 2005, Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05).

[11]  Carl M. Harris,et al.  Fundamentals of queueing theory (2nd ed.). , 1985 .

[12]  Ajantha Dahanayake,et al.  Modeling and design of service-oriented architecture , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[13]  Zhong Yi-wen,et al.  A hybrid genetic algorithm with Lamarckian individual learning for tasks scheduling , 2004, SMC.

[14]  Barbara Pernici,et al.  Negotiation Support for Web Service Selection , 2004, TES.

[15]  Athman Bouguettaya,et al.  Efficient access to Web services , 2004, IEEE Internet Computing.

[16]  Heloisa A. Camargo,et al.  Genetic learning of fuzzy rules applied to sequencing problem of FMS , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[17]  Tian Chao,et al.  On demand Web services-based business process composition , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[18]  Yunxiang Liu,et al.  A Dynamic Web Service Selection Strategy with QoS Global Optimization Based on Multi-objective Genetic Algorithm , 2005, GCC.

[19]  Hei-Chia Wang,et al.  Combining subjective and objective QoS factors for personalized web service selection , 2007, Expert Syst. Appl..