Queues with the dropping function and general service time

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

Abstract

We present an analysis of queueing systems with the dropping function, infinite buffer and general distribution of the service time. Firstly, a stability condition, more general than the well-known ρ < 1, is proven. Secondly, the formulas for the queue size distribution, loss ratio and mean duration of the busy period, are derived. Thirdly, numerical examples are given, including optimizations of the shape of the dropping function with regard to the combined cost of the queue size and loss ratio.

Cite

CITATION STYLE

APA

Chydzinski, A., & Adamczyk, B. (2019). Queues with the dropping function and general service time. PLoS ONE, 14(7). https://doi.org/10.1371/journal.pone.0219444

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free