The use of Spitzer's identity in the investigation of the busy period and other quantities in the queue GI/G/1
From MaRDI portal
Publication:5733933
Cites work
- A Combinatorial Lemma and Its Application to Probability Theory
- Investigation of waiting time problems by reduction to Markov processes
- Order Statistics of Partial Sums
- Singular Integral Equations†
- Spitzer's Formula: A Short Proof
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- The Wiener-Hopf equation whose kernel is a probability density
Cited in
(7)- A discrete-time single-server queue with set-up time
- The first Erlang century---and the next
- Cumulants of the maximum of the Gaussian random walk
- Fluctuations of a renewal-reward process
- Limits and approximations for the busy-period distribution in single-server queues
- Two-sided bounds of ruin probabilities
- Queues with correlated inter-arrival and service times
This page was built for publication: The use of Spitzer's identity in the investigation of the busy period and other quantities in the queue GI/G/1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5733933)