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 examplesare provided.
ASJC Scopus subject areas