, European maritime safety agency -vessel tracking globally (lrit), 2019.

A. Buluç, I. Henning-meyerhenke, P. Safro, C. Sanders, and . Schulz, Recent Advances in Graph Partitioning, pp.117-158, 2016.

P. Carbone, A. Katsifodimos, S. Ewen, S. Volker-markl, K. Haridi et al., Apache flink: Stream and batch processing in a single engine, Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, vol.36, issue.4, 2015.

V. Cardellini, V. Grassi, F. L. Presti, and M. Nardelli, Optimal operator replication and placement for distributed stream processing systems. SIGMETRICS Perform, Eval. Rev, vol.44, issue.4

S. Chaturvedi, S. Tyagi, and Y. Simmhan, Collaborative reuse of streaming dataflows in iot applications, 2017 IEEE 13th International Conference on e-Science (e-Science), pp.403-412, 2017.

C. M. Fiduccia and R. M. Mattheyses, A Linear-Time Heuristic for Improving Network Partitions, 19th Design Automation Conference, pp.175-181, 1982.

R. Ghosh and Y. Simmhan, Distributed scheduling of event analytics across edge and cloud, ACM Trans. Cyber-Phys. Syst, vol.2, issue.4

O. Goldschmidt and D. S. Hochbaum, A Polynomial Algorithm for the k-Cut Problem for Fixed k, Mathematics of Operations Research, vol.19, issue.1, pp.24-37, 1994.

V. Gulisano, R. Jimenez-peris, M. Patino-martinez, C. Soriente, and P. Valduriez, Streamcloud: An elastic and scalable data streaming system, IEEE Transactions on Parallel and Distributed Systems, vol.23, issue.12, pp.2351-2365, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00748992

B. Hendrickson and R. Leland, A multi-level algorithm for partitioning graphs, Supercomputing '95:Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, pp.28-28, 1995.

M. Hirzel, R. Soulé, S. Schneider, B. Gedik, and R. Grimm, A catalog of stream processing optimizations, ACM Computing Surveys (CSUR), vol.46, issue.4, p.46, 2014.

F. Hueske, M. Peters, M. J. Sax, A. Rheinländer, R. Bergmann et al., Opening the black boxes in data flow optimization, Proc. VLDB Endow, vol.5, issue.11, pp.1256-1267, 2012.

L. Hyafil and R. L. Rivest, Graph partitioning and constructing optimal decision trees are polynomial complete problems

S. David, K. A. Johnson, and . Niemi, On knapsacks, partitions, and a new dynamic programming technique for trees, Mathematics of Operations Research, vol.8, issue.1, pp.1-14, 1983.

G. Karypis and V. Kumar, Multilevelk-way partitioning scheme for irregular graphs, Journal of Parallel and Distributed Computing, vol.48, issue.1, pp.96-129, 1998.

B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.

S. Kundu and J. Misra, A linear tree partitioning algorithm, SIAM Journal on Computing, vol.6, issue.1, pp.151-154, 1977.

J. A. Lukes, Efficient Algorithm for the Partitioning of Trees, IBM Journal of Research and Development, vol.18, issue.3, pp.217-224, 1974.

P. Pietzuch, J. Ledlie, J. Shneidman, M. Roussopoulos, M. Welsh et al., Network-aware operator placement for stream-processing systems, 22nd International Conference on Data Engineering (ICDE'06), pp.49-49, 2006.

L. Prosperi, A. Costan, P. Silva, and G. Antoniu, Planner: Cost-efficient Execution Plans Placement for Uniform Stream Analytics on Edge and Cloud, WORKS 2018: 13th Workflows in Support of Large-Scale Science Workshop, pp.1-10, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01892718

T. Repantis, X. Gu, and V. Kalogeraki, Synergy: Sharing-aware component composition for distributed stream processing systems, pp.322-341, 2006.

S. Schneider, M. Hirzel, B. Gedik, and K. Wu, Auto-parallelizing stateful distributed streaming applications, Proceedings of the 21st international conference on Parallel architectures and compilation techniques, pp.53-64, 2012.

A. Toshniwal, S. Taneja, A. Shukla, K. Ramasamy, M. Jignesh et al., Proceedings of the, 2014.

, ACM SIGMOD international conference on Management of data, pp.147-156, 2014.