Skip to main content
Log in

Comments on: Polling: past, present and perspective

  • Discussion
  • Published:
TOP Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • Foss SG, Chernova NI (1996) On polling systems with infinitely many stations. Sibe Math J 37:832–846

    Article  Google Scholar 

  • Borovkov AA, Korshunov D, Schassberger R (1999) Ergodicity of a polling network with an lnfinite number of stations. Queueing Syst 32:169–193

    Article  Google Scholar 

  • Chernova N, Foss S, Kim B (2012) On the stability of a polling system with an adaptive service mechanism. Ann Oper Res 198:125–144

    Article  Google Scholar 

  • Remerova M, Foss S, Zwart B (2014) Random fluid limit of an overloaded polling model. Adv Appl Probab 46:832–846

    Article  Google Scholar 

  • Foss S, Kovalevskii A (1999) A stability criterion via fluid limits and its applications to a polling system. Queueing Syst 32:131–168

    Article  Google Scholar 

  • Kovalevskii AP, Topchii VA, Foss SG (2005) On the stability of a queueing system with uncountably branching fluid limits. Probl Inf Transm 41:254–279

    Article  Google Scholar 

  • Chernova N, Foss S, Kim B (2013) A polling system whose stability region depends on a whole distribution of service times. Oper Res Lett 41:188–190

    Article  Google Scholar 

  • Foss SG, Chernova NI (1996) Dominance theorems and ergodic properties of polling systems. Probl Inf Transm 32:342–364

    Google Scholar 

  • Royas-Nandayapa L, Foss S, Kroese DP (2011) Stability and performance of greedy server systems: a review and open problems. Queueing Syst 68:221–226

    Article  Google Scholar 

  • Coffman EG, Gilbert EN (1987) Polling and greedy servers on a line. Queueing Syst 2:115–145

    Article  Google Scholar 

  • Schassberger R (1995) Stability of polling networks with state-dependent server routing. Probab Eng Inf Sci 9:539–550

    Article  Google Scholar 

  • Foss S, Last G (1996) Stability of polling systems with exhaustive service policies and state-dependent routing. Ann Appl Probab 6:116–137

    Article  Google Scholar 

  • Foss S, Last G (1998) On the stability of greedy polling systems with general service policies. Probab Eng Inf Sci 12:49–68

    Article  Google Scholar 

  • Rolla LT, Sidoravicius V (2017) Stability of the Greedy algorithm on the circle. Commun Pure Appl Math 70:1961–1986

    Article  Google Scholar 

  • Robert P (2010) The evolution of a spatial stochastic network. Stoch Proces Appl 120:1342–1363

    Article  Google Scholar 

  • Leskela L, Unger F (2012) Stability of a spatial polling system with Gready Myopic servive. Ann Oper Res 198:165–183

    Article  Google Scholar 

  • Kurkova IA, Menshikov MV (1997) Greedy algorithm, \(Z_1\) case. Markov Proces Relat Fields 3:243–259

    Google Scholar 

  • Cruise RJ, Wade A (2017) The critical Greedy server on the integers is recurrent. ArXiv:1712.03026

  • Foss S, Rolla LT, Sidoravicus V (2015) Greedy Walk on the real line. Ann Probab 43:1399–1418

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sergey Foss.

Additional information

This comment refers to the invited paper available at https://doi.org/10.1007/s11750-018-0484-5.

Research of S. Foss is supported by RSF research Grant no. 17-11-01173.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Foss, S. Comments on: Polling: past, present and perspective. TOP 26, 374–378 (2018). https://doi.org/10.1007/s11750-018-0489-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-018-0489-0

Navigation