Number of hours
- Lectures 16.5
- Tutorials 16.5
- Laboratory works 18.0
ECTS
ECTS 2.5
Goal(s)
Random processes are basic tools for modeling communication networks and computer systems for their design. They allow on one hand to understand the phenomena of heavy/low traffic and on the other hand to develop management policies (protocols, allocation, optimization...)
The purpose of this course is to lead to:
- Know how to model a computer system using Markov processes;
- Be able to analyze the behavior of random processes using
formal methods or simulations; - Be able to analyze the behavior of classic protocols of communication.
Content(s)
1. Modeling of computer systems and performance evaluation;
2. Basic tools in probability;
3. Fundamentals of Performance Evaluation;
4. Markov chains : automata and probabilities;
5. Poisson process : Quality of service, traffic models and loss analysis;
6. Reversibility, Markov algorithm : contention and network of queueing systems
7. Robustness of Markov models.
Prerequisites
Applied Probability and Statistical Principles and Methods (1rst year Ensimag).
1st session : Written exam 3h
<br>
2nd session : Written exam 2h
N1=E1
N2=E2
O. François : Notes de Cours de Probabilités Ensimag 1ère année.
O. Gaudoin : Principe et Méthode Statistique Ensimag 2ème année.
S.M. Ross : Probability Models for Computer Science, Academic Press, 2001.
Cours de Gérard Hébuterne à l'INT
Le livre de Jean-Yves Le Boudec en évaluation de performances
Orienté évaluation de performances (pratique)
P.Brémaud Markov Chains, Gibbs Fields, Monte Carlo Simulation and Queues, Springer 1999.
J. Banks, J. S. Carson II, B. L. Nelson et D. M. Nicol, Discrete-Event System Simulation, Pearson 2010
R. Jain, The Art of Computer Systems Performance Analysis Techniques for Experimental Design, Measurement, Simulation, and Modeling, Wiley 1991