Search
Abstract
Application development by integration of existing, atomic services reduces development cost and time by extensive reuse of service components. In Service Oriented Architecture, there exist alternative versions of services supplying the same functionality but differing in Quality of Service (QoS) attributes, which enables developers to select services with optimal QoS. Existing algorithms of service selection focus on the formal model of the composite service refraining from interoperability issues that may affect the integration process. In this paper, the author proposes a methodology that extends existing service selection algorithms by introducing additional constraints and processing rules representing interoperability. Two computational models are considered: the graph-based model and the combinatorial model. The extensions enable a straightforward application of a wide range of existing algorithms. The paper also describes a system that implements chosen service selection algorithms together with appropriate extensions for interoperability analysis.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Published in:
-
Communications in Computer and Information Science
no. 410,
pages 33 - 47,
ISSN: 1865-0929 - Title of issue:
- Evaluation of Novel Approaches to Software Engineering strony 33 - 47
- Language:
- English
- Publication year:
- 2013
- Bibliographic description:
- Kaczmarek P.: Extending Service Selection Algorithms with Interoperability Analysis// Evaluation of Novel Approaches to Software Engineering/ : , 2013, s.33-47
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/978-3-642-45422-6_3
- Verified by:
- Gdańsk University of Technology
seen 111 times