Optimization of OSPF Routing in IP Networks

Bley, Andreas; Fortz, Bernard; Gourdin, Éric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Umit, Hakan

doi:10.1007/978-3-642-02250-0_8

Cited by 16 publications

(19 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is evident from the results in Table 2 that both groups of inequalities are extremely helpful in practice. Adding only the inequalities (5)-(7) derived from the subpath consistency gave substantially improved lower bounds in 2 and improved solutions in 5 of the 20 cases, while adding only (in)equalities (8) and (9) substantially improves the lower bounds in 5 cases and the solutions in 5 cases. Of course, adding these inequalities to the model has side effects on the exploration of the branchand-bound tree and on the addition of other integer programming cuts via CPLEX's build-in separation subroutines, so there are also some cases where adding inequalities (5)-(7) slightly deteriorates the lower bounds and solutions.…”

Section: Resultsmentioning

confidence: 89%

“…Furthermore, there is only one case with a slightly worse solution and no case with a worse lower bound than in the corresponding run where none of the addition inequalities is added. Comparing the results of the different runs, one also finds that the vast majority of the improvement in the lower bound is due to adding (in)equalities (8) and (9), which are derived from the dependencies between the link capacities and the subpath consistency property. Inequalities (5)- (7), on the other hand, help to find better feasible solutions earlier in the search tree, but they have only little effect on the lower bound of the linear relaxation.…”

Section: Resultsmentioning

confidence: 97%

“…In many cases, adding (in)equalities (8) and (9) alone, already yields a much better linear programming bound at the root node and leads a substantial improvement of the performance of the overall branch-and-bound algorithm. In several cases, however, our approach achieves its maximum performance only if all inequalities (5)-(9) are added.…”

Section: Resultsmentioning

confidence: 99%

“…Formulations of this type are discussed in [8,9,20,28,30,33], for example. Unfortunately, the relation between the shortest paths and the routing length always leads to quadratic or very large big-M models, which are computationally extremely hard and not suitable for practical problems.…”

mentioning

confidence: 99%

See 3 more Smart Citations

An Integer Programming Algorithm for Routing Optimization in IP Networks

Bley¹

2010

Algorithmica

Self Cite

View full text Add to dashboard Cite

Most data networks nowadays use shortest path protocols to route the traffic. Given administrative routing lengths for the links of the network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination.In this paper, we present an integer programming algorithm for the minimum congestion unsplittable shortest path routing problem, which arises in the operational planning of such networks. Given a capacitated directed graph and a set of communication demands, the goal is to find routing lengths that define a unique shortest path for each demand and minimize the maximum congestion over all links in the resulting routing. We illustrate the general decomposition approach our algorithm is based on, present the integer and linear programming models used to solve the master and the client problem, and discuss the most important implementational aspects. Finally, we report computational results for various benchmark problems, which demonstrate the efficiency of our algorithm.

show abstract

Section: Resultsmentioning

confidence: 89%

Section: Resultsmentioning

confidence: 97%

Section: Resultsmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

An Integer Programming Algorithm for Routing Optimization in IP Networks

Bley¹

2010

Algorithmica

Self Cite

View full text Add to dashboard Cite

show abstract

“…Except for some special cases [38] there is no complete description of routing configurations which can be realized as shortest‐paths, but [7, 8, 10, 13, 14, 16,17) study some necessary conditions. For more extensive reviews on the subject, we refer to the surveys of Alt \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}\begin{align*} \mathcal{i}\end{align*}\end{document}n et al [3], Bley et al [11] and Fortz [21].…”

Section: Introductionmentioning

confidence: 99%

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

Altın¹,

Fortz²,

Umit³

2012

Networks

Self Cite

View full text Add to dashboard Cite

The desire for configuring well‐managed open shortest path first (OSPF) routes to handle the communication needs in the contemporary business world with larger networks and changing service requirements has opened the way to use traffic engineering tools with the OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. We take these two crucial issues into consideration and study the weight setting problem for OSPF routing problem with polyhedral demands. Our motivation is to optimize the link weight metric such that the minimum cost routing uses shortest paths with equal cost multipath splitting and the routing decisions are robust to possible fluctuations in demands. In addition to a compact mixed integer programming model, we provide an algorithmic approach with two variations to tackle the problem. We present several test results for these two strategies and discuss whether we could make our weight‐managed OSPF comparable to unconstrained routing under polyhedral demand uncertainty. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012

show abstract

On the complexity of equal shortest path routing

2015

View full text Add to dashboard Cite

International audienceIn telecommunication networks packets are carried from a source s to a destination t on a path determined by the underlying routing protocol. Most routing protocols belong to the class of shortest path routing protocols. In such protocols, the network operator assigns a length to each link. A packet going from s to t follows a shortest path according to these lengths. For better protection and efficiency, one wishes to use multiple (shortest) paths between two nodes. Therefore the routing protocol must determine how the traffic from s to t is distributed among the shortest paths. In the protocol called OSPF-ECMP (for Open Shortest Path First-Equal Cost Multiple Path) the traffic incoming at every node is uniformly balanced on all outgoing links that are on shortest paths. In that context, the operator task is to determine the " best " link lengths, toward a goal such as maximizing the network throughput for given link capacities. In this work, we show that the problem of maximizing even a single commodity flow for the OSPF-ECMP protocol cannot be approximated within any constant factor ratio. Besides this main theorem, we derive some positive results which include polynomial-time approximations and an exponential-time exact algorithm

show abstract

Optimization of OSPF Routing in IP Networks

Cited by 16 publications

References 30 publications

An Integer Programming Algorithm for Routing Optimization in IP Networks

An Integer Programming Algorithm for Routing Optimization in IP Networks

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

On the complexity of equal shortest path routing

Contact Info

Product

Resources

About