Logo ČVUT
Loading...
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2011/2012

Queuing Theory

The course is not on the list Without time-table
Code Completion Credits Range Language
XD32THO Z,ZK 4 14+4s Czech
The course is a substitute for:
Queuing Theory (D32THO)
Lecturer:
Tutor:
Supervisor:
Department of Telecommunications Engineering
Synopsis:

Queuing theory is able to calculate in advance number of service

links for service with given grade of service GOS. Applications of queuing theory are in telecommunications, computer networks, banks, business, health service and so on - strictly speaking where the service of customers exist.

Besides utilization for dimensioning queuing theory enables determination of the grade of service GOS of a service system which is necessary part of evaluation of a quality of service - QOS.

The course is necessary prerequisite to the course 32DTS- Dimensioning of Telecommunication Networks.

Requirements:

For successful study of the course are necessary basic knowledge of the theory probability and stochastic processes.

Syllabus of lectures:

1. History and development of the queuing theory. Practical utilization

2. Service system (SS), description and classification of SSs

3. Sources, input flow - basic characteristics and terminology, math. description

4. Service processes, output flow. Relations between processes

5. Kendall´s classification. Probabilistic characteristics SS

6. Mathematical models SS, stationary state probabilities of Markovian SS

7. Loss SS - M/M/N - probabilistic characteristics. Applications

8. Loss SS - M(s)/M/N - probabilistic characteristics. Applications

9. Waiting SS - M/M/N/C - probabilistic characteristics

10. Waiting SS with loss - M/M/N/C/FIFO, RANDOM and LIFO. Applications

11. Basic characteristics SS - G/G/N/C, influence of queuing discipline

12. SS with priorities, some specific results

13. Nonmarkovian SS - basic problems, SS - M/D/N,M/Ek/N,M/G/N

14. Simulation of SS - Monte Carlo methods

Syllabus of tutorials:

2. Traffic in telecommunications networks

3. Traffic - examples

4. Traffic flow - basic characteristics

5. Service processes - examples

6. Probability characteristics os service systems (SS)

7. Stacionary Markovian SS

8. Loss SS - M/M/N - examples

9. Loss SS - M(s)/M/N - examples

10. Waiting SS - M/M/N/C - examples

11. Waiting SS with loss - M/M/N/C/FIFO, RAND a LIFO. Examples

12. Waiting SS with loss - M/M/N/C/FIFO, RAND a LIFO. Examples

13. Waiting SS with loss - M/M/N/C/FIFO, RAND a LIFO. Examples

14. SS - M/D/N, M/Ek/N, M/G/N. Examples

15. SS - M/D/N, M/Ek/N, M/G/N. Examples

Study Objective:

The goal is to give adequate overlook about fundamentals of queuing theory and its applications for dimensioning service systems - telecommunications equipment.

Study materials:

1. Gross, D., Harris, C., M. Fundamentals of queuing theory. Third Edition. New York, London: J. Wiley and Sons, 1998.

2. http://www.itu.int/ITU-D/study_groups/SGP_1998-2002/SG2/StudyQuestions/Question_16/RapporteursGroupDocs/teletraffic.pdf Teletraffic Engineering Handbook. Geneva: ITC in cooperation with ITU-D, SG2 Question 16/2, December 2002. 323 s.

3. http://oldwww.com.dtu.dk/education/34340/telenook.pdfTELETRAFFIC ENGINEERING and NETWORK PLANNING Villy B. Iversen

4. http://www.cse.fau.edu/~bob Cooper Robert B. Introduction to Queuing Theory. Second Edition. ISBN 0-444-00379-7

.

Note:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Generated on 2012-7-9
For updated information see http://bilakniha.cvut.cz/en/predmet11650204.html