Response time in a pair of processor sharing queues with Join-the-Shortest-Queue scheduling (2405.11927v1)
Abstract: Join-the-Shortest-Queue (JSQ) is the scheduling policy of choice for many network providers, cloud servers and traffic management systems, where individual queues are served under processor sharing (PS) queueing discipline. A numerical solution for the response time distribution in two parallel PS queues with JSQ scheduling is derived for the first time. Using the generating function method, two partial differential equations (PDEs) are obtained corresponding to conditional response times, where the conditioning is on a particular traced task joining the first or the second queue. These PDEs are functional equations that contain partial generating functions and their partial derivatives, and therefore cannot be solved by commonly used techniques. We are able to solve these PDEs numerically with good accuracy and perform the deconditioning with respect to the queue-length probabilities by evaluating a certain complex integral. Numerical results for the density and the first four moments compare well against regenerative simulation with 500,000 regeneration cycles.
- “Cisco IOS server load balancing configuration guide,” Cisco Systems, Inc., 2011, accessed on November 14, 2023. [Online]. Available: https://shorturl.at/hpgqQ
- “Microsoft.network applicationgateways,” Microsoft Azure, 2023, accessed on November 14, 2023. [Online]. Available: https://shorturl.at/I2ivr
- “Virtual IPs and service proxies,” Cloud Native Computing Foundation, 2023, accessed on November 14, 2023. [Online]. Available: https://kubernetes.io/docs/reference/networking/virtual-ips/
- “Application load balancer now supports least outstanding requests algorithm for load balancing requests,” Amazon Web Services, Inc., 2019, accessed on November 14, 2023. [Online]. Available: https://shorturl.at/HkxZ4
- J. F. C. Kingman, “Two Similar Queues in Parallel,” The Annals of Mathematical Statistics, vol. 32, no. 4, pp. 1314 – 1323, 1961. [Online]. Available: https://doi.org/10.1214/aoms/1177704869
- L. Flatto and H. P. McKean, “Two queues in parallel,” Communications on Pure and Applied Mathematics, vol. 30, no. 2, pp. 255–263, 1977.
- P. G. Harrison, “On the numerical solution of functional equations with application to response time distributions,” Applied Mathematics and Computation, vol. 472, 2024. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0096300324001097
- B. K. Asare and F. G. Foster, “Conditional response times in the m/g/1 processor-sharing system,” Journal of applied probability, vol. 20, no. 4, pp. 910–915, 1983.
- J. Abate and W. Whitt, “Numerical inversion of Laplace transforms of probability distributions,” ORSA Journal on Computing, vol. 7, no. 1, pp. 36–43, 1995.
- P. W. Glynn, “Simulation algorithms for regenerative processes,” in Simulation, ser. Handbooks in Operations Research and Management Science, S. G. Henderson and B. L. Nelson, Eds. Elsevier, 2006, vol. 13, pp. 477 – 500. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0927050706130169
- C. Chien, “Batch size selection for the batch means method,” in Proceedings of the 1994 Winter Simulation Conference, J. D.Tew, S. Manivannan, D. Sadowski, and A. F. Seila, Eds., 01 1995, pp. 345– 352.
- E. G. C. Jr., R. R. Muntz, and H. F. Trotter, “Waiting time distributions for processor-sharing systems,” J. ACM, vol. 17, no. 1, pp. 123–130, 1970. [Online]. Available: https://doi.org/10.1145/321556.321568
- P. G. Harrison and J. Bor, “Response time distribution in a tandem pair of queues with batch processing,” Journal of the ACM, vol. 68, 2021.
- Julianna Bor (1 paper)
- Peter G Harrison (1 paper)