Skip to main content
SpringerLink
Log in

Erlang Service System with Limited Memory Space Under Control of AQM Mechanizm

  • Conference paper
  • First Online:
Computer Networks (CN 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 718))

Included in the following conference series:

Abstract

We investigate the \(M/G/n\le \infty /(0,V)\)-type Erlang loss service system with \(n\le \infty \) independent service stations and Poisson arrival stream in which volumes of entering demands and their processing times are generally distributed and, in general, are dependent random variables. Moreover, the total volume of all demands present simultaneously in the system is bounded by a non-random value V (system memory capacity). The enqueueing process is controlled by an AQM-type non-increasing accepting function. Two different acceptance rules are considered in which the probability of acceptance is dependent or independent on the volume of the arriving demand. Stationary queue-size distribution and the loss probability are found for both scenarios of the system behavior. Besides, some special cases are discussed. Numerical examples are attached as well.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Netw. 1(4), 397–412 (1993)

    Article  Google Scholar 

  2. Kempa, W.M.: On main characteristics of the \(M/M/1/N\) queue with single and batch arrivals and the queue size controlled by AQM algorithms. Kybernetika 47(6), 930–943 (2011)

    MathSciNet  MATH  Google Scholar 

  3. Liu, S., Basar, T., Srikant, R.: Exponential RED: a stabilizing AQM scheme for low- and high-speed TCP protocols. IEEE/ACM Trans. Netw. 13, 1068–1081 (2005)

    Article  Google Scholar 

  4. Tikhonenko, O.M.: Generalized Erlang problem for service systems with finite total capacity. Probl. Inf. Transm. 41(3), 243–253 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Tikhonenko, O.M.: Queueing systems of a random length demands with restrictions. Autom. Remote Control 52(10, pt. 2), 1431–1437 (1991)

    Google Scholar 

  6. Tikhonenko, O.: Computer systems probability analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (2006). (in Polish)

    Google Scholar 

  7. Tikhonenko, O., Kempa, W.M.: The generalization of AQM algorithms for queueing systems with bounded capacity. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds.) PPAM 2011. LNCS, vol. 7204, pp. 242–251. Springer, Heidelberg (2012). doi:10.1007/978-3-642-31500-8_25

    Chapter  Google Scholar 

  8. Tikhonenko, O., Kempa, W.M.: Queue-size distribution in M/G/1-type system with bounded capacity and packet dropping. In: Dudin, A., Klimenok, V., Tsarenkov, G., Dudin, S. (eds.) BWWQT 2013. CCIS, vol. 356, pp. 177–186. Springer, Heidelberg (2013). doi:10.1007/978-3-642-35980-4_20

    Chapter  Google Scholar 

  9. Tikhonenko, O., Kempa, W.M.: On the queue-size distribution in the multiserver system with bounded capacity and packet dropping. Kybernetika 49(6), 855–867 (2013)

    MathSciNet  MATH  Google Scholar 

  10. Zhou, K., Yeung, K.L., Li, V.O.K.: Nonlinear RED: a simple yet efficient active queue management scheme. Comput. Netw. 50(18), 3784–3794 (2006)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Natural Sciences, College of Sciences, Cardinal Stefan Wyszynski University in Warsaw, Ul. Woycickiego 1/3, 01-938, Warsaw, Poland

    Oleg Tikhonenko

  2. Institute of Mathematics, Silesian University of Technology, Ul. Kaszubska 23, 44-100, Gliwice, Poland

    Wojciech M. Kempa

Authors
  1. Oleg Tikhonenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech M. Kempa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oleg Tikhonenko .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

  3. Silesian University of Technology, Gliwice, Poland

    Michał Sawicki

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Tikhonenko, O., Kempa, W.M. (2017). Erlang Service System with Limited Memory Space Under Control of AQM Mechanizm. In: Gaj, P., Kwiecień, A., Sawicki, M. (eds) Computer Networks. CN 2017. Communications in Computer and Information Science, vol 718. Springer, Cham. https://doi.org/10.1007/978-3-319-59767-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59767-6_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59766-9

  • Online ISBN: 978-3-319-59767-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation