A preemptive discrete-time priority buffer system with partial buffer sharing

This paper considers a Geo/Geo/1 discrete-time queue with preemptive priority. Both the arrival and service processes are Bernoulli processes. There are two kinds of customers: low-priority and high-priority customers. The high-priority customers have a preemptive priority over low-priority customers. If the total number of customers is equal or more than the threshold (k), the arrival of low-priority customers will be ignored. Hence the system buffer size is finite only for the low-priority customers. A recursive numerical procedure is developed to find the steady-state probabilities. With the aid of recursive equations, we transform the infinite steady-state departure-epoch equations set to a set of (k + 1) × (k + 2)/2 linear equations set based on the embedded Markov Chain technique. Then, this reduced linear equations set is used to compute the steady-state departure-epoch probabilities. The important performance measures of the system are calculated. Finally, the applicability of the solution procedure is shown by a numerical example and the sensitivity of the performance measures to the changes in system parameters is analyzed.

[1]  Mohan L. Chaudhry,et al.  Discrete-time GeoX/G(a, b)/1/N queues with single and multiple vacations , 2007, Math. Comput. Model..

[2]  Jean-Yves Le Boudec,et al.  An Efficient Solution Method for Markov Models of ATM Links with Loss Priorities , 1991, IEEE J. Sel. Areas Commun..

[3]  U. C. Gupta,et al.  A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/K , 1994, Comput. Oper. Res..

[4]  Wenhui Zhou,et al.  Discrete-time queue with Bernoulli bursty source arrival and generally distributed service times , 2008 .

[5]  Ali Derbala,et al.  Priority queuing in an operating system , 2005, Comput. Oper. Res..

[6]  Fariborz Jolai,et al.  Performance estimation of an email contact center by a finite source discrete time Geo/Geo/1 queue with disasters , 2008, Comput. Ind. Eng..

[7]  Anwar Elwalid,et al.  Fluid models for the analysis and design of statistical multiplexing with loss priorities on multiple classes of bursty traffic , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[8]  Ho Woo Lee,et al.  A queueing model for optimal control of partial buffer sharing in ATM , 1998, Comput. Oper. Res..

[9]  Herwig Bruneel,et al.  Performance analysis of a GI-Geo-1 buffer with a preemptive resume priority scheduling discipline , 2004, Eur. J. Oper. Res..

[10]  Duan-Shin Lee,et al.  Queueing analysis of a threshold based priority scheme for ATM networks , 1993, TNET.

[11]  Donald F. Towsley,et al.  Discrete-Time Models and Analysis Methods , 1994, Perform. Evaluation.

[12]  Naishuo Tian,et al.  The discrete time Geom/Geom/1 queue with multiple working vacations , 2008 .

[13]  Chakib Tadj,et al.  Recursive solution to a quorum queueing system , 2002 .

[14]  Yutae Lee,et al.  Discrete-time GeoX/G/1 que with non-preemptive priority☆ , 2003 .

[15]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

[16]  Horst Tempelmeier,et al.  Supply chain inventory optimization with two customer classes in discrete time , 2006, Eur. J. Oper. Res..

[17]  U. C. Gupta,et al.  Performance analysis of finite buffer discrete-time queue with bulk service , 2002, Comput. Oper. Res..

[18]  Qing Zhao,et al.  Discrete-time Geo/G/1 retrial queue with general retrial times and starting failures , 2007, Math. Comput. Model..

[19]  Yutae Lee.  Discrete-time GeoX/G/1 queue with preemptive resume priority , 2001 .

[20]  Ping Yang,et al.  A unified algorithm for computing the stationary queue length distributions inM(k)/G/1/N and GI/M(k)/1/N queues , 1994, Queueing Syst. Theory Appl..

[21]  Thomas G Robertazzi.  Computer networks and system:qucuing theory and performance evaluation , 2012 .

[22]  Herwig Bruneel,et al.  Performance of discrete-time queueing systems , 1993, Comput. Oper. Res..

[23]  S. H. Lee,et al.  A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM , 1999, Comput. Oper. Res..

[24]  Herwig Bruneel,et al.  Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline , 2002, Perform. Evaluation.

[25]  Seok Ho Chang,et al.  Performance analysis of a finite-buffer discrete-time queue with bulk arrival, bulk service and vacations , 2005, Comput. Oper. Res..