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
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
Two phase load balanced routing using OSPF
IEEE Journal on Selected Areas in Communications
Load-balanced IP routing scheme based on shortest paths in hose model
IEEE Transactions on Communications
| Hi-index | 0.00 |
In this paper we introduce the novel routing scheme based on load balancing and shortest-path routing. First, we present the linear program for routing optimization. The nonblocking network is considered, which only limits the traffic loads of the network nodes. Guaranteed node traffic loads pass through the network regardless of the actual traffic destinations. The derived optimization includes node priority weights that allow the network planner to assign higher or lower traffic values to the network nodes. Then we analyze the performance of the proposed strategy for some realistic network topologies, and show that the proposed scheme achieves higher guaranteed node traffic loads than the regular shortest-path routing.