dc.creatorAnabalon, Diego
dc.creatorGarriga, Martín
dc.creatorFlores, Andrés P.
dc.date2016-09
dc.date2016-11-30
dc.date2016-11-30T17:18:18Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/57163
dc.identifierhttp://45jaiio.sadio.org.ar/sites/default/files/asse-08.pdf
dc.identifierissn:2451-7593
dc.descriptionDuring development of a Service-oriented Application, some software pieces could be fulfilled by the connection to Web Services. A list of candidate Web Services could be obtained by making use of any service discovery registry, which are then selected and integrated into the application. However, when it comes to a distributed system, multiple functional and non-functional constraints arise from the interaction between several service requesters and providers, particularly when composing different services. To overcome with such constraints, in this work we propose to model service selection and composition scenarios as Distributed Constraints Optimization Problems (DCOP).We propose different modeling approaches and develop representative examples to be solved through different DCOP algorithms. Also, we analyze the impact of possible extensions to the model in the computability of the problem.
dc.descriptionSociedad Argentina de Informática e Investigación Operativa (SADIO)
dc.formatapplication/pdf
dc.format99-110
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-sa/3.0/
dc.rightsCreative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)
dc.subjectCiencias Informáticas
dc.subjectDCOP
dc.subjectDCSP
dc.subjectWeb-based services
dc.subjectConstraints
dc.titleModeling Web Service Selection for Composition as a Distributed Constraint Optimization Problem (DCOP)
dc.typeObjeto de conferencia
dc.typeObjeto de conferencia


Este ítem pertenece a la siguiente institución