Network Calculus: A Theory of Deterministic Queuing Systems for the Internet

By J. L. Boudec, Patrick Thiran. 2001

1,803 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/5c410022b11bbfef8b7d41dbcb9f42316e12333c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Intra-Vehicle Networks: A Review (2015, methodology): “In [62], Queck provided an analysis of the AVB standard through the application of network calculus [63].”
A Software Defined Networking architecture for the Internet-of-Things (2014, methodology): “Generally, there are two methodologies in analysing QoS in communication networks, one is Queueing Theory [22] and the other is Network Calculus [23].”
A Tutorial on Ultrareliable and Low-Latency Communications in 6G: Integrating Domain Knowledge Into Deep Learning (2021, methodology): “There are two principal tools for analyzing statistical QoS in more general queuing systems, that is, network calculus and effective bandwidth/capacity [150], [151], [163].”
Extreme value theory for the study of probabilistic worst case delays in wireless networks (2016, methodology): “Moreover, Network Calculus is not adapted to dynamic networks: it cannot easily handle load balancing or mobility for instance [4].”
ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping (2012, background): “The complexity of this multidimensional system model prohibits queueing theoretic performance analysis [25].”
Improving smartphone user experience by balancing performance and energy with probabilistic QoS guarantee (2016, background): “The second approach is explored in more detail in [34].”
Throughput-Optimal Topology Design for Cross-Silo Federated Learning (2020, background): “[54] Jean-Yves Le Boudec and Patrick Thiran.”
Energy- and performance-aware mapping for regular NoC architectures (2005, methodology): “For instance, the designer can calculate the bound of packet latency with the specified bandwidth using the techniques presented in [14].”
A general framework for analysing system properties in platform-based embedded system designs (2003, background): “These results are based on generalizing ideas from network calculus as applied to the domain of communication networks (see [2] for details), and hold specifically for infinite event streams that span over time t = −∞ to t = +∞.”
InferLine: latency-aware provisioning and scaling for prediction serving pipelines (2020, background): “The Tuner continuously monitors the current traffic envelope [19] to detect deviations from the planning trace traffic envelope at different timescales simultaneously.”
Stochastic Network Calculus (2008, methodology): “Remark: Similarly, the deterministic result on output burstiness obtained in the literature such as [10] and [5] can be recovered from this theorem.”