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