Throughput of Reliable Networks with Load Balanced Shortest Path Routing

In this paper, a practical routing protocol that maximizes the guaranteed node traffic loads in reliable networks is designed and analyzed. The derived node traffic loads can be routed for every traffic pattern, and regardless of the possible single node or link failures. First, it is described how load balanced shortest path routing (LB-SPR) can be optimized to maximize the value of the guaranteed node loads. By assigning the node weights which are fed into the linear program for the routing optimization, different network nodes can be guaranteed different traffic loads, according to their estimated demands. Then, the throughputs of the reliable networks using LB-SPR are determined. The obtained values are compared with the throughputs of the reliable networks using the regular shortestpath routing. The analysis is performed for the real networks, and the regular network topologies, and it is shown that the use of LB-SPR can significantly increase the network throughput.