Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
F-TPR: fine two-phase IP routing scheme over shortest paths for hose model
IEEE Communications Letters
Routing with load balancing: increasing the guaranteed node traffics
IEEE Communications Letters
Optimal capacity allocation for load balanced shortest path routing
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Two phase load balanced routing using OSPF
IEEE Journal on Selected Areas in Communications
Traffic-Oblivious Routing for Guaranteed Bandwidth Performance
IEEE Communications Magazine
Hi-index | 0.00 |
The routing based on load balancing and shortest path routing (LB-SPR) was recently introduced, and it was shown to have advantages over the standard shortest path routing (SPR) algorithms: it can support higher guaranteed traffic loads, and it simplifies the resource reservation processes. In this paper, the cost of setting up the reliable network which is resilient to node or link failures is analyzed. In such a network, enough capacity has to be provisioned on all the links for routing the traffic even in the case of a failure. The cost of setting up the reliable network using the shortest path routing (SPR) is compared to the cost of setting up the reliable network using the load balanced shortest path routing (LB-SPR). It is shown that LB-SPR can significantly decrease the network cost.