Please use this identifier to cite or link to this item:
Title: Matching Customer Requests to Service Offerings in Real-Time
Authors: Tilly, Marcel
Reiff-Marganiec, Stephan
First Published: 2011
Publisher: Association for Computing Machinery (ACM)
Citation: Tilly, Marcel and Reiff-Marganiec, Stephan, ‘Matching Customer Requests to Service Offerings in Real-Time ' in SAC '11 Proceedings of the 2011 ACM Symposium on Applied Computing, pp. 456-461
Abstract: Classic request-response Service-oriented architecture (SOA) has reached a level of maturity where SOA inspired extensions are enabling new and creative domains like the Internet of Things, real-time business or real-time Web. These new domains impose new requirements on SOA, such as a huge data volume, meditation between various data structures and a large number of sources that need to be procured, processed and provided with almost zero latency. Service selection is one of the areas where decisions have to be made based consumer requests and service offerings. Processing this data requires typical SOA behavior combined with more elaborate approaches to process large amounts of data with near-zero latency. The approach presented in this paper combines pub-sub approaches for processing service offerings and mediations with classical request-response SOA approaches for consumer requests facilitated by Complex Event Processing (CEP). This paper presents a novel approach for subscribing to dynamic service properties and receiving up-to-date information in real-time. Therefore, we are able to select services with zero latency since there is no need to pull for property values anymore. The paper shows how to map requests to streaming data, how to process and answer complex requests with low latency and how to enable real-time service selection.
DOI Link: 10.1145/1982185.1982285
ISBN: 978-1-4503-0113-8
Version: Post print
Status: Peer reviewed
Type: Conference paper
Rights: © ACM, 2011. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in SAC '11 Proceedings of the 2011 ACM Symposium on Applied Computing, 2001.
Description: This paper received the SAC 2011 Best Paper award in the Engineering Category.
Appears in Collections:Conference Papers & Presentations, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
2011-4.pdf620.38 kBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.