The Community for Technology Leaders
Green Image
Issue No. 07 - July (2013 vol. 39)
ISSN: 0098-5589
pp: 954-974
Andrea Zisman , City University London, London
George Spanoudakis , City University London, London
James Dooley , University of Essex, Colchester
Igor Siveroni , City University London, London
The identification of services during the execution of service-based applications to replace services in them that are no longer available and/or fail to satisfy certain requirements is an important issue. In this paper, we present a framework to support runtime service discovery. This framework can execute service discovery queries in pull and push mode. In pull mode, it executes queries when a need for finding a replacement service arises. In push mode, queries are subscribed to the framework to be executed proactively and, in parallel with the operation of the application, to identify adequate services that could be used if the need for replacing a service arises. Hence, the proactive (push) mode of query execution makes it more likely to avoid interruptions in the operation of service-based applications when a service in them needs to be replaced at runtime. In both modes of query execution, the identification of services relies on distance-based matching of structural, behavioral, quality, and contextual characteristics of services and applications. A prototype implementation of the framework has been developed and an evaluation was carried out to assess the performance of the framework. This evaluation has shown positive results, which are discussed in the paper.
Runtime, Context, Servers, Educational institutions, Database languages, Unified modeling language, Informatics, application development in services, Web-services discovery, composite web services, context-aware QoS model

J. Dooley, I. Siveroni, G. Spanoudakis and A. Zisman, "Proactive and Reactive Runtime Service Discovery: A Framework and Its Evaluation," in IEEE Transactions on Software Engineering, vol. 39, no. , pp. 954-974, 2013.
93 ms
(Ver 3.3 (11022016))