Hajar Elmaghraoui

Hajar Elmaghraoui

Auto-generated profile, based on publicly available information

Hajar Elmaghraoui

Mohammed V University in Rabat, Ecole Mohammadia d'Ingénieurs, Rabat, Morocco

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2019 in International Journal of Web Services Research
Verified
Journal Article
Closed access
PDF file
HEHajar Elmaghraoui
Hajar Elmaghraoui
LBLaila Benhlima
Laila Benhlima
DCDalila Chiadmi
Dalila Chiadmi
In this article, the authors propose a dynamic web service composition approach based on representing the semantic relationship between web services using a weighted directed AND/OR graph. The nodes in this graph represent available services while the arcs represent the semantic input/output dependencies among them. The novelty of this work consists of constructing the graph and computing offline the shortest paths between each pair of its nodes to disconnect this tedious task from the composition query process. A set of dynamic optimization techniques has been included to reduce the size of the graph and thus improve the scalability and performance of this approach. In addition to the sequence and fork relations between services, this solution also supports the parallel relation. Furthermore, a recovery mechanism is integrated to ensure the continuity of the execution of the composition.

1 October 2017
Verified
Conference Paper
Closed access
HEHajar Elmaghraoui
Hajar Elmaghraoui
LBLaila Benhlima
Laila Benhlima
DCDalila Chiadmi
Dalila Chiadmi
Because of their interesting properties, web services have grown in popularity and have become the preferred technology for distributed systems development. It is then necessary to find efficient solutions for web service composition that can deal with large amounts of services. However, in order to coordinate the exchanges of the data flow in a combination of services, different control structures can contribute, which will complicate the search for an optimal composition. Moreover, the time constraints as well as the increasing number of services also complicate the problem of the composition. In this paper, we presents a formalization of the web Service composition problem as a search problem in an AND/OR Service Dependency Graph, where nodes represent available services and arcs represent the semantic input/output dependencies among them. A set of dynamic optimization techniques have been included to reduce the size of this graph and thus improve the scalability and performance of our approach. We pre-compute all the shortest paths between each pair of this graph's nodes using a graph search algorithm. These paths will be used upon the receipt of a client request, and this reduces the running cost. Furthermore, our model is not only capable of dealing with sequence relations and fork relations, but also capable of dealing with parallel relations between services.

28 July 2018
Verified
Book Chapter
Closed access
PDF file
HEHajar Elmaghraoui
Hajar Elmaghraoui
LBLaila Benhlima
Laila Benhlima
DCDalila Chiadmi
Dalila Chiadmi

1 April 2014
Verified
Conference Paper
Closed access
HEHajar Elmaghraoui
Hajar Elmaghraoui
LBLaila Benhlima
Laila Benhlima
DCDalila Chiadmi
Dalila Chiadmi
Nowadays, e-government has emerged as a government policy to improve the quality and efficiency of public administrations. In order to improve government-citizen interactions, the government agencies are providing a wide spectrum of online services. However, a single service may not be able to serve citizens' needs, but a combination of web services can serve the purpose. It is an important task to solve the problem of finding such a combination, called Web Service Composition. Building composite web services can save significant time and cost for developing new applications and enhancing the interoperability and collaboration among administrations. This paper proposes a Framework for dynamic composition of web services using an approach based on modeling the semantic relationship between the involved web services through a directed graph. It takes into consideration functional and nonfunctional attributes to enable the computation of relevant and most suitable service compositions for some service request.

7 March 2019
Verified
Conference Paper
Open access
HEHajar Elmaghraoui
Hajar Elmaghraoui
LBLaila Benhlima
Laila Benhlima
DCDalila Chiadmi
Dalila Chiadmi