Title :
A heuristic algorithm for solving the static weight optimisation problem in OSPF networks
Author_Institution :
Traffic Anal. & Network Performance Lab., Ericsson Hungary Ltd., Budapest, Hungary
Abstract :
This paper deals with the problem of OSPF weight system adjustment. It is one of the fundamental optimisation tasks in IP/OSPF networks, because the OSPF weight system determines the routes for traffic flows. If the OSPF weights are set in a proper way, significantly better network throughput and performance can be achieved compared with the simple weight setting heuristics used nowadays. Because this kind of weight configuration is typically set in the network planning phase, the overall quality of the weight setting algorithm results will determine the long-term network utilisation. In the paper we formulate a relevant optimisation problem and on the basis of the experiences of our previous research work we propose a deterministic, heuristic algorithm for solving the problem. In addition to the network model, formulation of the problem and description of the proposed algorithm, its performance is illustrated with numerical results
Keywords :
Internet; deterministic algorithms; optimisation; protocols; telecommunication network planning; telecommunication network routing; telecommunication traffic; IP networks; OSPF networks; deterministic heuristic algorithm; interior gateway protocol; long-term network utilisation; network planning; network throughput; open shortest path first protocol; optimisation; performance; routes; traffic flows; weight system adjustment; Costs; Heuristic algorithms; IP networks; Intelligent networks; Laboratories; Performance analysis; Protocols; Routing; Telecommunication traffic; Throughput;
Conference_Titel :
Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE
Conference_Location :
San Antonio, TX
Print_ISBN :
0-7803-7206-9
DOI :
10.1109/GLOCOM.2001.965851