On the stability of queues with the dropping function

Andrzej Chydzinski

PLOS ONE, 2021, vol. 16, issue 11, 1-16

Abstract: In this paper, the stability of the queueing system with the dropping function is studied. In such system, every incoming job may be dropped randomly, with the probability being a function of the queue length. The main objective of the work is to find an easy to use condition, sufficient for the instability of the system, under assumption of Poisson arrivals and general service time distribution. Such condition is found and proven using a boundary for the dropping function and analysis of the embedded Markov chain. Applicability of the proven condition is demonstrated on several examples of dropping functions. Additionally, its correctness is confirmed using a discrete-event simulator.

Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0259186 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 59186&type=printable (application/pdf)

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:plo:pone00:0259186

DOI: 10.1371/journal.pone.0259186

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().