Network Calculus: A Comprehensive Guide

Network calculus is a mathematical framework allowing to analyze the worst-case performance of communication networks. As high performance is the goal of any communication network, we believe that the theory is a very useful tool for network researchers and engineers. However, because it relies on non-traditional algebras, namely the min-plus and max-plus algebras, researchers and engineers are usually reluctant to use network calculus or use it in a non-optimal or wrong way. Therefore, as an objective to make it more understandable and usable by the community, this document tries to present major results of network calculus in a comprehensive way. Proofs and detailed developments are intentionally omitted. We do not pretend to present any new result. Each statement is accompanied by a pointer to a proof or to a more detailed explanation for it. The goal of this document is to provide researchers and engineers with a comprehensive guide they can use as a reference to properly apply network calculus to their specific application. Hoping for the best but expecting the worst

[1]  R. A. Rosenbaum,et al.  Sub-additive functions , 1950 .

[2]  Eric Thierry,et al.  Service curves in Network Calculus: dos and don'ts , 2009 .

[3]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[4]  Florin Ciucu,et al.  A network service curve approach for the stochastic analysis of networks , 2005, SIGMETRICS '05.

[5]  A. Floren,et al.  ' " ' " ' " . " ' " " " " " ' " ' " " " " " : ' " 1 , 2001 .

[6]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[7]  Markus Fidler,et al.  WLC15-2: A Network Calculus Approach to Probabilistic Quality of Service Analysis of Fading Channels , 2006, IEEE Globecom 2006.

[8]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[9]  Jim Kurose,et al.  Computer Networking: A Top-Down Approach , 1999 .

[10]  Ralf Steinmetz,et al.  Per-flow guarantees under class-based priority queueing , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  A. Bruckner,et al.  SOME FUNCTION CLASSES RELATED TO THE CLASS OF CONVEX FUNCTIONS , 1962 .

[12]  Cheng-Shang Chang.  Performance Guarantees in Communication Networks , 2000, Telecommunication Networks and Computer Systems.

[13]  David Tall,et al.  Complex Analysis: The Hitchhiker's Guide to the Plane , 1983 .

[14]  Yuming Jiang.  A basic stochastic network calculus , 2006, SIGCOMM 2006.

[15]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[16]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1995, Multimedia Systems.

[17]  A. E. Eckberg,et al.  AN APPROACH TO CONTROLLING CONGESTION IN ATM NETWORKS , 1990 .

[18]  Roch Guérin,et al.  Efficient network QoS provisioning based on per node traffic shaping , 1996, TNET.