The single-server queue with the dropping function and infinite buffer

DOI10.1155/2018/3260428MaRDI QIDQ1720755zbMATH OpenOpenAlexFDO

Authors Andrzej Chydzinski, Marek Barczyk, Dominik Samociuk

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2018/3260428

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

Summary: We present an analysis of queues with the dropping function and infinite buffer. In such queues, the arriving packet (job, customer, etc.) can be dropped with the probability which is a function of the queue size. Currently, the main application area of the dropping function is active queue management in routers, but it is applicable also in many other queueing systems. So far, queues with the dropping function have been analyzed with finite buffers only, which led to complicated, computationally demanding formulas. Assuming infinite buffers enabled us herein to obtain formulas in compact, easy to use forms. Moreover, a model with the infinite buffer can often be used as a good approximation of the real queue, in which the buffer is large. We start with noticing that the classic stability condition, \( \rho < 1\), cannot be used for queues with the dropping function and infinite buffer. For this reason, we prove a few new, easy to use conditions, which guarantee system stability or instability. Then we prove several theorems on popular performance characteristics, including the queue size, busy period, loss ratio, output rate, and system response time. Additionally, we derive a special, very important characteristic called the burst ratio, which may influence severely the quality of real-time multimedia transmissions. All the theorems are illustrated with numerical examples, demonstrating in particular how the system stability may be tested and how the shape of the dropping function may affect different performance characteristics.

Recommendations

• Response time of the queue with the dropping function
• Analysis of AQM queues with queue size based packet dropping
• On Main characteristics of the M/M/1/N queue with single and batch arrivals and the queue size controlled by AQM algorithms
• Queues with dropping functions and autocorrelated arrivals
• On the queue-size distribution in the multi-server system with bounded capacity and packet dropping

Cites work

• A concrete approach to classical analysis
• Analysis of AQM queues with queue size based packet dropping
• Burst ratio in the finite-buffer queue with batch Poisson arrivals
• scientific article; zbMATH DE number 3755546 (Why is no real title available?)
• scientific article; zbMATH DE number 227027 (Why is no real title available?)
• Nonlinear RED: a simple yet efficient active queue management scheme
• On Main characteristics of the M/M/1/N queue with single and batch arrivals and the queue size controlled by AQM algorithms
• Performance evaluation of an \(M/G/n\)-type queue with bounded capacity and packet dropping
• Queues with dropping functions and autocorrelated arrivals

Cited in

(5)

• Queues with dropping functions and autocorrelated arrivals
• Response time of the queue with the dropping function
• On the structure of data losses induced by an overflowed buffer
• Per-flow structure of losses in a finite-buffer queue
• Burst Ratio of Packet Losses in Individual Network Flows

This page was built for publication: The single-server queue with the dropping function and infinite buffer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1720755)