Congestion Avoidance using Traffic Load Balancing (CATLB) in Computer Networks

Abstract

Congestion in computer networks is one of the most crucial subjects in the world of networks since it has a significant influence on the network and the quality of service and decreased efficiency of it, 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 minimize its effects. Congestion is avoided at two levels, knot and link, by using different techniques, including close loop or open loop. This paper proposed a new method (CATLB) to avoid congestion by using the traffic load balancing technique, CATLB is based on the popular algorithm Round Robin in the process of distributing packets coming to a particular 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 and thus leads to more load on the other links until the network collapses. Method has been simulated using OMNET++ and got around 15% improvement in the performance from the most popular similar algorithms in this field ECMP and TinyFlow.