A graph-based framework for optimal semantic web service composition

Web services are self-described, loosely coupled software components that are network-accessible through standardized web protocols, whose characteristics are described in XML. One of the key promises of Web services is to provide better interoperability and to enable a faster integration between sy...

Descripción completa

Detalles Bibliográficos
Autor: Rodríguez Mier, Pablo
Tipo de recurso: tesis doctoral
Fecha de publicación:2016
País:España
Institución:Universidad de Santiago de Compostela (USC)
Repositorio:Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Idioma:inglés
OAI Identifier:oai:minerva.usc.gal:10347/14849
Acceso en línea:http://hdl.handle.net/10347/14849
Access Level:acceso abierto
Palabra clave:Materias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330406 Arquitectura de ordenadores
Materias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330418 Dispositivos de almacenamiento
id ES_f8b383017b3c200e1c73514c8d8a6c2f
oai_identifier_str oai:minerva.usc.gal:10347/14849
network_acronym_str ES
network_name_str España
repository_id_str
dc.title.none.fl_str_mv A graph-based framework for optimal semantic web service composition
title A graph-based framework for optimal semantic web service composition
spellingShingle A graph-based framework for optimal semantic web service composition
Rodríguez Mier, Pablo
Materias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330406 Arquitectura de ordenadores
Materias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330418 Dispositivos de almacenamiento
title_short A graph-based framework for optimal semantic web service composition
title_full A graph-based framework for optimal semantic web service composition
title_fullStr A graph-based framework for optimal semantic web service composition
title_full_unstemmed A graph-based framework for optimal semantic web service composition
title_sort A graph-based framework for optimal semantic web service composition
dc.creator.none.fl_str_mv Rodríguez Mier, Pablo
author Rodríguez Mier, Pablo
author_facet Rodríguez Mier, Pablo
author_role author
dc.contributor.none.fl_str_mv Lama Penín, Manuel
Mucientes Molina, Manuel
Universidade de Santiago de Compostela. Facultade de Física. Departamento de Electrónica e Computación. Centro Singular de Investigación en Tecnoloxías da Información (CiTIUS)

