DEPARTMENT OF MATHEMATICS

MAL 740 (Queueing Networks for Computer and Communication Systems) 4 Credits (3-0-2)

INFORMATION SHEET

Stochastic processes, classifications, discrete and continuous time Markov chains, Poisson processes, renewal processes, Little's formula

Erlangs loss system ((M/M/m/m-queue), finite source population, M/M/1-queue; M/M/m-queue, multidimensional queues

M/G/1-queue, GI/M/1-queue, GI/G/1-queue, bulk queues, priority queues

Open (Jacksons) queueing networks; closed queueing networks, mean value analysis (MVA), time reversibility, Burk's theorem

Solution techniques, steady state and transient analysis, Stochastic Petri nets, discrete event simulation, performance measures

Applications of above queueing systems in availability, reliability, computer systems, communication systems such as wired, wireless and mobile ad hoc networks.

TEXT BOOKS

1. Kishor S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications, 2^nd Edition, John Wiley & Sons, New York, 2002.

2. Gunter Bolch, Stefan Greiner, Hermann de Meer and Kishor S. Trivedi ,Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications, 2^nd Edition, John Wiley & Sons, New York, 2006.

REFERENCE BOOKS

2. Donald Gross, and Carl M. Harris, Fundamentals of Queueing Theory. 3^rd Edition, John Wiley & Sons, New York, 1998.

3. Sheldon M Ross, Introduction to Probability Models, 7^th/8^th Edition, Academic Press, 2002.