Skip to main content
SpringerLink
Log in

An Ergodicity Condition for a Cyclic Queuing System

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

An ergodicity condition is obtained for a discrete system with m queues that periodically interact with a channel.

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.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. L. Kleinrock, Computer Systems with Queues [Russian translation], Mir, Moscow (1979).

    Google Scholar 

  2. S. F. Yashkov, Analysis of Queues in Computers [in Russian], Radio i Svyaz' Moscow (1989), pp. 207–211.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Far Eastern Branch of the Russian Academy of Sciences, Vladivostok, Russia

    G. Sh. Tsitsiashvili

Authors
  1. G. Sh. Tsitsiashvili
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tsitsiashvili, G.S. An Ergodicity Condition for a Cyclic Queuing System. Cybernetics and Systems Analysis 37, 149–150 (2001). https://doi.org/10.1023/A:1016636604876

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016636604876

Search

Navigation