Queueing networks with finite capacity queues

• Queueing network models to represent

  • sharing of resources with finite capacity queues
  • population constraints
  • synchronization constraints

• finite capacity of the queue

  • n = number of customers in the service center
  • B = finite capacity

    
    
    
    
    
    blocking _ dependence
    Deadlock
    
    Solution Methods : exact vs approximate simulation

• various blocking types:

  • different behaviors of customer arrivals at a full node and of servers' activity

Previous slide

Next slide

Back to first slide

View graphic version