ANALYSIS OF ORANGE ACTIVE QUEUE MANAGEMENT ALGORITHM TO FIND ITS OPTIMUM OPERATING PARAMETERS

ANALYSIS OF ORANGE ACTIVE QUEUE MANAGEMENT ALGORITHM TO FIND ITS OPTIMUM OPERATING PARAMETERS

Due to the fast growth of the demand for the use of internet during the last decade, congestion control mechanisms to keep the throughput high and the queuing delays low get of vital importance. The purpose of this paper is to present a new approach, which is called as “Orange” in IP level congestion control as an active queue management mechanism and to compare its performance with that of the other mechanisms. Within the framework of this paper, the best operating point of Orange algorithm is evaluated by using the empirical formulas we derive. It is investigated that when the best operating point parameters are applied, Orange gives the best performance against other active queue management algorithms. Keywords:Congestion control, IP level routing strategies, threshold, computer simulation, active queue management.

___

  • K. Ramakrishnan, S. Floyd, “A Proposal to add Explicit Congestion Notification (ECN) to IP”, RFC 2481, Proposed Standard, 1999. Retrived May 2009 from http://www.rfc-editor.org/info/rfc248.
  • S.Floyd, V.Jacobson, “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transactions on Networking, vol: l, no: 4, pp. 397-413, 1993.
  • W.Feng, D. Kandlur, D.Saha, K. Shin, “A Self- Configuring RED Gateway”, Proceedings IEEE INFOCOM '99, vol: 3, pp. 1320-1328, 1999.
  • T. J.Ott, T. V.Lakshman, L. H. Wong, “SRED: Stabilized RED”, Proceedings IEEE INFOCOM'99, vol: 3, pp. 1346-1355, 1999.
  • D. D.Clark, W.Fang, “Explicit Allocation of Best Effort
  • Transactions on Networking-TON,vol: 6, no: 4, pp. 362- 373, 1998.
  • R.Pan, B. Prabhakar, K.Psounis, “CHOK, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation”, Proceedings IEEE INFOCOM 2000, vol: 2, pp. 942-951, 2000.
  • C.V.Hollot, V. Misra, D. Towsley, W. Gong, “On designing improved controllers for AQM routers supporting TCP flows”, Proceedings IEEE INFOCOM 2001,vol: 3, pp. 1726-1734, 2001.
  • M. K. Şiş, A Dynamic Local Congestion Reducing Strategy Based on a Mini-Max Criterion. USA; Polytechnic Institute of New York University, Ph.D. Thesis, 1994.
  • G.Çatalkaya, Simulation of a Local Congestion Reducing
  • Networks. Izmir; DokuzEylul University, Engineering Faculty, Msc. Thesis. 2003.
  • J. Morrison, “Two Server Queue with One Server Idle below a Threshold”, Queueing Systems: Theory and Applications, vol: 7, no: 3-4, pp. 325-336, 1990.
  • L.Kleinrock,Queueuing Systems. vol I. Wiley,1975. [12] L. Le, J. Aikat, K.Jeffay, F. D.Smith, “The Effects of Active Queue Management on Web Performance”, ACM SIGCOMM2003, pp. 265-276, 2003.
  • Z. Zheng, R. E. Kinicki, “Adaptive Explicit Congestion Notification Techniques for Heteregeneous TCP Flows”, Computer Science Technical Report Series, 2001.
  • G. Çatalkaya A New Approach to IP Level Congestion Control. Izmir; DokuzEylul University, Engineering Faculty, Ph.D. Thesis, 2011.
  • J. Padhye, V. Firoiu, D. Towsley, J. Kurose, “Modeling TCP Thrughput: A Simple Model and its Empirical Validation”, ACM SIGCOMM 1998,vol: 28, no: 4, pp. 303-314. 1998. Service”, IEEE/ACM Routing Strategy for Multidestination