1. Home
    Item seperator
  3. Item seperator
    An Analysis of Finite Capacity Queues With Priority Scheduling and Common or Res Reserved Waiting Areas

An Analysis of Finite Capacity Queues With Priority Scheduling and Common or Res Reserved Waiting Areas

New Image

We present an efficient method for computing the steady state probabilities of a finite capacity queue with exponential service, Poisson arrivals, non- preemptive priority scheduling, and common or reserved waiting areas for high and low priority packets. Numerical results are presented for the complete sharing (CS), compete partition (CP), sharing with minimum allocation (SMA), and sharing with maximum queue length (SMXQ) buffer allocation schemes.