A new algorithm for QoS-aware composite web services selection
Proceedings - 2010 2nd International Workshop on Intelligent Systems and Applications, ISA 2010（2010）
摘要
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. ©2010 IEEE.
更多查看译文
关键词
composite web service selection,culture algorithm,global qos constraints,max-min ant system,carbon capture and storage,service oriented architecture,service provider,constraint optimization,quality of service,mathematical model,np hard problem,computer architecture,web service,software architecture,web services
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要