Using Dynamic Asynchronous Aggregate Search for Quality Guarantees of Multiple Web Services Compositions
With the increasing impact and popularity of Web service technologies in today’s World Wide Web, composition of Web services has received much interest to support enterprise-to-enterprise application integrations. As for service providers and their partners, the Quality of service (QoS) offered by a composite Web service is important. The QoS guarantee for composite services has been investigated in a number of works. However, those works consider only an individual composition or take the viewpoint of a single provider. In this paper, we focus on the problem of QoS guarantees for multiple inter-related compositions and consider the global viewpoints of all providers engaged in the compositions. The contributions of this paper are two folds. We first formalize the problem of QoS guarantees for multi-compositions and show that it can be modelled as a Distributed Constraint Satisfaction Problem (DisCSP). We also take into account the dynamic nature of the Web service environment of which compositions may be formed or dissolved any time. Secondly, we present a dynamic DisCSP algorithm to solve the problem and discuss our initial experiment to show the feasibility of our approach for multiple Web service compositions with QoS guarantees.
KeywordsService Composition Composite Service Private Constraint Distribute Constraint Satisfaction Problem Nogood Message
Unable to display preview. Download preview PDF.
- 1.Agarwal, V., Dasgupta, K., Karnik, N., Kumar, A., Kundu, A., Mittal, S., Srivastava, B.: A service creation environment based on end to end composition of web services. In: WWW 2005: Proceedings of the 14th international conference on World Wide Web, pp. 128–137. ACM Press, New York (2005)CrossRefGoogle Scholar
- 2.Bejar, R., Krishnamachari, B., Gomes, C., Selman, B.: Distributed constraint satisfaction in a wireless sensor tracking system. In: Workshop on Distributed Constraints, IJCAI (2001)Google Scholar
- 3.Benatallah, B., Casati, F., Traverso, P. (eds.): ICSOC 2005. LNCS, vol. 3826. Springer, Heidelberg (2005)Google Scholar
- 6.Gu, X., Nahrstedt, K., Chang, R., Ward, C.: Qos-assured service composition in managed service overlay networks (2003)Google Scholar
- 7.Jaeger, M.C., Rojec-Goldmann, G., Mühl: QoS aggregation for service composition using workflow patterns. In: Proceedings of the 8th International Enterprise Distributed Object Computing Conference (EDOC 2004), Monterey, California, USA, pp. 149–159. IEEE CS Press, Los Alamitos (2004)CrossRefGoogle Scholar
- 10.NSolver home page (2005), http://www.cs.cityu.edu.hk/hwchun/nsolver/
- 15.Verfaillie, G., Schiex, T.: Dynamic backtracking for dynamic constraint satisfaction problems. In: Proceedings of the ECAI 1994 Workshop on Constraint Satisfaction Issues Raised by Practical Applications, Amsterdam, The Netherlands, pp. 1–8 (1994)Google Scholar
- 16.Verfaillie, G., Schiex, T.: Solution reuse in dynamic constraint satisfaction problems. In: National Conference on Artificial Intelligence, pp. 307–312 (1994)Google Scholar
- 17.Web Service Choreography Interface (WSCI) 1.0 (2005), http://www.w3.org/TR/wsci/
- 18.Web Services Choreography Description Language Version 1.0 (2006), http://www.w3.org/TR/2004/WD-ws-cdl-10-20041217/
- 19.XPath Adapter for NSolver (2005), http://www.it.swin.edu.au/centres/ciamas/tikiindex.php?page=xpath2nsolver
- 20.Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: International Conference on Distributed Computing Systems, pp. 614–621 (1992)Google Scholar