Age process, workload process, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue
From MaRDI portal
Publication:2572898
DOI10.1007/s11134-005-6972-yzbMath1080.90028OpenAlexW2029689645MaRDI QIDQ2572898
Publication date: 7 November 2005
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-005-6972-y
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
A batch arrival $M^X/M/c$ queue with impatient customers ⋮ Commuting Matrices in the Queue Length and Sojourn Time Analysis of MAP/MAP/1 Queues ⋮ An \(\mathrm{M}/\mathrm{PH}/K\) queue with constant impatient time ⋮ Analysis of a continuous time SM[K/PH[K]/1/FCFS queue: age process, sojourn times, and queue lengths] ⋮ Mathematical analysis of queue with phase service: an overview ⋮ Queues with Correlated Service and Inter-Arrival Times and Their Application to Optical Buffers ⋮ A Fast Newton's Iteration for M/G/1-Type and GI/M/1-Type Markov Chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The single server semi-Markov queue
- Phase-type representations in random walk and queueing problems
- 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
- Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K/PH[K]/N/LCFS non-preemptive queue]
- Markov chains with marked transitions
- Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
- STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
- The delay distribution of a type k customer in a first-come-first-served MMAP[K/PH[K]/1 queue]
- Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue]
- The semi-markovian queue: theory and applications
- Phase-type representations for matrix-geometric solutions
- Generalizations of the Pollaczek-Khinchin integral equation in the theory of queues
- 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
- A logarithmic reduction algorithm for quasi-birth-death processes
- Solutions of the basic matrix equation for M/G/l AND G/M/1 type markov chains
- 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
- Representations for matrix-geometric and matrix-exponential steady-state distributions with applications to many-server queues
- 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
- Queues with semi-Markovian arrivals
- 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
