loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Salima Benbernou 1 ; Djamal Benslimane 1 ; Mohand Said Hacid 1 ; Hamamache Kheddouci 2 and Kamel Tari 3

Affiliations: 1 Claude Bernard Lyon 1 University, France ; 2 LIESP, Claude Bernard Lyon 1 University, France ; 3 Bejaia University, Algeria

ISBN: 978-972-8865-77-1

Keyword(s): Oriented graph, semantic web services, web services composition, web services discovery.

Related Ontology Subjects/Areas/Topics: Internet Technology ; Web Information Systems and Technologies ; Web Services and Web Engineering

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. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.214.224.224

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

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

@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 2: WEBIST,},
year={2007},
pages={290-296},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001289102900296},
isbn={978-972-8865-77-1},
}

TY - CONF

JO - Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 2: 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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.