A short tutorial on network calculus. I. Fundamental bounds in communication networks

Network calculus is a collection of results based on MinPlus algebra, which applies to deterministic queuing systems found in communication networks. It can be used, for example, to understand the computations for delays used in the IETF guaranteed service, why re-shaping delays can be ignored in shapers or spacer-controllers, a common model for schedulers, etc. This short tutorial presents the basic results of network calculus and their application to some fundamental performance bounds in communication networks