Analysis of a finite-capacity M/G/1 queue with a resume level

DOI10.1016/0166-5316(85)90013-6zbMath0571.68027OpenAlexW1965543919MaRDI QIDQ3687709

Hideaki Takagi

Publication date: 1985

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(85)90013-6

zbMATH Keywords

performance measuressemi-Markov processqueue length distributionbuffer pool behaviordata communication component

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 (4)

Performance analysis of the \(DAR(1)/D/c\) priority queue under partial buffer sharing policy ⋮ Polling systems with batch service ⋮ Queueing systems with resume level ⋮ Analysis of an \(\mathrm{M}/\mathrm{G}/1/R\) queue with batch arrivals and two hysteretic overload control policies

This page was built for publication: Analysis of a finite-capacity M/G/1 queue with a resume level