A Bidirectional Heuristic Search for web service composition with costs

  • Authors:

  • Nilesh Ukey;Rajdeep Niyogi;Kuldip Singh;Alfredo Milani;Valentina Poggioni

  • Affiliations:

  • Department of Electronics and Computer Engineering, Indian Institute of Technology Roorkee, Roorkee 247667, India.;Department of Electronics and Computer Engineering, Indian Institute of Technology Roorkee, Roorkee 247667, India.;Department of Electronics and Computer Engineering, Indian Institute of Technology Roorkee, Roorkee 247667, India.;Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli 1 06100, Perugia, Italy.;Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli 1 06100, Perugia, Italy

  • Venue:
  • International Journal of Web and Grid Services
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.