Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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), Japan
Li, J.-M., Widjaja, I., Neuts, M.F.: Congestion Detection in ATM Network. Performance Evaluation 34, 147–168 (1998)
Braden, B., et al.: Recommendations on Queue Management and Congestion Avoidance in the Internet. IETF RFC 2309 (April 1998)
Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transaction on Networking 1(4), 397–413 (1993)
Lapsley, D., Low, S.: Ransom Early Marking for Internet Congestion Control. In: Proceedng of GlobeCom 1999, December 1999, pp. 1747–1752 (1999)
Athuraliya, S., Lapsley, D., Low, S.: An Enhanced Random Early Marking Algorithm for Internet Flow Control. Infocom (2000)
Gibbens, R., Kelly, F.: Distributed Connection Acceptance Control for a Connectionless Network. In: Proceeding of the 16th Intl. Teletraffic Congress, Edinburgh, Scotland (June 1999)
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)
Kunniyur, S., Srikant, R.: A Time-Scale Decomposition Approach to Adaptive ECN Marking. In: Proceeding of Infocom 2001, Alaska, Anchorage (April 2001)
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)
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)
May, M., Bonald, T., Bolot, J.: Analytical evaluation of RED Prformance. In: Proceedings of INFOCOM 2000 (2000)
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)
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)
Jaynes, E.T.: Information Theory and Statistical Mechanics. Phys. Rev. 106, 620–630 (1957)
Jaynes, E.T.: Information Theory and Statistical Mechanics, II. Phys. Rev. 108, 71–190 (1957)
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)
Tribus, M.: Rational Descriptions, Decisions, and Designs. Pergamon Press, New York (1969)
Kouvatsos, D.D.: Entropy Maximisation and Queueing Network Models. Annals pf Operation Research 48, 63–126 (1994)
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)
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)
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)
Kouvatsos, D.D.: Maximum Entropy and the G/G/1/N Queue. Acta Informatica 23, 545–565 (1986)
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)
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)
Veran, M., Potier, D. (eds.): QNAP-2: A Portable Environment for Queueing Network Modelling Techniques and Tools for Performance Analysis. North Holland, Amsterdam (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guan, L., Awan, I., Woodward, M.E. (2004). Performance Analysis of Congestion Control Mechanism Using Queue Thresholds Under Bursty Traffic. In: Freire, M.M., Chemouil, P., Lorenz, P., Gravey, A. (eds) Universal Multiservice Networks. ECUMN 2004. Lecture Notes in Computer Science, vol 3262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30197-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-30197-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23551-4
Online ISBN: 978-3-540-30197-4
eBook Packages: Springer Book Archive