Response time of the queue with the dropping function

Andrzej Chydzinski and Blazej Adamczyk

Applied Mathematics and Computation, 2020, vol. 377, issue C

Abstract: In many active queue management algorithms, the dropping function, which associates the probability of dropping a packet with the buffer occupancy, is used. Several different forms of the dropping function has been considered so far, from a simple linear one, to the newest three-range polynomials. In this paper, an analysis of the response time of the queue with the dropping function is presented. In particular, theorems on the distribution of the response time and its average value and variance are proven. The assumed model of the queue is general – it allows arbitrary form of the dropping function, arbitrary form of the service time distribution and infinite buffer. Theoretical results are illustrated with numerical results for five popular types of dropping functions.

Keywords: Internet; Queueing model; Dropping function; Performance evaluation; Response time (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320301338
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:377:y:2020:i:c:s0096300320301338

DOI: 10.1016/j.amc.2020.125164

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().