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

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 LaplaceStieltjes 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 traffi ct ype and the mean waiting time of high-priority messages. Finally, some numerical examples are provided.

[1]  Daniel P. Heyman.  The Push-Out-Priority Queue Discipline , 1985, Oper. Res..

[2]  Annie Gravey,et al.  A Space Priority Queuing Mechanism for Multiplexing ATM Channels , 1990, Comput. Networks ISDN Syst..

[3]  Hans Kröner,et al.  Priority Management in ATM Switching Nodes , 1991, IEEE J. Sel. Areas Commun..

[4]  Changxin Fan,et al.  Analysis of a priority cell discarding method for ATM networks , 1995, Telecommun. Syst..

[5]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[6]  A. Gravey,et al.  Tagging versus strict rate enforcement in ATM networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[7]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[8]  Nelson Luis Saldanha da Fonseca,et al.  On the effectiveness of push-out mechanisms for the discard of TCP packets , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[9]  Yongjin Kim Kim,et al.  Performance Analysis of an ATM Multiplexer with Multiple QoS VBR Traffic , 1997 .

[10]  Ian F. Akyildiz,et al.  A finite buffer two class queue with different scheduling and push-out schemes , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[11]  S. Wittevrongel,et al.  Queueing systems , 2019, Autom..

[12]  Harry H. Tan,et al.  Queueing analysis of explicit policy assignment push-out buffer sharing schemes for ATM networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[13]  Jon W. Mark,et al.  A buffer allocation scheme for ATM networks: complete sharing based on virtual partition , 1995, TNET.

[14]  H. Armbruster,et al.  Broadband communication and its realization with broadband ISDN , 1987, IEEE Communications Magazine.

[15]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

[16]  Yutaka Takahashi,et al.  M/G/1/K SYSTEM WITH PUSH-OUT SCHEME UNDER VACATION POLICY , 1996 .