TY - GEN
T1 - Complex event service provision and composition based on event pattern matchmaking
AU - Gao, Feng
AU - Curry, Edward
AU - Bhiri, Sami
PY - 2014
Y1 - 2014
N2 - Service computing has gained great success because it decouples service providers and consumers. Because of this decoupling, it is possible to reuse software applications without knowing their implementation details. However, business applications consuming complex events (and complex event processing systems in general) are not maximising the full benefits from service computing. Current service models are not suitable for describing complex events and the requirements for enabling pattern-based complex event service composition are not fully addressed. In this paper, we propose a complex event service description model that extends OWL-S and captures the exact semantics of complex events, including their patterns and attributes. We propose algorithms to create event service compositions based on event patterns. These algorithms are capable of selecting the composition plans with lowest estimated data traffic demands over the service network. Moreover, we show how to improve the efficiency of event service composition by indexing event patterns.
AB - Service computing has gained great success because it decouples service providers and consumers. Because of this decoupling, it is possible to reuse software applications without knowing their implementation details. However, business applications consuming complex events (and complex event processing systems in general) are not maximising the full benefits from service computing. Current service models are not suitable for describing complex events and the requirements for enabling pattern-based complex event service composition are not fully addressed. In this paper, we propose a complex event service description model that extends OWL-S and captures the exact semantics of complex events, including their patterns and attributes. We propose algorithms to create event service compositions based on event patterns. These algorithms are capable of selecting the composition plans with lowest estimated data traffic demands over the service network. Moreover, we show how to improve the efficiency of event service composition by indexing event patterns.
KW - complex event processing
KW - event reusability
KW - event service
UR - https://www.scopus.com/pages/publications/84903141690
U2 - 10.1145/2611286.2611287
DO - 10.1145/2611286.2611287
M3 - Conference Publication
AN - SCOPUS:84903141690
SN - 9781450327374
T3 - DEBS 2014 - Proceedings of the 8th ACM International Conference on Distributed Event-Based Systems
SP - 71
EP - 82
BT - DEBS 2014 - Proceedings of the 8th ACM International Conference on Distributed Event-Based Systems
PB - Association for Computing Machinery
T2 - 8th ACM International Conference on Distributed Event-Based Systems, DEBS 2014
Y2 - 26 May 2014 through 29 May 2014
ER -