Optimizing paths in OSPF routing

Author

Bamatraf, Makarem ; Othman, Mohamed ; Johari, Rozita ; Subramaniam, Shamala

Author_Institution

Dept. of Commun. Technol. & Network, Univ. Putra Malaysia, Selangor, Malaysia

Volume

1

fYear

2005

fDate

16-18 Nov. 2005

Abstract

Open shortest path first (OSPF) is the most commonly used Internet routing protocol. Traffic flows in OSPF routing go along shortest paths and the traffic will be split evenly when several shortest paths are found to the destination. An integer value is assigned for each link as a weight in OSPF networks. Weights highly affect the selection of links in the shortest paths. One of the standard heuristic recommended by Cisco is to set weights inversely proportional to the capacities of links. Overloaded links could appear if they have lower weights, while still other links unutilized. Many balance heuristics were proposed to avoid congestion and utilize un-used network resources. This paper presents an improvement for the evenly balancing heuristic proposed by Fortz and Thorup. Routing efficiency was improved when using our improved heuristic in terms of cost and max-utilization.

Keywords

Internet; routing protocols; telecommunication traffic; Internet routing protocol; evenly load balancing; open shortest path first protocol; optimizing paths; Communications technology; Computer science; Costs; IP networks; Information technology; Intelligent networks; Load management; Routing protocols; Telecommunication traffic; Topology; Evenly Load Balancing; Internet Routing; OSPF; Optmizaton; Traffic Engineering;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication., 2005 13th IEEE International Conference on

ISSN

1531-2216

Print_ISBN

1-4244-0000-7

Type

conf

DOI

10.1109/ICON.2005.1635557

Filename

1635557