Graph based E-Government web service composition
Nowadays, e-government has emerged as a government policy to improve the quality and efficiency of public administrations. By exploiting the potential of new information and communication technologies, government agencies are providing a wide spectrum of online services. These services are composed of several web services that comply with well defined processes. One of the big challenges is the need to optimize the composition of the elementary web services. In this paper, we present a solution for optimizing the computation effort in web service composition. Our method is based on Graph Theory. We model the semantic relationship between the involved web services through a directed graph. Then, we compute all shortest paths using for the first time, an extended version of the Floyd-Warshall algorithm.
Keywords: Web services composition, optimization, graph theory; Floyd-Warshall, e-government
Download Full-Text
ABOUT THE AUTHORS
Hajar Elmaghraoui
Engineer degree in Computer Science in 2002. PhD student in Computer Science
Imane Zaoui
Engineer degree in Computer Science. PhD student in Computer Science
Dalila Chiadmi
Professor of Computer Science at Mohamadia engineering School(EMI), Mohammed V Agdal University, Morocco.
Laila Benhlima
Professor of Computer Science at Mohamadia engineering School(EMI), Mohammed V Agdal University, Morocco.
Hajar Elmaghraoui
Engineer degree in Computer Science in 2002. PhD student in Computer Science
Imane Zaoui
Engineer degree in Computer Science. PhD student in Computer Science
Dalila Chiadmi
Professor of Computer Science at Mohamadia engineering School(EMI), Mohammed V Agdal University, Morocco.
Laila Benhlima
Professor of Computer Science at Mohamadia engineering School(EMI), Mohammed V Agdal University, Morocco.
