By Topic

Optimal capacity allocation for load balanced shortest path routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Antic, M. ; Sch. of Electr. Eng., Belgrade Univ., Belgrade, Serbia ; Smiljanic, A.

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.

Published in:

High Performance Switching and Routing, 2009. HPSR 2009. International Conference on

Date of Conference:

22-24 June 2009