ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Information Sciences
Volume 178, Issue 2, 15 January 2008, Pages 317-339
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1299 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.ins.2007.08.021    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier Inc. All rights reserved.

Efficient execution of composite Web services exchanging intensional data

Chang-Sup Parka, Corresponding Author Contact Information, E-mail The Corresponding Author and Soyeon Parkb, E-mail The Corresponding Author

aDepartment of Internet Information Engineering, The University of Suwon, San 2-2 Wau-ri, Bongdam-eup, Hwaseong-si, Gyeonggi-do 445-743, Republic of Korea bDepartment of Computer Science, University of Illinois at Urbana-Champaign, 4222 Siebel Center, 201 N.Goodwin Avenue, Urbana, IL 61801, USA

Received 20 September 2006; 
revised 20 August 2007; 
accepted 24 August 2007. 
Available online 6 September 2007.

Purchase the full-text article



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
3.1. Invocation plan using intensional results
3.2. Invocation plan using intensional parameters
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



















Information Sciences
Volume 178, Issue 2, 15 January 2008, Pages 317-339
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.