skip to main content
10.1145/1963192.1963229acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
poster

Anytime algorithm for QoS web service composition

Published:28 March 2011Publication History

ABSTRACT

The QoS-aware web service composition (WSC) problem aims at the automatic construction of a composite web service with the optimal accumulated QoS value. It is, however, intractable to solve the QoS-aware WSC problem for large scale instances, since the problem corresponds to a global optimization problem. In this paper, we propose a novel anytime algorithm for the QoS-aware WSC problem to identify composite web services with high quality much earlier than an optimal algorithm and the beam stack search [3].

References

  1. The web service challenge. http://ws-challenge.org/.Google ScholarGoogle Scholar
  2. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, 2nd edition, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. Zhou and E. A. Hansen. Beam-stack search: Integrating backtracking with beam search. In ICAPS, pages 90--98, 2005.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Anytime algorithm for QoS web service composition

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader