Computation of the state probabilities in M/G/1 queues with state dependent input and state dependent service

DOI10.1007/BF01719846MaRDI QIDQ1056151zbMATH OpenFDO

Authors Helmut Schellhaas

Publication date 1983

Published in OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

steady-state probabilities

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 4043001 (Why is no real title available?)
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 3532286 (Why is no real title available?)
• scientific article; zbMATH DE number 3591923 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Algorithms for the state probabilities and waiting times in single server queueing systems with random and quasirandom input and phase-type service times
• Markov Renewal Processes with Auxiliary Paths
• Periodicity in Markov renewal theory
• Reliability analysis of a parallel system with exponential life times and phase type repairs
• Some Conditions for Ergodicity and Recurrence of Markov Chains

Cited in

(4)

• Performance analysis of the single server queue with state-dependent service
• A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues
• Approximations for multiserver queues with balking/retrial discipline
• Analysis of finite-buffer state-dependent bulk queues

This page was built for publication: Computation of the state probabilities in M/G/1 queues with state dependent input and state dependent service

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