Performance Evaluation of A Class of Adaptive Bifurcated Routing Algorithms

Show simple item record Ayad, N. M. en_US
date.accessioned 2009-11-25T13:03:47Z en_US
date.available 2009-11-25T13:03:47Z en_US
date.issued 1988 en_US
identifier.citation Engineering Journal of Qatar University, 1988, Vol. 1, Pages 283-294. en_US
identifier.uri en_US
description.abstract With the cost of computation decreasing, packet-switched computer communication networks are becoming increasingly cost effective. In this paper a class of bifurcated routing algorithms is considered. One of the algorithms uses distributed control and routing decisions based on stochastic measures. The second one is a deterministic routing algorithm that uses localised deterministic routing decisions based on centralised measures. The third algorithm uses "Learning Automata" principle which is a promising technique because of its simplicity and ease of implementation. The three algorithms have been modelled and simulated to evaluate their performance under network conditions. A quantitative investigation of the three algorithms under various traffic conditions has been carried out. The overall average time delay, the average retransmission probability, and the average response time have been taken as a common basis of the comparative study. Regarding these measures, the learning automata has proved to be the best. en_US
language.iso en en_US
publisher Qatar University en_US
subject Computer Hardware & Networks en_US
title Performance Evaluation of A Class of Adaptive Bifurcated Routing Algorithms en_US
type Article en_US
identifier.pagination 283-294 en_US
identifier.volume 1 en_US

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record