Queueing Theory (MAE634): Διαφορά μεταξύ των αναθεωρήσεων
| Γραμμή 39: | Γραμμή 39: | ||
|- | |- | ||
! Prerequisite Courses | ! Prerequisite Courses | ||
| | | It is desirable to have an elementary knowledge of probability theory and Markov chains. | ||
|- | |- | ||
! Language of Instruction and Examinations | ! Language of Instruction and Examinations | ||
Αναθεώρηση της 23:47, 16 Ιανουαρίου 2025
- Ελληνική Έκδοση
- Undergraduate Courses Outlines
- Outline Modification (available only for faculty members)
- Department of Mathematics
- Save as PDF or Print (to save as PDF, pick the corresponding option from the list of printers, located in the window which will popup)
General
| School |
School of Science |
|---|---|
| Academic Unit |
Department of Mathematics |
| Level of Studies |
Undergraduate |
| Course Code |
MAE634 |
| Semester |
6 |
| Course Title |
Queueing Theory |
| Independent Teaching Activities |
Lectures (Weekly Teaching Hours: 3, Credits: 6) |
| Course Type |
Special Background |
| Prerequisite Courses | It is desirable to have an elementary knowledge of probability theory and Markov chains. |
| Language of Instruction and Examinations |
Greek |
| Is the Course Offered to Erasmus Students |
Yes |
| Course Website (URL) | See eCourse, the Learning Management System maintained by the University of Ioannina. |
Learning Outcomes
| Learning outcomes |
Queuing phenomena are encountered in several real-life situations. Prominent examples are service counters, elevators and traffic networks, but queuing effects also arise in supply chains, production systems and communication networks. In this course you will learn basic mathematical models for analyzing congestion effects in terms of queue lengths and waiting times. You will also develop insight into the applications of such approaches for improving the design and performance of service operations. The course aims to enable students to:
At the end of the course, the student will be able to:
|
|---|---|
| General Competences |
|
Syllabus
Introduction, modelling examples, basic concepts, Kendall’s notation, Review of the basic stochastic processes (Poisson process, birth-death processes), Queueing notation and basics, Littles law, mean value analysis. Simple Markovian systems: M/M/1, M/M/c and extensions. General Markovian systems: Queues with batch arrivals and services, Non-Markovian systems: Erlang queues, M/G/1, G/M/1. Markovian networks: Jackson networks. Priority systems.
Teaching and Learning Methods - Evaluation
| Delivery |
Face-to-face | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Use of Information and Communications Technology | -
Software for the calculation of queueing systems performance measures, Email, class web | ||||||||||
| Teaching Methods |
| ||||||||||
| Student Performance Evaluation |
LANGUAGE OF EVALUATION: Greek
|
Attached Bibliography
See the official Eudoxus site or the local repository of Eudoxus lists per academic year, which is maintained by the Department of Mathematics. Books and other resources, not provided by Eudoxus:
- Handouts and slides. Selected topics from the resources given below:
- Adan, I., Resing, J.. Queueing Theory. Eindhoven. Notes available online https://www.win.tue.nl/jadan/queueing.pdf , 2001.
- Adan, I., van Leeuwaarden, J., Selen, J., Analysis of structured Markov processes, 2017 (Online https://arxiv.org/pdf/1709.09060.pdf).
- Kleinrock, L. Queueing Systems, Vol. I: Theory. Wiley, New York, 1975.
- V.G. Kulkarni. Introduction to Modeling and Analysis of Stochastic Systems Second Edition, Springer, 2011.
- J. Medhi. Stochastic Models in Queueing Theory, Academic Press, New York, 2003.
- P. Phuoc Tran-Gia, T. Hosfeld. Performance Modeling and Analysis of Communication Networks, 2017. (Available online in https://opus.bibliothek.uni-wuerzburg.de/opus4-wuerzburg/frontdoor/deliver/index/docId/24192/file/978-3-95826-153-2_Tran-Gia_Hossfeld_OPUS_24192.pdf)
- Ross, S.. Introduction to Probability Models, Academic Press, New York, 12th Ed. 2019.