Performance Evaluation of Routing Algorithms

Based on various Network Topologies

Abstract

As Network technologies and practices are

constantly evolving, the past few years have seen a remarkable

growth in global network infrastructure. Routing refers to the process

of discovering, selecting and employing paths from one place to

another in a Network. So it plays a vital role in Networking and is

done using routing algorithms. The aim of the Routing Simulator is

to find out the best algorithm for a given set of Network

configurations.

A model of a subnet is generated and experiments are

done employing different routing algorithms. The statistics obtained for

different routing algorithms are analyzed and an algorithm is chosen

that gives the shortest or the optimal path. The optimal path so as to

minimize the number of hops and reduce the cost incurred for routing

process.

Algorithms Used:

 Flooding

 Hot-Potato

 Source Routing

 Distance Vector (Bellman-Ford)

 RIP (Routing Information Protocol)

 Linkstate

Problem Definition

For sending information from one network to other

network through a subnet efficiently, one has to select a better

routing technique among the several techniques available. So far

no routing Algorithm is reported to be outright choice for all

possible cases. So an attempt is made to provide such a routing

technique which provides better results for a given configuration

of the subnet in real time.

 The main objective of our project is to maximize the

efficiency of the routing process by suggesting the potential user

a better algorithm.

Objectives of the System

The proposed Routing Simulator has the following objectives:

1. The topology of the subnet should be displayed with routers

designated with computer images and links with lines.

2. The congestion table should be printed showing the congestion on

various links.

3. Various Statistics for the router like efficiency, average packet size

are to be displayed when required.

4. Statistics for the link like propagation delay, buffers filled are to be

displayed when congestion table is clicked.

5. A provision for router crash is required which should show an

outline when a router is crashed.

6. When a link is down, it should be highlighted. This gives an idea of

how the routing goes when a link is down.

7. The statistics for the router and the link are to be calculated for

every 500 m sec.

8. A provision for redrawing the congestion table and network is to be

provided.

9. The routing should be controlled by a speed controller.

Tools: Java

Platform: Win 2k/XP