An investigation and simulation of novel dynamic routing methods
Routing in networks is a multi-objective and multi-constraint optimization problem due to the nature of current networks being highly dynamic environments. Currently implemented solutions are single metric solutions where instead an optimal multi-metric solution is needed to solve this problem. T...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English English |
| Published: |
2001
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/8673/ http://psasir.upm.edu.my/id/eprint/8673/1/FSKTM_2001_17%20IR.pdf |
| _version_ | 1848840935534755840 |
|---|---|
| author | Saleh, Mohammad |
| author_facet | Saleh, Mohammad |
| author_sort | Saleh, Mohammad |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Routing in networks is a multi-objective and multi-constraint optimization
problem due to the nature of current networks being highly dynamic environments.
Currently implemented solutions are single metric solutions where instead an optimal
multi-metric solution is needed to solve this problem. This research work
investigates novel multi-metric solutions to this optimization problem. Recently, it is
found that the employment of a natural optimization process called the ant colony
optimization process to the routing problem, resulted in a multi-metric dynamic
solution. Latest research work reported two slightly different implementations of this
employment. Network agents are used to sensor the status of the network and
feedback the network nodes with the necessary information. This is used to update its
routing tables based on the network status. These two implementations differ in the
method (philosophy) used to update the information in the routing tables held by the
network nodes. This research work suggests a new method to update the routing
tables held by the nodes in the network. This done by merging modified versions of
the previous two methods in order to overcome the disadvantages of each.
A discrete event simulation system is built to test the routing method
suggested by this research work together with the previous two routing methods for companson purposes. This simulation system represents a prototype for the
development of a general network simulation tool. It is capable of collecting various
types of simulation statistical data and generating tracing files for detailed studies of
the network and for testing purposes. An expandable structured C-pointer based
implementation is used to code the system.
The system is tested on various networks and the results of the simulation
show improvements on the performance of the network by reducing the overall delay
in the network and increasing throughput. Moreover, the use of the suggested routing
method results in balancing the load in the network. |
| first_indexed | 2025-11-15T07:35:15Z |
| format | Thesis |
| id | upm-8673 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T07:35:15Z |
| publishDate | 2001 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-86732023-12-26T04:48:24Z http://psasir.upm.edu.my/id/eprint/8673/ An investigation and simulation of novel dynamic routing methods Saleh, Mohammad Routing in networks is a multi-objective and multi-constraint optimization problem due to the nature of current networks being highly dynamic environments. Currently implemented solutions are single metric solutions where instead an optimal multi-metric solution is needed to solve this problem. This research work investigates novel multi-metric solutions to this optimization problem. Recently, it is found that the employment of a natural optimization process called the ant colony optimization process to the routing problem, resulted in a multi-metric dynamic solution. Latest research work reported two slightly different implementations of this employment. Network agents are used to sensor the status of the network and feedback the network nodes with the necessary information. This is used to update its routing tables based on the network status. These two implementations differ in the method (philosophy) used to update the information in the routing tables held by the network nodes. This research work suggests a new method to update the routing tables held by the nodes in the network. This done by merging modified versions of the previous two methods in order to overcome the disadvantages of each. A discrete event simulation system is built to test the routing method suggested by this research work together with the previous two routing methods for companson purposes. This simulation system represents a prototype for the development of a general network simulation tool. It is capable of collecting various types of simulation statistical data and generating tracing files for detailed studies of the network and for testing purposes. An expandable structured C-pointer based implementation is used to code the system. The system is tested on various networks and the results of the simulation show improvements on the performance of the network by reducing the overall delay in the network and increasing throughput. Moreover, the use of the suggested routing method results in balancing the load in the network. 2001-06 Thesis NonPeerReviewed text en http://psasir.upm.edu.my/id/eprint/8673/1/FSKTM_2001_17%20IR.pdf Saleh, Mohammad (2001) An investigation and simulation of novel dynamic routing methods. Doctoral thesis, Universiti Putra Malaysia. Routing (Computer network management). Routing protocols (Computer network protocols). English |
| spellingShingle | Routing (Computer network management). Routing protocols (Computer network protocols). Saleh, Mohammad An investigation and simulation of novel dynamic routing methods |
| title | An investigation and simulation of novel dynamic routing methods |
| title_full | An investigation and simulation of novel dynamic routing methods |
| title_fullStr | An investigation and simulation of novel dynamic routing methods |
| title_full_unstemmed | An investigation and simulation of novel dynamic routing methods |
| title_short | An investigation and simulation of novel dynamic routing methods |
| title_sort | investigation and simulation of novel dynamic routing methods |
| topic | Routing (Computer network management). Routing protocols (Computer network protocols). |
| url | http://psasir.upm.edu.my/id/eprint/8673/ http://psasir.upm.edu.my/id/eprint/8673/1/FSKTM_2001_17%20IR.pdf |