The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System

DOI10.1007/11777830_15zbMath1185.68126OpenAlexW1575382227MaRDI QIDQ3613677

Benny Van Houdt, J. Van Velthoven, Chris Blondia

Publication date: 12 March 2009

Published in: Formal Methods and Stochastic Models for Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://repository.uantwerpen.be/docman/irua/30439f/4721.pdf

zbMATH Keywords

generating functionsmatrix analytic methodspriority queuesloss ratebuffer finiteness

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

\((N, n)\)-preemptive-priority M/G/1 queues with finite and infinite buffers ⋮ Analysis of a discrete-time preemptive resume priority buffer ⋮ Delay analysis of multiclass queues with correlated train arrivals and a hybrid priority/FIFO scheduling discipline

This page was built for publication: The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System