Computing distributions and moments in polling models by numerical transform inversion

DOI10.1016/0166-5316(95)00015-1zbMATH Open0900.68049OpenAlexW2097347127MaRDI QIDQ4332072FDOQ4332072

Authors: Gagan L. Choudhury, Ward Whitt 

Publication date: 27 February 1997

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(95)00015-1

Recommendations

• Numerical Computation of the Moments of a Probability Distribution from its Transform
• Performance evaluation of polling systems by means of the power-series algorithm
• scientific article; zbMATH DE number 935967

zbMATH Keywords

Transient analysisGenerating functionsFourier-series methodNumerical transform inversionTail probabilitiesExhaustive service disciplinePolling models

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Cited In (17)

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

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)