Composición de servicios web usando el algoritmo de Dijkstra bidirecccional
(Web service composition using the bidirectional Dijkstra algorithm)
Francisco Moo Mena (email@example.com)1, Rafael Hernández Ucán (firstname.lastname@example.org)1, Víctor Uc Cetina (email@example.com)1, Francisco Madera Ramírez (firstname.lastname@example.org)1
1Universidad Autónoma de Yucatán
This paper appears in: Revista IEEE América Latina
Publication Date: May 2016
Volume: 14, Issue: 5
Web services are not always able to fulfill customer requirements on their own, so in those cases it can choose to make a composition of web services. However, this is a complex problem since it must take into account the large number of available services, performance requirements, and other factors related to quality of service (QoS). Representing the problem of web service composition as a graph, some methods were used that do not ensure optimum solution. In this work the bidirectional Dijkstra algorithm is proposed to solve the problem of web services composition. Experimental results show that, as the number of web service classes increases, proposed algorithm performance improves.
web service composition, Dijkstra algorithm, bidirectional search, dynamic programming
Documents that cite this
This function is not implemented yet.
[PDF Full-Text (459)]