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

DOI10.1007/BF01719846zbMath0522.60095MaRDI QIDQ1056151

Helmut Schellhaas

Publication date: 1983

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

steady-state probabilities

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Performance analysis of the single server queue with state-dependent service

Cites Work

• Algorithms for the state probabilities and waiting times in single server queueing systems with random and quasirandom input and phase-type service times
• Reliability analysis of a parallel system with exponential life times and phase type repairs
• Periodicity in Markov renewal theory
• Some Conditions for Ergodicity and Recurrence of Markov Chains
• Markov Renewal Processes with Auxiliary Paths
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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