Skip to main content

Queue-Size Distribution in M/G/1-Type System with Bounded Capacity and Packet Dropping

  • Conference paper
Modern Probabilistic Methods for Analysis of Telecommunication Networks (BWWQT 2013)

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

Included in the following conference series:

Abstract

A single-server queueing system of M/G/1-type with boun- ded total volume is considered. It is assumed that volumes of arriving packets are generally distributed random variables. The AQM-type mechanism is used to control the actual buffer state: each of arriving packets is dropped with probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and loss probability are found.

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

Access this chapter

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Athuralya, S., Low, S.H., Qinghe, Y.: REM: active queue management. IEEE Network 15(3), 48–53 (2001)

    Article  Google Scholar 

  2. Bonald, T., May, M., Bolot, J.C.: Analytic evaluation of RED perfomance. In: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 48–53 (2000)

    Google Scholar 

  3. Chydzinski, A., Chrost, L.: Analysis of AQM queues with queue size based packet dropping. International Journal of Applied Mathematics and Computer Science 21(3), 567–577 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chydzinski, A.: Optimization problems in the theory of queues with dropping functions. In: HET-NETs, pp.121–132 (2011)

    Google Scholar 

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

    Article  Google Scholar 

  6. Floyd, S.: Recomendations on using the gentle variant of RED (March 2000), http://www.aciri.org/floyd/red/gentle.html

  7. Floyd, S.: Adaptive RED: an algoritm for increasing the robustness of RED’s Active Queue Management (August 2001), http://www.aciri.org/floyd/papers/adaptiveRed.pdf

  8. Hao, W., Wei, Y.: An Extended GIX/M/1/N Queueing Model for Evaluating the Performance of AQM Algorithms with Aggregate Traffic. In: Lu, X., Zhao, W. (eds.) ICCNMC 2005. LNCS, vol. 3619, pp. 395–404. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Kempa, V.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 

  10. Liu, S., Basar, T., Srikant, R.: Exponential RED: A stabilizing AQM scheme for low- and light-speed TCP protocols. IEEE/ACM ToN (2005)

    Google Scholar 

  11. Rosolen, V., Bonaventure, O., Leduc, G.: A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic. Computer Communication Rewiew 29(3), 23–43 (1999)

    Article  Google Scholar 

  12. Sun, L., Wang, L.: A novel RED scheme with preferential dynamic threshold deployment. In: Computational Intelligence and Security Workshops, pp. 854–857 (2007)

    Google Scholar 

  13. Suresh, S., Gol, O.: Congestion management of self similar IP traffic-application of the RED scheme. In: Wireless and Optical Communications Networks, Second IFIP International Conference, pp. 372–376 (2005)

    Google Scholar 

  14. 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, Part II. LNCS, vol. 7204, pp. 242–251. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. Tikhonenko, O., Kempa, W.M.: On the queue-size distribution in the multi-server system with bounded capacity and packet dropping. Kybernetika (submitted)

    Google Scholar 

  16. Xiong, N., Yang, Y., Defago, X., He, Y.: LRC-RED: A self-tuning robust and adaptive AQM scheme. In: Sixth International Conference on Parallel and Distributed Computing Applications and Technologies, pp. 655–659 (2005)

    Google Scholar 

  17. Zhou, K., Jeung, K.L., Li, V.O.K.: Nonlinear RED: A simple yet efficient active queue management scheme. Computer Networks (18), 3784–3794 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tikhonenko, O., Kempa, W.M. (2013). 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) Modern Probabilistic Methods for Analysis of Telecommunication Networks. BWWQT 2013. Communications in Computer and Information Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35980-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35980-4_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35979-8

  • Online ISBN: 978-3-642-35980-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics