A bidirectional heuristic search technique for web service composition

  • Authors:

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

  • Affiliations:

  • Department of Electronics and Computer Engineering, Indian Institute of Technology Roorkee, India;Department of Electronics and Computer Engineering, Indian Institute of Technology Roorkee, India;Department of Mathematics and Computer Science, University of Perugia, Italy;Department of Electronics and Computer Engineering, Indian Institute of Technology Roorkee, India

  • Venue:
  • ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Automatic web services composition has recently received considerable attention from researchers in different fields. In this paper we propose a model based on web service dependency graph and a bidirectional heuristic search algorithm to find composite web services. The proposed algorithm is based on a new domain independent heuristic. 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 to state-of-the-art search algorithms. The proposed dependency graph based composition model is, however, not limited to traditional web services but it can be extended to more general frameworks of collective systems where a global intelligent behavior emerges by a plurality of agents which interact composing different actions, services, or resources.