dc.subject.none.fl_str_mv Materias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330406 Arquitectura de ordenadores
Materias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330418 Dispositivos de almacenamiento
topic Materias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330406 Arquitectura de ordenadores
Materias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330418 Dispositivos de almacenamiento
description Web services are self-described, loosely coupled software components that are network-accessible through standardized web protocols, whose characteristics are described in XML. One of the key promises of Web services is to provide better interoperability and to enable a faster integration between systems. In order to generate robust service oriented architectures, automatic composition algorithms are required in order to combine the functionality of many single services into composite services that are able to respond to demanding user requests, even when there is no single service capable of performing such task. Service composition consists of a combination of single services into composite services that are executed in sequence or in a different order, imposed by a set of control constructions that can be specified using standard languages such as OWL-s or BPEL4WS. In the last years several papers have dealt with composition of web services. Some approaches treat the service composition as a planning problem, where a sequence of actions lead from a initial state to a goal state. However, most of these proposals have some drawbacks: high complexity, high computational cost and inability to maximize the parallel execution of web services. Other approaches consider the problem as a graph search problem, where search algorithms are applied over a web service dependency graph in order to find a solution for a particular request. These proposals are simpler than their counterparts and also many can exploit the parallel execution of web services. However, most of these approaches rely on very complex dependency graphs that have not been optimized to remove data redundancy, which may negatively affect the overall performance and scalability of these techniques in large service registries. Therefore, it is necessary to identify, characterize and optimize the different tasks involved in the automatic service composition process in order to develop better strategies to efficiently obtain optimal solutions. The main goal of this dissertation is to develop a graph-based framework for automatic service composition that generate optimal input-output based compositions not only in terms of complexity of the solutions, but also in terms of overall quality of service solutions. More specifically, the objectives of this thesis are: (1) Analysis of the characteristics of services and compositions. The aim of this objective is to characterize and identify the main steps that are part for the service composition process. (2) Framework for automatic graph-based composition. This objective will focus on developing a framework that enables the efficient input-output based service composition, exploring the integration with other tasks that are part of the composition process, such as service discovery. (3) Development of optimal algorithms for automatic service composition. This objective focuses on the development of a set of algorithms and optimization techniques for the generation of optimal compositions, optimizing the complexity of the solutions and the overall Quality-of- Service. (4) Validation of the algorithms with standard datasets so they can be compared with other proposals.
publishDate 2016
dc.date.none.fl_str_mv 2016
2016-08-23
2016
2016-08-23
dc.type.none.fl_str_mv doctoral thesis
http://purl.org/coar/resource_type/c_db06
dc.type.openaire.fl_str_mv info:eu-repo/semantics/doctoralThesis
format doctoralThesis
dc.identifier.none.fl_str_mv http://hdl.handle.net/10347/14849
url http://hdl.handle.net/10347/14849
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
https://creativecommons.org/licenses/by-nc-nd/4.0/deed.gl
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
https://creativecommons.org/licenses/by-nc-nd/4.0/deed.gl
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
instname:Universidad de Santiago de Compostela (USC)
instname_str Universidad de Santiago de Compostela (USC)
reponame_str Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
collection Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869425026194735104
spelling A graph-based framework for optimal semantic web service compositionRodríguez Mier, PabloMaterias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330406 Arquitectura de ordenadoresMaterias::Investigación::33 Ciencias tecnológicas::3304 Tecnología de los ordenadores::330418 Dispositivos de almacenamientoWeb services are self-described, loosely coupled software components that are network-accessible through standardized web protocols, whose characteristics are described in XML. One of the key promises of Web services is to provide better interoperability and to enable a faster integration between systems. In order to generate robust service oriented architectures, automatic composition algorithms are required in order to combine the functionality of many single services into composite services that are able to respond to demanding user requests, even when there is no single service capable of performing such task. Service composition consists of a combination of single services into composite services that are executed in sequence or in a different order, imposed by a set of control constructions that can be specified using standard languages such as OWL-s or BPEL4WS. In the last years several papers have dealt with composition of web services. Some approaches treat the service composition as a planning problem, where a sequence of actions lead from a initial state to a goal state. However, most of these proposals have some drawbacks: high complexity, high computational cost and inability to maximize the parallel execution of web services. Other approaches consider the problem as a graph search problem, where search algorithms are applied over a web service dependency graph in order to find a solution for a particular request. These proposals are simpler than their counterparts and also many can exploit the parallel execution of web services. However, most of these approaches rely on very complex dependency graphs that have not been optimized to remove data redundancy, which may negatively affect the overall performance and scalability of these techniques in large service registries. Therefore, it is necessary to identify, characterize and optimize the different tasks involved in the automatic service composition process in order to develop better strategies to efficiently obtain optimal solutions. The main goal of this dissertation is to develop a graph-based framework for automatic service composition that generate optimal input-output based compositions not only in terms of complexity of the solutions, but also in terms of overall quality of service solutions. More specifically, the objectives of this thesis are: (1) Analysis of the characteristics of services and compositions. The aim of this objective is to characterize and identify the main steps that are part for the service composition process. (2) Framework for automatic graph-based composition. This objective will focus on developing a framework that enables the efficient input-output based service composition, exploring the integration with other tasks that are part of the composition process, such as service discovery. (3) Development of optimal algorithms for automatic service composition. This objective focuses on the development of a set of algorithms and optimization techniques for the generation of optimal compositions, optimizing the complexity of the solutions and the overall Quality-of- Service. (4) Validation of the algorithms with standard datasets so they can be compared with other proposals.Lama Penín, ManuelMucientes Molina, ManuelUniversidade de Santiago de Compostela. Facultade de Física. Departamento de Electrónica e Computación. Centro Singular de Investigación en Tecnoloxías da Información (CiTIUS)20162016-08-2320162016-08-23doctoral thesishttp://purl.org/coar/resource_type/c_db06info:eu-repo/semantics/doctoralThesisapplication/pdfhttp://hdl.handle.net/10347/14849reponame:Minerva. Repositorio Institucional de la Universidad de Santiago de Compostelainstname:Universidad de Santiago de Compostela (USC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Esta obra atópase baixo unha licenza internacional Creative Commons BY-NC-ND 4.0. Calquera forma de reprodución, distribución, comunicación pública ou transformación desta obra non incluída na licenza Creative Commons BY-NC-ND 4.0 só pode ser realizada coa autorización expresa dos titulares, salvo excepción prevista pola lei. Pode acceder Vde. ao texto completo da licenza nesta ligazón: https://creativecommons.org/licenses/by-nc-nd/4.0/deed.glhttps://creativecommons.org/licenses/by-nc-nd/4.0/deed.glinfo:eu-repo/semantics/openAccessoai:minerva.usc.gal:10347/148492026-06-15T12:47:27Z
score 15.811543