Performance comparison of several priority schemes with priority jumps

@article{Maertens2008PerformanceCO,
  title={Performance comparison of several priority schemes with priority jumps},
  author={Tom Maertens and Joris Walraevens and Herwig Bruneel},
  journal={Annals of Operations Research},
  year={2008},
  volume={162},
  pages={109-125},
  url={https://api.semanticscholar.org/CorpusID:19231640}
}
This paper considers several discrete-time priority queues with priority jumps, which all differ in their jumping mechanism, based on a certain jumping criterion, and thus all have a different performance.
View on Springer
biblio.ugent.be
29 Citations
Highly Influential Citations
4
Background Citations
18
Methods Citations
3
Results Citations
1

29 Citations

Delay Analysis of a Discrete-Time Non-Preemptive Priority Queue with Priority Jumps

A discrete-time non-preemptive priority queueing model with priority jumps for real-time and non-real time traffic is considered and expressions for the joint probability generating function of the system contents of the high and the low priority traffic in the steady state are derived.

DYNAMIC CALL TRANSMISSION PRIORITY DISCIPLINE WITH PRIORITY JUMPS

A dynamic call transmission priority discipline, head-of-the line with priority jumps (HOL-PJ), to give transmission priority to the call having the largest queueing delay in excess of its delay requirement.

PERFORMANCE COMPARISON OF PRIORITY SCHEMES WITH PRIORITY JUMPS IN WIRELESS NETWORKS

A jumping scheme in which a random call of the low priority queue can jump to the high priority queue (to incorporate “impatient” calls) is analyzed and some performance measures such as blocking probability of new calls and dropping probability of handoff calls is obtained.

Analysis of a discrete-time queue with time-limited overtake priority

In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The…

Analysis of a discrete-time queue with time-limited overtake priority

This paper investigates a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes, and obtains expressions for the steady-state probability generating functions of the delays of both customer classes by using a censoring argument.

Controlling delay differentiation with priority jumps: analytical study

A priority scheduling discipline with priority jumps to control the delay differentiation between different types of traffic, where packets can be promoted to a higher priority level in the course of time.

Analysis of discrete-time queueing systems with priority jumps

This text is a summary of the author's PhD thesis, which proposes several (types of) jumping mechanisms, and analyses their effect on the performance of a discrete-time queueing system.

Delay characteristics in place-reservation queues with class-dependent service times

This paper considers a discrete-time single-server infinite-capacity queue with two classes of packet arrivals, either delay-sensitive or delay-tolerant (class 2), and a reservation-based priority scheduling mechanism, and study the delay characteristics for both packet classes under the assumption of a general independent packet arrival process.

Delay Analysis of a Queue with Reservation-Based Scheduling and Class-Dependent Service Times

In this paper, we study the delay characteristics of a discrete-time queue with a reservation-based scheduling mechanism. The objective is to provide a better quality of service to delay-sensitive…

Priority Queues with Fractional Service for Tiered Delay QoS

A packet queueing engine dubbed Fractional Service Buffer (FSB) is presented, which, when coupled with a configurable flow scheduler, can achieve desired QoS objectives, such as fair throughputs and differentiated delay guarantees.

9 References

On priority queues with priority jumps

A modified HOL priority scheduling discipline: Performance analysis

Performance analysis of a single-server ATM queue with a priority scheduling

Analysis of a delay-dependent priority discipline in an integrated multiclass traffic fast packet switch

A dynamic packet transmission priority discipline, head-of-the-line with priority jumps, is proposed and analyzed for a packet switch serving multiple classes of delay-sensitive traffic and it is shown that the discipline can make the tail probabilities of the delay distributions for the different classes of traffic approximately the same.

Analysis of DQLT scheduling policy for an ATM multiplexer

It is shown that the DQLT method gives intermediate performance between those of minimum laxity threshold (MLT) and queue length threshold (QLT) policy, but its control method is quite simpler.

Queueing system with multiple delay and loss priorities for ATM networks

Survey of traffic control schemes and protocols in ATM networks

The authors survey a number of important research topics in ATM (asynchronous transfer mode) networks. The topics covered include mathematical modeling of various types of traffic sources,…

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

Numerical results illustrate the improved performance of the optimal open-loop TR over that of the (constant relief-spacing) Spacer-Controller and their difference determines the performance gain if feedback information can become available on time.

A new dynamic priority scheme: Performance analysis