Code
IGFE NET 7333
Niveau
MSc
Graduate
PostGraduate
Domaine
Réseaux
Programme
Master of Science
Langue
Anglais/English
Crédits ECTS
2,5
Heures programmées
21
Organisation
Cours/TD/TP/projet/examen :Acquis d'apprentissage
Technical issues underlying a design of network infrastructure and protocols are formulated as their theoretical models. An algorithmic approach to be used to solve these modeling problems has to be based upon their theoretical analysis. The course presents commonly used problem models as graph coloring, Steiner tree, packing, partitioning, etc. together with their complexity analysis. It introduces the algorithmic approaches recommended: greedy, flow, random, Monte-Carlo etc. Algorithms are given in their technological context, i.e. taking into account computing time, signaling overhead, CAPEX/OPEX, resource availability, etc.
Prérequis
Foundations of the graph theory