Search Swinburne Research Bank
This object has not yet been indexed by the background indexing service.
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/52553
|Download PDF (Published version) (Adobe Acrobat PDF, -1 bytes)|
- Dynamic asynchronous aggregate search for solving QoS compositions of web services
- Nguyen, Xuan Thang; Kowalczyk, Ryszard; Phan, Khoi Anh
- 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.
- Publication type
- Conference paper
- Research centre
- Swinburne University of Technology. Faculty of Information and Communication Technologies
- Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2006 Workshops Proceedings), Hong Kong, China, 18-22 December 2006, pp. 142-145
- Publication year
- Publisher URL
- Copyright © 2006 IEEE. Published version of the paper reproduced here in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.