Approximate load balance based on ID/Locator split routing architecture

In this paper, we propose an approximate load balance approach based on the Identifler(ID)/Locator split routing architecture. In our approach, we propose a multipath method and a schedule algorithm. Both of them run on each router for scheduling each packet that is received from the connected host onto the proper path to the destination host. Our approach allows each router using the ID/Locator splitting to obtain the multiple paths between each pair of hosts. The merit of our approach is that the path is selected by each router individually to achieve load balance other than a central controller in the ID/Locator split routing architecture. The time complexity of the schedule algorithm is much lower than the linear programming (LP) and nonlinear programming (NLP). Simulation results show that, compared to the existing single path routing based on the ID/Locator split routing architecture, the mean of normalized link utilization (NLU) increases by more than 75% relatively on average of all simulated scenarios.