Heavy traffic approximations for busy period in an M/G/\(\infty\) queue

DOI10.1016/0304-4149(85)90028-6zbMath0567.60088OpenAlexW1562578440MaRDI QIDQ1059937

No author found.

Publication date: 1985

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(85)90028-6

zbMATH Keywords

heavy trafficbusy periodasymptotic exponential distribution

Mathematics Subject Classification ID

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

Related Items (5)

Bootstrap Methods for Time Series ⋮ Qualitative and asymptotic properties of stochastic integrals related to random marked point processes ⋮ Change Point Estimation with Independent Observations and Piece-Wise Continuous Variance Function ⋮ Bootstrap order selection for SETAR models ⋮ On Mixture Periodic Vector Autoregressive Models

Cites Work

• Unnamed Item
• Markov chain models - rarity and exponentiality
• Asymptotic coverage distributions on the circle
• On inference in a one-dimensional mosaic and an M/G/∞ queue
• On the heavy-traffic limit theorem for GI/G/∞ queues
• On-Line and Adaptive Optimum Advertising Control by a Diffusion Approximation
• A Diffusion Model Approximation for the GI/G/1 Queue in Heavy Traffic
• Optimal disposal policies for a single-item inventory system with returns
• Approximation techniques in the solution of queueing problems
• An approximation for the busy period of the M/G/1 queue using a diffusion model
• A Combinatorial Method in the Theory of Queues

This page was built for publication: Heavy traffic approximations for busy period in an M/G/\(\infty\) queue