End-to-end deadlines over dynamic topologies
Millnert, Victor LU ; Eker, Johan LU
and Bini, Enrico
LU
(2019)
31st Euromicro Conference on Real-Time Systems (ECRTS 2019)
In Leibniz International Proceedings in Informatics (LIPIcs)
133.
p.1-22
- Abstract
- 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... (More) - 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/fbdb0e8a-e318-45c8-9dcd-c3fa835f0dd8
- author
- Millnert, Victor
LU
; Eker, Johan
LU
and Bini, Enrico
LU
- organization
- publishing date
- 2019-07
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- cloud, 5g, end-to-end deadline, smart factories, dynamic network, microservices
- host publication
- 31st Euromicro Conference on Real-Time Systems : ECRTS 2019 - ECRTS 2019
- series title
- Leibniz International Proceedings in Informatics (LIPIcs)
- editor
- Quinton, Sophie
- volume
- 133
- article number
- 10
- pages
- 22 pages
- publisher
- Schloss Dagstuhl - Leibniz-Zentrum für Informatik
- conference name
- 31st Euromicro Conference on Real-Time Systems (ECRTS 2019)
- conference location
- Stutgart, Germany
- conference dates
- 2019-07-09 - 2019-07-12
- external identifiers
-
- scopus:85069164787
- ISSN
- 1868-8969
- ISBN
- 978-3-95977-110-8
- DOI
- 10.4230/LIPIcs.ECRTS.2019.10
- project
- Feedback Computing in Cyber-Physical Systems
- WASP: Autonomous Cloud
- language
- English
- LU publication?
- yes
- id
- fbdb0e8a-e318-45c8-9dcd-c3fa835f0dd8
- date added to LUP
- 2019-05-09 10:57:13
- date last changed
- 2023-11-18 21:07:21
@inproceedings{fbdb0e8a-e318-45c8-9dcd-c3fa835f0dd8,
abstract = {{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.<br/><br/>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.}},
author = {{Millnert, Victor and Eker, Johan and Bini, Enrico}},
booktitle = {{31st Euromicro Conference on Real-Time Systems : ECRTS 2019}},
editor = {{Quinton, Sophie}},
isbn = {{978-3-95977-110-8}},
issn = {{1868-8969}},
keywords = {{cloud; 5g; end-to-end deadline; smart factories; dynamic network; microservices}},
language = {{eng}},
pages = {{1--22}},
publisher = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
series = {{Leibniz International Proceedings in Informatics (LIPIcs)}},
title = {{End-to-end deadlines over dynamic topologies}},
url = {{http://dx.doi.org/10.4230/LIPIcs.ECRTS.2019.10}},
doi = {{10.4230/LIPIcs.ECRTS.2019.10}},
volume = {{133}},
year = {{2019}},
}