5,265 research outputs found
A Basic Result on the Superposition of Arrival Processes in Deterministic Networks
Time-Sensitive Networking (TSN) and Deterministic Networking (DetNet) are
emerging standards to enable deterministic, delay-critical communication in
such networks. This naturally (re-)calls attention to the network calculus
theory (NC), since a rich set of results for delay guarantee analysis have
already been developed there. One could anticipate an immediate adoption of
those existing network calculus results to TSN and DetNet. However, the
fundamental difference between the traffic specification adopted in TSN and
DetNet and those traffic models in NC makes this difficult, let alone that
there is a long-standing open challenge in NC. To address them, this paper
considers an arrival time function based max-plus NC traffic model. In
particular, for the former, the mapping between the TSN / DetNet and the NC
traffic model is proved. For the latter, the superposition property of the
arrival time function based NC traffic model is found and proved. Appealingly,
the proved superposition property shows a clear analogy with that of a
well-known counterpart traffic model in NC. These results help make an
important step towards the development of a system theory for delay guarantee
analysis of TSN / DetNet networks
An Algebra of Synchronous Scheduling Interfaces
In this paper we propose an algebra of synchronous scheduling interfaces
which combines the expressiveness of Boolean algebra for logical and functional
behaviour with the min-max-plus arithmetic for quantifying the non-functional
aspects of synchronous interfaces. The interface theory arises from a
realisability interpretation of intuitionistic modal logic (also known as
Curry-Howard-Isomorphism or propositions-as-types principle). The resulting
algebra of interface types aims to provide a general setting for specifying
type-directed and compositional analyses of worst-case scheduling bounds. It
covers synchronous control flow under concurrent, multi-processing or
multi-threading execution and permits precise statements about exactness and
coverage of the analyses supporting a variety of abstractions. The paper
illustrates the expressiveness of the algebra by way of some examples taken
from network flow problems, shortest-path, task scheduling and worst-case
reaction times in synchronous programming.Comment: In Proceedings FIT 2010, arXiv:1101.426
- …