SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING

DOI10.1081/STM-100001400zbMath0994.90052OpenAlexW2083148839MaRDI QIDQ2746240

Rudesindo Núñez-Queija

Publication date: 10 October 2001

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1081/stm-100001400

zbMATH Keywords

random environmentsojourn timerandom time changediscriminatory processor sharingquasi birth-death processvarying service rate

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (10)

Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals ⋮ Sojourn Time Analysis for Processor Sharing Loss System with Unreliable Server ⋮ Analysis of the M/G/1 processor-sharing queue with bulk arrivals ⋮ Analysis of a queueing system with mixed service discipline ⋮ Processor sharing: a survey of the mathematical theory ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ Perturbation analysis of an \(M/M/1\) queue in a diffusion random environment ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ Perturbation analysis of a variable M/M/1 queue: a probabilistic approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Value iteration in countable state average cost Markov decision processes with unbounded costs
• Processor-sharing queues: Some progress in analysis
• Markov and Markov reward model transient analysis: An overview of numerical approaches
• The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
• Mathematical problems in the theory of processor-sharing queueing systems
• The multiple phase service network with generalized processor sharing
• Analysis of a versatile multi-class delay-loss system with a superimposed Markovian arrival process
• Sojourn times in a processor sharing queue with service interruptions
• Solution of finite QBD processes
• Exponential Convergence in Undiscounted Continuous-Time Markov Decision Chains
• Crump–Mode–Jagers Branching Processes As a Method of Investigating ${\rm M}/{\rm G}/1$ Systems with Processor Sharing
• On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
• An algorithm to calculate transient distributions of cumulative rate and impulse based reward
• Performability analysis: a new algorithm
• Stationary increments in the accumulated work process in processor-sharing queues
• Generalized folding-algorithm for sojourn time analysis of finite qbd processes and its queueing applications
• Analysis of A time‐shared processor
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems
• Time Sharing with Priorities

This page was built for publication: SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING