TY - GEN
T1 - Latency-aware placement of data stream analytics on edge computing
AU - da Silva Veith, Alexandre
AU - de Assunção, Marcos Dias
AU - Lefèvre, Laurent
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2018.
PY - 2018
Y1 - 2018
N2 - The interest in processing data events under stringent time constraints as they arrive has led to the emergence of architecture and engines for data stream processing. Edge computing, initially designed to minimize the latency of content delivered to mobile devices, can be used for executing certain stream processing operations. Moving operators from cloud to edge, however, is challenging as operator-placement decisions must consider the application requirements and the network capabilities. In this work, we introduce strategies to create placement configurations for data stream processing applications whose operator topologies follow series parallel graphs. We consider the operator characteristics and requirements to improve the response time of such applications. Results show that our strategies can improve the response time in up to 50% for application graphs comprising multiple forks and joins while transferring less data and better using the resources.
AB - The interest in processing data events under stringent time constraints as they arrive has led to the emergence of architecture and engines for data stream processing. Edge computing, initially designed to minimize the latency of content delivered to mobile devices, can be used for executing certain stream processing operations. Moving operators from cloud to edge, however, is challenging as operator-placement decisions must consider the application requirements and the network capabilities. In this work, we introduce strategies to create placement configurations for data stream processing applications whose operator topologies follow series parallel graphs. We consider the operator characteristics and requirements to improve the response time of such applications. Results show that our strategies can improve the response time in up to 50% for application graphs comprising multiple forks and joins while transferring less data and better using the resources.
KW - Cloud computing
KW - Data stream processing
KW - Edge computing
KW - Resource management
KW - Scheduling
KW - Series parallel graphs
UR - https://www.scopus.com/pages/publications/85056882385
U2 - 10.1007/978-3-030-03596-9_14
DO - 10.1007/978-3-030-03596-9_14
M3 - Contribution to conference proceedings
AN - SCOPUS:85056882385
SN - 9783030035952
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 215
EP - 229
BT - Service-Oriented Computing - 16th International Conference, ICSOC 2018, Proceedings
A2 - Yu, Qi
A2 - Pahl, Claus
A2 - Vukovic, Maja
A2 - Yin, Jianwei
PB - Springer Verlag
T2 - 16th International Conference on Service-Oriented Computing, ICSOC 2018
Y2 - 12 November 2018 through 15 November 2018
ER -