Optimizing OSPF/IS-IS weights in a changing world

Fortz, Bernard; Thorup, Mikkel

doi:10.1109/jsac.2002.1003042

Cited by 537 publications

(381 citation statements)

References 26 publications

Supporting

Mentioning

375

Contrasting

Unclassified

Order By: Relevance

“…Generally, the transport capacity of a network is limited by two factors: link capacity (bandwidth in the case of the Internet or wireless networks) and node (router) latency. Traditionally, both fixed and ad-hoc network routing is based on the idea of maintaining a table of the shortest paths (or the best available approximation to the shortest paths) between any two nodes of the network and forwarding the information packages along these paths [1,2]. The length of a path is computed as the sum of the weights assigned to the links that form the path.…”

mentioning

confidence: 99%

“…In the case of the Internet, link weights are typically assigned manually by operators according to simple rules based on experience [1]. Recently, a series of heuristic algorithms have also been proposed for network traffic optimization [1,2,3,4,5]. These rules and algorithms are aimed at avoiding or reducing link overload by a judicious link weight assignment.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Optimal transport on complex networks

Danila

Marsh³

et al. 2006

Phys. Rev. E

222

187

View full text Add to dashboard Cite

We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By using the resulting routing table, a network can sustain significantly higher traffic without jamming than in the case of traditional shortest path routing.

show abstract

mentioning

confidence: 99%

mentioning

confidence: 99%

Optimal transport on complex networks

Danila

Marsh³

et al. 2006

Phys. Rev. E

222

187

View full text Add to dashboard Cite

show abstract

“…The routing parameters determine, for each source-destination pair, the fraction of traffic going on different paths from the source to the destination. Many TE techniques have been presented (for examples see [2][3][4][5][6][7][8][9][10][11][12][13][14][15]). The majority of the TE literature concerns intra-domain TE.…”

Section: Traffic Engineeringmentioning

confidence: 99%

“…It has been shown that (for realistic networks) one can get within a few percent of the performance of explicit path routing [6], even where the inputs contain prediction or inference errors [13,15]. What's more shortest-path optimization can choose sets of weights that perform well over a range of traffic (say the variations over the course of a day) [9,15] or under link failures [14,18,19].…”

Section: Traffic Engineeringmentioning

confidence: 99%

GATEway: symbiotic inter-domain traffic engineering

Roughan

Zhang

2010

Telecommun Syst

View full text Add to dashboard Cite

There are a group of problems in networking that can most naturally be described as optimization problems (network design, traffic engineering, etc.). There has been a great deal of research devoted to solving these problems, but this research has been concentrated on intra-domain problems where one network operator has complete information and control. An emerging field is interdomain engineering, for instance, traffic engineering between large autonomous networks. Extending intra-domain optimization techniques to inter-domain problems is often impossible without the measurements and control available within a domain. This paper presents an alternative: we propose a method for traffic engineering that doesn't require sharing of important information across domains. The method extends the idea of genetic algorithms to allow symbiotic evolution between two parties. Both parties may improve their performance without revealing their data, other than what would be easily observed in any case. We show the method provides large reductions in network congestion, close to the optimal shortest path routing across a pair of networks. The results are highly robust to measurement noise, the method is very flexible, and it can be applied using existing routing.

show abstract

“…When tested on synthetic internetworks the performance of this search heuristic was not as close to the optimal general routing. In [9] authors propose techniques for optimizing OSPF or IS-IS weights for intradomain routing in a dynamic setting, by changing as few weights as possible. An algorithm for dynamic routing of bandwidth guaranteed tunnels, where tunnel routing requests arrive at runtime and there is no knowledge about future requests, is presented in [10].…”

Section: Related Workmentioning

confidence: 99%

S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks

Mishra

Sahoo

2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet forwarding to achieve any network optimization objective. Because of the high cost of network assets and commercial and competitive nature of Internet service provisioning, service providers are interested in performance optimization of their networks. This helps in reducing congestion hotspots and improving resource utilization across the network, which, in turn, results in an increased revenue collection. One way of achieving this is through Traffic Engineering. Currently traffic engineering is mostly done by using MPLS. But legacy networks running OSPF would need to be upgraded to MPLS. To achieve better resource utilization without upgrading OSPF network to MPLS is a challenge. In this paper we present a simple but effective algorithm, called Smart OSPF (S-OSPF) to provide traffic engineering solution in an OSPF based best effort network. We formulate an optimization problem based on the traffic demand to minimize the maximum link utilization in the network. Routing of the traffic demand is achieved using OSPF. We have simulated S-OSPF on real networks of two service providers. Simulation results show that S-OSPF based traffic engineering solution performance very closely follows the optimal solution.

show abstract

Optimizing OSPF/IS-IS weights in a changing world

Cited by 537 publications

References 26 publications

Optimal transport on complex networks

Optimal transport on complex networks

GATEway: symbiotic inter-domain traffic engineering

S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks

Contact Info

Product

Resources

About