A Bidirectional Heuristic Search for web service composition with costs
by Nilesh Ukey, Rajdeep Niyogi, Kuldip Singh, Alfredo Milani, Valentina Poggioni
International Journal of Web and Grid Services (IJWGS), Vol. 6, No. 2, 2010

Abstract: This paper presents a model for web service composition based on navigating the web service dependency graph by bidirectional heuristic algorithm. The algorithm is based on a new domain-independent heuristic, while a cost optimisation strategy that balances optimality and convergence performance is also proposed. Experiments on different types of dependency graphs of varying sizes and number of web services show promising results for the service composition model when compared with state-of-the-art search algorithms. The proposed dependency-graph-based composition model can be extended to more general frameworks such as collective systems and virtual environments where a plurality of agents interact composing different actions, services, or resources.

Online publication date: Wed, 30-Jun-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com