Performance evaluation of an \(M/G/n\)-type queue with bounded capacity and packet dropping

DOI10.1515/amcs-2016-0060zbMath1355.93176OpenAlexW2576500185MaRDI QIDQ511387

Wojciech M. Kempa, Oleg M. Tikhonenko

Publication date: 15 February 2017

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2016-0060

zbMATH Keywords

finite bufferloss probabilityAQM algorithmsqueue-size distributiontotal packet volume

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic systems in control theory (general) (93E03)

Related Items (6)

Response time of the queue with the dropping function ⋮ The single-server queue with the dropping function and infinite buffer ⋮ Infinite–Server Tandem Queue with Renewal Arrivals and Random Capacity of Customers ⋮ On the Total Customers’ Capacity in Multi-server Queues ⋮ Queueing systems with random volume customers and a sectorized unlimited memory buffer ⋮ Finite capacity single-server queue with Poisson input, general service and delayed renovation

Cites Work

• A RED modified weighted moving average for soft real-time application
• Nonlinear RED: a simple yet efficient active queue management scheme
• Queueing systems of a random length with restrictions
• A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning
• Generalized Erlang problem for service systems with finite total capacity
• Transient and stationary characteristics of a packet buffer modelled as an \(\mathrm{MAP}/\mathrm{SM}/1/b\) system
• Analysis of AQM queues with queue size based packet dropping
• Queueing Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Performance evaluation of an \(M/G/n\)-type queue with bounded capacity and packet dropping