A GRAPH-BASED APPROACH FOR WEB SERVICES COMPOSITION

Salima Benbernou, Djamal Benslimane, Mohand Said Hacid, Hamamache Kheddouci, Kamel Tari

Abstract

The automatic web services composition plays an important role in the area of semantic web services. In fact, in a real life it is not usual to discover atomic web services matching with the user’s query. So composing services fulfilling the query is needed. This paper discusses the web services composition model based on an oriented graph. It is based on Bcov algorithm (Benatallah.B et al., 2005a), initially defined for web services discovery and considered as the best cover problem, which it was mapped as the problem of computing the minimal transversals with minimum cost of a weighted hypergraph. We propose two algorithms handling the oriented graph reasoning for web service composition. At first glance, a basic composition version for Bcov algorithm is given. The algorithm composes services over the induced subgraphs of each transversal provided by Becov algorithm, and gives a covering ratio satisfying the query. The second algorithm used a composed services graph maintained by a web services provider. The composition in that case is based on Dijkstra algorithm, where for each two consecutive services in the best minimal transversal provided by Bcov algorithm, a shortest path is computed regarding the composed services graph.

References

  1. Benatallah.B, Hacid.M.S, Leger.A, Rey.C, and Toumani.F (2005a). On automating web services discovery. VLDB Journal, 14(1):84-96.
  2. Benatallah.B, Hacid.M.S, Paik.H, Rey.C, and Toumani.F (2005b). Towards semantic -driven, flexible and scalable framework for peering and querying e-catalog communities. Information Systems International Journal.
  3. Benbernou.S, Canaud, and Pimont.S (2004a). A semantic web services discovery regarded as constraint satisfaction problem. In 6th Flexible Query Answering Systems FQAS'04.
  4. Benbernou.S, Canaud.E, Hacid.M.S, and Toumani.F (2004b). Resolution and constraint propagation for semantic web services discovery. In RIDE, pages 23-30.
  5. Berardi.D (2004). Automatic composition of finite state eservices. Technical report, American Association for Artificial Intelligence (AAAI).
  6. Berardi.D, Calvanese.D, Giacomo.G, D., Lenzerini.M, and Mecella.M (2003a). Automatic composition of eBerardi.D, Calvanese.D, Giacomo.G, D., Lenzerini.M, and Mecella.M (2003b). A foundational vision of eservices. In WES, pages 28-40.
  7. Bordeaux.L, Salaün.G, Berardi.D, and Mecella.M (2004). When are two web services compatible? In TES, pages 15-28.
  8. Bultan, T., Fu, X., Hull, R., and Su, J. (2003). Conversation specification: a new approach to design and analysis of e-service composition. In WWW, pages 403-410.
  9. Doshi.P and Zhao.H (2006). A hierarchical framework for composing nested web processes. In 4th International Conference on Service Oriented Computing ICSOC'06.
  10. E.J.Dijkstra (1959). A note on two problems in connection with graphs. Numerische Math, 1:269-171.
  11. Hamadi, R. and Benatallah, B. (2003). A petri net-based model for web service composition. In ADC, pages 191-200.
  12. Hull, R. (2003). E-service composition: Models and formalisms. In Description Logics.
  13. Hull, R., Benedikt, M., Christophides, V., and Su, J. (2003). E-services: a look behind the curtain. In PODS, pages 1-14.
  14. John E. Hopcroft, R. Motwani and Jeffrey D. Ullman (2001.). Introduction to automata theory, languages, and computation. Addison-Wesley.
  15. McIlraith, S. A. and Son, T. C. (2002). Adapting golog for composition of semantic web services. In KR, pages 482-496.
  16. Medjahed, B., Bouguettaya, A., and Elmagarmid, A. K. (2003). Composing web services on the semantic web. VLDB J., 12(4):333-351.
  17. Merz, S. (2000). Model checking: A tutorial overview. In MOVEP, pages 3-38.
  18. Narayanan, S. and McIlraith, S. A. (2002). Simulation, verification and automated composition of web services. In WWW, pages 77-88.
  19. R. Reiter (2002.). Knowledge in Action. The MIT Press.
  20. Rao, J. and Su, X. (2004). A survey of automated web service composition methods. In SWSWPC, pages 43-54.
  21. S.Skiena (1990). ”dijkstra's algorithm.” 6.1.1. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, pages 225-227.
  22. Stuart J. Russell and P. Norvig (2003.). Artificial intelligence : a modern approach. Prentice Hall.
  23. Sycara.K, Paolucci.M, Ankolekar.A, and Srinivasan.N (2003). Automated discovery, interaction and composition of semantic web services. Journal of Web Semantics, 1(1):27-46.
  24. Tan.M, Nguyen.X, and Kowalczyk (2006). Modelling and solving qos composition problem using fuzzy discsp. In 2006 IEEE International Conference on Web Services ICWS 2006.
  25. Yuan.Y, Li.Z, and Sun.W (2006). Graph search based approach for BPEL4WS Test Generation. In IEEE International Conference on Software Engineering Advances ICSEA'06.
Download


Paper Citation


in Harvard Style

Benbernou S., Benslimane D., Said Hacid M., Kheddouci H. and Tari K. (2007). A GRAPH-BASED APPROACH FOR WEB SERVICES COMPOSITION . In Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-972-8865-77-1, pages 290-296. DOI: 10.5220/0001289102900296


in Bibtex Style

@conference{webist07,
author={Salima Benbernou and Djamal Benslimane and Mohand Said Hacid and Hamamache Kheddouci and Kamel Tari},
title={A GRAPH-BASED APPROACH FOR WEB SERVICES COMPOSITION},
booktitle={Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2007},
pages={290-296},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001289102900296},
isbn={978-972-8865-77-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - A GRAPH-BASED APPROACH FOR WEB SERVICES COMPOSITION
SN - 978-972-8865-77-1
AU - Benbernou S.
AU - Benslimane D.
AU - Said Hacid M.
AU - Kheddouci H.
AU - Tari K.
PY - 2007
SP - 290
EP - 296
DO - 10.5220/0001289102900296