A BAYESIAN APPROACH TO FIND RANDOM-TIME PROBABILITIES FROM EMBEDDED MARKOV CHAIN PROBABILITIES

DOI10.1017/S0269964807000319zbMath1145.90354OpenAlexW2035381730MaRDI QIDQ5433637

Javad Tavakoli, Winfried K. Grassmann

Publication date: 9 January 2008

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964807000319

Mathematics Subject Classification ID

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

Related Items (2)

A tollbooth tandem queue with heterogeneous servers ⋮ Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues

Cites Work

• Analysis of \(\text{GI}/\text{M}/s/c\) queues using uniformisation
• Optimal service rates for the state-dependent \(M/G/1\) queues in steady state

This page was built for publication: A BAYESIAN APPROACH TO FIND RANDOM-TIME PROBABILITIES FROM EMBEDDED MARKOV CHAIN PROBABILITIES