TELCOM 2130: Queueing Theory

Fall  2011

Development and application of the mathematical techniques used for analyzing the performance of communication systems and networks.  Topics include:  Markov Processes and Chains,  Markovian queues, Phase type queues, , M/G/1, G/M/1, queueing networks approximation techniques, non stationary queues.


Prerequisites: Probability, Statistics and Stochastic Processes

 

1. Instructor: Dr. David Tipper,  Associate Professor of  Telecommunications
                         Office:  715  IS Building
                         Phone: (412) 624-9421
                         Email: dtipper@mail.sis.pitt.edu
                         Web page: http://www.sis.pitt.edu/~dtipper/tipper.html
                         Office hours: Thursday: 2:30  - 4:00 p.m,   or by appointment

 

2. GSA:         Le Tri Anh
                       Office: SIS 821
                       Email:  alt13@pitt.edu
                       Office hours:       


                      

3.Textbook:   System Modeling and Analysis: Foundations of System Performance Evaluation, H. Kobayashi and B. Mark,  2008.

 

4. References

                          Performance Analysis of Communications Networks and Systems, P. Van Mieghem, 2009.

                          Fundamentals of Queueing Theory, 4th edition,  D. Gross,  J. Shortle, J. Thompson, and C. Harris,   2008.    

                          Stochastic Modeling and the Theory of Queues, R. W., Wollf, 1998 

                          Queueing Systems, Theory, Volumes I and II,   L. Kleinrock , 1976

                          Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications,  G. Bolch,

                                S. Greiner, H. de Meer, and K. Trivedi, 2006

                           Queueing Modelling Fundamentals: With Applications in Communication Networks, C. Ng and S. Boon-Hee, 2008

                           Queueing Theory with Applications to Packet Telecommunication,  J. Daigle, 2004.

                           ITU Teletraffic Engineering and Network Planning

 

5.  Course Outline

 

6. Grading:  Homework                            25%

                        Midterm                                20%
                        Project                                   30%
                        Exam                                     25% 

 

7. Policies

  • All work must be the student's own unless collaboration is explicitly permitted
  • Late assignments will not be accepted unless there are exceptional circumstances.
  • Homework is due ONE week after it is assigned unless otherwise mentioned.
  • Homework and reading will be assigned every week unless otherwise mentioned.
  • Keep checking the web page for other changes regularly
  • All written work must be legible and clear to receive credit.