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

DOI10.1007/BF01245323zbMATH Open0847.60076OpenAlexW1998878945MaRDI QIDQ1915946FDOQ1915946

Authors: H. Richard Gail, S. L. Hantler, Moshe Sidi, B. A. 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

Recommendations

• Solutions of the basic matrix equation for M/G/l AND G/M/1 type markov chains
• An explicit solution to a particular Markov chain of M/G/1 type
• scientific article; zbMATH DE number 1867252
• Level-phase independence for \(\text{GI}/\text{M}/1\)-type Markov chains
• On monotone Markov chains and properties of monotone matrix roots
• Filtration of random solutions of a system of linear difference equations with coefficients depending on a Markov chain

zbMATH Keywords

ergodicitymatrix analytic methodtransform method

Mathematics Subject Classification ID

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

Cites Work

• Matrix Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Time dependence of queues with semi-Markovian services
• The single server queue with Poisson input and semi-Markov service times

Cited In (10)

• Title not available (Why is that?)
• Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes
• Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process: BMAP/Gn(a,b)/1
• Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline
• Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process
• 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
• Analysis of the \(BMAP/G/1\) retrial system with search of customers from the orbit
• 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 \(BMAP/R/1\) queues under gated-limited service with the Server's single vacation policy

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

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