Copyright © 2007 Elsevier Inc. All rights reserved.
Efficient execution of composite Web services exchanging intensional data
Received 20 September 2006;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Web service technologies provide a standard means of integrating heterogeneous applications distributed over the Internet. Successive compositions of new Web services using pre-existing ones usually create a hierarchical structure of invocations among a large number of Web services. For the efficient execution of these composite Web services, we propose an approach which exploits intensional XML data, i.e. an XML document that contains special elements representing the calls to Web services, in order to delegate the invocations of the external Web services to some relevant nodes. We formalize an invocation plan for composite Web services in which intensional data is used as their parameters and results, and define a cost-based optimization problem to obtain an efficient invocation plan for them. We provide an A* heuristic search algorithm to find an optimal invocation plan for a given set of Web services and also present a greedy method of generating an efficient solution in a short time. The experimental results show that the proposed greedy method can find a close-to-optimal solution efficiently and has good scalability for a complex call hierarchy of Web services.
Keywords: Web service; Invocation plan; Intensional data; XML; Optimization
Article Outline
- 1. Introduction
- 2. Background and related work
- 3. Invocation plan for Web services using intensional data
- 4. Optimizing invocation plans
- 4.1. Cost model
- 4.2. Exhaustive search
- 4.3. A* search algorithm
- 4.4. Greedy algorithm
- 5. Performance evaluation
- 5.1. Quality of solution
- 5.2. Performance modeling
- 5.3. Execution time
- 6. Conclusion
- References






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)






