Batch processor sharing with hyper-exponential service time

We study the Processor Sharing queueing model with a hyper-exponential service time distribution and Poisson batch arrival process. In the case of the hyper-exponential service time distribution we find an analytical expression for the expected conditional response time function and obtain an alternative proof of its concavity with respect to the service time.

[1]  L. Hesselholt,et al.  Higher Algebra , 1937, Nature.

[2]  François Baccelli,et al.  A stochastic model for the throughput of non-persistent TCP flows , 2006, valuetools '06.

[3]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[4]  Bara Kim,et al.  Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals , 2008, Queueing Syst. Theory Appl..

[5]  Urtzi Ayesta,et al.  Mean Delay Analysis of Multi Level Processor Sharing Disciplines , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

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

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

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

[10]  Konstantin Avrachenkov,et al.  Optimal choice of threshold in Two Level Processor Sharing , 2009, Ann. Oper. Res..

[11]  Anja Feldmann,et al.  Fitting mixtures of exponentials to long-tail distributions to analyze network performance models , 1997, Proceedings of INFOCOM '97.

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

[13]  Konstantin Avrachenkov,et al.  Differentiation between short and long TCP flows: predictability of the response time , 2004, IEEE INFOCOM 2004.

[14]  Vishal Misra,et al.  Asymptotic bounds for $M^X/G/1$ processor sharing queues , 2004 .