LIPIcs.ECRTS.2024.9.pdf
- Filesize: 0.82 MB
- 23 pages
The Network Calculus theory has been designed to compute upper bounds on delay and backlog in data networks. A lot of results have been developed to address different aspects. However, they are not all compatible with each other since they make different assumptions on the continuity of a core aspect of the model (the cumulative curves). However, real systems may mix several mechanisms. When modeling such a system, one has to choose one continuity hypothesis and limit the analysis to a subset of existing results. This paper addresses the continuity problem and argues formally that continuity issues are mathematical details that can be solved as long as the min-plus properties are used (minimal and maximal service, shaping). Conversely, it gives a counter-example for properties based on strict service, requiring a generalisation of the backlogged interval notion.
Feedback for Dagstuhl Publishing