A method for computing the states for a queue with walks of the server

zbMATH Open0929.90008MaRDI QIDQ1287508FDOQ1287508

Authors: E. A. Saksonov 

Publication date: 13 December 1999

Published in: Automation and Remote Control (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 866108
• On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
• scientific article; zbMATH DE number 4043001
• Calculating steady-state probabilities of the \(G/M/n/m\) queueing systems
• A method for calculating the marginal probabilities of states of cyclic queueing systems

zbMATH Keywords

\(M/G/1\) queuequeues with walks

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

This page was built for publication: A method for computing the states for a queue with walks of the server

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