The goals of this course are to:
- Introduce the mathematical tools useful for the analysis of discrete-event systems
- Present some stochastic models for both circuit-switched networks and packet-switched networks
- Show through examples how to analyze and to optimize some key network algorithms (e.g., access control, scheduling, buffer management)
- Poisson processes.
- Markov chains. Application to the PageRank algorithm.
- Markov processes. Application to random access control.
- Queuing theory. Application to packet scheduling and buffer management.
- Loss networks. Application to circuit-switched networks.
- Bandwidth sharing. Application to packet-switched networks.
- Load balancing. Application to data centers.
The course includes some lab sessions to simulate some network algorithms and validate the theoretical results.
Requirements: INF557 Introduction to Networking or equivalent is a strong prerequisite.
Evaluation mechanism: Written exam
- Network performance analysis, by Thomas Bonald and Mathieu Feuillet (2011)
- Performance modeling, stochastic networks, and statistical multiplexing, by Ravi Mazumdar (2013)
Language: English (bi-lingual teachers)
- Teaching coordinator: Thomas Clausen
Category: Ingénieur 3A / Master 1