Polling systems in heavy traffic: a Bessel process limit
From MaRDI portal
Recommendations
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- Polling systems with periodic server routing in heavy traffic: renewal arrivals
- Polling systems in heavy traffic: Higher moments of the delay
- Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
Cited in
(33)- A note on polling models with renewal arrivals and nonzero switch-over times
- Polling: past, present, and perspective
- Polling models with multi-phase gated service
- Polling systems with periodic server routing in heavy traffic: renewal arrivals
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- The impact of scheduling policies on the waiting-time distributions in polling systems
- Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times
- An asymptotic property of branching-type overloaded polling networks
- Green's functions and the Cauchy problem of the Burgers hierarchy and forced Burgers equation
- Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
- Mathematical methods to study the polling systems
- Towards a unifying theory on branching-type polling systems in heavy traffic
- POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
- Bessel processes, stochastic volatility, and timer options
- A two-queue polling model with priority on one queue and heavy-tailed on/off sources: a heavy-traffic limit
- An analysis of asymmetrical threshold polling systems
- Waiting times in queueing networks with a single shared server
- Polling systems with periodic server routeing in heavy traffic: distribution of the delay
- Heavy traffic analysis of a polling model with retrials and glue periods
- On two-queue Markovian polling systems with exhaustive service
- The spectral representation of Bessel processes with constant drift: applications in queueing and finance
- Delays at signalized intersections with exhaustive traffic control
- Heavy traffic analysis of roving server networks
- Density of generalized Verhulst process and Bessel process with constant drift
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- Solution of the Fokker-Planck equation with a logarithmic potential and mixed eigenvalue spectrum
- Random fluid limit of an overloaded polling model
- On the transition densities for reflected diffusions
- Quantum-computing with AI \& blockchain: modelling, fault tolerance and capacity scheduling
- Approximations for the waiting time distribution in polling models with and without state-dependent setups
- About semilinear low dimension Bessel PDEs
- Integrating streaming and file-transfer internet traffic: fluid and diffusion approximations
This page was built for publication: Polling systems in heavy traffic: a Bessel process limit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757533)
