Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K]/SM[K]/1/FCFS Queue
From MaRDI portal
Publication:3157860
DOI10.1081/STM-200033099zbMath1060.60088OpenAlexW2328669200MaRDI QIDQ3157860
Publication date: 19 January 2005
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/stm-200033099
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
Analysis of a continuous time SM[K/PH[K]/1/FCFS queue: age process, sojourn times, and queue lengths] ⋮ Marked Markovian arrivals in a tandem G-network with blocking ⋮ Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(MMAP[K/PH[K]/1\) queues with a last-come-first-served preemptive service discipline]
- Censoring, factorizations, and spectral analysis for transition matrices with block-repeating entries
- Markov chains with marked transitions
- Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
- A continuous version of matrix-analytic methods with the skip-free to the left property
- The delay distribution of a type k customer in a first-come-first-served MMAP[K/PH[K]/1 queue]
- Generalizations of the Pollaczek-Khinchin integral equation in the theory of queues
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- Markov processes whose steady state distribution is matrix-exponential with an application to the GI/PH/1 queue
- Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority
- On steady-state queue size distributions of the discrete-time GI/G/1 queue
- Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains
- The Waiting Time Distribution of a TypekCustomer in a Discrete-Time MMAP[K/PH[K]/c (c = 1, 2) Queue Using QBDs]
- FIFO by sets ALOHA (FS-ALOHA): a collision resolution algorithm for the contention channel in wireless ATM systems
- Topics in the Constructive Theory of Countable Markov Chains
- Queues with marked customers
- Marked point processes as limits of Markovian arrival streams
- The versatility of MMAP[K and the MMAP[K]/G[K]/1 queue]
- Queue length distribution in a FIFO single-server queue with multiple arrival streams having different service time distributions
This page was built for publication: Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K]/SM[K]/1/FCFS Queue
