A Matrix Usage for Load Balancing in Shortest Path Routing

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

Full description

Saved in:

Bibliographic Details
Main Author:	Mustafa, Nor Musliza
Format:	Thesis
Language:	English English
Published:	2009
Subjects:	Routers (Computer networks) - Case studies
Online Access:	http://psasir.upm.edu.my/id/eprint/7140/1/FSKTM_2009_3a.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.7140
record_format	uketd_dc
spelling	my-upm-ir.71402013-05-27T07:33:39Z A Matrix Usage for Load Balancing in Shortest Path Routing 2009-02 Mustafa, Nor Musliza 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. Routers (Computer networks) - Case studies 2009-02 Thesis http://psasir.upm.edu.my/id/eprint/7140/ http://psasir.upm.edu.my/id/eprint/7140/1/FSKTM_2009_3a.pdf application/pdf en public masters Universiti Putra Malaysia Routers (Computer networks) - Case studies Computer Science and Information Technology English
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English English
topic	Routers (Computer networks) - Case studies
spellingShingle	Routers (Computer networks) - Case studies Mustafa, Nor Musliza A Matrix Usage for Load Balancing in Shortest Path Routing
description	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.
format	Thesis
qualification_level	Master's degree
author	Mustafa, Nor Musliza
author_facet	Mustafa, Nor Musliza
author_sort	Mustafa, Nor Musliza
title	A Matrix Usage for Load Balancing in Shortest Path Routing
title_short	A Matrix Usage for Load Balancing in Shortest Path Routing
title_full	A Matrix Usage for Load Balancing in Shortest Path Routing
title_fullStr	A Matrix Usage for Load Balancing in Shortest Path Routing
title_full_unstemmed	A Matrix Usage for Load Balancing in Shortest Path Routing
title_sort	matrix usage for load balancing in shortest path routing
granting_institution	Universiti Putra Malaysia
granting_department	Computer Science and Information Technology
publishDate	2009
url	http://psasir.upm.edu.my/id/eprint/7140/1/FSKTM_2009_3a.pdf
_version_	1747810661422858240

A Matrix Usage for Load Balancing in Shortest Path Routing

Similar Items