Queuing Theory

The course is not on the list Without time-table

Code	Completion	Credits	Range
11QUE-E	Z,ZK	4	2+2

Garant předmětu:

Lecturer:

Tutor:

Supervisor:

Department of Applied Mathematics

Synopsis:

Basic principles of stochastic processes, simulation techniques and elementary analytical methods for investigation of queueing systems.

Requirements:

Linear algebra, graph theory, PT Petri net, fundamentals of mathematical statistics, use of MATLAB or C++ programming language.

Syllabus of lectures:

Discrete event process, definition, random distribution, and probability. Basic processes, process of revitalisation. Markov process, Markov models, Kendall classification, model M/M/1, models M/M/n. Non-markovian models, model M/C/n, models G/G/n. Models with continuous flow. Service net, examples of Petri net. Computer simulation.

Syllabus of tutorials:

Study Objective:

Study materials:

Bacceli F., Brémaud P.: Elements of Queuing Theory, Springer - Verlag, Applications of Mathematics 26, 1994,

Kleinrock L.: Queuing Systems. orig. John Wiley ?Sons, ruský překlad Moskva, 1979,

Kulvánek P., Brandalík F.: Operační analýza 1, Teorie hromadné obsluhy, Alfa

Note:

Further information:

http://www.fd.cvut.cz/department/k611/PEDAGOG/THO_A/K611THO_A.html

No time-table has been prepared for this course

The course is a part of the following study plans: