•  
  •  
 

Corresponding Author

Zedan, I.

Subject Area

Computer and Control Systems Engineering

Article Type

Original Study

Abstract

The goal of routing in a communication network is to direct user traffic from a source to the correct destination in accordance with the network's service requirements. The routing algorithm is used by network to compute the path that would best serve to transport the data from the source to the destination. The routing algorithm should be able to cope with changes in the topology and traffic without requiring all jobs to be aborted in all hosts. The robustness, stability, fairness and optimality are main properties that the routing algorithms should often have. The routing algorithms can be grouped into two major classes: non adaptive and adaptive. The performance of these routing algorithms may be expressed in terms of various criteria. There are many factors that affected the performance of these algorithms as source and destination capabilities, intermediate nodes capabilities and finally network parameters. Because the routing algorithms fiave so much impact on the overall performance of any network, the objective of the present study is to compare between six routing algorithms by evaluating their performance under various circumstances. This is done by developing an efficient estimation function that depends on various network parameters. Developing this function helps network designers to select the appropriate routing algorithm for their networks.

Keywords

Routing algorithm; performance evaluation; Estimated function; Network parameters

Download

Share

COinS