Skip to main content
SpringerLink
Log in

On the deterministic approach to active queue management

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Virtually all known active queue management (AQM) algorithms, except for the two-category classifier (TCC), operate by calculating packet dropping probabilities. The probabilistic approach involves the necessity of using a type of random number generation upon every packet arrival at the router. Even if the generation of a single random value does not involve high computational complexity, the overhead becomes significant, considering the number of packets in a typical Internet environment. We propose a new AQM algorithm based on the deterministic approach. The algorithm offers a high throughput and a low loss ratio while maintaining a short and stable queue size. At the same time, the algorithm is of low computation complexity, which allows for energy-efficient implementations in routers. In addition to that, the proposed algorithm is universal—it provides high performance in a variety of distinct networking scenarios (diversified round-trip times, congestion levels, traffic types, etc.). Contrary to the TCC algorithm, the proposed algorithm does not make the decision whether to accept or drop the packet upon each packet arrival—the computation process is involved less frequently.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

Notes

  1. Explicit congestion notification.

  2. The shortest time, 24 ms, is obtained on the path N1–RA–RB–N4–RB–RA–N1 in Fig. 2. We have there 0+10+2+2+10+0=24 ms. Similarly, the longest time, 220 ms, is obtained on the path N3–RA–RB–N6–RB–RA–N3. Other paths give the time between 24 and 220 ms.

  3. Parameters \(min_{th}\) and \(max_{th}\) are the two thresholds of the RED (ARED) algorithm. Between these thresholds the queue size is supposed to be kept most of the time. The \(min_{th}\) parameter is the queue size at which the dropping probability becomes non-zero. At \(max_{th}\) the dropping probability becomes 1.

