RES 421 A: Performance evaluation and network reliability


Coordinator:  Patrick MAILLE   

Presentation

How should the network be sized (link bandwidth, buffer size, number of servers ...) in order to guarantee quality of service to users? Until now a network such as the Internet was oversized: motorways were being built for an amount of traffic more usually found on a country road. However, Internet now has applications which are much more varied than at the beginning (no longer reserved to data but with video, voice, etc.). These new applications have very different requirements in terms of Quality of Service (time, jitter, loss rate). The current evolution of the Internet is tending to much more precise dimensioning of the network where Quality of Service is adapted to the needs of each customer/application.

The theory of queuing systems provides a mathematical solution to the problem of telecommunication network dimensioning. The course covers the bases of probability and random processes (exponential law, Poisson process, Markov chains ...) necessary to find solutions to problems in network queuing systems and access via classical markovian queuing systems (M/M/1,M/M/1/K,M/M/C/C,M/M/C/infinite,...) as well as some non-markovian queuing systems (M/G/1,G/M/1).

Course work also includes numerous practical application exercises enabling students to gain greater understanding of the theory they have seen in class and its application to a real problem (dimensioning of a GSM/GPRS system).

Duration: 39h


Organization

Scheduled activities

  • C1-C2 (3h)   Protocole de liaison de données, protocole Aloha
  • PC1-PC2 (3h)   TD protocole de liaison de données, TD Aloha
  • C3-C4 (3h)   Introduction files d'attente, chaînes de Markov
  • PC3-PC4 (3h)   Exercices de base sur les chaînes de Markov, Token bucket
  • TP1 (3h)   Simulation d'une M/M/1 en Matlab
  • C5-C6 (3h)   Files Markoviennes
  • C7 (1h30)   Files générales, réseaux de Jackson
  • PC5 (1h30)   File avec loi de service Cox
  • PC6-PC7 (2h30)   MMPP/M/1, Algorithme Google PageRank
  • TP2 (3h)   Performances de GPRS
  • PC8-PC9 (3h)   TD Dimensionnement
  • CC (12h30)   QCM sur le début du module
  • C8-C9 (2h30)   Cours de Fiabilité
  • PC10-PC11 (3h)   TD Fiabilité
  • PC12-PC13 (3h)   Révisions, TD Gestion de l'énergie en GSM

Team


  C1-C2
  3h
  PC1-PC2
  3h
  C3-C4
  3h
  PC3-PC4
  3h
  TP1
  3h
  C5-C6
  3h
  C7
  1h30
  PC5
  1h30
  PC6-PC7
  2h30
  TP2
  3h
  PC8-PC9
  3h
  CC
  12h30
  C8-C9
  2h30
  PC10-PC11
  3h
  PC12-PC13
  3h
 Isabel AMIGO    x             x x x     x x
 Guillaume BONNORON        x x                    
 Patrick MAILLE  x x x x x x x x x x x   x    
 Loutfi NUAYMI                            x x
 Sandrine VATON                               


Recommended reading

B.Baynat, Théorie des Files d'Attente: des chaînes de Markov aux réseaux à forme produit, Hermes, collection Réseaux et Télécommunications.


  Year 2016/2017
Last update: 26-AUG-16
Last validation:

IMT Atlantique
Campus de Brest
Technopôle Brest-Iroise
CS 83818
29238 Brest Cedex 3
France

Tél  +33 (0)2 29 00 11 11
Fax +33 (0)2 29 00 10 00