Page 33 - REC :: M.E. CSE Curriculum and Syllabus - R2019
P. 33

CP19P13                QUEUING THEORY AND MODELING                     Category   L  T  P  C
                                                                                           PE      3   0   0  3


               Objectives:
                     To provide the required mathematical support in real life problems and develop probabilistic models which can
                ⚫
                     be used in several areas of science and engineering.
                     To analyze the performance of various designs in computer systems and networks.
                ⚫
                     To understand and characterize phenomenon which evolve with respect to time in a probabilistic manner
                ⚫

               UNIT-I     RANDOM VARIABLES                                                                 9
               Discrete  and  continuous  random  variables  –  Moments  –  Moment  generating  functions  –  Binomial,  Poisson,
               Geometric, Uniform, Exponential, Gamma and Normal distributions.

               UNIT-II    TWO – DIMENSIONAL RANDOM VARIABLES                                               9
               Joint  distributions  –  Marginal  and  conditional  distributions  –  Covariance  –  Correlation  and  Linear  regression  –
               Transformation of random variables.

               UNIT-III   QUEUEING MODELS                                                                  9
               Poisson Process–Markovian Queues–Single and Multi-server Models–Little’s formula–Machine Interference Model–
               Steady State analysis –Self Service Queue.

               UNIT-IV    ADVANCED QUEUEING MODEL                                                          9
               Non- Markovian Queues – Pollaczek  Khintchine Formula – Queues in Series – Open Queueing Networks –Closed Queueing
               networks.

               UNIT-V     NETWORK MODELS                                                                   9
               Network Construction- computation of earliest start time, latest start time, Total, free  and  independent float time- Computation
               of optimistic, most likely Pessimistic and expected time.

                                                                                   Total Contact Hours   :  45


               Course Outcomes:
               Upon completion of the course, students will be able to
                ⚫    Have a fundamental Knowledge of the probability concepts.
                ⚫    Get exposed to the testing of hypothesis using distributions
                ⚫    Acquire skills in analyzing queuing models.
                ⚫    Gain strong knowledge in principles of Queuing theory
                ⚫    Get exposed to Network Models

               Reference Books(s) / Web links:
                1   Ibe. O.C., “Fundamentals of Applied Probability and Random Processes”, Elsevier, 1st Indian Reprint, 2007.
                2   Gross. D. and Harris. C.M., “Fundamentals of Queueing Theory”, Wiley Student edition, 2004.
                3   Nita H.Shah., Ravi M. Gor and Hardik Soni, “Operations Research”, Prentice Hall India, 2008
                4   Donald Gross and Carl M. Harris, “Fundamentals of Queueing theory”, 3rd edition, John Wiley and Sons, 2011.
                    Robertazzi, “Computer Networks and Systems: Queueing Theory and Performance Evaluation”, 3rd Edition,
                5
                    Springer, 2006.
                    Hwei Hsu, “Schaum’s Outline of Theory and Problems of Probability, Random Variables and Random
                6
                    Processes”, Tata McGraw Hill Edition, New Delhi, 2004.
                7   Taha. H.A., “Operations Research”, 8th Edition, Pearson Education, Asia, 2007
   28   29   30   31   32   33   34   35   36   37   38