Polling Systems in Heavy Traffic: A Bessel Process Limit-Reference-Cited by-同舟云学术

Polling Systems in Heavy Traffic: A Bessel Process Limit

Published:1998-05 Issue:2 Volume:23 Page:257-304
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Coffman E. G.,Puhalskii A. A.,Reiman M. I.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Link

https://pubsonline.informs.org/doi/pdf/10.1287/moor.23.2.257

Reference18 articles.

1. Chen H. , Mandelbaum A. , Davis M. H. A. , Elliott R. J. Leontief systems, RBV's and RBM's.Proc. Imperial College Workshop on Applied Stochastic Processes(1991) (Gordon and Breach Science Publishers, London)

2. Storage-Limited Queues in Heavy Traffic

3. Polling Systems with Zero Switchover Times: A Heavy-Traffic Averaging Principle

4. Multiple channel queues in heavy traffic. I

Cited by 64 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times;The Annals of Applied Probability;2022-12-01

2. Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms;The Annals of Applied Probability;2021-04-01

3. An asymptotic property of branching-type overloaded polling networks;Open Mathematics;2019-12-10

4. Quantum-computing with AI & blockchain: modelling, fault tolerance and capacity scheduling;Mathematical and Computer Modelling of Dynamical Systems;2019-10-29

5. Green’s functions and the Cauchy problem of the Burgers hierarchy and forced Burgers equation;Communications in Nonlinear Science and Numerical Simulation;2019-07