Skip to main content
SpringerLink
Log in

Performance of a closed network with exponential distributed service time and periodically repeating demands of users

  • Brief Communication
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A closed network is considered in which one processor provides service to n customers. Service time is exponentially distributed. Once the service is completed, the user calls for the next service in time T. A rejected call returns in time T as well. The performance of the processor and the mean number of call returns are determined.

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

References

  1. B. V. Gnedenko and I. N. Kovalenko, Introduction to Queueing Theory [in Russian], Nauka, Moscow (1987).

    MATH  Google Scholar 

  2. P. Franken, D. König, W. Arndt, and F. Schmidt, Queues and Point Processes [Russian translation], Naukova Dumka, Kiev (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International University of Civil Aviation, Kiev, Ukraine

    E. V. Koba

Authors
  1. E. V. Koba
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 176–179, May–June, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koba, E.V. Performance of a closed network with exponential distributed service time and periodically repeating demands of users. Cybern Syst Anal 36, 465–467 (2000). https://doi.org/10.1007/BF02733000

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation