GENERAL INFORMATION
- Name:
- Communication Networks.
- Degree:
- Telecommunication Engineering. 4th Year. Mandatory. 3+3 credits.
- Professor(s):
- Klaus D. Hackbarth.
Alberto Eloy García Gutiérrez.
- Timetable:
- 1st Semester.
THEORY CLASSES:
Monday (09:30 - 10:30)
Tuesday (10:30 - 11:30)
Wednesday (09:30 - 10:30)
Thursday (10:30 - 11:30)
PRACTICAL CLASSES (3 sessions):
Monday to Friday (15:30 - 17:30)
OBJECTIVES
The objective of the lecture is to introduce in the most important models for telecom and computer networks analysis, design and dimensioning. The student gets an understanding on most important network performance parameters as blocking, loss, delay, jitter etc. under both legacy traffic typically Poisson as modern traffic phenomena happens by internet traffic. The student should get the faculty to use analytical models ranging from Marov up to Semimarkov queuing and loss models and applying them on current and future network architecture.
SYLLABUS
Lesson I: Introduction to the Network Architecture Models.
Introduces the layered model of the OSI/ISO and the functional model of the ITU-T and exposes a resume over the most important network architectures.
Lesson II: Mathematical Models for Stochastic and Combinational Problems.
The second chapter exposes principles mathematical models for stochastic and combinatorial problems. It deduce the discrete and continuous Markov chain with application to source traffic description and the general birth death process and the regenerator formulas in the steady state condition are introduced.
Lesson III: Queueing Systems.
It exposes in more queuing models ranging from M/M/1 M/M/S up M/G/1 for infinite sources and finite source models of M/M/S/M/K+S>M. The Erlang loss model M/G/S/S is introduced and the expanded Erlang loss model for multiple services is deduced and finally the Engset loss model for limited sources.
Lesson IV: Queueing Networks.
The fourth chapter treats queuing networks, the special case of the Jackson network and traffic routing in loss network.
Lesson V: Routing IP.
The fifth chapters introduce into the IP network model and corresponding routing protocols like RIP, OSFP and BGP.
EVALUATION CRITERIA
Doyon: “Systèmes et réseaux de télécomunicación en régime stochastique”; Ed. Masson Paris, 1989
Flood: “Telecommunicactions Switching”; Ed. IEE Press, 1998
Pujolle Gelenbe: “Introduction to Queueing Networks”; Ed. John Wiley&Son, 1998
Kavashima Akimaru: “Teletraffic”; Ed. Springer, 1999
Kleinrock: “Queing systems. Vol I Theory”; John Wiley&Son.
Mina: “Introduction to teletraffic engineering”; Telephony Publishing Corp.
Schwartz: “Telecommunicaction Networks”; Ed. Addison Wesley, 1987
D. McDysan: “QoS & Trafic Management in IP&ATM Networks”; Ed. Mc Graw Hill, 2000
W. Stalling: “High Speed Networks”; Ed. Prentice Hall, 1998
Ross-Kurso: “Redes de Computadores”; Pearson. Ed. Addison Wesley, 2004
MATERIALS
| Tema 1 - Introducción general y modelos para redes |
01/10/2012 |
 |
| Tema 2 - Procesos estocásticos y cadenas de Markov |
01/10/2012 |
|
| Tema 3 - El proceso de Nacimiento y Muerte |
09/10/2012 |
|
| Tema 4 - Introducción a los sistemas de cola. SdC Markov con fuentes infinitas |
19/10/2012 |
|
| Tema 5 - Sistemas de Cola (SdC) de tipo Markov con fuentes finitas |
29/10/2012 |
|
| Tema 6 - Extensiones del modelo M/M/1 |
13/11/2012 |
|
| Tema 7 - Redes de Sistemas de Cola |
25/11/2012 |
|
| Tema 8 - Fórmula de Erlang-B y extnsiones. Redes de sistemas de pérdida |
16/12/2012 |
|
