Increasing Internet capacity using local search

Increasing Internet capacity using local search

0.00 Avg rating0 Votes
Article ID: iaor2005718
Country: Netherlands
Volume: 29
Issue: 1
Start Page Number: 13
End Page Number: 48
Publication Date: Oct 2004
Journal: Computational Optimization and Applications
Authors: ,
Keywords: internet
Abstract:

Open Shortest Path First (OSPF) is one of the most commonly used intra-domain internet routing protocols. Traffic flow is routed along shortest paths, splitting flow evenly at nodes where several outgoing links are on shortest paths to the destination. The weights of the links, and thereby the shortest path routes, can be changed by the network operator. The weights could be set proportional to the physical lengths of the links, but often the main goal is to avoid congestion, i.e. overloading of links, and the standard heuristic recommended by Cisco (a major router vendor) is to make the weight of a link inversely proportional to its capacity. We study the problem of optimizing OSPF weights for a given set of projected demands so as to avoid congestion. We show this problem is NP-hard, even for approximation, and propose a local search heuristic to solve it. We also provide worst-case results about the performance of OSPF routing vs. an optimal multi-commodity flow routing. Our numerical experiments compare the results obtained with our local search heuristic to the optimal multi-commodity flow routing, as well as simple and commonly used heuristics for setting the weights. Experiments were done with a proposed next-generation AT&T WorldNet backbone as well as synthetic internetworks.

Reviews

Required fields are marked *. Your email address will not be published.