Worst-Case Analysis of Distributed Systems (WoCADS)
Organization
The next iteration of this course is TBD.
Course Overview
The contents of this lecture revolve around the Deterministic Network Calculus (DNC). The DNC is a framework for conducting performance modeling and analyses of complex distributed systems. Contents include
- Abstraction of arrival and departure processes
- Calculation of performance guarantees in distributed systems
- End-to-end analysis
- Network analysis
- Server dimensioning of planned systems
Literature
- Jean-Yves Le Boudec, Patrick Thiran. Network Calculus. Springer, 2001. (available online)
- Cheng-Shang Chang, Performance Guarantees in Communication Networks. Springer, 2000.
- Anne Bouillard, Marc Boyer, and Euriell Le Corronc. Deterministic Network Calculus: From Theory to Practical Implementation. John Wiley & Sons, 2018.
- Jörg Liebeherr. Duality of the Max-Plus and Min-Plus Network Calculus. Foundations and Trends® in Networking 11, 2017. (available online)
Tools
We use the following tools for modeling and analyzing systems using Network Calculus in the exercises: