Analysis of an M/G/1/K/N queue

DOI10.2307/3214853zbMATH Open0772.60084OpenAlexW2327744481MaRDI QIDQ5288022FDOQ5288022

Authors: Tetsuya Takine, Hideaki Takagi, Toshiharu Hasegawa 

Publication date: 11 October 1993

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214853

Recommendations

• scientific article; zbMATH DE number 834595
• scientific article; zbMATH DE number 1389067
• Analysis of a finite-capacity M/G/1 queue with a resume level
• Modelling and analysis of \(M/G^{a,b}/1/N\) queue -- A simple alternative approach

zbMATH Keywords

blocking probabilitysteady-state analysissystem throughputjoint distributions of the queue size and the remaining service times

Mathematics Subject Classification ID

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

Cited In (9)

• Computational analysis of M(n)/G/1/N queues with setup time
• Performance analysis of the single server queue with state-dependent service
• Analysis of a finite-capacity M/G/1 queue with a resume level
• Title not available (Why is that?)
• Analysis of discrete-time TES/G/1 and TES/D/1-K queueing systems
• Properties and performance modelling of finite buffer \(M/G/1/K\) networks
• Analysis of queueing-time distributions for MAP/D_N/1 queue
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Analysis of an M/G/1/K/N queue

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