5.1 Classification of Different Types of Queueing Networks
5.1.1 Open Queueing Networks
5.1.2 Closed Queueing Networks
5.1.3 Mixed Queueing Networks
5.1.4 Multiple Classes of Jobs/Customers
5.1.5 Blocking in a Queueing Network
5.1.6 Product-Form Queueing Networks
5.2 Probabilistic Routing in a Queueing Network
5.3 Open Networks of M/M/m Type Queues and Jackson’s Theorem
5.3.1 Jackson’s Theorem
5.3.2 Some Examples of Jackson Networks
5.4 Extensions to Jackson’s Theorem for other Open Networks
5.4.1 Jackson's Theorem with State Dependent Service Rates at the Queueing Nodes
5.4.2 Queueing Networks with Multiple Customer Classes
5.5 Closed Queueing Networks
5.5.1 Jackson’s Theorem for Closed Networks
5.5.2 Jackson’s Theorem for Closed Networks of Multi-Server Queues
5.6 Convolution Algorithm for finding the Normalisation Constant for a Closed Queueing Network
5.6.1 Network of Single Server Queues
5.6.2 Network of Multi-Server Queues or Network of Queues with State Dependent Service Rates
5.7 Mean Value Analysis (MVA) Algorithm for a Closed Queueing Network
5.7.1 Network of Single Server Queues with Single Traffic Class
5.7.2 Network of Multi-Server Queues with Single Traffic Class
5.7.3 MVA Algorithm for Closed Network with Multiple Traffic Classes
5.8 Analysis of a Sample Closed Network using Convolution and MVA Algorithms
5.8.1 Using the Convolution Algorithm
5.8.2 Using the MVA Algorithm
5.9 Norton’s Theorem for Closed Queueing Networks
Problems