Wavenet-based dual-path congestion control routing mechanism

The wide use of computer networks, such as Internet, and network related applications makes computer networks the most integral medium for information transfer. Due to the increase in load on computer networks, congestion problems in their links will occur. Thus, any additional use of those congested links in packet forwarding makes the problem be more severing so that network service will deteriorate with the increase of both packet loss and queuing delay. In this paper, a new routing mechanism called wavenet-based dual-path congestion control routing mechanism (WBDPCCRM) is proposed. This congestion control routing mechanism is based on adding a least congested shortest path in addition to the original OSPF path between any source-destination node-pair. These two paths run in parallel and share the loads that are offered by the nodes. The least congested shortest path is an adaptive path takes into account the congestion state of each network link while it determines forwarding paths that delivers packets from source to destination through it. During this process, the congested links are avoided by shortest path calculation since their cost values are scaled up locally. The second path uses in its computations some information about the congestion and loading states gathered from a network predictor called wavenet-based link status predictor (WBLSP). The results show that WBDPCCRM can succeed in eliminating network congestion for some load scenarios or at least it can minimize such congestion.