Dynamic Asynchronous Aggregate Search for Solving QoS Compositions of Web Services

Authors:
Xuan Thang Nguyen;Ryszard Kowalczyk;Khoi Anh Phan
Affiliations:
Swinburne University of Technology, Australia;Swinburne University of Technology, Australia;Swinburne University of Technology, Australia
Venue:
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
Year:
2006

Citing 6
Cited 0

Solution reuse in dynamic constraint satisfaction problems

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Asynchronous Search with Aggregations

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Intelligent Domain Splitting for CSPs with Ordered Domains

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
QoS computation and policing in dynamic web service selection

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
QoS Aggregation for Web Service Composition using Workflow Patterns

EDOC '04 Proceedings of the Enterprise Distributed Object Computing Conference, Eighth IEEE International
Asynchronous aggregation and consistency in distributed constraint satisfaction

Artificial Intelligence - Special issue: Distributed constraint satisfaction

Quantified Score

Hi-index	0.00

Visualization

Abstract

There has been recently an increase of interests in Distributed Constraint Satisfaction (DisCSP) algorithms. Most of these algorithms assume that the set of variables and constraints in a DisCSP are completely known and fixed. However, these assumptions do not hold in many open environments where unexpected events and changes can happen. Therefore this issue needs to be addressed in order for a DisCSP algorithm to be practically used in real life applications. Our contribution in this paper is two-fold. Firstly, we present an extended version of the Asynchronous Aggregate Search (AAS), called the Dynamic Asynchronous Aggregate Search (DynAAS) - as a new algorithm for dynamic and uncertain environments. Secondly, we investigate the applicability of DynAAS in the Web service domain and argue that DynAAS is suitable for solving the QoS compositions of Web services. We also carry out the experiments to show the efficiency of our proposed algorithm in solving the QoS composition problem.