A Matrix Usage for Load Balancing in Shortest Path Routing

Mustafa, Nor Musliza (2009) A Matrix Usage for Load Balancing in Shortest Path Routing. Masters thesis, Universiti Putra Malaysia.

[img] PDF
394Kb

Abstract

The Open Shortest Path First (OSPF) protocol is a hierarchical interior gateway protocol (IGP) for routing in Internet Protocol. Traffic flows routed along shortest path and splits the load equally at nodes where a number of outgoing links on the shortest paths to the same destination IP address. Network operator defines shortest paths based on a link weights value assigned to each link in the network. The OSPF link weight-setting problem seeks a set of link weights to optimize a cost function and network performance, typically associated with a network congestion measure. This research highlight the importance of managing network resource and avoiding congested point in the current widely deployed shortest path routing. The previous Evenly Balancing Method (EBM) and Re-Improved Balancing Method (R-IBM) used demand matrix, which requires constant monitoring of routers with high time executions in the optimization process. The problems are to find another matrix that can replace or minimize the usage of demand matrix with low time executions process. A new proposed Matrix Usage Method (MUM) is developed. MUM selects the shortest path routing in order to provide a balancing load and optimized the usage of link in the network. The simulation results show that the routing performance of the new proposed method MUM is better than the routing performance of the previous Evenly Balancing Methods (EBM) and Re-Improved Balancing Method (R-IBM) due to providing counting selection technique in the shortest path routing. MUM times executions are also improved comparing with the previous work.

Item Type:Thesis (Masters)
Subject:Routers (Computer networks) - Case studies
Chairman Supervisor:Associate Professor Mohamed Othman, PhD
Call Number:FSKTM 2009 3
Faculty or Institute:Faculty of Computer Science and Information Technology
ID Code:7140
Deposited By: Nur Izyan Mohd Zaki
Deposited On:10 Jun 2010 02:06
Last Modified:27 May 2013 07:33

Repository Staff Only: Edit item detail

Document Download Statistics

This item has been downloaded for since 10 Jun 2010 02:06.

View statistics for "A Matrix Usage for Load Balancing in Shortest Path Routing "


Universiti Putra Malaysia Institutional Repository

Universiti Putra Malaysia Institutional Repository is an on-line digital archive that serves as a central collection and storage of scientific information and research at the Universiti Putra Malaysia.

Currently, the collections deposited in the IR consists of Master and PhD theses, Master and PhD Project Report, Journal Articles, Journal Bulletins, Conference Papers, UPM News, Newspaper Cuttings, Patents and Inaugural Lectures.

As the policy of the university does not permit users to view thesis in full text, access is only given to the first 24 pages only.