Interpolation Approximations of Sojourn Time Distributions

DOI10.1287/OPRE.39.2.251MaRDI QIDQ3353933zbMATHOpenAlexFDO

Authors Philip Fleming, Burton Simon

Publication date 1991

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.39.2.251

zbMATH Keywords

heavy traffic limitsapproximating sojourn time distributionsnetworks of priority queues

Mathematics Subject Classification ID

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

Recommendations

• Simterpolation: A Simulation based Interpolation Approximation for Queueing Systems
• An Interpolation Approximation for Queueing Systems with Poisson Input
• A Simple Relationship Between Light and Heavy Traffic Limits
• Calculating light traffic limits for sojourn times in open markovian queueing systems
• Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks

Cited in

(10)

• An Interpolation Approximation for Queueing Systems with Poisson Input
• A Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks
• A network of priority queues in heavy traffic: One bottleneck station
• scientific article; zbMATH DE number 16756 (Why is no real title available?)
• Simterpolation: A Simulation based Interpolation Approximation for Queueing Systems
• Transient flows in queueing systems via closure approximations
• An interpolation approximation for expected wait in a time-limited polling system
• Approximation of sojourn-times via maximal couplings: motif frequency distributions
• A Simple Relationship Between Light and Heavy Traffic Limits
• An explicit estimate of sojourning time by intermittency with elementary method

This page was built for publication: Interpolation Approximations of Sojourn Time Distributions

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