Comparison of delay bounds for Ethernet networks based on simple Network Calculus algorithms

This paper gives a simple introduction to Network Calculus (NC), a theory to calculate end-to-end delay bounds for packet-switched communication networks. It illustrates how various networking parameters affect delay bounds when flows are multiplexed. Various algorithms for the calculation of end-to-end delay bounds are revisited and their performance is compared under different conditions. The framework is applicable to feedforward networks and useful to determine delay bounds for flows in Ethernet networks.