Traffic Balancing Method in Shortest Path Routing

Traffic Balancing Method in Shortest Path Routing

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 va...

Full description

Saved in:
Bibliographic Details
Main Author: Mohamed Abdulqader, Makarem
Format: Thesis
Language:English
English
Published: 2007
Subjects:
Open Shortest Path First (Computer network protocol).
Routing protocols (Computer network protocols).
Online Access:http://psasir.upm.edu.my/id/eprint/448/1/1600477.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-upm-ir.448
record_format uketd_dc
spelling my-upm-ir.4482013-05-27T06:48:25Z Traffic Balancing Method in Shortest Path Routing 2007 Mohamed Abdulqader, Makarem 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. Open Shortest Path First (Computer network protocol). Routing protocols (Computer network protocols). 2007 Thesis http://psasir.upm.edu.my/id/eprint/448/ http://psasir.upm.edu.my/id/eprint/448/1/1600477.pdf application/pdf en public phd doctoral Universiti Putra Malaysia Open Shortest Path First (Computer network protocol). Routing protocols (Computer network protocols). Faculty of Computer Science and Information Technology English
institution Universiti Putra Malaysia
collection PSAS Institutional Repository
language English
English
topic Open Shortest Path First (Computer network protocol).
Routing protocols (Computer network protocols).
spellingShingle Open Shortest Path First (Computer network protocol).
Routing protocols (Computer network protocols).

Mohamed Abdulqader, Makarem
Traffic Balancing Method in Shortest Path Routing
description 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.
format Thesis
qualification_name Doctor of Philosophy (PhD.)
qualification_level Doctorate
author Mohamed Abdulqader, Makarem
author_facet Mohamed Abdulqader, Makarem
author_sort Mohamed Abdulqader, Makarem
title Traffic Balancing Method in Shortest Path Routing
title_short Traffic Balancing Method in Shortest Path Routing
title_full Traffic Balancing Method in Shortest Path Routing
title_fullStr Traffic Balancing Method in Shortest Path Routing
title_full_unstemmed Traffic Balancing Method in Shortest Path Routing
title_sort traffic balancing method in shortest path routing
granting_institution Universiti Putra Malaysia
granting_department Faculty of Computer Science and Information Technology
publishDate 2007
url http://psasir.upm.edu.my/id/eprint/448/1/1600477.pdf
_version_ 1747810223952756736

Similar Items