IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v96y2020i1d10.1007_s11134-020-09663-x.html
   My bibliography  Save this article

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

Author

Listed:
  • Arnaud Devos

    (Ghent University)

  • Joris Walraevens

    (Ghent University)

  • Dieter Fiems

    (Ghent University)

  • Herwig Bruneel

    (Ghent University)

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.

Suggested Citation

  • Arnaud Devos & Joris Walraevens & Dieter Fiems & Herwig Bruneel, 2020. "Analysis of a discrete-time two-class randomly alternating service model with Bernoulli arrivals," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 133-152, October.
    • Handle: RePEc:spr:queues:v:96:y:2020:i:1:d:10.1007_s11134-020-09663-x
    DOI: 10.1007/s11134-020-09663-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-020-09663-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-020-09663-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fiems, Dieter & Maertens, Tom & Bruneel, Herwig, 2008. "Queueing systems with different types of server interruptions," European Journal of Operational Research, Elsevier, vol. 188(3), pages 838-845, August.
    2. Jasper Vanlerberghe & Tom Maertens & Joris Walraevens & Stijn Vuyst & Herwig Bruneel, 2016. "On the optimization of two-class work-conserving parameterized scheduling policies," 4OR, Springer, vol. 14(3), pages 281-308, September.
    3. Dieter Fiems & Bart Steyaert & Herwig Bruneel, 2002. "Randomly Interrupted GI-G-1 Queues: Service Strategies and Stability Issues," Annals of Operations Research, Springer, vol. 112(1), pages 171-183, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Arnaud Devos & Joris Walraevens & Dieter Fiems & Herwig Bruneel, 2021. "Heavy-Traffic Comparison of a Discrete-Time Generalized Processor Sharing Queue and a Pure Randomly Alternating Service Queue," Mathematics, MDPI, vol. 9(21), pages 1-25, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. A. Krishnamoorthy & P. Pramod & S. Chakravarthy, 2014. "Queues with interruptions: a survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 290-320, April.
    2. I. Atencia & P. Moreno, 2006. "A Discrete-Time Geo/ G/1 retrial queue with the server subject to starting failures," Annals of Operations Research, Springer, vol. 141(1), pages 85-107, January.
    3. I. Atencia & A. Pechinkin, 2013. "A discrete-time queueing system with optional LCFS discipline," Annals of Operations Research, Springer, vol. 202(1), pages 3-17, January.
    4. Pedram Sahba & Bariş Balciog̃lu & Dragan Banjevic, 2013. "Analysis of the finite‐source multiclass priority queue with an unreliable server and setup time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 331-342, June.
    5. I. Atencia, 2015. "A discrete-time queueing system with server breakdowns and changes in the repair times," Annals of Operations Research, Springer, vol. 235(1), pages 37-49, December.
    6. Shekhar, Chandra & Kumar, Neeraj & Gupta, Amit & Kumar, Amit & Varshney, Shreekant, 2020. "Warm-spare provisioning computing network with switching failure, common cause failure, vacation interruption, and synchronized reneging," Reliability Engineering and System Safety, Elsevier, vol. 199(C).
    7. N. Nithya & N. Anbazhagan & S. Amutha & K. Jeganathan & Gi-Cheon Park & Gyanendra Prasad Joshi & Woong Cho, 2023. "Controlled Arrivals on the Retrial Queueing–Inventory System with an Essential Interruption and Emergency Vacationing Server," Mathematics, MDPI, vol. 11(16), pages 1-24, August.
    8. Arnaud Devos & Joris Walraevens & Dieter Fiems & Herwig Bruneel, 2021. "Heavy-Traffic Comparison of a Discrete-Time Generalized Processor Sharing Queue and a Pure Randomly Alternating Service Queue," Mathematics, MDPI, vol. 9(21), pages 1-25, October.
    9. Pedram Sahba & Barış Balcıog̃lu & Dragan Banjevic, 2022. "The impact of disruption characteristics on the performance of a server," Annals of Operations Research, Springer, vol. 317(1), pages 239-252, October.
    10. Atencia, I., 2017. "A Geo/G/1 retrial queueing system with priority services," European Journal of Operational Research, Elsevier, vol. 256(1), pages 178-186.
    11. Atencia-Mc.Killop, Ivan & Galán-García, José L. & Aguilera-Venegas, Gabriel & Rodríguez-Cielos, Pedro & Galán-García, MÁngeles, 2018. "A Geo[X]/G[X]/1 retrial queueing system with removal work and total renewal discipline," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 245-253.
    12. Arnaud Devos & Joris Walraevens & Dieter Fiems & Herwig Bruneel, 2022. "Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline," Annals of Operations Research, Springer, vol. 310(2), pages 477-503, March.
    13. Walraevens, Joris & Maertens, Tom & Bruneel, Herwig, 2013. "A semi-preemptive priority scheduling discipline: Performance analysis," European Journal of Operational Research, Elsevier, vol. 224(2), pages 324-332.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:96:y:2020:i:1:d:10.1007_s11134-020-09663-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.