■ Probabilistic Management of Late Arrival of Events

Abstract.

In a networked world, events are transmitted from multiple distributed sources into CEP systems, where events are related to one another along multiple dimensions, e.g., temporal and spatial, to create complex events. The big data era brought with it an increase in the scale and frequency of event reporting. Internet of Things adds another layer of complexity with multiple, continuously changing event sources, not all of which are perfectly reliable, often suffering from late arrivals. In this work we propose a probabilistic model to deal with the problem of reduced reliability of event arrival time. We use statistical theories to fit the distributions of inter-generation at the source and network delays per event type. Equipped with these distributions we propose a predictive method for determining whether an event belonging to a window has yet to arrive. Given some user-defined tolerance levels (on quality and timeliness), we propose an algorithm for dynamically determining the amount of time a complex event time-window should remain open. Using a thorough empirical analysis, we compare the proposed algorithm against state-of-the-art mechanisms for delayed arrival of events and show the superiority of our proposed method.

Bibtex Entry.

@inproceedings{rivetti2018probabilistic,
  title={Probabilistic Management of Late Arrival of Events},
  author={Rivetti, Nicolo and Zacheilas, Nikos and Gal, Avigdor and Kalogeraki, Vana},
  booktitle={Proceedings of the 12th ACM International Conference on Distributed and Event-based Systems},
  pages={52--63},
  year={2018},
  organization={ACM}
}