Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
Worst-case Traffic for Oblivious Routing Functions
IEEE Computer Architecture Letters
Understanding and Using Linear Programming (Universitext)
Understanding and Using Linear Programming (Universitext)
Rate and delay guarantees provided by Clos packet switches with load balancing
IEEE/ACM Transactions on Networking (TON)
Traffic-Oblivious Routing for Guaranteed Bandwidth Performance
IEEE Communications Magazine
Cost reduction of reliable networks using load balanced routing
IEEE Communications Letters
Hi-index | 0.00 |
In this paper we first describe the load balanced shortest path routing (LB-SPR) protocol. Then, we present the linear program for the optimal capacity allocation, to minimize the resource consumption when LB-SPR is applied in the network. We show that when the load balancing is applied, the capacity allocation problem can be expressed only in terms of the total traffic generated by the network nodes, without the need to know the actual traffic distribution. Then, we compare the resource consumption for the proposed LB-SPR protocol and for the regular shortest path routing (SPR) protocols assuming only the traffic loads that users generate and receive at the network nodes. It will be shown that the proposed LB-SPR protocol needs less network resources. In other words, the LB-SPR protocol can route the same traffic at the lower price than the commonly used SPR protocols.