Minimizing Congestion in Ring Topology Using Node-to-Node Path-Finding Algorithm

The performance of any network is often calculated by the rate at which the packets can be transmitted from the source node to the destination node. However, several factors can hinder the performance of the network. Faulty sub-nodes, bottlenecks, and long queues are some of how the performance of a network can be hindered. Most of these factors can be solved through a change in the hardware used. A buffer of greater volume and proper maintenance of the nodes in the network can help to reduce the hindrances during data transmission However, congestion can occur due to various factors and the assessment to find the root cause can take time. Therefore, minimizing congestion is a critical component of any network monitoring system. If we can isolate the congested node and resume the data transmission, the performance of the network remains unaffected. This gives ample time for the admin to assess the fault in the node by running various tests that would not have been possible to do with the constraint of resuming the data transmission. Hence, this paper discusses a process of dynamic topology-shaping to find the quickest path from one node to another irrespective of congestion in the network.