Properties of the interrupted Poisson approximation
The interrupted Poisson approximation has been used very successfully for overflow systems. The approximation is fitted to the overflow stream so that if the number of overflow servers was infinite the distribution of the number of serves in use would have the same first three moments. The approximation is shown to be a lower bound in the sense that it underestimates all of the remaining moments. From this, its properties as an approximation for queueing overflow problems can be predicted and its performance as an approximation can be improved for high traffic intensities. For many problems an upper bound can also be produced.
- The Interrupted Poisson Process As An Overflow Process
- A class of renewal Interrupted Poisson Processes and applications to queueing systems
- Individual Traffic Characteristics Queueing Systems with Multiple Poisson and Overflow Inputs
- Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers
- A Note on Evaluating the Overflow Probability Using the Infinite Queue
- A Method of Moments for the Analysis of a Switched Communication Network's Performance
- A note on congestion in overflow queues
- scientific article; zbMATH DE number 3174016 (Why is no real title available?)
- scientific article; zbMATH DE number 3744898 (Why is no real title available?)
- Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room
- The Interrupted Poisson Process As An Overflow Process
This page was built for publication: Properties of the interrupted Poisson approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796904)