Batch sojourn time in the processor sharing queue with geometric batch size

References

• Abramowitz, M.; Stegun, I. Handbook of Mathematical Functions; Library of Congress: Washington, DC, 1972.
   Google Scholar
• Arnold, V. I.; Cooke, R. Lectures on Partial Differential Equations. Universitext; Springer Berlin Heidelberg, 2003.
   Google Scholar
• Avrachenkov, K.; Ayesta, U.; Brown, P. Batch arrival processor-sharing with application to multi-level processor-sharing scheduling. Queueing Syst. 2005, 50, 459–480. DOI: 10.1007/s11134-005-1666-z.
   Web of Science ®Google Scholar
• Bansal, N. Analysis of the M/G/1 processor-sharing queue with bulk arrivals. Oper. Res. Lett. 2003, 31, 401–405. DOI: 10.1016/S0167-6377(03)00029-4.
   Web of Science ®Google Scholar
• Borst, S. C.; Boxma, O. J.; Morrison, J. A.; Nunez Queija, R. The equivalence between processor sharing and service in random order. Oper. Res. Lett. 2003, 31, 254–262. DOI: 10.1016/S0167-6377(03)00006-3.
   Web of Science ®Google Scholar
• Coffman, E. G.; Muntz, R. R.; Trotter, H. Waiting time distributions for processor-sharing systems. J. ACM 1970, 17, 123–130. DOI: 10.1145/321556.321568.
   Web of Science ®Google Scholar
• Flatto, L. The waiting time distribution for the random order service M/M/1 queue. Ann. Apl. Prob. 1997, 7, 382–409.
   Web of Science ®Google Scholar
• Gradshteyn, I. S.; Ryzhik, I. M. Table of Integrals, Series, and Products. Elsevier/Academic Press: Amsterdam, 7th edition, 2007.
   Google Scholar
• Gross, D.; Shortle, J. F.; Thompson, J. M.; Harris, C. M. Fundamentals of Queueing Theory. Wiley-Interscience: Hoboken, NJ, USA, 4th edition, 2008.
   Google Scholar
• Guillemin, F.; Rodriguez, V. Q.; Simonian, A. A processor-sharing model for the performance of virtualized network functions. In 2019 31st International Teletraffic Congress (ITC 31), 2019; 10–18. DOI: 10.1109/ITC31.2019.00011.
   Google Scholar
• Guillemin, F.; Rodriguez, V. K. Q.; Simonian, A. Sojourn time in a processor sharing queue with batch arrivals. Stoch. Models 2018, 34, 322–361. DOI: 10.1080/15326349.2018.1479270.
   Web of Science ®Google Scholar
• Kleinrock, L. Queueing systems, volume 1; Wiley: New York, 1976.
   Google Scholar
• Kleinrock, L.; Muntz, R. R.; Rodemich, E. The processor sharing queueing model for time shared systems with bulk arrivals. Networks 1971, 1, 1–13. DOI: 10.1002/net.3230010103.
   Google Scholar
• Lafitte-Godillon, P.; Raschel, K.; Tran, V. C. Extinction probabilities for a distylous plant population modeled by an inhomogeneous random walk on the positive quadrant. SIAM J. Appl. Math. 2013, 73, 700–722. DOI: 10.1137/120864258.
   Web of Science ®Google Scholar
• Massoulie, L.; Roberts, J. Bandwidth sharing: objectives and algorithms. IEEE Infocom ’99 1999, 3, 1395–1403.
   Google Scholar
• Morrison, J. Response time for a processor sharing system. SIAM J. Appl. Math. 1985, 45, 152–167. DOI: 10.1137/0145007.
   Web of Science ®Google Scholar
• Nasri, R.; Simonian, A.; Guillemin, F. A new linear inversion formula for a class of hypergeometric polynomials. Int. Transf. Special Functions 2020, https://10.1080/10652469.2020.1833002.
   Web of Science ®Google Scholar
• National Institute of Standards and Technologies, editors. Handbook of Mathematical Functions; Cambridge University Press: Cambridge, 2010.
   Google Scholar
• Ott, T. J. The sojourn-time distribution in the M/G/1 queue with processor sharing. J. Appl. Prob. 1984, 21, 360–378. DOI: 10.2307/3213646.
   Web of Science ®Google Scholar
• Pólya, G.; Szegö, G. Problems and Theorems in Analysis I; Springer: Berlin, Heidelberg GmbH, 1978.
   Google Scholar
• Rodriguez, V. K. Q.; Guillemin, F. 2016 Performance analysis of resource pooling for network function virtualization. In Networking Conference, November.
   Google Scholar
• John, R. Combinatorial Identities. Wiley Series in Probability and Mathematical Statistics; Wiley: New York, 1968.
   Google Scholar
• Quintuna Rodriguez, V.; Guillemin, F. Cloud-ran modeling based on parallel processing. IEEE J. Select. Areas Commun. 2018, 36, 457–468. DOI: 10.1109/JSAC.2018.2815378.
   Web of Science ®Google Scholar
• Schlosser, M. J. Multiple hypergeometric series – Appell series and beyond. 2013. DOI: 10.1007/978-3-7091-1616-6_13.
   Google Scholar
• Guillemin, F.; Simonian, A.; Nasri, R.; Rodriguez, V. Q. Asymptotic analysis of the sojourn time of a batch in an M[X]/M/1 processor sharing queue. Submitted for publication, 2021.
   Google Scholar
• Yashkov, S. F. A derivation of response time for an M/G/1 processor sharing queue. Probl. Contr. Inform. Theory 1983, 12, 133–148.
   Google Scholar
• Yashkov, S. F. Explicit formulas for the moments of the sojourn time in the M/G/1 processor sharing queue with permanent jobs. Technical report, arXiv:math/052281, 2005.
   Google Scholar