Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Space and Time Priority Queues with Randomized Push-Out Scheme

확률적 밀어내기 정책을 가지는 공간-시간 우선순위 대기행렬

  • Kilhwan Kim (Management Engineering, Sangmyung University)
  • Received : 2023.03.09
  • Accepted : 2023.04.27
  • Published : 2023.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

Keywords

Acknowledgement

This research was funded by a 2022 research grant from Sangmyung University.

References

  1. Al-Begain, K., Dudin, A., Kazimirsky, A., and Yerima, S., Investigation of the M2/G2/1/, N Queue with Restricted Admission of Priority Customers and its Application to HSDPA Mobile Systems, Computer Networks, 2009, Vol. 53, No. 8, pp. 1186-1201. https://doi.org/10.1016/j.comnet.2009.02.017
  2. Allman, M., Paxson, V. and Blanton, E., TCP Congestion Control, RFC 5681, Internet Engineering Task Force, 2009.
  3. Arpaci, M. and Copeland, J.A., Buffer Management for Shared-memory ATM Switches, IEEE Communications Surveys & Tutorials, 2000, Vol. 3, No. 1, pp. 2-10. https://doi.org/10.1109/COMST.2000.5340716
  4. Avrachenkov, K.E., Vilchevsky, N.O., and Shevlyakov, G.L., Priority Queueing with Finite Buffer Size and Randomized Push-out Mechanism, ACM SIGMETRICS Performance Evaluation Review, 2003, Vol. 31, No. 1, pp. 324-325. https://doi.org/10.1145/885651.781079
  5. Avrachenkov, K.E., Vilchevsky, N.O., and Shevlyakov, G.L., Priority Queueing with Finite Buffer size and Randomized Push-out Mechanism, Performance Evaluation, 2005, Vol. 61, No. 1, pp. 1-16. https://doi.org/10.1016/j.peva.2004.08.006
  6. Avrachenkov, K., Shevlyakov, G., and Vilchevskii, N., Randomized Push-out Disciplines in Priority Queueing, Journal of Mathematical Sciences, 2004, Vol. 122, No. 4, pp. 3336-3342. https://doi.org/10.1023/B:JOTH.0000031879.84592.31
  7. Carballo-Lozano, C., Ayesta, U., and Fiems, D., Performance Analysis of Space-time Priority Queues, Performance Evaluation, 2019, Vol. 133, pp. 25-42. https://doi.org/10.1016/j.peva.2019.04.003
  8. Cardoso, K.V., de Rezende, J.F., and Fonseca, N.L., On the Effectiveness of Push-out Mechanisms for the Discard of TCP Packets, 2002 IEEE international conference on communications, Conference proceedings, ICC 2002 (cat. No. 02CH37333), 2002, pp. 2636-2640.
  9. Chang, C.G. and Tan, H.H., Queueing Analysis of Explicit Policy Assignment Push-out Buffer Sharing Schemes for ATM Networks, Proceedings of INFOCOM'94 Conference on Computer Communications, 1994, Toronto, ON, Canada, pp. 500-509.
  10. Cheng, X. and Akyildiz, A., A Finite Buffer Two Class Queue with Different Scheduling and Push-out Schemes, [Proceedings] IEEE INFOCOM'92: The conference on computer communications, 1992, pp. 231-241.
  11. Demoor, T., Walraevens, J., Fiems, D., De Vuyst, S., and Bruneel, H., Influence of Real-time Queue Capacity on System Contents in DiffServ's Expedited Forwarding Per-hop-behavior, Journal of Industrial and Management Optimization, 2010, Vol. 6, No. 3, pp. 587-602. https://doi.org/10.3934/jimo.2010.6.587
  12. Eugster, P., Kesselman, A., Kogan, K., Nikolenko, S., and Sirotkin, A., Admission Control in Shared Memory Switches, Journal of Scheduling, 2018, Vol. 21, No. 5, pp. 533-543. https://doi.org/10.1007/s10951-018-0564-2
  13. Gravey, A., Boyer, P., and Hebuterne, G., Tagging Versus Strict Rate Enforcement in ATM Networks, IEEE Global Telecommunications Conference GLOBECOM'91: Countdown to the New Millennium, Conference record, 1991, Phoenix, AZ, USA, pp. 271-275.
  14. Gravey, A. and Hebuterne, G., Mixing Time and Loss Priorities in a Single Server Queue, Proceedings of 13th International Teletraffic Congress, 1991, Copenhagen, Denmark, pp. 147-152.
  15. Heyman, D.P. and Sobel, M.J., Stochastic models in operations research. 1, Stochastic processes and operating characteristics, McGraw-Hill, 1982.
  16. Kapadia, A.S., Kazmi, M.F., and Mitchell, A.C., Analysis of a Finite Capacity Non Preemptive Priority Queue, Computers & Operations Research, 1984, Vol. 11, No. 3, pp. 337-343. https://doi.org/10.1016/0305-0548(84)90022-4
  17. Kim, K., Delay Cycle Analysis of Finite-buffer M/G/1 Queues and its Application to the Analysis of M/G/1 Priority Queues with Finite and Infinite Buffers, Performance Evaluation, 2020, Vol. 143, pp. 102-133. DOI:https://doi.org/https://doi.org/10.1016/j.peva.2020.102133.
  18. Kim, K., Finite-buffer m/g/1 Queues with Time and Space Priorities, Mathematical Problems in Engineering, 2022, Vol. 2022.
  19. Kim, K., M/G/1 Preemptive Priority Queues with Finite and Infinite Buffers, Journal of the Society of Korea Industrial and Systems Engineering, 2020, Vol. 43, No. 4, pp. 1-14. https://doi.org/10.11627/jkise.2020.43.4.001
  20. Kim, K., (N, n)-preemptive Priority Queues, Performance Evaluation, 2011, Vol. 68, No. 7, pp. 575-585. https://doi.org/10.1016/j.peva.2011.03.006
  21. Kim, K., (N, n)-preemptive Repeat-different Priority Queues, Journal of Society of Korea Industrial and Systems Engineering, 2017, Vol. 40, No. 3, pp. 66-75. https://doi.org/10.11627/jkise.2017.40.3.066
  22. Kim, K., The Analysis of an Opportunistic Spectrum Access with a Strict T-preemptive Priority Discipline, Journal of Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 4, pp. 162-170. https://doi.org/10.11627/jkise.2012.35.4.162
  23. Kim, K., T-preemptive Priority Queue and its Application to the Analysis of an Opportunistic Spectrum Access in Cognitive Radio Networks, Computers & Operations Research, 2012, Vol. 39, No. 7, pp. 1394-1401. https://doi.org/10.1016/j.cor.2011.08.008
  24. Kleinrock, L., Queueing systems, volume 2: Computer applications, Wiley, 1976.
  25. Kroner, H., Hebuterne, G., Boyer, P. and Gravey, A., Priority Management in ATM Switching Nodes, IEEE Journal on Selected Areas in Communications, 1991, Vol. 9, No. 3, pp. 418-427. https://doi.org/10.1109/49.76641
  26. Lee, Y. and Choi, B.D., Queueing System with Multiple Delay and Loss Priorities for ATM Networks, Information Sciences, 2001, Vol. 138, No. 1-4, pp. 7-29. https://doi.org/10.1016/S0020-0255(01)00151-7
  27. Lee, Y., Choi, B.D., Kim, B., and Sung, D.K., Delay Analysis of an m/g/1/k Priority Queueing System with Push-out Scheme, Mathematical Problems in Engineering, 2007, Vol. 2007.
  28. Lin, A.-M. and Silvester, J.A., Priority Queueing Strategies and Buffer Allocation Protocols for Traffic Control at an ATM Integrated Broadband Switching System, IEEE Journal on Selected Areas in Communications, 1991, Vol. 9, No. 9, pp. 1524-1536. https://doi.org/10.1109/49.108688
  29. Ross, S.M., Stochastic processes, John Wiley & Sons, 1996.
  30. Sharma, V. and Virtamo, J.T., A Finite Buffer Queue with Priorities, Performance Evaluation, 2002, Vol. 47, No. 1, pp. 1-22. https://doi.org/10.1016/S0166-5316(01)00053-0
  31. Stewart, W.J., Numerical Methods for computing stationary distributions of finite irreducible markov chains, Computational probability, Springer, pp. 81-111.
  32. Takagi, H., Queueing analysis, volume 1: Vacation and priority systems, part 1, North-Holland, 1991.
  33. Xue, H., Kim, K.T., and Youn, H.Y., Packet Scheduling for Multiple-switch Software-defined Networking in Edge Computing Environment, Wireless Communications and Mobile Computing, 2018, Vol. 2018.
  34. Zaborovsky, V., Zayats, O., and Mulukha, V., Priority queueing with finite buffer size and randomized push-out mechanism, 2010 ninth International Conference on Networks, 2010, pp. 316-320.