Workloads and waiting times in single-server systems with multiple customer classes
From MaRDI portal
Publication:1823562
DOI10.1007/BF01149192zbMath0681.60098MaRDI QIDQ1823562
Publication date: 1989
Published in: Queueing Systems (Search for Journal in Brave)
mean waiting times; conservation law for mean waiting times; single-server multi-class service systems; work decomposition
60K25: Queueing theory (aspects of probability theory)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Waiting times in a two-queue model with exhaustive and Bernoulli service, Dominance relations in polling systems, Conditional and unconditional distributions for M/G/1 type queues with server vacations, 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, Mean value analysis for polling systems, Queue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacations, Iterative approximation of \(k\)-limited polling systems, A note on polling models with renewal arrivals and nonzero switch-over times, Efficient visit frequencies for polling tables: Minimization of waiting cost, On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals, 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, Performance analysis and optimization of a cyclic-service tandem queueing system with multi-class customers, On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers, Stochastic bounds for a polling system, A deep cut ellipsoid algorithm for convex programming: Theory and applications, Approximating queue size and waiting time distributions in general polling systems, \(N\) parallel queueing systems with server breakdown and repair, Level-crossing approach to a time-limited service system with two types of vacations, Discrete time queues with delayed information, Polling systems with multiple coupled servers, A mean value formula for the M/G/1 queues controlled by workload, 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, An M\(^{[x}\)/G/1 system with startup server and \(J\) additional options for service], Analysis of a time-limited service priority queueing system with exponential timer and server vacations, A pseudoconservation law for a time-limited service polling system with structured batch Poisson arrivals, ASTA implies an M/G/1-like load decomposition for a server with vacations, Cyclic Bernoulli polling, ON A QUEUING MODEL WITH SERVICE INTERRUPTIONS
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
