Cost-effective paths : using kruskal's algorithm to find optimal ethernet cable routes

Date

6-2024

Academic Strand

Science, Technology, Engineering, and Mathematics (STEM) Strand

Adviser

John Cedric C. Gaza

Principal

Buela, Mabel S.

Abstract

Inefficient Ethernet installation could lead to a significant increase in costs in the overall spending of the building when only considering one factor (length). To use Kruskal's algorithm to create a Minimum Spanning Tree (MST) to find the minimum overall costs to connect the routers. This study shows a formula that considers different factors that would be considered when installing new Ethernet cables in a building. The study however does not consider the following factors: Maintenance costs, quality of cables, and cost of other equipment (switches, routers). This solution could potentially aid cable installers and companies in deciding which factors could be considered important.

Language

English

LC Subject

Capstone

Location

UP Rural High School

Document Type

Capstone

This document is currently not available here.

Share

COinS