Load balancing effects in DCUR QoS routing algorithm

DCUR follows the same procedure as define in Bellman-Ford but uses two vectors, namely least cost and least delay vector. The main drawback of DCUR is its assumption of link costs. It means that the minimum cost path is more often chosen and therefore the load distribution is not fair for the minimum cost paths. In this paper we propose a way to modify the cost and delay metrics dynamically in the course of load distribution in the links. We propose weight functions that modify the cost and delay based on the current load of the links. Simulation results show that dynamic DCUR (DCUR with adjusted cost and delay) improves the resource utilization.