On open shortest path first related network optimisation problems

Authors:
M. Pióro;Á. Szentesi;J. Harmatos;A. Jüttner;P. Gajowniczek;S. Kozdrowski
Affiliations:
-;-;Ericsson Research, Traffic Analysis and Network Performance Laboratory, Budapest, Hungary;-;Institute of Telecommunications, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, Poland;Institute of Telecommunications, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, Poland
Venue:
Performance Evaluation
Year:
2002

Citing 3
Cited 7

Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

On shortest path representation

IEEE/ACM Transactions on Networking (TON)
Optimal link weights for IP-based networks supporting hose-model VPNs

IEEE/ACM Transactions on Networking (TON)
Robust IP link costs for multilayer resilience

NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Network-coding multicast networks with QoS guarantees

IEEE/ACM Transactions on Networking (TON)
Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE

Computers and Operations Research
Estimating the performance of intelligent transport systems wireless services for multimodal logistics applications

Expert Systems with Applications: An International Journal
Benefits of traffic engineering using QoS routing schemes and network controls

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with flow allocation problems in IP networks using open shortest path first (OSPF) routing. Its main purpose is to discuss and propose methods for finding settlements of OSPF link weight system realising the assumed demand pattern for the given network resources (links capacities). Such settlements can result in a significantly better network performance, as compared with the simplified weight setting heuristics typically used nowadays. Although the configuration of the link weight system is primarily done in the network planning phase, still additional re-optimisations are feasible, and in fact essential, in order to cope with major changes in traffic conditions and with major resources' failures and rearrangements.The paper formulates a relevant OSPF routing optimisation problem, proves its NP-completeness, and discusses possible heuristic approaches and related optimisation methods for solving it. Two basic approaches are considered (the direct approach and the two-phase approach) and the resulting optimisation algorithms are presented. The considerations are illustrated with numerical results.