Study Guide@lith   Link to LiU Homepage
 

Linköping Institute of Technology

Search

 Link to LiU Homepage
 
Valid for year : 2007
 
NMAC22 Queueing Theory, 6 ECTS credits.
/Köteori/

For:   CS   I   Ii   Mat  

 

Prel. scheduled hours: 44
Rec. self-study hours: 116

  Area of Education: Science

Subject area: Mathematics
  Advancement level (G1, G2, A): A

Aim:
The aim of the course is give a working knowledge of standard queueing models and some of their applications and a description of the underlying theory. By the end of the course, the student is expected to know something of:
  • the theory of Markov Chains; classification of states, ergodicity, time reversibility.
  • Little's formula and its applications.
  • the basic Markov queuing models and situations to which they may be applied.
  • Markovian queueing models (E_r/M/1, M/E_r/1, hyperexponential arrival and hyperexponential service distributions).
  • Networks of queueing systems (Burke's Theorem, Jackson Networks).
  • The Pollaczek-Khinchine formula and its applications
  • M/G/1 systems and priority queueing systems.
  • How to use the GPSS queueing simulation programme.
Prerequisites: (valid for students admitted to programmes within which the course is offered)
TAMS35, TAMS07, NMAB27 or a similar course.

Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshhold requirements for progression within the programme, or corresponding.
Supplementary courses:
TAMS47 Stochastic Processes
Organisation:
The teaching consists of lectures, lessons and obligatory computer exercises.
Course contents:
The Poisson process, Discrete time Markov Chains (with Applications to some queueing problems), Continuous time Markov Chains, classification of states, expected time spent in states, ergodicity, steady state probabilities, time reversibility. Little's Formula, Markov queueing systems: one server, several servers, finite and infinite carrying capacity, Erlang´s formulae, Markovian queuing systems (E_r/M/1, M/E_r/1, hyperexponential arrival and service distributions), networks of queueing systems Burke's theorem, Jackson Networks, M/G/1 systems, Pollaczek - Khinchine formula, priority queueing systems, use of probability generating functions, simulation of queueing systems.
Course literature:
A Compendium containing lecture notes and examples (required). Sheldon Ross, "Introduction to Probability Models" (current edition)(recmmended). Ulf Körner, "Köteori", Studentlitteratur (2003)(recommended).
Examination:
A written examination
Computer exercises
 3,5 p
0,5 p
/
/
5 ECTS
1 ECTS
 


Course language is English/swedish.
Department offering the course: MAI.
Director of Studies: Eva Enqvist
Examiner: John M. Noble

Course Syllabus in Swedish

Linköping Institute of Technology
Link to top of pagep


Contact: TFK , val@tfk.liu.se
Last updated: 02/09/2011