A New Algorithm for QoS-Aware Composite Web Services Selection

Service Oriented Architecture enable a multitude of service providers to provide loosely, coupled and interoperable services at different Quality of Service (QoS), As more and more Web services become available, QoS is becoming a decisive factor to distinguishing composite Web services. Composite Web service selection with global QoS constraints is clearly a NP-Hard problem, in this paper, a new optimization algorithm called C-MMAS is proposed by integrating Max-Min Ant System into Culture algorithm framework, and is used to solve the problem of composite Web services selection. Theoretical analysis and experimental results indicate the feasibility and efficiency of this algorithm.

[1]  Jianwen Su,et al.  E-services: a look behind the curtain , 2003, PODS.

[2]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[3]  Tao Yu,et al.  Efficient algorithms for Web services selection with end-to-end QoS constraints , 2007, TWEB.

[4]  Tao Yu,et al.  Service Selection Algorithms for Web Services with End-to-End QoS Constraints , 2004, CEC.

[5]  Stephen J. H. Yang,et al.  An optimal QoS-based Web service selection scheme , 2009, Inf. Sci..

[6]  Amit P. Sheth,et al.  Modeling Quality of Service for Workflows and Web Service Processes , 2002 .

[7]  R. Reynolds.  AN INTRODUCTION TO CULTURAL ALGORITHMS , 2008 .

[8]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  市村 匠,et al.  Max-Min Ant System による 2次割り当て問題の実験 , 2011 .

[11]  Thomi Pilioura,et al.  An Overview of Standards and Related Technology in Web Services , 2002, Distributed and Parallel Databases.

[12]  Gero Mühl,et al.  QoS aggregation for Web service composition using workflow patterns , 2004 .

[13]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[14]  Jing Ning,et al.  A Dynamic Web Services Selection Algorithm with QoS Global Optimal in Web Services Composition , 2007 .