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

Sofian Clercq (), Bart Steyaert, Sabine Wittevrongel and Herwig Bruneel

Annals of Operations Research, 2016, vol. 238, issue 1, 69-97

Abstract: 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 two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012 ). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. Copyright Springer Science+Business Media New York 2016

Keywords: Queueing theory; Priority; Slot-bound priority; Probability generating function; Censored Markov chains; Priority jumps; Earliest-due-date; Dynamic priority (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-015-2000-8 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:238:y:2016:i:1:p:69-97:10.1007/s10479-015-2000-8

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

DOI: 10.1007/s10479-015-2000-8

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().