An Adaptive Triple-Path Mechanism for Congestion Control in Computer Networks


AbstractIt is known that congestion may widely appear in computer networks which apply open shortest path first (OSPF) protocol. The use of such protocol may lead to serve congestion states in some network links while another links are either not used or underutilized. In this paper, an adaptive triple-path congestion control routing mechanism is proposed. This mechanism is based on adaptive adding up to two new additional paths between source and destination nodes, in addition to original shortest path when there is a possibility of congestion in the network links. These two new paths use some information about the congestion and loading states gathered from a network predictor called wavenet-based link status predictor (WBLSP). The first additional path uses a routing algorithm called wavenet-based congested link scaling (WBCLS), while the second uses another algorithm called wavenet-based loaded link-aware with congested link scaling (WBLLACLS). The proposed congestion control routing approach is tested and its performance is evaluated using OPNET 14.5 Modeler. The results are compared with the results of applying traditional OSPF routing protocol on two different tested network topologies and similar loading scenarios.