확률적 밀어내기 정책을 가지는 공간-시간 우선순위 대기행렬
Space and Time Priority Queues with Randomized Push-Out Scheme
1
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (34)
- Al-Begain, K., "Investigation of the M2", G2, , N Queue with Restricted Admission of Priority Customers and its Application to HSDPA Mobile Systems, pp.Computer Networks, 2009[DOI]
- Allman, M., "TCP Congestion Control, RFC 5681", Internet Engineering Task Force, ~ (2009)
- Arpaci, M., "Buffer Management for Shared-memory ATM Switches", IEEE Communications Surveys & Tutorials, 3(1), pp.2~10 (2000)
- Avrachenkov, K. E., "Priority Queueing with Finite Buffer Size and Randomized Push-out Mechanism", ACM SIGMETRICS Performance Evaluation Review, 31(1), pp.324~325 (2003)
- Avrachenkov, K. E., "Priority Queueing with Finite Buffer size and Randomized Push-out Mechanism", Performance Evaluation, 61(1), pp.1~16 (2005)
- Avrachenkov, K., "Randomized Push-out Disciplines in Priority Queueing", Journal of Mathematical Sciences, 122(4), pp.3336~3342 (2004)
- Carballo-Lozano, C., "Performance Analysis of Space-time Priority Queues", Performance Evaluation, 133, pp.25~42 (2019)
- Cardoso, K. V., "On the Effectiveness of Push-out Mechanisms for the Discard of TCP Packets", 2002 IEEE international confer-ence on communications, Conference proceedings, ICC 2002 (cat. No. 02CH37333), pp.2636~2640 (2002)
- Chang, C. G., "Queueing Analysis of Explicit Policy Assignment Push-out Buffer Sharing Schemes for ATM Networks", Proceedings of INFOCOM’94Conference on Computer Communications, pp.500~509 (1994)
- Cheng, X., "A Finite Buffer Two Class Queue with Different Scheduling and Push-out Schemes", IEEE INFOCOM’92: The conference on computer communications, pp.231~241 (1992)
- Demoor, T., "Influence of Real-time Queue Capacity on System Contents in DiffServ’s Expedited Forwarding Per-hop-behavior", Journal of Industrial and Management Optimization, 6(3), pp.587~602 (2010)
- Eugster, P., "Admission Control in Shared Memory Switches", Journal of Scheduling, 21(5), pp.533~543 (2018)
- Gravey, A., "Tagging Versus Strict Rate Enforcement in ATM Networks", IEEE Global Telecommunications Conference GLOBECOM’91: Countdown to the New Millennium, Conference record, pp.271~275 (1991)
- Gravey, A., "Mixing Time and Loss Priorities in a Single Server Queue", Proceedings of 13th International Teletraffic Congress, pp.147~152 (1991)
- Heyman, D. P., "Stochastic processes and operating characteristics" (1982), McGraw-Hill
- Kapadia, A. S., "Analysis of a Finite Capacity Non Preemptive Priority Queue", Computers & Operations Research, 11(3), pp.337~343 (1984)
- Kim, K., "Delay Cycle Analysis of Finite-buffer M", G, G, pp.1Priority Queues with Finite and Infinite Buffers, Performance Evaluation[DOI]
- Kim, K., "Finite-buffer m", g, Mathematical Problems in Engineering, pp.2022, 2022[DOI]
- 김길환, "유한 및 무한 용량 대기열을 가지는 선점 우선순위 M", G, 한국산업경영시스템학회지, pp.2020, 43(4)[DOI]
- Kim, K., "(N, n)-preemptive Priority Queues", Performance Evaluation, 68(7), pp.575~585 (2011)
- 김길환, "(N, n)-Preemptive Repeat-Different Priority Queues", 한국산업경영시스템학회지, 40(3), pp.66~75 (2017), 한국산업경영시스템학회
- 김길환, "엄격한 T‐축출 우선순위 대기행렬을 이용한 기회 주파수 접근 방식의 성능 분석", 한국산업경영시스템학회지, 35(4), pp.162~170 (2012), 한국산업경영시스템학회[DOI]
- Kim, K., "T-preemptive Priority Queue and its Application to the Analysis of an Opportunistic Spectrum Access in Cognitive Radio Networks", Computers & Operations Research, 39(7), pp.1394~1401 (2012)
- Kleinrock, L., "Queueing systems, volume 2: Computer applications" (1976), Wiley
- Kroner, H., "Priority Management in ATM Switching Nodes", IEEE Journal on Selected Areas in Communications, 9(3), pp.418~427 (1991)
- Lee, Y., "Queueing System with Multiple Delay and Loss Priorities for ATM Networks", Information Sciences, 138(1-4), pp.7~29 (2001)
- Lee, Y., "Delay Analysis of an m", g, k Priority Queueing System with Push-out Scheme, pp.Mathematical Problems in Engineer-ing, 2007[DOI]
- Lin, A. -M., "Priority Queueing Strategies and Buffer Allocation Protocols for Traffic Control at an ATM Integrated Broadband Switching System", IEEE Journal on Selected Areas in Communica-tions, 9(9), pp.1524~1536 (1991)
- Ross, S. M., "Stochastic processes" (1996), John Wiley & Sons
- Sharma, V., "A Finite Buffer Queue with Priorities", Performance Evaluation, 47(1), pp.1~22 (2002)
- Stewart, W.J., "Computational probability", pp.81~111, Springer
- Takagi, H., "Queueing analysis, volume 1: Vacation and priority systems, part 1" (1991), North-Holland
- Xue, H., "Packet Scheduling for Multiple-switch Software-defined Networking in Edge Computing Environment", Wireless Communications and Mobile Computing, 2018 (2018)
- Zaborovsky, V., "Priority queueing with finite buffer size and randomized push-out mechanism", 2010 ninth International Conference on Networks, pp.316~320 (2010)