Network Optimization and Quality of Service

Course Code : IR393

Time Hours : Semester 3, 18h (course)

Time Periods : not available yet

Lecturers :

  • Hassine Moungla, Assistant Professor, hassine.moungla[at]
  • Jocelyne Elias, Assistant Professor, jocelyne.elias[at]


This course will present and discuss the fundamentals of quality of service and optimization in telecommunications networks. The first part of the course presents the concepts of (1) Quality of Service (QoS), (2) Management and service-oriented architectures. This course provides the foundation for understanding the QoS and networks management mechanisms. The importance of the fundamental of the performance study for computer networks will be argued, especially in association with the notion of QoS (Quality of Service).

The second part of the course will present the state of the art of basic ways for analytical decision-making with multiple interacting agents. This part will focus on classical mathematical models derived from Game Theory and will highlight the critical aspects of applying such models to telecommunications networks (wireless networks, wireless sensor networks …). Then, techniques for network planning, management and simulation will be presented, and several mathematical models for the planning and maintenance of networks will be studied.

Acquired Skills

The students will learn the general network functions and its quality of service, the principle of its quantification and its control methods (based on practical experience), their organization overall, and a rough idea of some aspects of their implementation.


  • QoS objectives and parameters in networks
  • Actions Plan of QoS treatment (Processing at Level 2 and 3)
  • Tools traffic conditioning, processing queues and congestion treatment
  • QoS in IntServ and DiffServ architectures
  • Settings network performance : vocabulary and metrics of network design, impact of protocols, packet size, segmentation, flow control, etc. … ; impact applications, classification of applications according to their network requirements
  • Various control mechanisms
  • Traffic monitoring and policies queues management
  • Introduction to Game Theory : examples (Prisoner’s dilemma), Nash equilibrium concept, non-cooperative games (dominance, mixed strategies …) and cooperative games.
  • Application of Game Theory to telecommunications networks : network formation and resource allocation games (fully distributed approaches).
  • Introduction to Optimization : linear and integer programming.
  • Mathematical models for the network design problem.
  • Exercises : Introduction to the use of AMPL and Neos/Cplex, and practical examples of network planning.


  • Quality of service over IP – J.L. Mélin – Eyrolles
  • J. C. C. McKinsey. Introduction to the theory of games
  • Michal Pioro, Deepankar Medhi. Routing, Flow, and Capacity Design in Communication and Computer Networks (Morgan Kaufmann).
  • R. K.Ahuja, T. L. Magnanti, J. B. Orlin. Network flows. Theory, algorithms, and applications (Prentice Hall, 1993). D. Bertsimas, J. Tsitsiklis. Introduction to linear optimization (Athena Scientific, 1996).
  • Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani. Algorithmic Game Theory (Cambridge University Press)