Skip to main content
SpringerLink
Log in

The simplest models of queue control at nodes of packet-switched networks

  • Mathematical Models, Computational Methods
  • Published:
Journal of Communications Technology and Electronics Aims and scope Submit manuscript

Abstract

Queueing systems simulating the operation of nodes of packet data transmission networks using probabilistic algorithms of packet dropping —namely, a single-channel system with a finite buffer and a multichannel system with an unlimited queue—are considered. An input flow is simulated with the use of a generalized Poisson process. The service time is exponentially distributed. An algorithm for finding the stationary distribution of the number of customers and the stationary characteristics of the system (the mean queue length, the mean time of waiting in a queue, the probability of customer service) is proposed. The obtained results are verified with the help of simulation models developed with the help of GPSS World tools.

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. A. Chydzin-ski, Nowe Modele Kolejkowe Dla Wezlow Sieci Pakietowych (Pracownia Komputerowa Jacka Skalmierskiego, Gliwice, 2013) [in Polish].

    Google Scholar 

  2. S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance,” IEEE/ACM Trans. Networking 1, 397–413 (1993).

    Article  Google Scholar 

  3. S. Bohacek, K. Shah, G. R. Arce, and M. Davis, “Signal processing challenges in active queue management,” IEEE Signal Process Mag. Trans. Networking 21(5), 69–79 (2004).

    Article  Google Scholar 

  4. T. Bonald, M. May, and J.-C. Bolot, “Analytic evaluation of RED performance,” Proc. INFOCOM 3, 1415–1424 (2000).

    Google Scholar 

  5. O. Tikhonenko and W. M. Kempa, “The generalization of AQM algorithms for queueing system with bounded capacity,” Lecture Notes Comput. Sci. 7204, 242–251 (2012).

    Article  Google Scholar 

  6. O. Tikhonenko and W. M. Kempa, “Queue-size distribution in M/G/1-type system with bounded capacity and packet dropping,” Commun. Comput. Inf. Sci. 356, 177–186 (2013).

    Article  Google Scholar 

  7. W. M. Kempa, “A direct approach to transient queue-size distribution in a finite-buffer queue with AQM,” Appl. Math. Inf. Sci. 7, 909–915 (2013).

    Article  MathSciNet  Google Scholar 

  8. V. D. Boev, System Simulation. GPSS World Tools (BKhV-Peterburg, St. Petersburg, 2004) [in Russian].

    Google Scholar 

  9. P. P. Bocharov and A. V. Pechinkin, The Queueing Theory (RUDN, Moscow, 1995) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ivan Franko National University of Lviv, Universitetska vul. 1, Lviv, 79000, Ukraine

    Yu. V. Zhernovyi

Authors
  1. Yu. V. Zhernovyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu. V. Zhernovyi.

Additional information

Original Russian Text © Yu.V. Zhernovyi, 2014, published in Informatsionnye Protsessy, 2014, Vol. 14, No. 2, pp. 185–196.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhernovyi, Y.V. The simplest models of queue control at nodes of packet-switched networks. J. Commun. Technol. Electron. 59, 1475–1482 (2014). https://doi.org/10.1134/S1064226914120183

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064226914120183

Keywords

Search

Navigation