Download now Free registration required
In this paper, the authors propose the oblivious routing scheme based on shortest-path routing and load balancing. They present the LP model that finds the optimal routing. Then, they compare the performance of the proposed scheme with the performance of the shortest-path routing for some regular and real-case network topologies. They 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.
- Format: PDF
- Size: 167.03 KB