Author:
Lee Yutae,Choi Bong Dae,Kim Bara,Sung Dan Keun
Abstract
This paper considers anM/G/1/Kqueueing 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.
Subject
General Engineering,General Mathematics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献