Delay Analysis of anPriority Queueing System with Push-out Scheme
Authors:
Open Access
- 6 December 2007
- journal article
- research article
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2007, 1-12
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.Keywords
Funding Information
- LG Yonam Foundation
This publication has 7 references indexed in Scilit:
- Performance Analysis of an ATM Multiplexer with Multiple QoS VBR TrafficETRI Journal, 1997
- M/G/1/K system with push‐out scheme under vacation policyInternational Journal of Stochastic Analysis, 1996
- Analysis of a priority cell discarding method for ATM networksTelecommunication Systems, 1995
- A buffer allocation scheme for ATM networks: complete sharing based on virtual partitionIEEE/ACM Transactions on Networking, 1995
- Priority management in ATM switching nodesIEEE Journal on Selected Areas in Communications, 1991
- Broadband communication and its realization with broadband ISDNIEEE Communications Magazine, 1987
- The Push-Out-Priority Queue DisciplineOperations Research, 1985