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

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.

[1]  Richard J. Gibbens,et al.  Distributed connection acceptance control for a connectionless network , 1999 .

[2]  Demetres D. Kouvatsos,et al.  Maximum entropy and the G/G/1/N queue , 1986, Acta Informatica.

[3]  Irfan-Ullah Awan,et al.  A cost-effective approximation for SRD traffic in arbitrary multi-buffered networks , 2000, Comput. Networks.

[4]  Peter G. Harrison,et al.  Modelling techniques and tools for computer performance evaluation , 2003, Perform. Evaluation.

[5]  Demetres D. Kouvatsos,et al.  ME-Based Approximations for General Discrete-Time Queueing Models , 1994, Perform. Evaluation.

[6]  M. Tribus.  Rational descriptions, decisions, and designs , 1969 .

[7]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[8]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  D. Lapsley,et al.  Random early marking for Internet congestion control , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[10]  Ahmed Mokhtar,et al.  Stochastic modeling of random early detection gateways in TCP networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[11]  Rodney W. Johnson,et al.  Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy , 1980, IEEE Trans. Inf. Theory.

[12]  Demetres D. Kouvatsos,et al.  GGeo-Type Approximations for General Discrete-Time Queueing Systems , 1993, Modelling and Evaluation of ATM Networks.

[13]  Marcel F. Neuts,et al.  Congestion Detection in ATM Networks , 1998, Perform. Evaluation.

[14]  R. Srikant,et al.  A time scale decomposition approach to adaptive ECN marking , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  A. Mokhtar,et al.  A random early discard framework for congestion control in ATM networks , 1999, IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462).

[16]  Steven H. Low,et al.  An enhanced random early marking algorithm for Internet flow control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Demetres D. Kouvatsos,et al.  A Universal Maximum Entropy Algorithm for General Multiple Class Open Networks with Mixed Service Disciplines , 1989 .

[18]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[19]  Demetres D. Kouvatsos,et al.  Entropy maximisation and queueing network models , 1994, Ann. Oper. Res..

[20]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

[21]  Donald F. Towsley,et al.  On designing improved controllers for AQM routers supporting TCP flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[22]  Martin May,et al.  Analytic evaluation of RED performance , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[23]  Ahmed Mokhtar,et al.  Stochastic approach for modeling random early detection gateways in TCP/IP networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).