Queues with dropping functions and general arrival processes

32Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

In a queueing system with the dropping function the arriving customer can be denied service (dropped) with the probability that is a function of the queue length at the time of arrival of this customer. The potential applicability of such mechanism is very wide due to the fact that by choosing the shape of this function one can easily manipulate several performance characteristics of the queueing system. In this paper we carry out analysis of the queueing system with the dropping function and a very general model of arrival process-the model which includes batch arrivals and the interarrival time autocorrelation, and allows for fitting the actual shape of the interarrival time distribution and its moments. For such a system we obtain formulas for the distribution of the queue length and the overall customer loss ratio. The analytical results are accompanied with numerical examples computed for several dropping functions.

Cite

CITATION STYLE

APA

Chydzinski, A., & Mrozowski, P. (2016). Queues with dropping functions and general arrival processes. PLoS ONE, 11(3). https://doi.org/10.1371/journal.pone.0150702

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