Performance analysis of integrated services on a single server system
Performance Evaluation
Interdeparture-time distributions in the non-preemptive priority &Sgr;Mi/Gi/1 queue
Performance Evaluation
Performance of discrete-time queueing systems
Computers and Operations Research
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
Systems of functional equations
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Analysis of transmission delay for a structured-priority packet-switching system
Computer Networks and ISDN Systems
Discrete-time multiserver queues with priorities
Performance Evaluation
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
A finite buffer queue with priorities
Performance Evaluation
Asymptotics for M/G/1 low-priority waiting-time tail probabilities
Queueing Systems: Theory and Applications
Analysis of a single server queue with semi-Markovian service interruption
Queueing Systems: Theory and Applications
A Discrete-Time Queuing Analysis of the Wireless ATM Multiplexing System
ICN '01 Proceedings of the First International Conference on Networking-Part 1
The Nonpreemptive Priority Map/G/1 Queue
Operations Research
Symbolic Computation of Moments in Priority Queues
INFORMS Journal on Computing
Analysis of a discrete-time GI-G-1 queueing model subjected to bursty interruptions
Computers and Operations Research
Performance analysis of a single-server ATM queue with a priority scheduling
Computers and Operations Research
A performance analysis of a discrete-time priority queueing system with correlated arrivals
Performance Evaluation
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
The discrete-time preemptive repeat identical priority queue
Queueing Systems: Theory and Applications
Analyzing priority queues with 3 classes using tree-like processes
Queueing Systems: Theory and Applications
Priority queueing systems: from probability generating functions to tail probabilities
Queueing Systems: Theory and Applications
Performance analysis of priority scheduling mechanisms under heterogeneous network traffic
Journal of Computer and System Sciences
Buffer Behavior in Computer Communication Systems
IEEE Transactions on Computers
Output analysis of multiclass fluid models with static priorities
Performance Evaluation
Multiclass G/M/1 queueing system with self-similar input and non-preemptive priority
Computer Communications
Time-dependent performance analysis of a discrete-time priority queue
Performance Evaluation
Mixed Finite-/Infinite-Capacity Priority Queue with Interclass Correlation
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A traffic based decomposition of two-class queueing networks with priority service
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance analysis of non-preemptive GE/G/1 priority queueing of LER system with bulk arrivals
Computers and Electrical Engineering
The impact of buffer finiteness on the loss rate in a priority queueing system
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Discrete-time GeoX/G/1 queue with preemptive resume priority
Mathematical and Computer Modelling: An International Journal
On the application of Rouché's theorem in queueing theory
Operations Research Letters
A note on the discretization of Little's result
Operations Research Letters
Hi-index | 0.00 |
The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-priority and low-priority traffic, which both generate variable-length packets. A probability generating functions approach leads to performance measures such as moments of system contents and packet delays of both classes.