References

  1. Feng-yuan, R., Chuang, L., Xioa-meng, H., & Wei-dong, L. (2004). A classifier implementation for active queue management algorithm. ACTA Electronica Sinica, 32(11), 1796–1800.

    Google Scholar 

  2. Feng-yuan, R., Chuang, L., & Xioa-meng, H. (2005). TCC: A two-category classifier for aqm routers supporting tcp flows. IEEE Communications Letters, 9(5), 471–473.

    Article  Google Scholar 

  3. Duda, R. O., Hart, P. E., & Stork, D. G. (2000). Pattern classification (2nd ed.). New York: Wiley-Interscience Publications.

    Google Scholar 

  4. Bolla, R., Bruschi, R., Davoli, F., & Cucchietti, F. (2011). Energy efficiency in the future internet: A survey of existing approaches and trends in energy-aware fixed network infrastructures. IEEE Communications Surveys and Tutorials, 13(2), 223–244.

    Article  Google Scholar 

  5. Infso., E. C. D. G. (2008). Impacts of information and communication technologies on energy efficiency, final report, 2008, Technical Report [Online]. Available: ftp://ftp.cordis.europa.eu/pub/fp7/ict/docs/sustainable-growth/ict4ee-final-report_en.pdf.

  6. Floyd, S., & Jacobson, V. (1993). Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1, 397–413.

    Article  Google Scholar 

  7. Floyd, S., Gummadi, R., & Shenker, S. et al., (2001). Adaptive RED: An algorithm for increasing the robustness of RED active queue management, 2001. Preprint, available at icir.org/floyd/papers.html.

  8. Rosolen, V., Bonaventure, O., & Leduc, G. (1999). A RED discard strategy for atm networks and its performance evaluation with tcp/ip traffic. SIGCOMM Computer Communication Review, 29, 3.

    Article  Google Scholar 

  9. Wang, C., Liu, J., Li, B., Sohraby, K., & Lred, H. T. (2007). A robust and responsive aqm algorithm using packet loss ratio measurement. IEEE Transactions on Parallel and Distributed Systems, 18(1), 29–43.

    Article  Google Scholar 

  10. Hariri, B., & Sadati, N. (2007). NN-RED: An aqm mechanism based on neural networks. Electronics Letters, 43(19), 1053–1055.

    Article  Google Scholar 

  11. Chen, J. V., Chen, F. c, Tarn, J. M., & Yen, D. C. (2012). Improving network congestion: A RED-based fuzzy PID approach. Computer Standards & Interfaces, 34(5), 426C–438.

    Article  Google Scholar 

  12. Athuraliya, S., Low, S. H., Li, V. H., & Yin, Q. (2001). REM: Active queue management. IEEE Network, 15(3), 48–53.

    Article  Google Scholar 

  13. Hollot, C. V., Misra, V., Towsley, D., & Gong, W. (2002). Analysis and design of controllers for aqm routers supporting tcp flows. IEEE Transactions on Automatic Control, 47(6), 945–959.

    Article  Google Scholar 

  14. Wu, W., Ren, Y., & Shan, X. (2001). A self-configuring pi controller for active queue management. In Asia-Pacific Conference on Communications (apcc) and Japan, 2001.

  15. Feng, W., Shin, K. G., Kandlur, D. D., & Saha, D. (2002). The BLUE active queue management algorithms. IEEE/ACM Transactions on Networking, 10(4), 513–528.

    Article  Google Scholar 

  16. Wydrowski, B., and Green, Z. M. (2002). An active queue management algorithm for a self managed internet. In Proceeding of IEEE International Conference on Communications ICC2002, vol. 4, April 2002 (pp. 2368–2372).

  17. Kunniyur, S. S., & Srikant, R. (2004). An adaptive virtual queue (AVQ) algorithm for active queue management. IEEE/ACM Transactions on Networking, 12(2), 286–299.

    Article  Google Scholar 

  18. Ryu, S., Rump, C., & Qiao, C. (2004). Advances in active queue management (AQM) based TCP congestion control journal. Telecommunication Systems, 25(4), 317–351.

    Article  Google Scholar 

  19. Feng-yuan, R., Chuang, L., & Bo, W. (2005). A robust active queue management algorithm in large delay networks. Computer Communications, 28(5), 485–493.

    Article  Google Scholar 

  20. Chang, X., & Muppala, J. K. (2006). A stable queue-based adaptive controller for improving AQM performance. Computer Networks: The International Journal of Computer and Telecommunications Networking, 50(13), 2204–2224.

    Article  Google Scholar 

  21. Hong, Y., & Yang, O. W. W. (2007). Using interval phase margin assignment to self-tune a pi aqm controller for tcp traffic. Telecommunication Systems, 36(4), 161–171.

    Article  Google Scholar 

  22. Sun, J., & RaQ, Z. M. (2007). A robust active queue management scheme based on rate and queue length. Computer Communications, 30(8), 1731–1741.

    Article  Google Scholar 

  23. Guan, X., Yang, B., Zhao, B., Feng, G., & Chen, C. (2007). Adaptive fuzzy sliding mode active queue management algorithms. Telecommunication Systems, 35(1–2), 21–42.

    Article  Google Scholar 

  24. Na, Z., Guo, Q., Gao, Z., Zhen, J., & Wang, C. (2012). A novel adaptive traffic prediction AQM algorithm journal. Telecommunication Systems, 49(1), 149–160.

    Article  Google Scholar 

  25. Suzer, M. H., K.-D., K., & Basaran, C. (2012). Active queue management via event-driven feedback control. Computer Communications, 35(4), 517–529.

    Article  Google Scholar 

  26. Farzaneh, N., Monsefi, R., Yaghmaee, M. H., & Mohajerzadeh, A. H. (2013). A novel congestion control protocol with AQM support for IP-based networks. Telecommunication Systems, 52(1), 229–244.

    Article  Google Scholar 

  27. Kahe, G., Jahangir, A. H., & Ebrahimi, B. (2014). AQM controller design for TCP networks based on a new control strategy. Telecommunication Systems, 57(4), 295–311.

  28. Bitorika, A., Robin, M., Huggard, M., & Goldrick, C. M. (2004). A comparative study of active queue management schemes. Proceedings of IEEE, 201, 6.

    Google Scholar 

  29. Kwon, M., & Fahmy, S. (2002). A comparison of load-based and queue-based active queue management algorithms. vol. (2002).

  30. Rosolen, V., Bonaventure, O., & Leduc, G. (1999). A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic. ACM SIGCOMM Computer Communication Review, 29(3), 23–43.

    Article  Google Scholar 

  31. Cerf, V. G. (2014). Bufferbloat and other internet challenges. IEEE Internet Computing, 18(5), 79–80.

    Article  Google Scholar 

  32. Gettys, J., & Nichols, K. (2012). Bufferbloat: Dark buffers in the Internet. Communications of the ACM, 55(1), 57–65.

    Article  Google Scholar 

  33. Nichols, K., & Jacobson, V. (2012). Controlling queue delay. Communications of the ACM, 55(7), 42–50.

    Article  Google Scholar 

  34. Chydzinski, A., & Chrost, L. (2011). Analysis of AQM queues with queue-size based packet dropping. International Journal of Applied Mathematics and Computer Science, 21(3), 567577.

    Article  Google Scholar 

  35. Kempa, W. (2013). A direct approach to transient queue-size distribution in a finite-buffer queue with AQM. Applied Mathematics and Information Sciences, 7(3), 909–915.

    Article  Google Scholar 

  36. Raina, G., & Wischik, D. (2005). Buffer sizes for large multiplexers: TCP queueing theory and instability analysis. Next Generation Internet Networks, 2005, 173–180.

    Google Scholar 

  37. Gorinsky, S., Kantawala, A., & Turner, J. (2005) Link buffer sizing: A new look at the old problem. In Proceedings of 10th IEEE Symposium on Computers and Communications, ISCC 2005, (pp. 507–514).

  38. Appenzeller, G., Keslassy, I., and McKeown, N. (2004). Sizing router buffers. In Proceedings of the 2004 Conference on Applications Technologies, Architectures, and Protocols for Computer Communications. New York, NY: ACM, 2004 (pp. 281–292).

  39. Wischik, D., & McKeown, N. (2005). Part 1: Buffer sizes for core routers. ACM SIGCOMM Computer Communication Review, 35(3), 75–78.

    Article  Google Scholar 

  40. Enachescu, M., Ganjali, Y., Goel, A., McKeown, N., & Roughgarden, T. (2005). Part III: Routers with very small buffers. ACM SIGCOMM Computer Communication Review, 35(3), 83–90.

    Article  Google Scholar 

  41. Dhamdhere, A., Jiang, H., and Dovrolis, C. (2005). Buffer sizing for congested internet links. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, March 2005 (vol. 2, pp. 1072–1083).

  42. Cho, H., Fadali, M., & Lee, H. (2005). Neural network control for TCP network congestion. American Control Conference, 2005, 3480–3485.

    Google Scholar 

  43. Rahnamai, K., Gorman, K., & Gray, A. (2006). Model predictive neural control of TCP flow in AQM network. Annual meeting of the North American Fuzzy Information Processing Society, 2006(AFIPS2006), 493–498.

    Article  Google Scholar 

  44. Sun, J., Chan, S., Ko, K., Chen, G., & Zukerman, M. (2006). Neuron pid: A robust AQM scheme. In Proceedings of ATNAC. Citeseer, 2006 (pp. 259–262).

  45. Sun, J., & Zukerman, M. (2007). Improving RED by a neuron controller. In Managing traffic performance in converged networks (pp. 434–445).

  46. Sun, J., Zukerman, M. & Palaniswami, M. (2007). Stabilizing RED using a fuzzy controller. In IEEE International Conference on Communications, ICC’07, 2007 (pp. 266–271).

  47. Sun, J., & Zukerman, M. (2007). An adaptive neuron AQM for a stableInternet. In NETWORKING 2007, Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, 2007 (pp. 844–854).

  48. Mrozowski, P., & Chydzinski, A. (2009). Stability of aqm algorithms in low congestion scenarios. International Journal of Applied Mathematics and Informatics, 3(1), 9–16.

    Google Scholar 

  49. Du, Y. P., & Wang, N. (2004). A PID controller with neuron tuning parameters for multi-model plants. In Proceedings of 2004 International Conference on Machine Learning and Cybernetics, 2004 (vol. 6, pp. 3408–3411).

  50. Widrow, B., & Hoff, M. E. (1988). In Neurocomputing: Foundations of research. In J. A. Anderson & E. Rosenfeld (Eds.) (pp. 123–134) Cambridge, MA: MIT Press. [Online]. Available: http://dl.acm.org/citation.cfm?id=65669104390.

  51. Hebb, D. O. (1949). The Organization of Behavior. New York: Wiley & Sons.

    Google Scholar 

  52. Zhang, J., Wang, S., and Wang, N. (2000). A new intelligent coordination control system for a unit power plant. In Proceedings of 3rd World Congress on Intelligent Control and Automation, 2000 (pp. 313–317).

  53. Chrost, L., & Chydzinski, A. (2009). On the evaluation of the active queue management mechanisms. In Proceedings of International Conference on Evolving Internet, 2009 (pp. 113–118).

  54. [Online]. Available: www.isi.edu/nsnam/ns/.

  55. Mudge, T. (2001). Power: A first-class architectural design constraint. Computer, 34(4), 52–58.

    Article  Google Scholar 

  56. Brooks, D. M. B., et al. (2000). Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors. IEEE Micro, 20(6), 26–44.

    Article  Google Scholar 

  57. Chen, J. J., & Kuo, T. W. (2005). Multiprocessor energy-efficient scheduling for real-time tasks with different power characteristics. In International Conference on Parallel Processing, 2005 (pp. 13–20).

  58. Pruhs, K., van Stee, R., & Uthaisombut, P. (2008). Speed scaling of tasks with precedence constraints. Theory of Computing Systems, 43(1), 67–80.

    Article  Google Scholar 

  59. Aupy, G., Benoit, A., Dufoss, F., & Robert, Y. (2011). Reclaiming the energy of a schedule: models and algorithms, INRIA technical report, Technical Report, 2011. [Online]. Available: http://graal.ens-lyon.fr/~yrobert/onlinepapers/RR-INRIA-7598.

Download references

Acknowledgments

The work was supported by MNiSW under Grant N N516 381134.

Author information

Authors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Lukasz Chrost & Andrzej Chydzinski

Authors
  1. Lukasz Chrost
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Chydzinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Chydzinski.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chrost, L., Chydzinski, A. On the deterministic approach to active queue management. Telecommun Syst 63, 27–44 (2016). https://doi.org/10.1007/s11235-015-9969-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-015-9969-9

Keywords

Search

Navigation