Queuing Theory and Applications Detailed Syllabus for Wireless and Mobile Communications M.Tech first year first sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.<\/p>\n
The detailed syllabus for Queuing Theory and Applications M.Tech 2017-2018 (R17) first year first sem is as follows.<\/p>\n
M.Tech. I Year I Sem.<\/p>\n
UNIT – I : <\/strong>Review of probability, Stochastic Processes, random variables, distributions, generating functions; Poisson, Markov, renewal and semi-Markov processes, and Markov Chains, Birth-Death Process<\/p>\n UNIT – II :<\/strong> Basic Queuing Theory:An Introduction to Queues and Queuing Theory ,Characteristics of queuing systems, M\/M\/1 queuing system, Littles law, Reversibility and Burke\u2019s theorem, Markovian and nonMarkovian queuing systems, embedded Markov chain applications to M\/G\/1, G\/M\/1 and related queuing systems;<\/p>\n UNIT – III :<\/strong> Queuing Networks: Fundamentals of Queuing Networks, Networks of queues, Open and Closed Queuing Networks, Open Networks of M\/M\/m type queues and Jackson\u2019s Theorem, MVA and Convolution Algorithm for Closed Networks, Approximate Models for Open and Closed Queuing Networks, Queues with vacations, priority queues, queues with modulated arrival process,<\/p>\n UNIT – IV : Discrete time queuing Systems:<\/strong> Introduction, Discrete time queuing systems, discrete time arrival process, Geome\/Geom\/m\/N queuing system, Queuing on a Space division packet switch, Queuing on a single buffered banyan network<\/p>\n UNIT – V : Network traffic Modeling:<\/strong> Introduction, Continuous time models, discrete time Models Solution methods, Burstiness, self similar traffic<\/p>\n TEXT BOOKS:<\/strong><\/p>\n REFERENCE BOOKS:<\/strong><\/p>\n\n
\n