Determining end-to-end delays using network calculus

The a priori determination of temporal behavior is an essential requirement on the design of distributed real-time systems. It is shown how the analytical method Network Calculus can be applied to find hard upper bounds for transaction times in switched Ethernet networks. The analytical results are validated by simulation for an example scenario and the differences are discussed.