A computerised algorithm to optimise large, heterogeneous internets
| dc.contributor.author | Brandl, Marcus | |
| dc.date.accessioned | 2016-08-19T09:15:53Z | |
| dc.date.available | 2016-08-19T09:15:53Z | |
| dc.date.issued | 2016-08-19 | |
| dc.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. | en_ZA |
| dc.description.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 | en_ZA |
| dc.identifier.uri | http://hdl.handle.net/10539/20914 | |
| dc.language.iso | en | en_ZA |
| dc.title | A computerised algorithm to optimise large, heterogeneous internets | en_ZA |
| dc.type | Thesis | en_ZA |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Brandi Marcus._A computerised algorithm to optimis.pdf
- Size:
- 3.08 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: