Matrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams
From MaRDI portal
Publication:5462803
DOI10.1081/STM-200056013zbMath1069.60080OpenAlexW2084669950MaRDI QIDQ5462803
Hiroyuki Masuyama, Tetsuya Takine
Publication date: 27 July 2005
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/stm-200056013
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Processes in random environments (60K37)
Cites Work
- The \(MMAP[K/PH[K]/1\) queues with a last-come-first-served preemptive service discipline]
- Stability conditions of the MMAP[\(K\)/\(G\)[\(K\)]/1/LCFS preemptive repeat queue]
- Markov chains with marked transitions
- Matrix product-form solution for an LCFS-PR single-server queue with multiple arrival streams governed by a Markov chain
- Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models
- New results on the single server queue with a batch markovian arrival process
- Extended and conditional versions of the PASTA property
- A single-server queue with server vacations and a class of non-renewal arrival processes
- The Relation between Customer and Time Averages in Queues
- The quasi-birth-death type markov chain with a tree structure
- The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority
- Matrix product-form solutions for Markov chains with a tree structure
- Classification of Markov Processes of Matrix M/G/l type with a Tree Structure and its Applications to the MMAP[K/G[K]/1 Queues]
- A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure
- The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing
- A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
- Queues with marked customers
- Distributional form of Little's law for FIFO queues with multiple Markovian arrival streams and its application to queues with vacations
- The versatility of MMAP[K and the MMAP[K]/G[K]/1 queue]