A computerised algorithm to optimise large, heterogeneous internets
Date
2016-08-19
Authors
Brandl, Marcus
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
he spanning Tree Algorithm is considered to be one of the best
algorithm for loop resolution in bridge internets, but it does
nonethe1ess have its limitations. Bridges Only have a local
perspective of the internet which limits their effectiveness in
setting up an optimal spanning Tree. A computerised algorithm has
been devised and implemented to view the internet on a global
scale. It is demonstrated to a bad Spanning Tree configuration
can result in increased delay and poor fault tolerance. The
program provides valuable information to aid the network designer and administrator to set up and adjust the network to run at its
maximum potential. Problems which can arise when a bridged
internet is left to configure itself are also highlighted
Description
A dissertation submitted to the Faculty of Engineering,
University of the Witwatersrand, Johannesburg, in the fulfilment of
the requirements for the degree of Master of science in
Engineering
Johannesburg, 1994.