Skip to Main Content
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.
Date of Publication: June 2009