A preemptive repeat priority queue with resampling: Performance analysis

• DOI: 10.1007/s10479-006-0053-4
• Publication Date: 2006-07-06T06:32:49Z
• Authors: Joris Walraevens; Bart Steyaert; Herwig Bruneel
• Keywords: Retransmission; Priority ceiling protocol; Priority inheritance; Deadline-monotonic scheduling; Resampling; Theory of computation; Preemption

In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing the system contents and packet delay of both classes. The influence of the priority scheduling on the performance measures is illustrated by some numerical examples.