Theory of queuing. Module 1. Module 2.

Course: System Analysis

Structural unit: Faculty of Computer Science and Cybernetics

Title
Theory of queuing. Module 1. Module 2.
Code
Module type
Вибіркова дисципліна для ОП
Educational cycle
First
Year of study when the component is delivered
2023/2024
Semester/trimester when the component is delivered
6 Semester
Number of ECTS credits allocated
5
Learning outcomes
Know and understand the main sections and tasks of queuing theory, principles of analysis and modeling of queuing systems. Be able to model queuing systems, find a stationary distribution of Markov-type systems, solve optimization problems for systems with repeated calls. Demonstrate the ability to self-study and continue professional development. Be able to organize their own activities and get results within a limited time. Demonstrate skills of interaction with other people, ability to work in teams.
Form of study
Full-time form
Prerequisites and co-requisites
Know: basics of mathematical analysis, algebra, probability theory, mathematical statistics Be able to: formalize tasks and compile algorithms for the implementation of tasks Have basic skills: working with stochastic objects
Course content
The discipline "Methods and algorithms of queuing theory" is part of the educational and professional training program for the first (bachelor's) level of higher education in the field of knowledge 12 "Information Technology" in 124 "System Analysis", educational and professional program "System Analysis". and considers methods of analysis of queuing systems: the theory of birth and death processes, the method of Erlang stages, nested Kendall chains, the method of catastrophes. The main stages of the implementation of the theory to the solution of applied problems are considered on the examples of specific technical systems. This discipline is elective discipline in the program "Systems Analysis". It is taught in the 6th semester in the amount of 150 hours. (5 ECTS credits) in particular: lectures - 34 hours, seminars - 34 hours, consultations - 2 hours, independent work - 80 hours. The course includes 2 substantive parts and 2 tests. The discipline ends with a test.
Recommended or required reading and other learning resources/tools
1. BV Gnedenko, IN Kovalenko "Introduction to the theory of queuing", Ed. 3rd, ref. et al., KomKniga, 2005, 400 p. 2. В.А. Ivnitsky "Theory of queuing networks", ed. physical and mathematical Literature, 2004. - 772 p. 3. E.O. Lebedev, IA Makushenko "Optimal distribution of external load for multichannel stochastic networks. Tutorial". - К .: НБУВ, 2012. - 90 с. 4. Є.О. Lebedev, GV Livinska “Congested multi-channel networks with variable input intensity. Textbook ”, VPC“ Kyiv University ”, 2016, 120 p. 5. J.R. Artalejo, A. Gomez-Corral “Retrial Queueing Systems. A Computational Approach ”, Springer, Verlag Berlin Heidelberg, 2008, 317 p. 6. В.В. Anisimov “Switching Processes in Queueing Models”, John Wiley & Sons, 2008, 345 p. 7. LS Globa "Mathematical foundations of information and telecommunications systems. Teaching manual. ”, K .: Norita-plus, 2007. - 360 p.
Planned learning activities and teaching methods
Lectures, seminars
Assessment methods and criteria
Current assessment, control work, credit
Language of instruction
Ukrainian

Lecturers

This discipline is taught by the following teachers

Departments

The following departments are involved in teaching the above discipline