International audience; Stream Processing deals with the efficient, real-time processing of continuous streams of data. Stream Processing engines ease the development and deployment of such applications which are commonly pipelines of operators to be traversed by each data item. Due to the varying velocity of the streams, autoscaling is needed to dynamically adapt the number of instances of each operator. With the advent of geographically-dispersed computing platforms such as Fog platforms, operators are dispersed accordingly, and autoscaling needs to be decentralized as well. In this paper, we propose an algorithm allowing for scaling decisions to be taken and enforced in a fully-decentralized way. In particular, in spite of scaling actions being triggered concurrently, each operator maintains a view of its neighbours in the graph so as no data message is lost. The protocol is detailed and its correctness discussed. Its performance is captured through early simulation experiments.

Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1007/978-3-030-48340-1_4 under the license http://www.springer.com/tdm
Back to Top

Document information

Published on 01/01/2019

Volume 2019, 2019
DOI: 10.1007/978-3-030-48340-1_4
Licence: Other

Document Score


Views 2
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?