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.

1. 서 론
2. 모 형
3. 패킷 전송완료 직후 시점의 패킷수 결합분포
    3.1 전송 기간 동안의 도착 패킷수 분포
    3.2 패킷 전송완료 시점의 EMC
4. 패킷 손실확률
5. 임의 시점의 패킷수 기대치
6. 수치 예제
7. 결 론
Acknowledgement
References

• Kilhwan Kim(Management Engineering, Sangmyung University) | 김길환 (상명대학교 경영공학과) Corresponding author