No.: 507.071/507.072, Semester: 6. S[860], Type: Lecture/Practical, Hours/Week: 2 L / 1 P
Lecturer
Ernst Stadlober / Ernst Stadlober
Status of the Course
Optional course of Technical Mathematics
Aims and objectives
To provide an introduction to the basic principles of queueing theory.
The students should be able to use simple queueing models for the design
and analysis of systems.
Teaching method
Problem-oriented presentation supported by examples from different
fields of application. Analyses of case studies with computer aid (Mathlab, Mathematica, Maple).
Contents
Birth- and Death Processes, Markov Chains, Elements of a Queueing System,
M|M-, M|G- and G|M-Systems, Queueing Networks.
Pre-requisites
Probability Theory, Stochastic Processes.
Teaching aids
Allen, A.O. (1990), Statistics and Queueing Theory with Computer Science
Applications, 2nd Ed., Academic Press, Boston.
Gross, D. and Harris, C.M. (1998), Fundamentals of Queueing Theory, 3nd
Ed., John Wiley, New York
Examination method
L: oral , P: case studies including written reports and oral
presentations
There are 4 homeworks with 6 problems each. Each student should solve at least 8 problems.
The homeworks may be presented and discussed at the following days:
| Hw_1.pdf | Wednesday, March 26, 9.00 - 10.30 | SR Statistics 407 |
| Hw_2.pdf | Wednesday, May 7, 9.00 - 10.30 | SR Statistics 407 |
| Hw_3.pdf | Wednesday, May 21, 9.00 - 10.30 | SR Statistics 407 |
| Hw_4.pdf | Wednesday, June 4, 9.00 - 10.30 | SR Statistics 407 |