SODA

Search Heuristics for Load Balancing in IP-networks

Söderqvist, Mattias (2005) Search Heuristics for Load Balancing in IP-networks. [SICS Report]

[img]
Preview
PDF
321Kb
[img]Postscript
402Kb

Abstract

Two of the most commonly used intra-domain Internet routing protocols are Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS). In both these protocols the traffic is routed along shortest paths to the destination without considering other traffic demands or load in the network. The weight of the links, and thereby the shortest paths, can be set by the network operator. This creates the possibility for the network operator to redirect traffic from congested links to less utilised links and achieve a more efficient use of the network. We study three different heuristics for the problem of finding a set of OSPF/IS-IS weights that optimises the performance of the network. We evaluate the heuristics in topologies with power-law properties and compare the obtained results with those from a standard weight setting recommended by Cisco (a major router vendor) as well as with those from an optimal multi-commodity flow routing. Our main conclusion is that one of the heuristics performs better than the rest of the heuristics and achieves results reasonable close to optimum.

Item Type:SICS Report
Uncontrolled Keywords:Load balancing, IP-networks, power-laws topologies, search heuristics
ID Code:2364
Deposited By:Vicki Carleson
Deposited On:29 Oct 2007
Last Modified:18 Nov 2009 16:07

Repository Staff Only: item control page