Partially shared buffers with full or mixed priority

DOI10.3934/jimo.2011.7.735zbMath1235.60127OpenAlexW2312397414MaRDI QIDQ656437

Thomas Demoor, Joris Walraevens, Dieter Fiems, Herwig Bruneel

Publication date: 18 January 2012

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2011.7.735

zbMATH Keywords

queueing theorymatrix analytic methodpartial buffer sharingspace prioritytime priority

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Network protocols (68M12)

Related Items (4)

Approximate method for analysis of queuing models with jump priorities ⋮ Asymptotic analysis of the \(\mathrm{M/M/1/N}-1\) retrial system with priority and feedback ⋮ Numerical method for the analysis of queuing models with priority jumps ⋮ Queueing models for the analysis of communication systems

This page was built for publication: Partially shared buffers with full or mixed priority