Survey of deterministic and stochastic service curve models in the network calculus
M Fidler - IEEE Communications surveys & tutorials, 2010 - ieeexplore.ieee.org
In recent years service curves have proven a powerful and versatile model for performance
analysis of network elements, such as schedulers, links, and traffic shapers, up to entire …
analysis of network elements, such as schedulers, links, and traffic shapers, up to entire …
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 …
Tightening end to end delay upper bound for AFDX network calculus with rate latency FIFO servers using network calculus
This paper presents some new results in network calculus designed to improve the
computation of end to end bounds for an AFDX network, using the FIFO assumption. The …
computation of end to end bounds for an AFDX network, using the FIFO assumption. The …
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Aggregate scheduling has been proposed as a solution for achieving scalability in large-
size networks. However, in order to enable the provisioning of real-time services, such as …
size networks. However, in order to enable the provisioning of real-time services, such as …
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 …
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 …
An analytical model for delay bound of OpenFlow based SDN using network calculus
AK Koohanestani, AG Osgouei, H Saidi… - Journal of Network and …, 2017 - Elsevier
Abstract Software Defined Networking paves the way for simplifying network management.
This is achieved through the separation of control plane and data plane in a network. In …
This is achieved through the separation of control plane and data plane in a network. In …
Optimal routing for end-to-end guarantees using network calculus
In this paper we show how Network Calculus can be used to compute the optimal route for a
flow (wrt end-to-end guarantees on the delay or the backlog) in a network in the presence of …
flow (wrt end-to-end guarantees on the delay or the backlog) in a network in the presence of …
Bounding the delays of the MPPA network-on-chip with network calculus: Models and benchmarks
M Boyer, A Graillat, BD De Dinechin, J Migge - Performance Evaluation, 2020 - Elsevier
The Kalray MPPA2-256 processor integrates 256 processing cores and 32 management
cores on a chip. These cores are grouped into clusters and clusters are connected by a high …
cores on a chip. These cores are grouped into clusters and clusters are connected by a high …
A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
In this paper we address the problem of finding end-to-end delay bounds for single leaky-
bucket shaped flows subject to FIFO multiplexing in tandems of rate-latency nodes. More …
bucket shaped flows subject to FIFO multiplexing in tandems of rate-latency nodes. More …