Reducing cost and traffic congestion for a proposed computer network design using the minimum spanning tree (MST) and the shortest path (SP) algorithms.
| dc.contributor.author | Yeboah, Mavis Serwaa | |
| dc.date.accessioned | 2016-10-24T18:11:47Z | |
| dc.date.accessioned | 2023-04-19T13:26:16Z | |
| dc.date.available | 2016-10-24T18:11:47Z | |
| dc.date.available | 2023-04-19T13:26:16Z | |
| dc.date.issued | 2016-10-24 | |
| dc.description | A thesis submitted to the Department of Institute of Distance Learning, Kwame Nkrumah University of Science and Technology, in partial fulfillment of the requirement for award of degree of Master of Science in Information Technology Department of Computer Science. | en_US |
| dc.description.abstract | Usually network design phase is done before laying the infrastructure hence it is very important that the design achieves optimality and reliability. This paper proposes a methodology for reusing optimization technique such as shortest path (SP) and minimum spanning tree (MST) for network design. Analyzing networks through the product of engineering designs. The results obtained shows that graph theory can significantly improve productivity as well as quality of network design. | en_US |
| dc.description.sponsorship | KNUST | en_US |
| dc.identifier.uri | https://ir.knust.edu.gh/handle/123456789/9377 | |
| dc.language.iso | en | en_US |
| dc.subject | Node | en_US |
| dc.subject | link | en_US |
| dc.subject | weight | en_US |
| dc.subject | network | en_US |
| dc.title | Reducing cost and traffic congestion for a proposed computer network design using the minimum spanning tree (MST) and the shortest path (SP) algorithms. | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- KNUST Library.pdf
- Size:
- 6.65 KB
- Format:
- Adobe Portable Document Format
- Description: