Computing distributions and moments in polling models by numerical transform inversion
From MaRDI portal
Publication:4332072
Recommendations
Cited in
(17)- Numerical Computation of the Moments of a Probability Distribution from its Transform
- Polling models with multi-phase gated service
- Computing the moments of polling models with batch Poisson arrivals by transform inversion
- A Two‐Queue Polling Model with Regularly Varying Service and/or Switchover Times
- Polling Models with Unequal Service Rates under Limited Service Policies—Sharp Asymptotics
- A new method for deriving waiting-time approximations in polling systems with renewal arrivals
- Recursive calculation of moments in priority queues
- Lévy-driven polling systems and continuous-state branching processes
- Towards a unifying theory on branching-type polling systems in heavy traffic
- Polling: past, present, and perspective
- The analysis of batch sojourn-times in polling systems
- POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS
- Priority queueing systems: from probability generating functions to tail probabilities
- Queue length distributions from probability generating functions via discrete Fourier transforms
- Polling Models Under Limited Service Policies: Sharp Asymptotics
- Mathematical methods to study the polling systems
- Polling systems with periodic server routeing in heavy traffic: distribution of the delay
This page was built for publication: Computing distributions and moments in polling models by numerical transform inversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332072)