Es ist eine neuere Version 2025W dieser LV im Curriculum Masterstudium Computational Mathematics 2025W vorhanden.
(*) Leider ist diese Information in Deutsch nicht verfügbar.
Workload
Ausbildungslevel
Studienfachbereich
VerantwortlicheR
Semesterstunden
Anbietende Uni
3 ECTS
B3 - Bachelor 3. Jahr
Mathematik
Dmitry Efrosinin
2 SSt
Johannes Kepler Universität Linz
Detailinformationen
Quellcurriculum
Bachelorstudium Technische Mathematik 2023W
Ziele
(*)We are often faced with waiting in queues in our daily lives before receiving some service. The study of the unpleasant phenomenon of waiting is necessary to reduce queues and waiting times and as a result to improve the quality of service. Queueing system is a system in which customers randomly come to be served. The word "customer" and "serving" are generic terms. The customer can arrive at a system such as bank or supermarket to receive service. In a computer model, the server could correspond e.g. to a CPU that processes customer requests or to a link in a telecommunication system that transmits the data packets and so on. The simplest queueing system consists of one server (called single-server system) that serves customers with respect to a first-come-first-served (FCFS) discipline and a waiting line or queue (ordinary queue) where customers wait before receiving service if they can not be served immediately upon arrival. The simplest queueing system allows an astonishingly large number of variations. There could be more than one server (multi-server system) that could, serve at the same speed (homogeneous servers) or different speeds (heterogeneous servers). The server can fail in some random amount of time (non-reliable server) and it can be switched on/off (removable server). This lecture introduces the basic elements of the queuing theory.
Lehrinhalte
(*)
Introduction to the queueing theory
Some important random processes. Markov chains
Birth-and-death queueing systems
Queueing systems with an infinite population
Queueing systems with a finite population
Transient analysis of queueing systems
Queueing systems with batch arrivals and service
Erlang queueing systems
Semi-Markov queueing systems
Service disciplines in queueing systems
Jackson queueing networks
Gordon-Newell queueing networks
Beurteilungskriterien
(*)Written exam
Lehrmethoden
(*)Slides and blackboard presentation
Abhaltungssprache
English
Literatur
(*)
Lecture notes
L. Kleinrock Queueing systems Volume 1: Theory, John Wiley & Sons, New York 1975
Lehrinhalte wechselnd?
Nein
Frühere Varianten
Decken ebenfalls die Anforderungen des Curriculums ab (von - bis) TM1WCVOBEDI: VO Bedienungstheorie (2005S-2022S)
