1. Queuing Networks

2. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need not be people  parts, vehicles, machines, jobs. 2.Queue might not be a physical line  customers on hold, jobs waiting to be printed, planes circling airport.

3. 3 Definition of queueing networks A queueing network is a system composed of several interconnected stations, each with a queue. Customers, upon the completion of their service at a station, moves to another station for additional service or leave the system according some routing rules (deterministic or probabilitic).

4. Queuing Networks In many applications, an arrival has to pass through a series of queues arranged in a network structure.

5. 5 Open network or closed network Open network Closed network N customers

6. 6 A production line Raw parts Finished parts

7. Jackson Network Definition 1.All outside arrivals to each queuing station in the network must follow a Poisson process. 2.All service times must be exponentially distributed. 3.All queues must have unlimited capacity. 4.When a job leaves one station, the probability that it will go to another station is independent of its past history and is independent of the location of any other job. In essence, a Jackson network is a collection of connected M / M / s queues with known parameters.

8. Jackson’s Theorem 1.Each node is an independent queuing system with Poisson input determined by partitioning, merging and tandem queuing example. 2.Each node can be analyzed separately using M / M /1 or M / M / s model. 3.Mean delays at each node can be added to determine mean system (network) delays.

9. 9 Open Jackson Network An open Jackson network (1957) is characterized by: One single class of customers A Poisson arrival process at rate equivalent to independent external Poisson arrival at each station) One server at each station Exponentially distributed service time with rate  i at station i Unlimited capacity at each queue FIFO service discipline at all queues Probabilistic routing

10. 10 Open Jackson Network routing p ij (i ≠0 and j≠ 0) : probability of moving to station j after service at station i p 0i : probability of an arriving customer joining station i p i0 : probability of a customer leaving the system after service at station i

11. 11 Open Jackson Network stability condition Let i be the customer arrival rate at station i, for i = 1,..., M where M is the number of stations. The system is stable if all stations are stable, i.e. i <  i,  i = 1,..., M Consider also e i the average number of visits to station i for each arriving customer: e i = i /

12. 12 Open Jackson Network arrival rate at each station These arrival rates can be determine by the following system of flow balance equations which has a unique solution.

13. 13 Open Jackson Network Are arrivals to stations Poisson? as the departure process of M/M/1 queue is Poisson. Feedback keeps memory.

14. 14 Closed Queuing Network Definition Similar to Jackson network but with a finite population of N customers without extern arrivals. As a result,  = 0

15. 15 Closed Queuing Network Arrival rates The arrival rates i satisfy the following flow balance equations Unfortunately, the above system of flow balance equations has one free variable.