Polling Systems in Heavy Traffic: A Bessel Process Limit

DOI10.1287/MOOR.23.2.257zbMath0981.60088OpenAlexW2029520467WikidataQ56907685 ScholiaQ56907685MaRDI QIDQ2757533

Martin I. Reiman, Anatolii A. Puhalskii, Edward G. jun. Coffman

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8d7bf5628bcb7f5c2ee61d0cd00922e8f12dc024

zbMATH Keywords

Bessel processpolling systemsaveraging principlessemi-martingalesheavy traffic limit

Mathematics Subject Classification ID

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

Related Items (31)

Polling: past, present, and perspective ⋮ Polling systems with periodic server routing in heavy traffic: renewal arrivals ⋮ A two-queue polling model with priority on one queue and heavy-tailed on/off sources: a heavy-traffic limit ⋮ The spectral representation of Bessel processes with constant drift: applications in queueing and finance ⋮ Waiting times in queueing networks with a single shared server ⋮ Integrating streaming and file-transfer internet traffic: fluid and diffusion approximations ⋮ HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS ⋮ Solution of the Fokker-Planck equation with a logarithmic potential and mixed eigenvalue spectrum ⋮ Green's functions and the Cauchy problem of the Burgers hierarchy and forced Burgers equation ⋮ On the transition densities for reflected diffusions ⋮ On two-queue Markovian polling systems with exhaustive service ⋮ Mathematical methods to study the polling systems ⋮ Heavy traffic analysis of a polling model with retrials and glue periods ⋮ Towards a unifying theory on branching-type polling systems in heavy traffic ⋮ Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms ⋮ Density of generalized Verhulst process and Bessel process with constant drift ⋮ POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS ⋮ DELAYS AT SIGNALIZED INTERSECTIONS WITH EXHAUSTIVE TRAFFIC CONTROL ⋮ Random Fluid Limit of an Overloaded Polling Model ⋮ Polling models with multi-phase gated service ⋮ Approximations for the waiting time distribution in polling models with and without state-dependent setups ⋮ The impact of scheduling policies on the waiting-time distributions in polling systems ⋮ Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies ⋮ BESSEL PROCESSES, STOCHASTIC VOLATILITY, AND TIMER OPTIONS ⋮ An Analysis of Asymmetrical Threshold Polling Systems ⋮ A note on polling models with renewal arrivals and nonzero switch-over times ⋮ Polling systems with periodic server routeing in heavy traffic: distribution of the delay ⋮ Heavy traffic analysis of roving server networks ⋮ Quantum-computing with AI & blockchain: modelling, fault tolerance and capacity scheduling ⋮ Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times ⋮ An asymptotic property of branching-type overloaded polling networks

This page was built for publication: Polling Systems in Heavy Traffic: A Bessel Process Limit