Performance Evaluation of Proposed Routing Techniques for Internet

Abstract

The objective of this research has two folds:

The first one is to build a general simulation model to evaluate and measure the performance of the computer network algorithms. The second one is to evaluate the performance of a new internet routing algorithm in comparison with another one.

The idea of this algorithm depends mainly on the short time periodic update period for the routing database at closed routers in one area. The routing vector which carries the update information is short. It has only data about each link-state(up/or down) & its current bit rate and the traffic load for each destination. The update period time between border routers in the different areas depends mainly only the traffic load exchange between them. If the load is relatively high we choose short time period update and viceversa, Aperiodic update is done on time if sudden exchange is happened in the link-state or the traffic load not only between closed routers in one area but also between borders ones.

A comprehensive survay for current switching and routing techniques are presented. This survey has covered in brief details circuit switching, packet switching using datagram & virtual circuit, frame relay, and the asynchronous transfer mode with its main features. This is besides the internet routing survey which covered routing types in WAN and its comparison evaluation. Internet routing survey has detailed Routing Information Protocol (RIP), its different versions, flooding as the simplest