Skip to main content
SpringerLink
Log in

On polling systems with infinitely many stations

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

References

  1. S. G. Foss and N. I. Chernova, Ergodic Properties of Polling Systems [Preprint, No. 6], Inst. Mat. (Novosibirsk), Novosibirsk (1995). (To appear in “Problems of Information Transmission.”)

    Google Scholar 

  2. H. Lévy, M. Sidi, and O. J. Boxma, “Dominance relations in polling systems,” Queueing Systems,6, 155–171 (1990).

    Google Scholar 

  3. L. Massoulie, “Stability of nonmarkovian polling systems,” in: Abstracts: Proc. Conf. Appl. Probab., Paris, 1993. (Submitted to Queueing Systems.)

  4. A. A. Borovkov and R. Schassberger, “Ergodicity of a polling network,” Stochastic Process Appl.,50, 253–262 (1994).

    Google Scholar 

  5. S. Foss and G. Last, “On the stability of greedy polling systems with exhaustive service policies,” in: Technical Report 18/94, Technical University Braunschweig, 1994. (To appear in Ann. Appl. Probab.)

  6. S. Foss and G. Last, “On the stability of greedy polling systems with general service policies,” in: Technical Report 6/95, Technical University Braunschweig, 1995.

  7. C. Fricker and M. R. Jaibi, “Monotonicity and stability of periodic polling models,” Queueing Systems,15, 211–238 (1994).

    Google Scholar 

  8. L. Georgiadis and W. Szpankowski, “Stability of token passing rings,” Queueing Systems,11, 7–34 (1992).

    Google Scholar 

  9. D. P. Kroese and V. Schmidt, “A continuous polling system with general service times,” Ann. Appl. Probab.,2, 906–927 (1992).

    Google Scholar 

  10. D. P. Kroese and V. Schmidt, “Single-server queues with spatially distributed arrivals,” Queueing Systems,17, 317–345 (1994).

    Google Scholar 

  11. R. Schassberger, “Stability of polling networks with state-dependent server routing,” in: Technical Report 12/93, Technical University Braunschweig, 1993.

  12. V. Sharma, “Stability and continuity of polling systems,” Queueing Systems,16, 115–137 (1994).

    Google Scholar 

  13. H. Takagi, Queueing Analysis of Polling Systems in: Stochastic Analysis of Computer and Communications System, Hideaki Takagi (ed.), Elsevier Science Pub. Horth-Holland (1990).

    Google Scholar 

  14. F. Baccelli and S. Foss, “On the saturation rule for the stability of queues,” J. Appl. Probab.,32, No. 2, 494–507 (1995).

    Google Scholar 

  15. F. Baccelli and S. Foss, “Ergodicity of Jackson-type queueing networks,” Queueing Systems,17, 5–72 (1994).

    Google Scholar 

  16. F. Baccelli and P. Bremaud, Elements of Queueing Theory, Springer, Berlin (1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk

    S. G. Foss & N. I. Chernova

Authors
  1. S. G. Foss
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. I. Chernova
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research was financially supported in part by the International Science Foundation (Grant NR8300) and the INTAS (Grant 93-820).

Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 37, No. 4, pp. 940–956, July–August, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Foss, S.G., Chernova, N.I. On polling systems with infinitely many stations. Sib Math J 37, 832–846 (1996). https://doi.org/10.1007/BF02104674

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02104674

Keywords

Search

Navigation