Oblivious Routing Scheme Using Load Balancing Over Shortest Paths

In this paper, we propose the oblivious routing scheme based on shortest-path routing and load balancing. We present the LP model that finds the optimal routing. Then we compare the performance of the proposed scheme with the performance of the shortest-path routing for some regular and real-case network topologies. We show that the proposed routing strategy allows to achieve higher guaranteed traffic from/to a node in the network, compared to the case of the classical shortest-path routing.