An RG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue

ABSTRACT In this paper, we study a BMAP/M/1 generalized processor-sharing queue. We propose an RG-factorization approach, which can be applied to a wider class of Markovian block-structured processor-sharing queues. We obtain the expressions for both the distribution of the stationary queue length and the Laplace transform of the sojourn time distribution. From these two expressions, we develop an algorithm to compute the mean and variance of the sojourn time approximately.

[1]  David L. Jagerman,et al.  The gi/m/1 processor-sharing queue and its heavy traffic analysis , 1991 .

[2]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[3]  M. Reiman,et al.  FLUID AND HEAVY TRAFFIC DIFFUSION LIMITS FOR A GENERALIZED PROCESSOR SHARING MODEL , 2003 .

[4]  Jens Braband,et al.  Waiting time distributions for M/M/N processor sharing queues , 1994 .

[5]  Edward G. Coffman,et al.  Feedback Queueing Models for Time-Shared Systems , 1968, J. ACM.

[6]  S. Grishechkin.  On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes , 1992, Advances in Applied Probability.

[7]  K. Charles.  Asymptotic approximations for the GI/M/1 queue with processor-sharing service , 1992 .

[8]  Amber L. Puha,et al.  THE FLUID LIMIT OF A HEAVILY LOADED PROCESSOR SHARING QUEUE , 2002 .

[9]  Marcel F. Neuts,et al.  Numerical investigation of a multiserver retrial model , 1990, Queueing Syst. Theory Appl..

[10]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[11]  Alexander N. Dudin,et al.  A retrial BMAP/SM/1 system with linear repeated requests , 1999, Queueing Syst. Theory Appl..

[12]  Winfried K. Grassmann,et al.  Equilibrium distribution of block-structured Markov chains with repeating rows , 1990, Journal of Applied Probability.

[13]  Quan-Lin Li,et al.  THE RG-FACTORIZATION IN BLOCK-STRUCTURED MARKOV RENEWAL PROCESSES , 2004 .

[14]  Winfried K. Grassmann,et al.  Regenerative Analysis and Steady State Distributions for Markov Chains , 1985, Oper. Res..

[15]  V. Ramaswami.  THE SOJOURN TIME IN THE GI/M/1 QUEUE , 1984 .

[16]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[17]  Isi Mitrani,et al.  Sharing a Processor Among Many Job Classes , 1980, JACM.

[18]  Peter G. Taylor,et al.  Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes , 1995 .

[20]  Quan-Lin Li,et al.  A CONSTRUCTIVE METHOD FOR FINDING fl-INVARIANT MEASURES FOR TRANSITION MATRICES OF M=G=1 TYPE , 2002 .

[21]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[22]  Konstantin Avrachenkov,et al.  Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling , 2005, Queueing Syst. Theory Appl..

[23]  Sem C. Borst,et al.  Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows , 2003, Queueing Syst. Theory Appl..

[24]  R. Núñez Queija,et al.  Centrum Voor Wiskunde En Informatica Reportrapport Sojourn times in a Processor Sharing Queue with Service Interruptions Sojourn times in a Processor Sharing Queue with Service Interruptions , 2022 .

[25]  Nikhil Bansal.  Analysis of the M/G/1 processor-sharing queue with bulk arrivals , 2003, Oper. Res. Lett..

[26]  FABRICE GUILLEMIN,et al.  Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory , 2001, Queueing Syst. Theory Appl..

[27]  Jens Braband,et al.  Waiting time distributions for closed M/M/N processor sharing queues , 1995, Queueing Syst. Theory Appl..

[28]  Amber L. Puha,et al.  Invariant states and rates of convergence for a critical fluid model of a processor sharing queue , 2004 .

[29]  H. C. Gromoll.  Diffusion approximation for a processor sharing queue in heavy traffic , 2004, math/0405298.

[30]  R. Núñez Queija,et al.  Processor-Sharing Models for Integrated-Services Networks , 2000 .

[31]  Charles Knessl,et al.  The conditional sojourn time distribution in the GI/M/1 processor-sharing queue in heavy traffic , 1993, Queueing Syst. Theory Appl..

[32]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[33]  Edward G. Coffman,et al.  Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[34]  Michel Mandjes,et al.  Generalized processor sharing queues with heterogeneous traffic classes , 2003, Advances in Applied Probability.

[35]  Leonard Kleinrock,et al.  Time-shared Systems: a theoretical treatment , 1967, JACM.

[36]  C. Knessl,et al.  Conditional sojourn time moments in the finite capacity GI/M/1 queue with processor-sharing service , 1993 .

[37]  Tetsuya Takine,et al.  Sojourn time distribution in a MAP/M/1 processor-sharing queue , 2003, Oper. Res. Lett..

[38]  Sem C. Borst,et al.  A Reduced-Load Equivalence for Generalised Processor Sharing Networks with Long-Tailed Input Flows , 2002, Queueing Syst. Theory Appl..

[39]  Sergei Grishechkin.  GI/G/1 processor sharing queue in heavy traffic , 1994, Advances in Applied Probability.

[40]  S. F. Yashkov,et al.  Processor-sharing queues: Some progress in analysis , 1987, Queueing Syst. Theory Appl..

[41]  Bhaskar Sengupta,et al.  An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue , 1992 .

[42]  Liming Liu,et al.  An Algorithmic Approach for Sensitivity Analysis of Perturbed Quasi-Birth-and-Death Processes , 2004, Queueing Syst. Theory Appl..

[43]  J. W. Cohen.  On processor sharing and random service , 1984 .

[44]  R. Nunez Queija,et al.  Centrum Voor Wiskunde En Informatica Reportrapport Sojourn times in Non-homogeneous Qbd Processes with Processor Sharing Sojourn times in Non-homogeneous Qbd Processes with Processor Sharing , 2022 .

[45]  S. F. Yashkov.  Mathematical problems in the theory of shared-processor systems , 1992 .

[46]  J. W. Cohen,et al.  The multiple phase service network with generalized processor sharing , 1979, Acta Informatica.

[47]  M. Benzi.  A direct projection method for Markov chains , 2004 .

[48]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[49]  T. M. O'Donovan.  Technical Note - Conditional Response Times in M/M/1 Processor-Sharing Models , 1976, Oper. Res..

[50]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[51]  V. Ramaswami.  THE N/G/1 QUEUE AND ITS DETAILED ANALYSIS , 1980 .

[52]  J. Morrison.  Response-Time Distribution for a Processor-Sharing System , 1985 .

[53]  Zhi-Li Zhang,et al.  Large deviations and the generalized processor sharing scheduling for a multiple-queue system , 1998, Queueing Syst. Theory Appl..

[54]  David M. Lucantoni,et al.  The BMAP/G/1 QUEUE: A Tutorial , 1993, Performance/SIGMETRICS Tutorials.

[55]  Kiran M. Rege,et al.  The M/G/1 Processor-Sharing Queue with Bulk Arrivals , 1993, Modelling and Evaluation of ATM Networks.

[56]  Leonard Kleinrock,et al.  The processor-sharing queueing model for time-shared systems with bulk arrivals , 1971, Networks.

[57]  Predrag R. Jelenkovic,et al.  Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue , 2003, Math. Oper. Res..

[58]  B. Sengupta,et al.  A conditional response time of the M/M/1 processor-sharing queue , 1985, AT&T Technical Journal.