Traffic Load Balancing based on Congestion Avoidance (TLBCA) in high-speed computer networks

  • Ahmed Malik Khudhair Department of Computer Information System, College of Computer Science and Information Te
  • Khulood A. Nassar Department of Computer Information System, College of Computer Science and Information Technology, Basra, Iraq
Keywords: Congetion Avoidance, Congestion Control, Computer Netwoeks, Close Loop


Congestion, and how to manage it or prevent its occurrence, is one of the most crucial and cutting-edge subjects in the world of networks since it has a significant influence on the computer network and the quality of service (QoS). Network efficiency is decreased by congestion, which frequently results in service interruptions. In order to preserve the continuity of data flow in the network, it is necessary to design approaches and processes to avoid congestion or to minimize its effects. Congestion are avoided at two levels, knot and link, by using different techniques, including close loop or open loop. This paper proposed a new technique (TLBCA) to distribute packets arriving at a specific node on the links connected to it, which leads to the same destination, to avoid congestion on one of the links and out of service, which then leads to more load on the other links until the network collapses. TLBCA is based on the popular algorithm Round Robin. ECMP and TinyFlow, the two most widely used comparable algorithms in this sector, performed around 20% worse than the approach when it was simulated using OMNET++.


Download data is not yet available.


[1] E. N. . Obinna and L. G. ** , Kabari, “Comparative Analysis of Drop Tail, Red and NLRED Congestion Control Algorithms Using NS2 Simulator,” Int. J. Sci. Res. Publ., vol. 8, no. 8, 2018.
[2] J. F. Kurose and K. W. Ross, Computer Networking A Top Down Approach, Eighth edi. 2020.
[3] J. Chavula, “Improving Pan-African research and education networks through traffic engineering: A LISP/SDN approach,” 2017.
[4] K. A. Nasar, T. Y. Abdalla, and A. Y. Abdalla, “Computer Network Routing Using Fuzzy Systems,” basrah J. Sci., vol. 26, no. 1A english, 2008.
[5] M. Welzl, Network congestion control: managing internet traffic. John Wiley & Sons, 2005.
[6] A. Y. Abdalla, T. Y. Abdalla, and K. A. Nasar, “Computer Network Routing Using Neural Networks,” Basrah J. Sci., vol. 30, no. 1, pp. 1–14, 2012.
[7] X. Wang, Scheduling and Congestion Control for Wireless Internet. Springer, 2014.
[8] C. N. Houmkozlis and G. A. Rovithakis, End-to-end Adaptive Congestion Control in TCP/IP Networks. CRC Press, 2017.
[9] K. A. Nassar and A. A. Abdullah, “End-to-End Fuzzy RED to Reduce Packet Loss in Virtual Circuit Network,” J. Univ. Babylon, vol. 25, no. 3, 2017.
[10] S. Gupta, N. K. Sharma, and K. P. Yadav, “A Survey on Congestion Control & Avoidance.” VSRD-IJCSIT, 2012.
[11] A. S. Tanenbaum and D. Wetherall, “The network layer,” Comput. Networks, pp. 343–423, 2011.
[12] J. Liu, H. Zou, J. Dou, and Y. Gao, “Rethinking retransmission policy in concurrent multipath transfer,” in 2008 International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2008, pp. 1005–1008.
[13] A. Pehlivanlı, “Software implementations of QoS scheduling algorithms for high speed networks.” Middle East Technical University, 2015.
[14] R. Kauser, “QoS aware packet scheduling in the downlink of LTE-Advanced networks.” Queen Mary, University of London, 2013.
[15] M. H. E. Mohamed, “Some active queue management methods for controlling packet queueing delay,” Des. Perform. Eval. Some New Versions Act. Queue Manag. Schemes Control. Pack. Queueing Delay a Buffer to Satisf. Qual. Serv. Requir. Realt. Multimed. Appl., 2010.
[16] V. Jacobson, “Congestion avoidance and control,” ACM SIGCOMM Comput. Commun. Rev., vol. 18, no. 4, pp. 314–329, 1988.
[17] S. J. Golestani, “A stop-and-go queueing framework for congestion management,” in Proceedings of the ACM symposium on Communications architectures & protocols, 1990, pp. 8–18.
[18] S. J. Golestani, “A framing strategy for congestion management,” IEEE J. Sel. Areas Commun., vol. 9, no. 7, pp. 1064–1077, 1991.
[19] J. Waldby, U. Madhow, and T. V Lakshman, “Total acknowledgements (extended abstract) a robust feedback mechanism for end-to-end congestion control,” in Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1998, pp. 274–275.
[20] D.-I. Choi and S.-M. Lee, “Performance analysis of the leaky bucket scheme with queue length dependent arrival rates,” Bull. Korean Math. Soc., vol. 43, no. 3, pp. 657–669, 2006.
[21] G. Appenzeller, I. Keslassy, and N. McKeown, “Sizing router buffers,” ACM SIGCOMM Comput. Commun. Rev., vol. 34, no. 4, pp. 281–292, 2004.
[22] S. Bolla, “Implementation of virtual circuits as a switching fabric in virtual modularized network.” University of Toledo, 2010.
[24] J.-N. Hwang, Multimedia networking: From theory to practice. Cambridge university press, 2009.
[25] K. M. A. Patel and R. Martolia, “Congestion control techniques in networking,” in 2016 International Conference on Communication and Signal Processing (ICCSP), 2016, pp. 1831–1835.
[26] A. Almeida and C. Belo, “Explicit congestion control based on 1-bit probabilistic marking,” Comput. Commun., vol. 33, pp. S30–S40, 2010.
[27] J. Zhang, F. R. Yu, S. Wang, T. Huang, Z. Liu, and Y. Liu, “Load balancing in data center networks: A survey,” IEEE Commun. Surv. Tutorials, vol. 20, no. 3, pp. 2324–2352, 2018.
How to Cite
Khudhair, A., & Nassar, K. (2022). Traffic Load Balancing based on Congestion Avoidance (TLBCA) in high-speed computer networks. Journal of Al-Qadisiyah for Computer Science and Mathematics, 14(4), Comp Page 12-25.
Computer article