Toggle navigation
About us
Courses
Contact us
Courses
Electronics & Communication Engineering
Queuing Systems (Web)
Syllabus
Co-ordinated by :
IIT Guwahati
Available from :
2012-04-24
Lec :
1
Modules / Lectures
Introduction
Introduction to Queueing Systems
Analysis of a Simple Queue
Problems-Introduction
Markov Processes and Markov Chains
Basics of Markov Processes and Markov Chains
Markov Chains, Birth-Death Processes, Flow Balance
Problems-Markov Process and Markov Chains
Basics of Queuing(M/M- Type Queues)
Kendall's Notation, Little's Result, PASTA, M/M/1/∞ Queue
M/M/m/∞, M/M/m/m, M/M/1/K Queues, Delay Analysis
Problems-Basics of Queuing
M/M/-/- Type Queues (continued)
Departure Process, Burke's Theorem
Method of Stages, Batch Arrivals
Problems- M/M/-/- Type Queues
M/G/1 Queue
Residual Life Approach
Imbedded Markov Chain Approach
Delay Analysis
Problems-M/G/1 Queue
M/G/1 Queue(Method of Supplementary Variables)
Analysis of M/G/1 queue
Special Cases of the M/G/1 Queue
M/G/1 Queue with Multiple Vacations, Residual Life Approach
M/G/1 Queue with Multiple Vacations Imbedded Markov Chain Approach
M/G/1 Queue with Multiple Vacations, M/G/1 Queue with Exceptional First Service
Problems - Special Cases of the M/G/1 Queue
M/G/1 Queue with Batch Arrivals
Imbedded Markov Chain at Job Departure Instants
Imbedded Markov Chain at Batch Departure Instants
Problems- M/G/1 Queue with Batch Arrivals
Priority Operation of the M/G/1 Queue
Different Types of Priority Operation
Analysis using the Residual Life Approach
Analysis using the Imbedded Markov Chain Approach
Problems-Priority Operation of the M/G/1 Queue
M/G/1/K- Finite Capacity M/G/1 Queue
M/G/1/K Queue (Single Server Queue with Finite Capacity)
Analysis of the M/G/1/K queue
Proportionality Relationship, Alternate Analysis
Problems-M/G/1/K -Finite Capacity M/G/1 Queue
G/M/1, G/G/1, G/G/m and M/G/m/m Queues
Analyzing the G/M/1 Queue
Bounds and approximations for the G/G/1 and G/G/m Queues
Analyzing the M/G/m/m Queue
Queueing Networks: Classification and Basic Concepts
Introduction to Queuing Networks
Classificationof Queueing Networks
Fork-join Queues and Introduction to Blocking in Queueing Networks
Blocking Models in queueing Networks
Open and Closed Networks of M/M/m Type Queues, Jackson's Theorem
Splitting and Combining Poisson Processes
Jackson's Theorem for Open Networks
Product Form Solution for Open Networks
Jackson's Theorem for Closed Networks
Using Jackson's Theorem for Closed Networks
Examples: Analysis of Open and closed Networks
Problems- Open and Closed Networks of M/M/m Type Queues
Analyzing Closed Networks with Convolution and Mean Value Analysis Algorithms
Analysis of Closed Networks
Convolution Algorithm
Examples of analysis using Convolution Algorithm
Mean Value Analysis Algorithm
Examples of Analysis using MVA Algorithm
Problems- Analyzing Closed Networks with Convolution and Mean Value Analysis Algorithms
Norton's Theorem, Mixed Networks, QNA
Norton's Theorem
Mixed Networks, QNA
Problems-Norton's Theorem, Mixed Networks, QNA
Discrete Time Queues
Introduction to Discrete Time Queues
Geo/G/1 Queue-Late Arrival Model
Geo/G/1 Queue- early Arrival Model
Problems-Discrete Time Queues
Simulation of Queueing Systems
Introduction
Simulating a Queueing System
Processing Simulation Results
Web Content
loading...
Module Name
Download