Linear independence of root equations for \(M/G/1\) type Markov chains

DOI10.1007/BF01245323zbMath0847.60076OpenAlexW1998878945MaRDI QIDQ1915946

S. L. Hantler, H. R. Gail, Moshe Sidi, B. Alan Taylor

Publication date: 1 July 1996

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01245323

zbMATH Keywords

ergodicitymatrix analytic methodtransform method

Mathematics Subject Classification ID

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

Related Items (9)

Analysis of the \(BMAP/G/1\) retrial system with search of customers from the orbit ⋮ Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process: BMAP/Gn(a,b)/1 ⋮ A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues ⋮ Computational analysis of bulk service queue with Markovian arrival process: MAP/R\(^{(a,b)}/1\) queue ⋮ BMAP/G/1 queue with correlated arrivals of customers and disasters. ⋮ Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process ⋮ Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline ⋮ Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes ⋮ Analysis of BMAP∕R∕1 Queues Under Gated-Limited Service with the Server’s Single Vacation Policy

Cites Work

• Matrix Analysis
• Time dependence of queues with semi-Markovian services
• The single server queue with Poisson input and semi-Markov service times
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear independence of root equations for \(M/G/1\) type Markov chains