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.