Learning objectives
Overview of mathematical tools for performance analysis of telecommunication networks.
Course unit content
Introduction to Telecommunication networks and basic concepts (multiplexing, commutation, multiple access, LAN). Little’s law. Poisson processes. PASTA property. Renewal processes. M/G/1 queue. LAN performance analysis (Ideal controller. TDMA/FDMA. Aloha. Slotted Aloha). WAN performance analysis. Discrete-Time Markov Chains (DTMCs). Geo/geo/1 queue. Geo/geo/1/B queue. Slotted Aloha network. M/G/1 queue. M/G/1/B queue. (Mini)slotted Ethernet network. Absorbent Markov Chains (AMCs). Continous Time Markov Chains (CTMCs). Overview of semi-Markov processes. M/M/1 queue.
IEEE 802.15.4 networks: performance analysis with Markov chain models.
Bibliography
[1] D. P. Bertsekas, R. Gallager, Data networks, 2nd Ed. Prentice Hall, 1992.
[2] J. L. Hammond, P. J.P. O'Reilly, Performance analysis of Local Computer Networks. Addison Wesley, 1986.
[3] A. Leon-Garcia, Probability and random processes for electrical engineering, 2nd Ed. Addison Wesley, 1994.
[4] S. Ross, Stochastic Processes. Wiley, 1983.
[5] A. S. Tanenbaum, Computer Networks, 2nd Ed. Prentice-Hall, 1989.
[6] M. Schwartz, Telecommunication Networks. Addison-Wesley, 1987.
[7] J. G. Kemeny, H. Mirkil, J. L. Snell, G. L. Thompson, Finite mathematical structures. Prentice Hall, 1959.
[8] D. Gross, C. M. Harris, Fundamentals of Queuing Theory. Wiley, 1985.
[9] H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation. Volume III: Discrete-time Systems. North-Holland, Amsterdam, Holland, 1991.
Teaching methods
Direct theory classes (2/3 of the course). Laboratory classes (1/3 of the course) with final project to carry out with Matlab.
Assessment methods and criteria
Intermediate exam on the theoretical part at the end of the first two months. Final project with Matlab.
