Network calculus
Network calculus is "a set of mathematical results which give insights into man-made systems such as concurrent programs, digital circuits and communication networks." Network calculus gives a theoretical framework for analysing performance guarantees in computer networks. As traffic flows through a network it is subject to constraints imposed by the system components, for example:
data link capacity traffic shapers (leaky buckets) congestion control background traffic These constraints can be expressed and analysed with network calculus methods. Constraint curves can be combined using convolution under min-plus algebra. Network calculus can also be used to express traffic arrival and departure functions as well as service curves. The calculus uses "alternate algebras ... to transform complex non-linear network systems into analytically tractable linear systems." Currently, there exists two branches in network calculus: one handling deterministic bounded, and one handling stochastic bounds.
Wikipedia contributors, "Network calculus", Wikipedia, revision 1385908651, retrieved 20 November 2026, source, CC BY-SA 4.0.