Skip to main content
SpringerLink
Log in

Estimating the overlapping probability for complex demands in queuing systems

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Estimates are derived to simplify the computations related to the overlapping of random demands that consist of several time intervals. Analytical approach and Monte Carlo simulation are used. The results can be applied to design communication systems.

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. M. Sportak, Computer Networks and Network Technologies [in Russian], DiaSoftYuP, St. Petersburg (2005).

    Google Scholar 

  2. V. Stallings, Wireless Communications and Networks, Prentice Hall, Upper Saddle River, N.J. (2002).

    Google Scholar 

  3. E. V. Koba, “Service system for a Poisson flow of dual calls,” Dop. NAN Ukrainy, No. 3, 9–11 (1995).

  4. P. P. Bocharov and A. V. Pechinkin, Queuing Theory [in Russian], RUDN, Moscow (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    E. V. Koba

  2. National Aviation University, Kyiv, Ukraine

    O. N. Dyshliuk

Authors
  1. E. V. Koba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. N. Dyshliuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. V. Koba.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 175–180, May–June 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koba, E.V., Dyshliuk, O.N. Estimating the overlapping probability for complex demands in queuing systems. Cybern Syst Anal 46, 506–511 (2010). https://doi.org/10.1007/s10559-010-9226-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9226-x

Keywords

Search

Navigation