UPM Institutional Repository

Traffic Balancing Method in Shortest Path Routing


Mohamed Abdulqader, Makarem (2007) Traffic Balancing Method in Shortest Path Routing. PhD thesis, Universiti Putra Malaysia.


Open Shortest Path First (OSPF) is the most commonly used intra-domain routing protocol. OSPF routes traffic flows along shortest paths and splits the load evenly at nodes where several outgoing links are on the shortest paths to the same destination. Shortest paths are defined based on a weight value assigned to each link in the network. OSPF routing suffers from un-utilizing network resources, and hence appearance of congested links. Congestion appears in OSPF routing due to the excessive usage of shortest paths where still other links with higher weight values are unutilized. Many load balancing approaches were proposed to avoid congestion and increase network utilization. One of these approaches argued that optimizing link weights will improve shortest path routing performance, thus no changing needed in underlying infrastructure. Weight optimization approach neither deal with the issue of load splitting, nor the tradeoff relation between exploiting network resources and avoiding congested points. Increasing balanced links may lead to a usage of congested links. On the other hand, avoiding congested links may lead to un-utilizing some uncongested links. This research has two main aims. The first aim is to study the tradeoff relation between utilizing network links and avoiding congested links. The second aim is to provide an unequal load splitting in the current widely deployed shortest path routing. Unequal load splitting that provided in this research is conducted without changing the underlying routing policy and without changing the forwarding mechanism. In context of the first research aim, a previous evenly balancing method is improved by solving two problems. The first problem is Re-using Congested Links (RCL). The second problem is Un-Balancing some available Links (UBL). Solving these two problems will give a wide view about the tradeoff relation between utilizing network links and avoiding congested links. In context of the second research aim, a new proposed Selective Balancing Method (SBM) is developed. SBM selects the routing paths in order to provide unequal load splitting. Experimental results show that avoiding congested links is more efficient than exploiting too many links from a source towards a destination. In other words, solving RCL problem increases routing efficiency more than solving UBL problem. The results also show that the routing performance of the new proposed method SBM is better than the routing performance of the previous evenly balancing methods due to providing unequal load splitting in the shortest path routing. SBM robustness and execution time are also improved comparing with the previous work.

Download File


Download (121kB)

Additional Metadata

Item Type: Thesis (PhD)
Subject: Open Shortest Path First (Computer network protocol).
Subject: Routing protocols (Computer network protocols).
Call Number: FSKTM 2007 5
Chairman Supervisor: Associate Professor Mohamed Othman, PhD
Divisions: Faculty of Computer Science and Information Technology
Depositing User: Yusfauhannum Mohd Yunus
Date Deposited: 13 Oct 2008 15:09
Last Modified: 27 May 2013 06:48
URI: http://psasir.upm.edu.my/id/eprint/448
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item