End-to-end deadlines over dynamic topologies

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Standard

End-to-end deadlines over dynamic topologies. / Millnert, Victor; Eker, Johan; Bini, Enrico.

31st Euromicro Conference on Real-Time Systems: ECRTS 2019. ed. / Sophie Quinton. Vol. 133 Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. p. 10:1–10:22 10 (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Harvard

Millnert, V, Eker, J & Bini, E 2019, End-to-end deadlines over dynamic topologies. in S Quinton (ed.), 31st Euromicro Conference on Real-Time Systems: ECRTS 2019. vol. 133, 10, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 10:1–10:22, 31st Euromicro Conference on Real-Time Systems (ECRTS 2019), Stutgart, Germany, 2019/07/09. https://doi.org/10.4230/LIPIcs.ECRTS.2019.10

APA

Millnert, V., Eker, J., & Bini, E. (2019). End-to-end deadlines over dynamic topologies. In S. Quinton (Ed.), 31st Euromicro Conference on Real-Time Systems: ECRTS 2019 (Vol. 133, pp. 10:1–10:22). [10] (Leibniz International Proceedings in Informatics (LIPIcs)). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ECRTS.2019.10

CBE

Millnert V, Eker J, Bini E. 2019. End-to-end deadlines over dynamic topologies. Quinton S, editor. In 31st Euromicro Conference on Real-Time Systems: ECRTS 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. pp. 10:1–10:22. (Leibniz International Proceedings in Informatics (LIPIcs)). https://doi.org/10.4230/LIPIcs.ECRTS.2019.10

MLA

Millnert, Victor, Johan Eker and Enrico Bini "End-to-end deadlines over dynamic topologies". Quinton, Sophie (ed.). 31st Euromicro Conference on Real-Time Systems: ECRTS 2019. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2019, 10:1–10:22. https://doi.org/10.4230/LIPIcs.ECRTS.2019.10

Vancouver

Millnert V, Eker J, Bini E. End-to-end deadlines over dynamic topologies. In Quinton S, editor, 31st Euromicro Conference on Real-Time Systems: ECRTS 2019. Vol. 133. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2019. p. 10:1–10:22. 10. (Leibniz International Proceedings in Informatics (LIPIcs)). https://doi.org/10.4230/LIPIcs.ECRTS.2019.10

Author

Millnert, Victor ; Eker, Johan ; Bini, Enrico. / End-to-end deadlines over dynamic topologies. 31st Euromicro Conference on Real-Time Systems: ECRTS 2019. editor / Sophie Quinton. Vol. 133 Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. pp. 10:1–10:22 (Leibniz International Proceedings in Informatics (LIPIcs)).

RIS

TY - GEN

T1 - End-to-end deadlines over dynamic topologies

AU - Millnert, Victor

AU - Eker, Johan

AU - Bini, Enrico

PY - 2019/7

Y1 - 2019/7

N2 - Despite the creativity of the scientific community and the funding agencies, the underlying model of computation behind IoT, WSN, cloud, edge, fog, and mist is fundamentally the same; Computational nodes which are dynamically interconnected to form a system in where both processing capacity and connectivity may vary over time. On top of such a system, we consider applications that need packets to flow along a path and adhere to end-to-end deadlines. This application model is motivated by both control and automation systems, as well as telecom systems. The challenge is to guarantee end-to-end deadlines when allowing nodes and applications to join or leave.The mainstream, and to some extent natural, approach to this is to relax the stringency of the constraint (e.g. use probabilistic guarantees, soft deadlines). In this paper we take a different approach and keep the end-to-end deadlines as hard constraints and instead partially limit the freedom of how nodes and applications are allowed to leave and join. We present a theoretical framework for modeling such systems along with proofs that deadlines are always honored.

AB - Despite the creativity of the scientific community and the funding agencies, the underlying model of computation behind IoT, WSN, cloud, edge, fog, and mist is fundamentally the same; Computational nodes which are dynamically interconnected to form a system in where both processing capacity and connectivity may vary over time. On top of such a system, we consider applications that need packets to flow along a path and adhere to end-to-end deadlines. This application model is motivated by both control and automation systems, as well as telecom systems. The challenge is to guarantee end-to-end deadlines when allowing nodes and applications to join or leave.The mainstream, and to some extent natural, approach to this is to relax the stringency of the constraint (e.g. use probabilistic guarantees, soft deadlines). In this paper we take a different approach and keep the end-to-end deadlines as hard constraints and instead partially limit the freedom of how nodes and applications are allowed to leave and join. We present a theoretical framework for modeling such systems along with proofs that deadlines are always honored.

KW - cloud

KW - 5g

KW - end-to-end deadline

KW - smart factories

KW - dynamic network

KW - microservices

U2 - 10.4230/LIPIcs.ECRTS.2019.10

DO - 10.4230/LIPIcs.ECRTS.2019.10

M3 - Paper in conference proceeding

VL - 133

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 10:1–10:22

BT - 31st Euromicro Conference on Real-Time Systems

A2 - Quinton, Sophie

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

ER -