Performance Analysis of Congestion Control Mechanism Using Queue Thresholds Under Bursty Traffic

  • Lin Guan
  • Irfan Awan
  • Mike E. Woodward
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3262)


Performance modeling and analysis of the Internet Traffic Congestion control mechanism has become one of the most critical issues. Several approaches have been proposed in the literature by using queue thresholds. This motivates the analysis of a discrete-time finite capacity queue with thresholds to control the congestion caused by the bursty traffic. The maximum entropy (ME) methodology has been used to characterize the closed form expressions for the state and blocking probabilities. A GGeo/GGeo/1/{N1, N2} censored queue with external compound Bernoulli traffic process and generalised geometric transmission times under a first come first serve (FCFS) rule and arrival first (AF) buffer management policy for single class jobs has been used for the solution process. To satisfy the low delay along with high throughput, a threshold, N1, has been incorporated to slow the arrival process from mean arrival rate λ 1 to λ 2 once the queue length has been reached up to the threshold value N1 (N2 is the total capacity of the queue). The source operates normally, otherwise. This is like an implicit feedback from the queue to the arrival process. The system can be potentially used as a model for congestion control based on Random Early Detection (RED) mechanism. Typical numerical results have been presented to show the credibility of ME solution and its validation against simulation.


Maximum Entropy Queue Length Congestion Control Blocking Probability Random Early Detection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Atsumi, Y., Kondoh, E., Altintas, O., Yoshida, T.: A New Congestion Control Algorithm for Sack-Tcp with RED Routers. In: Ultra-high speed Network & Computer Technology Labs (UNCL), JapanGoogle Scholar
  2. 2.
    Li, J.-M., Widjaja, I., Neuts, M.F.: Congestion Detection in ATM Network. Performance Evaluation 34, 147–168 (1998)CrossRefGoogle Scholar
  3. 3.
    Braden, B., et al.: Recommendations on Queue Management and Congestion Avoidance in the Internet. IETF RFC 2309 (April 1998)Google Scholar
  4. 4.
    Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transaction on Networking 1(4), 397–413 (1993)CrossRefGoogle Scholar
  5. 5.
    Lapsley, D., Low, S.: Ransom Early Marking for Internet Congestion Control. In: Proceedng of GlobeCom 1999, December 1999, pp. 1747–1752 (1999)Google Scholar
  6. 6.
    Athuraliya, S., Lapsley, D., Low, S.: An Enhanced Random Early Marking Algorithm for Internet Flow Control. Infocom (2000)Google Scholar
  7. 7.
    Gibbens, R., Kelly, F.: Distributed Connection Acceptance Control for a Connectionless Network. In: Proceeding of the 16th Intl. Teletraffic Congress, Edinburgh, Scotland (June 1999)Google Scholar
  8. 8.
    Kunniyur, S., Srikant, R.: End-to-End Congestion Control: Utility Function, Random Losses and ECN Marks. In: Proceedings of Infocom 2000, Tel Aviv, Israel (March 2000)Google Scholar
  9. 9.
    Kunniyur, S., Srikant, R.: A Time-Scale Decomposition Approach to Adaptive ECN Marking. In: Proceeding of Infocom 2001, Alaska, Anchorage (April 2001)Google Scholar
  10. 10.
    Hoolot, C., Misra, V., Towlsey, D., Gong, W.: On Designing Improved Controllers for AQM Routers Supporting TCP Flows. UMass CMPSCI Technical Report 00-42 (2000)Google Scholar
  11. 11.
    Alazemi, H., Mokhtar, A., Azizoglu, M.: Stochastic modelling of random early detection gaeway in tcp networks. In: IEEE Global Telecommunications Conference,S GLOBECOM 2000, vol. 3, pp. 1747–1751 (2000)Google Scholar
  12. 12.
    May, M., Bonald, T., Bolot, J.: Analytical evaluation of RED Prformance. In: Proceedings of INFOCOM 2000 (2000)Google Scholar
  13. 13.
    Mokhtar, A., Azizoglu, M.: A random early discard frame work for congestion control in ATM networks. In: IEEE ATM Workshop 1999 Proceedings, Tokyo, Japan, pp. 45–50 (1999)Google Scholar
  14. 14.
    Alazemi, H., Mokhtar, A., Azizoglu, M.: Stochastic approach for modelling random early detection gateways in TCP/IP networks. In: IEEE International Conference on Communications, vol. 8, pp. 2385–2390 (2001)Google Scholar
  15. 15.
    Jaynes, E.T.: Information Theory and Statistical Mechanics. Phys. Rev. 106, 620–630 (1957)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Jaynes, E.T.: Information Theory and Statistical Mechanics, II. Phys. Rev. 108, 71–190 (1957)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Shore, J.E., Johnson, R.W.: Axiomatic Derivation of the Principle of Maximum Entropy and the Principle of Minimum-cross Entropy. IEEE Transactions of information Theory IT-26, 26–37 (1980)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Tribus, M.: Rational Descriptions, Decisions, and Designs. Pergamon Press, New York (1969)Google Scholar
  19. 19.
    Kouvatsos, D.D.: Entropy Maximisation and Queueing Network Models. Annals pf Operation Research 48, 63–126 (1994)zbMATHCrossRefGoogle Scholar
  20. 20.
    Kouvatsos, D.D., Tabet-Aouel, N.M.: GGeo-type Approximations for General Discrete- time Queueing Systems. In: Perros, H.G., et al. (eds.) Proc. of IFIP Workshop on Modelling and Performance Evaluation of ATM Technology, La Martinique (January 1993)Google Scholar
  21. 21.
    Kouvatsos, D.D., Tabet-Aouel, N.M., Denazis, S.G.: ME-based Approximations for General Discrete-time Queueing Models. Journal of Performance Evaluation 21, 81–109 (1994)zbMATHCrossRefGoogle Scholar
  22. 22.
    Kouvatsos, D.D., Awan, I.U., Fretwell, R.J., Dimakopoulos, G.: A Cost-effective Approximation for SRD Traffic in Arbitrary Multi-buffered Networks. Journal of Computer Networks 34, 97–113 (2000)CrossRefGoogle Scholar
  23. 23.
    Kouvatsos, D.D.: Maximum Entropy and the G/G/1/N Queue. Acta Informatica 23, 545–565 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Kouvatsos, D.D., Tabet-Aouel, N.M., Denazis, S.G.: Approximation Analysis of Discrete- time Networks with or without Blocking. In: Perros, H.G., Viniotis, Y. (eds.) High Speed Networks and their Performance C-21 (1994)Google Scholar
  25. 25.
    Kouvatsos, D.D., Georgatsos, P.H., Tabet-Aouel, N.M.: A Universal Maximum Entropy Algorithm for General Multiple Class Open Networks with Mixed Service Disciplines. In: Puigjaner, R., Potier, D. (eds.) Modelling Techniques and Tools for Computer Performance Evaluation. Plenum, New york (1989)Google Scholar
  26. 26.
    Veran, M., Potier, D. (eds.): QNAP-2: A Portable Environment for Queueing Network Modelling Techniques and Tools for Performance Analysis. North Holland, Amsterdam (1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Lin Guan
    • 1
  • Irfan Awan
    • 1
  • Mike E. Woodward
    • 1
  1. 1.Department of ComputingSchool of Informatics University of BradfordBradford, West YorkshireUK

Personalised recommendations