Performance Analysis of a Priority Queue with Place Reservation and General Transmission Times

Authors:
Bart Feyaerts;Sabine Wittevrongel
Affiliations:
SMACS Research Group, TELIN Department, Ghent University, Gent, Belgium 9000;SMACS Research Group, TELIN Department, Ghent University, Gent, Belgium 9000
Venue:
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
Year:
2008

Citing 6
Cited 1

Performance of discrete-time queueing systems

Computers and Operations Research
Discrete-Time Models for Communication Systems Including ATM

Discrete-Time Models for Communication Systems Including ATM
Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline

Performance Evaluation
A performance analysis of a discrete-time priority queueing system with correlated arrivals

Performance Evaluation
Performance analysis of priority scheduling mechanisms under heterogeneous network traffic

Journal of Computer and System Sciences
Place reservation: Delay analysis of a novel scheduling mechanism

Computers and Operations Research

Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling

Network performance engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we analyze a discrete-time single-server queue with two classes of packet arrivals and a reservation-based scheduling discipline. The objective of this discipline is to give a certain priority to (delay-sensitive) packets of class 1 and at the same time to avoid packet starvation for the (delay-tolerant) packets of class 2. This is achieved by the introduction of a reserved place in the queue that can be taken by a future arrival of class 1. Both classes contain packets with generally distributed transmission times.By means of a probability generating functions approach, both the class-1 and the class-2 packet delay are studied. By some numerical examples, the delay performance of the Reservation discipline is compared to that of the classical Absolute Priority (AP) and First-In First-Out (FIFO) scheduling disciplines.