Comparing counting processes and queues

DOI10.2307/1426475zbMATH Open0449.60064OpenAlexW2075259347MaRDI QIDQ3896331FDOQ3896331

Authors: Ward Whitt 

Publication date: 1981

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1426475

zbMATH Keywords

counting processstochastic ordertandem queuespoint process on the line

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited In (49)

• Comparing ordered-entry queues with heterogeneous servers
• Sufficient stability conditions for multi-class constant retrial rate systems
• Stochastic grey-box modeling of queueing systems: fitting birth-and-death processes to data
• Renewal sums under mixtures of exponentials
• Stability of constant retrial rate systems with NBU input
• Monotonicity and error bounds for networks of Erlang loss queues
• A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
• Title not available (Why is that?)
• TRANSIENT ANALYSIS OF LINEAR BIRTH–DEATH PROCESSES WITH IMMIGRATION AND EMIGRATION
• Sample-path analysis of processes with imbedded point processes
• Sample path large deviations and intree networks
• Control limit policies in a replacement model with additive phase-type distributed damage and linear restoration
• Further remarks on queueing network theory
• Steady-state GI/G/\(n\) queue in the Halfin-Whitt regime
• Monotonicity properties in various retrial queues and their applications
• TheM/G/1 Queue with Quasi-Restricted Accessibility
• Heavy-traffic extreme value limits for Erlang delay models
• Logarithmic regret bounds for continuous-time average-reward Markov decision processes
• A state-dependent queueing system with asymptotic logarithmic distribution
• A Note on Time Monotonicity for Performability Models
• Spatiotemporal Convexity of Stochastic Processes and Applications
• Stochastic ordering and thinning of point processes
• Stability analysis of \(\mathrm{GI}/\mathrm{GI}/c/K\) retrial queue with constant retrial rate
• The asymptotic variance of departures in critically loaded queues
• Optimal control of multiclass parallel service systems
• On regenerative estimation of extremal index in queueing systems
• A simple performability estimate for Jackson networks with an unreliable output channel
• Approximate uniformization for continuous-time Markov chains with an application to performability analysis
• Burst reduction properties of rate-control throttles: Departure process
• The influence of demand variability on the performance of a make-to-stock queue
• Almost sure comparison of birth and death processes with application to M/M/s queueing systems
• Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits
• Title not available (Why is that?)
• The transient blended queue
• Simple performance estimates and error bounds for slotted ALOHA loss systems
• Diffusion approximation for an overloaded \(X\) model via a stochastic averaging principle
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• Stochastic Bounds for Two-Layer Loss Systems
• A comparison of stochastically ordered queues
• Busy period analysis for \(M/G/1\) and \(G/M/1\) type queues with restricted accessibility
• Counterexamples for comparisons of queues with finite waiting rooms
• Using a standard clock technique for efficient simulation
• Monotonicity properties of cost functions in queueing networks
• On comparison of multiserver systems with multicomponent mixture distributions
• Limits for queues as the waiting room grows
• Rejection rules in the \(M/G/1\) queue
• Title not available (Why is that?)
• The heavy-traffic bottleneck phenomenon in open queueing networks
• Comparison conjectures about the M/G/s queue

This page was built for publication: Comparing counting processes and queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3896331)