A finite buffer two class queue with different scheduling and push-out schemes

Abstract

We analyze an M I , M2/G1,G2/1/N queue with different scheduling and push-out scheme in this paper. Our work is motivated by the study of the performance of an output link of ATM switches with two-class priority traffics. The queueing model developed in this paper is more general than that of the output link of ATM switches with two-class priority traffics. We can have general service time distributions for classes 1 and 2, and a general service discipline function, al(z,j), with a l ( i , j ) being the probability that a class 1 packet will be served, given that there are i class 1 and j class 2 packets waiting for service. We obtain an exact solution for loss probabilities for classes 1 and 2, the queue length distribution and the mean waiting time for class 1 and an approximate calculation for the queue length distribution and mean waiting time for class 2. We show that our approximation is an upper bound and the error due to the approximation is very small when the loss probability of class 2 is small (e.g., 5 0.01).

An Application of Stochastic Ordering to the Analysis of the Push-Out Mechanism

“…The first two models allow us to shorten the number of parameters. The third model is the general batch model (with maximum size 3) and we In the first model, we assume that the batch process is represented by d the ratio of high priority cells and by the vector (Pi)i=O, 4 where Pi is the probability that the batch size is i. Each cell of a batch may be a high priority cell following an i.i.d.…”

“…Three different space priority mechanisms (Push-Out, Partial Buffer Sharing and separate route for each class) were considered. Finally, Cheng and Akyildiz [4], have analyzed a M1 , MdG r , GdN queue with different scheduling and Push-Out discipline. They have obtained an exact solution for loss probabilities of both classes.…”

Performance analysis of space–time priority queues

“…Several authors have studied push-out buffers in the absence of time priority. Cheng and Akyildiz [17] and Lee et al [18] consider a push-out buffer with Poisson arrival streams and general service time distributions, while Kapadia et al [19] analyze the multi-server push-out buffer.…”

Numerical methods for analysis of multiflow queuing systems with virtual partition of a common buffer

“…Because of lacking space, we will omit detailing of the results obtained in this area and just mention the studies [3][4][5][6][7][8][9][10], which include an extensive bibliography.…”