Using cumulant functions in queueing theory

DOI10.1023/A:1015053801129MaRDI QIDQ1598902zbMATH OpenOpenAlexFDO

Authors Timothy I. Matis, Richard M. Feldman

Publication date 28 May 2002

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1015053801129

zbMATH Keywords

approximationMarkovian queueing systemmomentssystem sizetransient solutions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

A novel and effective method is proposed to approximate the moments of the system size in a Markovian queueing system with state dependent service using cumulants. Numerical examples are presented. This approach has been used earlier in an ecological context by \textit{J. H. Matis} and \textit{T. R. Kiffe} [Stochastic population models -- a compartmental perspective, Springer, New York, (2000; Zbl 0943.92029)].

Recommendations

• scientific article; zbMATH DE number 4178313
• scientific article; zbMATH DE number 3168168
• Transient analysis of state-dependent queueing networks via cumulant functions
• scientific article; zbMATH DE number 3433322
• Tail probabilities in queueing processes
• scientific article; zbMATH DE number 6515607
• scientific article; zbMATH DE number 1215446
• Queue length distributions from probability generating functions via discrete Fourier transforms

Cited in

(1)

• Tricomi and Kummer functions in occurrence, waiting time and exceedance statistics

This page was built for publication: Using cumulant functions in queueing theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598902)