A study of robust Active Queue Management schemes for correlated traffic

被引:1
作者
Oruganti, SS [1 ]
Devetsikiotis, M [1 ]
机构
[1] N Carolina State Univ, ECE Dept, Raleigh, NC 27695 USA
关键词
predictors; controllers; correlation; robustness;
D O I
10.1016/j.comcom.2004.05.016
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Random Early Detection detects the presence of congestion by measuring the exponentially weighted moving average (EWMA) of the queue length against two thresholds. Recently, rate-based packet marking schemes, like Adaptive Virtual Queue, have shown that they are more flexible in detecting and dealing with congestion as compared to schemes based on EWMA of queue length. In this paper we shed light on the operation of distributed local Active Queue Management (AQM) schemes by decomposing them based on their logical functions and by studying them as a combination of a measurement module and a control module. We also exploit the presence of strong correlation in network traffic in order to formulate a generalized Predictive AQM (PAQM) scheme. For this, we extend the calculation of the EWMA by including a term that represents the future traffic intensity. We compare the performance of our generalized predictive AQM scheme with a pure rate-based packet marking scheme. We study the performance of PAQM for various combinations of predictors and controllers with respect to robustness, end-to-end delay jitter, goodput and linkutilization. We present the goodput results purely with the intention that increased robustness is not at the expense of decreased goodput. Based on the simulation results, we have the following observations: (i) for proper selection of the weight of future observations, PAQM schemes achieve better delay bounds than the traditional (non-PAQM) ones. (ii) AQM schemes with stochastic based traffic prediction are usually more robust when the control is based on EWMA of queue length. Similarly, AQM schemes with traffic prediction based on finite impulse response filters are more robust when the control is based on fixed queue occupancy. (iii) More robust AQM schemes usually have higher goodput for comparable average queueing delay values, (iv) excessive dependence on predicted future arrivals always results in deterioration of performance. This sets a bound on the optimistic performance of AQM schemes even when using prediction. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 11
页数:11
相关论文
共 26 条
  • [1] CHRISTIANSEN M, 2000, SIGCOMM, P139
  • [2] *CISC, 2000, CISC WHIT PAP PERF M
  • [3] CROVELLA M, 1998, PRACTICAL GUIDE HEAV, pCH1
  • [4] DENG S, 1996, IEEE INT C COMMUNICA, V3, P71
  • [5] A self-configuring RED gateway
    Feng, WC
    Kandlur, DD
    Saha, D
    Shin, KG
    [J]. IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, : 1320 - 1328
  • [6] On the autocorrelation structure of TCP traffic
    Figueiredo, DR
    Liu, BY
    Misra, V
    Towsley, D
    [J]. COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2002, 40 (03): : 339 - 361
  • [7] Firoiu V., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P1435, DOI 10.1109/INFCOM.2000.832541
  • [8] Floyd S., 2001, AT CTR INTERNET RES, P12
  • [9] Random Early Detection Gateways for Congestion Avoidance
    Floyd, Sally
    Jacobson, Van
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (04) : 397 - 413
  • [10] Gao Y, 2002, IEEE INFOCOM SER, P1630, DOI 10.1109/INFCOM.2002.1019416