Analysis of a threshold-based priority queue

Herwig Bruneel ()
Additional contact information
Herwig Bruneel: Ghent University

Queueing Systems: Theory and Applications, 2025, vol. 109, issue 1, No 8, 45 pages

Abstract: Abstract This paper considers a discrete-time single-server queueing system, with two classes of customers, named class 1 and class 2. We propose and analyze a novel threshold-based priority scheduling scheme that works as follows. Whenever the number of class-1 customers in the system exceeds a given threshold $$m \ge 0$$ m ≥ 0 , the server of the system gives priority to class-1 customers; otherwise, it gives priority to class-2 customers. Consequently, for $$m=0$$ m = 0 , the system is equivalent to a classical priority queue with absolute priority for class-1 customers, whereby the (mean) delay of class-1 customers is lowered as much as possible at the expense of longer (mean) delays for class-2 customers. On the other hand, for $$m\rightarrow \infty $$ m → ∞ , the system is equivalent to a priority queue with absolute priority for class-2 customers, with the opposite effect on the class-specific (mean) delays. By choosing $$0

Keywords: Priority queues; Discrete-time; Priority threshold; Functional equation analysis; 60K25; 90B22; 68M20 (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-025-09936-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:109:y:2025:i:1:d:10.1007_s11134-025-09936-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-025-09936-3

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().