Worst-Case Analysis of Distributed Systems (WoCADS)
Organization
The course takes place during this winter semester and is organized through
OLAT.
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)
