带有丢弃功能的队列稳定性研究。
On the stability of queues with the dropping function.
机构信息
Department of Computer Networks and Systems, Silesian University of Technology, Gliwice, Poland.
出版信息
PLoS One. 2021 Nov 3;16(11):e0259186. doi: 10.1371/journal.pone.0259186. eCollection 2021.
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.
本文研究了具有丢弃功能的排队系统的稳定性。在这种系统中，每个到达的作业都可能随机丢弃，丢弃的概率是队列长度的函数。这项工作的主要目的是在泊松到达和一般服务时间分布的假设下，找到一个易于使用的条件，足以保证系统的不稳定性。通过丢弃函数的边界和嵌入式马尔可夫链的分析，找到了并证明了这个条件。对几个丢弃函数的例子进行了证明条件的适用性的演示。此外，还使用离散事件模拟器确认了其正确性。
Zotero 插件