A routing algorithm based loading ratio in nodes

QoS (quality-of-service) routing is a key issue. In order to find a feasible path for QoS traffic, most QoS routing algorithms have to search sufficient resources to satisfy certain constraints on delay, bandwidth and/or other metrics. However, the amount of constraints and the success ratio for QoS routing in practical networking are ambivalent. Thus, in this paper, a routing algorithm based on the node loading ratio is proposed. A node loading ratio model is firstly studied. Then, a distributed routing scheme probes multiple paths according to the node loading ratio and link-bandwidth in order to find satisfactory paths for sub-networking. Simulation results and complex degree analysis show that our algorithm achieves satisfactory loading balance in global networking and with satisfactory routing time.