A Web Service Composition Algorithm Based on Dependency Graph

  • Zhang Hua
  • Fu Yan
  • Gao Hui
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 113)


Applications based on Web service technology have grown rapidly and it has become more and more necessary to select and composite appropriate services automatically to satisfy the user’s complex requirements. To achieve this composition, the input–output interfaces relations and the concept of domain ontology between them were used to make the process flexible. Our proposed approach is based on abstracting atomic services specification, preprocessing the multiple interfaces of a Web service by combination and constructing a dependency graph including all service interfaces and web services themselves. By using this dependency graph, we perform a new bidirectional heuristic search algorithm from the desired input and output interfaces to find composite web services. Therefore the essence of the algorithm was that the problem of Web services composition was transformed into the research approach of directed graph with an improved bidirectional heuristic search algorithm used to realize the composition of services. Theoretical analysis and experimental results show that this algorithm is more efficient and effective than traditional searching algorithm.


Atomic service Services dependency graph Web services composition OWL-S Heuristic search 


  1. 1.
    Oh SC, Lee DL, Kumara SRT (2007) Web service planner (WSPR) an effective and scalable web service composition algorithm[J]. Int J Web Serv Res 4(1):1–22CrossRefGoogle Scholar
  2. 2.
    Oh SC, Lee DL, Kumara SRT (2008) Effective web service composition in diverse and large-scale service networks. IEEE Trans Serv comput 1(1):15–32CrossRefGoogle Scholar
  3. 3.
    Hu S, Muthusamy V, Li G et al (2008) Distributed automatic service composition in large-scale systems. Proceedings of the second international conference on distributed event-based systems[C]. Rome ACM, pp 233–244Google Scholar
  4. 4.
    Qiqing F, Xiaoming P, Qinghua L, Yahui H (2009) A global QoS optimizing web services selection algorithm based on MOACO for dynamic web service composition. In: 2009 International forum on information technology and applications, pp 37–42Google Scholar
  5. 5.
    Deng S, Wu J, Li Y (2007) Automatic web service composition based on backward tree[J]. J Softw 18(8):1896–1910CrossRefGoogle Scholar
  6. 6.
    Wen J, Chen J, Peng Y (2007) A method of heuristic web services composition based on goal distance estimate[J]. J Softw 18(1):85–93CrossRefGoogle Scholar
  7. 7.
    Li M, Wang D, Du X (2005) Dynamic composition of web services based on domain ontology[J]. Chin J Comput 28(4):644–650Google Scholar
  8. 8.
    Hashemian SV, Mavaddat F (2006) A graph-based framework for composition of stateless web services. In: Proceedings of the European conference on web services, pp 75–86Google Scholar
  9. 9.
    Hashemian SV, Mavaddat F (2005) A graph-based approach to web services composition. In: Proceedings of the symposium on applications and the internet (SAINT), pp 183–189Google Scholar
  10. 10.
    Rao J, Su X (2005) A survey of automated web services composition methods. In: Cardoso J, Sheth AP (eds) SWSWPC 2004. LNCS vol 3387. Springer, Heidelberg, pp 43–54Google Scholar
  11. 11.
    Martin D (2003) Information on

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  1. 1.Deptartment of Computer Science and EngineeringUniversity of Electronic Science and TechnologyChengduChina

Personalised recommendations