Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload
From MaRDI portal
Publication:4345595
Recommendations
Cited in
(12)- scientific article; zbMATH DE number 6951362 (Why is no real title available?)
- A stochastic queueing model for capacity allocation in the hierarchical healthcare delivery system
- Sampling at subexponential times, with queueing applications
- Characterisation of the output process of a discrete-time \(GI/D/1\) queue, and its application to network performance
- A comparison of the sliding window and the leaky bucket
- Estimation of the Poisson stream intensity in a multilinear queue with an exponential job queue decay
- A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues
- Price, delivery time guarantees and capacity selection
- Ergodic theorems for queuing systems with dependent inter-arrival times
- ApproximatingM/G/1 Waiting Time Tail Probabilities
- Effective bandwidths for Markov regenerative sources
- Quandary of service logistics: fast or reliable?
This page was built for publication: Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345595)