Workloads and waiting times in single-server systems with multiple customer classes

DOI10.1007/BF01149192zbMath0681.60098OpenAlexW2142557625MaRDI QIDQ1823562

Onno J. Boxma

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1007/bf01149192

zbMATH Keywords

mean waiting timesconservation law for mean waiting timessingle-server multi-class service systemswork decomposition

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (57)

Polling: past, present, and perspective ⋮ Approximating queue size and waiting time distributions in general polling systems ⋮ Mean value analysis for polling systems ⋮ ASTA implies an M/G/1-like load decomposition for a server with vacations ⋮ Queue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacations ⋮ Discrete time queues with delayed information ⋮ Polling systems with multiple coupled servers ⋮ Waiting times in a two-queue model with exhaustive and Bernoulli service ⋮ Controlled mobility in stochastic and dynamic wireless networks ⋮ On open problems in polling systems ⋮ A two-queue polling model with two priority levels in the first queue ⋮ Iterative approximation of \(k\)-limited polling systems ⋮ \(N\) parallel queueing systems with server breakdown and repair ⋮ Performance analysis of polling systems with retrials and glue periods ⋮ A decomposition property for an \(M^X / G / 1\) queue with vacations ⋮ Queues with interruptions: a survey ⋮ ON A QUEUING MODEL WITH SERVICE INTERRUPTIONS ⋮ Delay performance in random-access networks ⋮ Efficient visit frequencies for polling tables: Minimization of waiting cost ⋮ A mean value formula for the M/G/1 queues controlled by workload ⋮ On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals ⋮ On polling systems with large setups ⋮ Batch arrival queues under vacation policies with server breakdowns and startup/closedown times ⋮ Stochastic decomposition of the \(M/G/\infty \) queue in a random environment ⋮ Analysis of the MAP/G/1 Queue Under the Min(N,D)-Policy ⋮ An M\(^{[x}\)/G/1 system with startup server and \(J\) additional options for service] ⋮ Stability, monotonicity and invariant quantities in general polling systems ⋮ A decomposition result for a class of polling models ⋮ A queueing network with a single cyclically roving server ⋮ A note on the pseudo-conservation law for a multi-queue with local priority ⋮ Performance evaluation of polling systems by means of the power-series algorithm ⋮ Cyclic reservation schemes for efficient operation of multiple-queue single-server systems ⋮ Polling systems with synchronization constraints ⋮ A generalization of the decomposition property in the \(M/G/1\) queue with server vacations ⋮ Dynamic priority rules when polling with multiple parallel servers ⋮ A note on conservation laws for a multi-class service queueing system with setup times ⋮ Analysis of a time-limited service priority queueing system with exponential timer and server vacations ⋮ Performance analysis and optimization of a cyclic-service tandem queueing system with multi-class customers ⋮ Continuous polling models and application to ferry assisted WLAN ⋮ Analysis of a batch arrival queue with vacation policy and exceptional service ⋮ Two queues with random time-limited polling ⋮ A pseudoconservation law for a time-limited service polling system with structured batch Poisson arrivals ⋮ Level-crossing approach to a time-limited service system with two types of vacations ⋮ An Analysis of Asymmetrical Threshold Polling Systems ⋮ Managing premium wines using an \((s - 1,s)\) inventory policy: a heuristic solution approach ⋮ A note on polling models with renewal arrivals and nonzero switch-over times ⋮ Decomposition results for stochastic storage processes and queues with alternating Lévy inputs ⋮ Dominance relations in polling systems ⋮ Conditional and unconditional distributions for M/G/1 type queues with server vacations ⋮ Queueing systems with random volume customers and a sectorized unlimited memory buffer ⋮ L\'evy-driven polling systems and continuous-state branching processes ⋮ On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers ⋮ Cyclic Bernoulli polling ⋮ Stochastic bounds for a polling system ⋮ A deep cut ellipsoid algorithm for convex programming: Theory and applications ⋮ Expected waiting times in polling systems under priority disciplines ⋮ Modified \(T\) vacation policy for an \(M/G/1\) queueing system with an unreliable server and startup

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominance relations in polling systems
• Queueing systems with vacations - a survey
• A queueing network with a single cyclically roving server
• On the M/G/1 queue by additional inputs
• Generalizations of the stochastic decomposition results for single server queues with vacations
• Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
• Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules
• Pseudo-conservation laws in cyclic-service systems
• Queuing analysis of polling models
• Analysis of cyclic service systems with limited service: Bounds and approximations
• M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
• Waiting times in discrete-time cyclic-service systems
• The Analysis of Random Polling Systems
• Dynamic priority rules for cyclic-type queues
• Poisson Arrivals See Time Averages
• Two Queues in Tandem Attended by a Single Server
• Time-Sharing Service Systems. I
• A delay dependent queue discipline
• A conservation law for a wide class of queueing disciplines
• Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue G/G/1
• Work-conserving priorities
• A single server tandem queue
• On the relation between customer and time averages in queues

This page was built for publication: Workloads and waiting times in single-server systems with multiple customer classes