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

DOI10.1016/0166-5316(85)90013-6MaRDI QIDQ3687709zbMATH OpenOpenAlexFDO

Authors 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 measuresqueue length distributionsemi-Markov processbuffer 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)

Recommendations

• Analysis of an M/G/1/K/N queue
• Modeling and performance analysis of a finite-buffer queue with batch arrivals, batch services, and setup times: the \(M^{X}/G^{Y}/1/K + B\) queue with setup times
• Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP^(a,b)/1/N
• Properties and performance modelling of finite buffer \(M/G/1/K\) networks
• Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach

Cited in

(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

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