On priority queues with priority jumps

Authors:
Tom Maertens;Joris Walraevens;Herwig Bruneel
Affiliations:
Ghent University - UGent, Department of Telecommunications and Information Processing, SMACS Research Group, Gent, Belgium;Ghent University - UGent, Department of Telecommunications and Information Processing, SMACS Research Group, Gent, Belgium;Ghent University - UGent, Department of Telecommunications and Information Processing, SMACS Research Group, Gent, Belgium
Venue:
Performance Evaluation
Year:
2006

Citing 5
Cited 7

Some optimal traffic regulation schemes for ATM networks: a Markov decision approach

IEEE/ACM Transactions on Networking (TON)
Queueing system with multiple delay and loss priorities for ATM networks

Information Sciences—Informatics and Computer Science: An International Journal
Discrete-Time Models for Communication Systems Including ATM

Discrete-Time Models for Communication Systems Including ATM
Performance analysis of a single-server ATM queue with a priority scheduling

Computers and Operations Research
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Priority queueing systems: from probability generating functions to tail probabilities

Queueing Systems: Theory and Applications
Controlling the delay trade-off between packet flows using multiple reserved places

Performance Evaluation
Time-dependent performance analysis of a discrete-time priority queue

Performance Evaluation
Performance Evaluation of a Gradual Differentiation Scheme for Telecommunication Networks

ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Modelling and Performance Evaluation of Improved Access Mechanisms in a Novel Multiservice OPS Architecture

NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling

Network performance engineering
Approximate method for analysis of queuing models with jump priorities

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly introduced HOL-PJ priority scheme. We derive expressions for the probability generating function of the system contents and the packet delay. Some performance measures (such as mean and variance) of these quantities are derived and are used to illustrate the impact and significance of the HOL-PJ priority scheduling discipline in an output queueing switch. We compare this dynamic priority scheduling discipline with a first-in, first-out (FIFO) scheduling and a static priority scheduling (HOL) and we investigate the influence of the different parameters of the simplified HOL-PJ scheduling discipline.