Reference Hub80
Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm

Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm

Seog-Chan Oh, Dongwon Lee, Soundar R.T. Kumara
Copyright: © 2007 |Volume: 4 |Issue: 1 |Pages: 22
ISSN: 1545-7362|EISSN: 1546-5004|ISSN: 1545-7362|EISBN13: 9781615204540|EISSN: 1546-5004|DOI: 10.4018/jwsr.2007010101
Cite Article Cite Article

MLA

Oh, Seog-Chan, et al. "Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm." IJWSR vol.4, no.1 2007: pp.1-22. http://doi.org/10.4018/jwsr.2007010101

APA

Oh, S., Lee, D., & Kumara, S. R. (2007). Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm. International Journal of Web Services Research (IJWSR), 4(1), 1-22. http://doi.org/10.4018/jwsr.2007010101

Chicago

Oh, Seog-Chan, Dongwon Lee, and Soundar R.T. Kumara. "Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm," International Journal of Web Services Research (IJWSR) 4, no.1: 1-22. http://doi.org/10.4018/jwsr.2007010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

As the emergence of service-oriented architecture provides a major boost for e-commerce agility, the number of available Web services is rapidly increasing. However, when there are a large number of Web services available and no single Web service satisfies the given request, one has to “compose” multiple Web services to fulfill the goal. In this article, toward this problem, we present an AI planning-based Web service composition algorithm named as WSPR. We evaluate the efficiency and effectiveness of WSPR using two publicly available test sets—EEE05 and ICEBE05. In addition, we analyze the two test sets and suggest several improvements to benchmark Web service composition better.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.