Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
- Service Composition
- Composite Service
- Private Constraint
- Distribute Constraint Satisfaction Problem
- Nogood Message
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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)
Bejar, R., Krishnamachari, B., Gomes, C., Selman, B.: Distributed constraint satisfaction in a wireless sensor tracking system. In: Workshop on Distributed Constraints, IJCAI (2001)
Benatallah, B., Casati, F., Traverso, P. (eds.): ICSOC 2005. LNCS, vol. 3826. Springer, Heidelberg (2005)
Dan, A., Davis, D., Kearney, R., Keller, A., King, R., Kuebler, D., Ludwig, H., Polan, M., Spreitzer, M., Youssef, A.: Web services on demand: Wsla-driven automated management. IBM Syst. J. 43(1), 136–158 (2004)
Elfatatry, A., Layzell, P.: Negotiating in service-oriented environments. Commun. ACM 47(8), 103–108 (2004)
Gu, X., Nahrstedt, K., Chang, R., Ward, C.: Qos-assured service composition in managed service overlay networks (2003)
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)
Liu, Y., Ngu, A.H., Zeng, L.Z.: Qos computation and policing in dynamic web service selection. In: Alt, W.W.W. (ed.) WWW Alt. 2004: Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, pp. 66–73. ACM Press, New York (2004)
Mailler, R.: Comparing two approaches to dynamic, distributed constraint satisfaction. In: AAMAS 2005: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, pp. 1049–1056. ACM Press, New York (2005)
NSolver home page (2005), http://www.cs.cityu.edu.hk/hwchun/nsolver/
Ran, S.: A model for web services discovery with qos. SIGecom. Exch. 4(1), 1–10 (2003)
Silaghi, M.C., Faltings, B.: Asynchronous aggregation and consistency in distributed constraint satisfaction. Artificial Intelligence Journal 161, 25–53 (2005)
van der Aalst, W.M.P.: Don’t go with the flow: web services composition standards exposed. IEEE Intelligent Systems 18(1), 72–76 (2003)
van der Aalst, W.M.P., ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.P.: Workflow patterns. Distrib. Parallel Databases 14(1), 5–51 (2003)
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)
Verfaillie, G., Schiex, T.: Solution reuse in dynamic constraint satisfaction problems. In: National Conference on Artificial Intelligence, pp. 307–312 (1994)
Web Service Choreography Interface (WSCI) 1.0 (2005), http://www.w3.org/TR/wsci/
Web Services Choreography Description Language Version 1.0 (2006), http://www.w3.org/TR/2004/WD-ws-cdl-10-20041217/
XPath Adapter for NSolver (2005), http://www.it.swin.edu.au/centres/ciamas/tikiindex.php?page=xpath2nsolver
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, X.T., Kowalczyk, R., Han, J. (2006). Using Dynamic Asynchronous Aggregate Search for Quality Guarantees of Multiple Web Services Compositions. In: Dan, A., Lamersdorf, W. (eds) Service-Oriented Computing – ICSOC 2006. ICSOC 2006. Lecture Notes in Computer Science, vol 4294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11948148_11
Download citation
DOI: https://doi.org/10.1007/11948148_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68147-2
Online ISBN: 978-3-540-68148-9
eBook Packages: Computer ScienceComputer Science (R0)