M/G/1-FIFO Queue with Uniform Service Times
From MaRDI portal
Publication:6402848
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Laplace transform (44A10) History of probability theory (60-03) Functional-differential equations (including equations with delayed, advanced or state-dependent argument) (34Kxx) History of operations research and mathematical programming (90-03)
Abstract: An exact formula for the equilibrium M/U/1 waiting time density is now effectively known. What began as a numeric exploration became a symbolic banquet. Inverse Laplace transforms provided breadcrumbs in the trail; delay differential equations subsequently gave clear-cut precision. We also remark on tail probability asymptotics and on queue lengths.
This page was built for publication: M/G/1-FIFO Queue with Uniform Service Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402848)
