Impact of Link Weight Ranges on OSPF Weight Solutions

Author

Zuo, Yong ; Pitts, Jonathan

Author_Institution

Univ. of London, London

fYear

2007

fDate

22-24 Aug. 2007

Firstpage

72

Lastpage

76

Abstract

Finding a set of optimal link weights for OSPF routing is a NP-hard problem. Many heuristic algorithms have been proposed in the past. In this paper, we study the impact of link weight ranges on OSPF weight solutions. Experiments were conducted on three commonly used types of synthetic networks for a set of link weight ranges. Three heuristic algorithms with different search mechanisms were run independently for each network instance and for each link weight range. Based on the numerical results, we assess the link weight solutions with respect to solution quality, equal-cost multi-path and hop count, and then present guidelines on the choice of an acceptable link weight range, i.e. the minimum and maximum weight values.

Keywords

combinatorial mathematics; optimisation; radio links; search problems; NP-hard problem; equal-cost multipath solution; heuristic algorithms; hop count solutions; open short path first; optimal link weights; search mechanisms; synthetic networks; Genetic algorithms; Guidelines; Heuristic algorithms; Internet; Network topology; Performance analysis; Quality of service; Routing; Telecommunication traffic; Tellurium; OSPF weight optimization; Traffic engineering; link weight range;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Networking in China, 2007. CHINACOM '07. Second International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-1009-5

Electronic_ISBN

978-1-4244-1009-5

Type

conf

DOI

10.1109/CHINACOM.2007.4469331

Filename

4469331