Computing distributions and moments in polling models by numerical transform inversion

DOI10.1016/0166-5316(95)00015-1zbMath0900.68049OpenAlexW2097347127MaRDI QIDQ4332072

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

zbMATH Keywords

Generating functionsTransient analysisFourier-series methodNumerical transform inversionTail probabilitiesExhaustive service disciplinePolling models

Mathematics Subject Classification ID

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

Related Items (15)

Polling: past, present, and perspective ⋮ Polling Models Under Limited Service Policies: Sharp Asymptotics ⋮ Priority queueing systems: from probability generating functions to tail probabilities ⋮ The analysis of batch sojourn-times in polling systems ⋮ Polling Models with Unequal Service Rates under Limited Service Policies—Sharp Asymptotics ⋮ Computing the Moments of Polling Models with Batch Poisson Arrivals by Transform Inversion ⋮ Mathematical methods to study the polling systems ⋮ Towards a unifying theory on branching-type polling systems in heavy traffic ⋮ A New Method for Deriving Waiting-Time Approximations in Polling Systems with Renewal Arrivals ⋮ POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS ⋮ Polling models with multi-phase gated service ⋮ A Two‐Queue Polling Model with Regularly Varying Service and/or Switchover Times ⋮ Polling systems with periodic server routeing in heavy traffic: distribution of the delay ⋮ L\'evy-driven polling systems and continuous-state branching processes ⋮ Recursive calculation of moments in priority queues

This page was built for publication: Computing distributions and moments in polling models by numerical transform inversion