Interdeparture-time distributions in the non-preemptive priority &Sgr;Mi/Gi/1 queue
Performance Evaluation
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Analysis of a nonpreemptive priority queue with SPP arrivals of high class
Performance Evaluation
Discrete-time multiserver queues with priorities
Performance Evaluation
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
Design and analysis of a bandwidth management framework for ATM-based broadband ISDN
IEEE Communications Magazine
IEEE Network: The Magazine of Global Internetworking
The combined gated-exhaustive vacation system in discrete time
Performance Evaluation
Computers and Operations Research
Performance Analysis of a Priority Queue with Place Reservation and General Transmission Times
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
Power series approximations for two-class generalized processor sharing systems
Queueing Systems: Theory and Applications
Performance analysis of priority queueing systems in discrete time
Network performance engineering
A discrete-time HOL priority queue with multiple traffic classes
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Hi-index | 0.00 |
Priority scheduling for packets is becoming a hot topic, as attempts are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-time queueing system with head-of-line (HOL) non-preemptive priority scheduling. Two classes of traffic will be considered, i.e., high-priority and low-priority traffic, which both generate variable-length packets. We will derive expressions for the probability generating function of the packet delay of the high-priority traffic and the low-priority traffic. From these, some performance measures (such as the mean value) will be derived. These will be used to illustrate the significance of priority scheduling and will be applied to an output queueing switch.