A New Algorithm for QoS-Aware Composite Web Services Selection

Author

Liu, Zhi-Zhong ; Wang, Zhi-jian ; Zhou, Xiao-Feng ; Lou, Yuan-sheng ; Shang, Ling

Author_Institution

Coll. of Comput. & Inf. Eng., Hohai Univ., Nanjing, China

fYear

2010

fDate

22-23 May 2010

Firstpage

1

Lastpage

4

Abstract

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.

Keywords

Web services; optimisation; quality of service; software architecture; C-MMAS; NP-Hard problem; QoS constraints; Web services selection; culture algorithm; max-min ant system; optimization algorithm; quality of service; service oriented architecture; Carbon capture and storage; Computer architecture; Constraint optimization; Educational institutions; Electronic mail; Mathematical model; NP-hard problem; Quality of service; Service oriented architecture; Web services;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Systems and Applications (ISA), 2010 2nd International Workshop on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-5872-1

Electronic_ISBN

978-1-4244-5874-5

Type

conf

DOI

10.1109/IWISA.2010.5473293

Filename

5473293