DocumentCode
3118347
Title
A Service Discovery Framework based on Linear Composition
Author
Zisman, Andrea ; Mahbub, Khaled ; Spanoudakis, George
Author_Institution
City Univ., London
fYear
2007
fDate
9-13 July 2007
Firstpage
536
Lastpage
543
Abstract
Service discovery has been recognised as an important aspect of service oriented computing. This is even more the case when developing service centric systems in which software systems are constructed based on the identification and composition of Web services that together can fulfil the functionality of the system being developed. In this paper we present a framework that supports the discovery of services that can provide the functionality and satisfy the properties and constraints of service-based systems during their design phase. Our framework makes use of linear composition of service operations in which more than one Web service operations can be combined to fulfil a functionality of the system when no single operation can be identified. The discovery process is based on a graph-matching algorithm. A prototype tool has been developed to demonstrate and evaluate the framework.
Keywords
Web services; data mining; graph theory; software engineering; Web services; graph-matching algorithm; service centric systems; service discovery framework; service oriented computing; software systems; Algorithm design and analysis; Impedance matching; Logic; Process design; Prototypes; Runtime; Software systems; Systems engineering and theory; Web services;
fLanguage
English
Publisher
ieee
Conference_Titel
Services Computing, 2007. SCC 2007. IEEE International Conference on
Conference_Location
Salt Lake City, UT
Print_ISBN
0-7695-2925-9
Type
conf
DOI
10.1109/SCC.2007.15
Filename
4278701
Link To Document