AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue

DOI10.1081/STM-200056223zbMath1069.60077OpenAlexW2055762831MaRDI QIDQ5462801

Zhaotong Lian, Quan-Lin Li, Li-Ming Liu

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-200056223

zbMATH Keywords

sojourn timebatch Markovian arrival process (BMAP)Markov chain of \(M/G/1\) type

Mathematics Subject Classification ID

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

Related Items (14)

Departure processes and busy periods of a tandem network ⋮ Analysis and computation of the stationary distribution in a special class of Markov chains of level-dependent \(\mathrm{M}/\mathrm{G}/1\)-type and its application to \(\mathrm{BMAP}/\mathrm{M}/\infty\) and \(\mathrm{BMAP}/\mathrm{M}/c+\mathrm{M}\) queues ⋮ A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service ⋮ An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue ⋮ A new matrix-infinite-product-form solution for upper block-Hessenberg Markov chains and its quasi-algorithmic constructibility ⋮ Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline ⋮ Processor sharing: a survey of the mathematical theory ⋮ A tandem network with MAP inputs ⋮ Computing the conditional stationary distribution in Markov chains of level-dependent M/G/1-type ⋮ Performance analysis of two-loop closed production systems ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ A sequential update algorithm for computing the stationary distribution vector in upper block-Hessenberg Markov chains ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ Subexponential asymptotics of asymptotically block-Toeplitz and upper block-Hessenberg Markov chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic
• Numerical investigation of a multiserver retrial model
• Processor-sharing queues: Some progress in analysis
• Mathematical problems in the theory of processor-sharing queueing systems
• The multiple phase service network with generalized processor sharing
• Large deviations and the generalized processor sharing scheduling for a multiple-queue system
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• A direct projection method for Markov chains
• A retrial BMAP/SM/1 system with linear repeated requests
• Sojourn times in a processor sharing queue with service interruptions
• A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows
• An algorithmic approach for sensitivity analysis of perturbed quasi-birth-and-death processes
• Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
• Fluid and heavy traffic diffusion limits for a generalized processor sharing model
• The fluid limit of a heavily loaded processor sharing queue
• Invariant states and rates of convergence for a critical fluid model of a processor sharing queue.
• Diffusion approximation for a processor sharing queue in heavy traffic.
• SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
• The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic
• Equilibrium distribution of block-structured Markov chains with repeating rows
• The sojourn time in the GI/M/1 queue by processor sharing
• Response-Time Distribution for a Processor-Sharing System
• New results on the single server queue with a batch markovian arrival process
• On processor sharing and random service
• Regenerative Analysis and Steady State Distributions for Markov Chains
• The N/G/1 queue and its detailed analysis
• Sharing a Processor Among Many Job Classes
• The gi/m/1 processor-sharing queue and its heavy traffic analysis
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
• Technical Note—Conditional Response Times in M/M/1 Processor-Sharing Models
• GI/G/1 processor sharing queue in heavy traffic
• Complementation in Stochastic Matrices and the GTH Algorithm
• Generalized processor sharing queues with heterogeneous traffic classes
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
• Feedback Queueing Models for Time-Shared Systems
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals
• Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
• Analysis of the M/M/1 queue with processor sharing via spectral theory

This page was built for publication: AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue