Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains
From MaRDI portal
Publication:4361803
DOI10.2307/1428084zbMath0892.60091MaRDI QIDQ4361803
B. Alan Taylor, H. R. Gail, S. L. Hantler
Publication date: 9 August 1998
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1428084
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
AMAP/G/1 Queue with an Underlying Birth–Death Process, Algorithmic analysis of the BMAP/D/k system in discrete time, Stochastic monotonicity and comparability of Markov chains with block-monotone transition matrices and their applications to queueing systems, A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure, The Batch Markovian Arrival Process Subject to Renewal Generated Geometric Catastrophes, Analysis of generalized QBD queues with matrix-geometrically distributed batch arrivals and services, Two classes of time-inhomogeneous Markov chains: Analysis of the periodic case, An advanced queueing model to analyze appointment-driven service systems, Exploiting the Toeplitz structure in certain queueing problems, Computations with infinite Toeplitz matrices and polynomials, Non-skip-free M/G/1-type Markov chains and Laurent matrix power series, Rate-tilting for fast simulation of level/phase processes, Per connection performance analysis of a frame-based TDMA/CDMA MAC protocol containing both reservation and contention slots, The optimal allocation of server time slots over different classes of patients, Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue], Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue]
