The \(M/G/1\) queue with processor sharing and its relation to a feedback queue

DOI10.1007/BF01159223zbMath0743.60090MaRDI QIDQ1177917

J. L. van den Berg, Onno J. Boxma

Publication date: 26 June 1992

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

feedback probabilitiesPASTA propertyprocessor sharing queuesingle channel queueing system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov renewal processes, semi-Markov processes (60K15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (21)

Queueing system with processor sharing and limited memory under control of the AQM mechanism ⋮ A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ Tail asymptotics for processor-sharing queues ⋮ Asymptotic diffusion analysis of \(MMPP|M|N\) queueing systems with feedback ⋮ Sojourn times in a processor sharing queue with multiple vacations ⋮ ANALYSIS AND OPTIMIZATION OF BLOOD-TESTING PROCEDURES ⋮ A Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks ⋮ On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing ⋮ On the \(N\)-policy of \(M/G/1\) feedback queue with varying arrival rates. ⋮ SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING ⋮ Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing ⋮ A Cost-Equation Analysis of General-Input General-Service Processor Sharing System ⋮ On sojourn times in \(M/GI\) systems under state-dependent processor sharing ⋮ Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ Analyzing an \(M|M| N\) queueing system with feedback by the method of asymptotic analysis ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing ⋮ Sojourn times in the \(M/ PH/1\) processor sharing queue ⋮ A tandem Jackson network with feedback to the first node ⋮ The M/G/1 processor-sharing model: Transient behavior ⋮ A \(BMAP/PH/1\) queue with feedback operating in a random environment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Processor-sharing queues: Some progress in analysis
• Interoutput times in processor sharing queues with feedback
• Sojourn time problems in feedback queues
• A new approach to the M/G/1 processor-sharing queue
• A note on sojourn times in M/G/1 queues with instantaneous, bernoulli feedback
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• The M/G/1 processor sharing queue as the almost sure limit of feedback queues
• Queueing Networks: A Survey of Their Random Processes
• Sojourn times in the m/g/1 queue with deterministic feedback
• A derivation of response time distributions for a multi-class feedback queueing systems
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Stationary increments in the accumulated work process in processor-sharing queues
• Waiting Time Distributions for Processor-Sharing Systems

This page was built for publication: The \(M/G/1\) queue with processor sharing and its relation to a feedback queue