EconPapers    
Economics at your fingertips  
 

Analysis of a discrete-time two-class randomly alternating service model with Bernoulli arrivals

Arnaud Devos (), Joris Walraevens (), Dieter Fiems () and Herwig Bruneel ()
Additional contact information
Arnaud Devos: Ghent University
Joris Walraevens: Ghent University
Dieter Fiems: Ghent University
Herwig Bruneel: Ghent University

Queueing Systems: Theory and Applications, 2020, vol. 96, issue 1, No 6, 133-152

Abstract: Abstract We analyze a discrete-time two-class queueing system with a single server which is alternately available for only one customer class. The server is each time allocated to a customer class for a geometrically distributed amount of time. Service times of the customers are deterministically equal to 1 time slot each. During each time slot, both classes can have at most one arrival. The bivariate process of the number of customers of both classes can be considered as a two-dimensional nearest-neighbor random walk. The generating function of this random walk has to be obtained from a functional equation. This type of functional equation is known to be difficult to solve. In this paper, we obtain closed-form expressions for the joint probability distribution for the number of customers of both classes, in steady state.

Keywords: Two-class queueing model; Processor sharing; Singularity analysis; Analytic continuation; Nearest-neighbor random walk; 68M20; 90B22 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-020-09663-x 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:96:y:2020:i:1:d:10.1007_s11134-020-09663-x

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

DOI: 10.1007/s11134-020-09663-x

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 ().

 
Page updated 2025-03-20
Handle: RePEc:spr:queues:v:96:y:2020:i:1:d:10.1007_s11134-020-09663-x