Abstract-Open Shortest Path First (OSPF) is the most commonly used intra-domain internet routing protocol. ’Raffic flow is routed along shortest paths, splitting flow at nodes where several outgoing links are on shortest paths to the destination. The weights of the links, and thereby the shortest patb routes, can be changed by the network operator. The weights could be set proportional to their physical distances, but often the main goal is to avoid congestion, i.e. overloading of links,and the standard heuristic recommended by Cwo is to make the weight of a link inversely proportional to its capacity. Our startiug point was a proposed AT&T WorIdNet backbone with demands projected from previous measurements. The desire was to optimize the weight setting based on the projected demands. We showed that optimizii the weight settings for a given set of demands is NP-hard, so we resorted to a local search heuristic. Surprisingly it turned out that for the proposed AT&T WorlWet backbone, we found weight settings that performe
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.