Mathematical Problems in Engineering
Volume 2007 (2007), Article ID 14504, 12 pages
doi:10.1155/2007/14504
Research Article

Delay Analysis of an M/G/1/K Priority Queueing System with Push-out Scheme

Yutae Lee,1 Bong Dae Choi,2 Bara Kim,2 and Dan Keun Sung3

1Department of Information and Communication Engineering, Dongeui University, Busanjin-gu, Busan 614-714, South Korea
2Department of Mathematics, College of Science, Korea University, Sungbuk-gu, Seoul 136-701, South Korea
3School of Electrical Engineering and Computer Science, College of Engineering, Korea Advanced Institute of Science and Technology (KAIST), Yuseong-gu, Daejeon 305-701, South Korea

Received 16 March 2007; Accepted 18 October 2007

Academic Editor: Giuseppe Rega

Copyright © 2007 Yutae Lee et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

This paper considers an M/G/1/K queueing system with push-out scheme which is one of the loss priority controls at a multiplexer in communication networks. The loss probability for the model with push-out scheme has been analyzed, but the waiting times are not available for the model. Using a set of recursive equations, this paper derives the Laplace-Stieltjes transforms (LSTs) of the waiting time and the push-out time of low-priority messages. These results are then utilized to derive the loss probability of each traffic type and the mean waiting time of high-priority messages. Finally, some numerical examples are provided.