On the stability of queues with the dropping function.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 34731189.
- Also identified by DOI 10.1371/journal.pone.0259186 and PMC identifier 8565781.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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.
Medical subject headings
- Models, Statistical