[图书][B] Deterministic network calculus: From theory to practical implementation
Deterministic network calculus is a theory based on the (min, plus) algebra. Its aim is to
compute worst-case performance bounds in communication networks. Our goal is to provide …
compute worst-case performance bounds in communication networks. Our goal is to provide …
A theory of traffic regulators for deterministic networks with application to interleaved regulators
JY Le Boudec - IEEE/ACM Transactions on Networking, 2018 - ieeexplore.ieee.org
We introduce Pi-regulation, a new definition of traffic regulation which extends both the
arrival curves of network calculus and Chang's max-plus g-regulation, and also includes …
arrival curves of network calculus and Chang's max-plus g-regulation, and also includes …
Quality and cost of deterministic network calculus: Design and evaluation of an accurate and fast analysis
Networks are integral parts of modern safety-critical systems and certification demands the
provision of guarantees for data transmissions. Deterministic Network Calculus (DNC) can …
provision of guarantees for data transmissions. Deterministic Network Calculus (DNC) can …
DeepTMA: Predicting effective contention models for network calculus using graph neural networks
Network calculus computes end-to-end delay bounds for individual data flows in networks of
aggregate schedulers. It searches for the best model bounding resource contention between …
aggregate schedulers. It searches for the best model bounding resource contention between …
A survey on network calculus tools for network infrastructure in real-time systems
B Zhou, I Howenstine, S Limprapaipong… - IEEE Access, 2020 - ieeexplore.ieee.org
Network Calculus is an established analytical framework which can provide deterministic
estimates of latency and buffer requirements for feed-forward packet-switched …
estimates of latency and buffer requirements for feed-forward packet-switched …
Trade-off between accuracy and tractability of network calculus in FIFO networks
A Bouillard - Performance Evaluation, 2022 - Elsevier
Computing accurate deterministic performance bounds is a strong need for communication
technologies having stringent requirements on latency and reliability. Within new scheduling …
technologies having stringent requirements on latency and reliability. Within new scheduling …
On the Benefits of Traffic “Reprofiling” the Multiple Hops Case—Part I
This paper considers networks where user traffic is regulated through deterministic traffic
profiles, eg token buckets, and requirescleanguaranteed hard delay bounds. The network's …
profiles, eg token buckets, and requirescleanguaranteed hard delay bounds. The network's …
Network calculus for bounding delays in feedforward networks of FIFO queueing systems
A Scheffler, S Bondorf - … of Systems: 18th International Conference, QEST …, 2021 - Springer
Networks for safety-critical operation must guarantee deterministic bounds on the end-to-
end delay of data transmission despite the usually many data flows that all share the …
end delay of data transmission despite the usually many data flows that all share the …
Computationally efficient worst-case analysis of flow-controlled networks with network calculus
Networks with hop-by-hop flow control occur in several contexts, from data centers to
systems architectures (eg, wormhole-routing networks on chip). A worst-case end-to-end …
systems architectures (eg, wormhole-routing networks on chip). A worst-case end-to-end …
Tightening network calculus delay bounds by predicting flow prolongations in the FIFO analysis
Network calculus offers the means to compute worst-case traversal times based on
interpreting a system as a queueing network. A major strength of network calculus is its strict …
interpreting a system as a queueing network. A major strength of network calculus is its strict …