Advertisement

A Bidirectional Heuristic Search Technique for Web Service Composition

  • Nilesh Ukey
  • Rajdeep Niyogi
  • Alfredo Milani
  • Kuldip Singh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6019)

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.

Keywords

Web service composition dependency graph heuristic search algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dustdar, S., Schreiner, W.: A survey on web services composition. Int. Journal on Web and Grid Services 1(1), 1–30 (2005)CrossRefGoogle Scholar
  2. 2.
    Rao, J., Su, X.: A survey of automated web services composition methods. In: Cardoso, J., Sheth, A.P. (eds.) SWSWPC 2004. LNCS, vol. 3387, pp. 43–54. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Milani, A., Rossi, F., Pallottelli, S.: Planning Based Integration of Web Services. In: Proceedings of the IEEE/WIC/ACM Int. Conf. on Web intelligence and Intelligent Agent Technology, Washington, DC, pp. 125–128 (2006)Google Scholar
  4. 4.
    Hashemian, S.V., Mavaddat, F.: A Graph-Based Framework for Composition of Stateless Web Services. In: Proceedings of the European Conference on Web Services, pp. 75–86 (2006)Google Scholar
  5. 5.
    Hashemian, S.V., Mavaddat, F.: A graph-based approach to web services composition. In: Proceedings of the 2005 Symposium on Applications and the Internet (SAINT), pp. 183–189 (2005)Google Scholar
  6. 6.
    Ashish, N., Knoblock, C.A.: Wrapper generation for semi-structured Internet sources. SIGMOD Record 26(2), 8–15 (1997)CrossRefGoogle Scholar
  7. 7.
    Champeaux, D., Sint, L.: An improved bidirectional heuristic search algorithm. JACM 24(2), 177–191 (1977)zbMATHCrossRefGoogle Scholar
  8. 8.
    Ponnekanti, S.R., Fox, A.: SWORD: A developer toolkit for web service composition. In: Proceedings of 11th world wide web conference, USA (2002)Google Scholar
  9. 9.
    Wu, D., Sirin, E., Hendler, J., Nau, D., Parsia, B.: Automatic web services composition using SHOP2. In: Workshop on Planning for Web Services, Italy (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Nilesh Ukey
    • 1
  • Rajdeep Niyogi
    • 1
  • Alfredo Milani
    • 2
  • Kuldip Singh
    • 1
  1. 1.Department of Electronics and Computer EngineeringIndian Institute of Technology RoorkeeIndia
  2. 2.Department of Mathematics and Computer ScienceUniversity of PerugiaItaly

Personalised recommendations