Infopaket

Stochastic models of applied mathematics.

ДВС.3.05

Вибіркова дисципліна для ОП

First

2022/2023

7 Semester

4

PLO21.3. Understand the fundamental areas of mathematics and computer science, to the extent necessary for learning mathematical disciplines, applied disciplines and using their methods in a chosen profession. PLO22.3. Understand the main areas of mathematical logic, theory of algorithms and computational theory, programming theory, probability theory and mathematical statistics. PLO23.3. Be able to use professional knowledge, skills and abilities in the field of fundamental sections of mathematics and computer science for research of real processes of different nature. PLO24.3. Be able to independently analyze the relevant subject area, be able to develop mathematical and structural algorithmic models.

Full-time form

To successfully learn the discipline “ Stochastic models of applied mathematics. Queueing theory” the students should satisfy the following requirements. They know (a) fundamentals of mathematical methods for construction, verification and investigation of qualitative characteristics of deterministic and stochastic mathematical models; (b) classical methods of Calculus, Algebra and Probability Theory. They can (a) investigate qualitative characteristics of available mathematical models; (b) apply classical methods for solving applied problems in deterministic and stochastic models. They should be able to (a) apply classical methods of Calculus and Probability Theory; (b) seek information in open sources and properly analyze it.

Characteristics of queueing systems. Kendall's notation of queueing systems. Performance measures. Poisson flow. Characteristic property of exponential distribution. Birth-and-death processes. The simplest Markov models of queueing systems: M/M/1/∞, M/M/n/∞, and their stationary characteristics. Priority systems. System M/G/1. The virtual waiting time. The busy period. System G/G/1. Lindley's equation.

2. János Sztrik. Basic Queueing Theory. 2016. – 193 p. 3. Moshe Haviv. Queues - –A Course in Queueing Theory. Solution Manual 2015. – 89 p. 4. Cooper, R. Introduction to Queueing Theory, 3-rd Edition. CEE Press, Washington, 1990. – 361 p. 5. Ivo Adan and Jacques Resing. Queueing Theory. 2015. 180 pp. 6. http://web2.uwindsor.ca/math/hlynka/qonline.html. 2016. 7. Gross, D., Shortle, J., Thompson, J., and Harris, C. Fundamentals of queueing theory, 5th edition. John Wiley & Sons, New York, 2018. – 556 p.

Lectures, seminars, consultations, test works, independent work.

Intermediate assesement: The maximal number of available points is 60. Test work no. 1: 30/18 points. Test work no. 2: 30/18 points. Final assessment (in the form of exam): The maximal number of available points is 40. The form of exam: writing. The types of assignments are 4 writing assignments (2 theoretical and 2 practical).

Ukrainian