Prims Algorithm and its Application in the Design of University LAN Networks

Abstract

The problem deliberated is that of networking a given set of network nodes with shortest possible cables of direct links. Simple practical procedures have been given for solving this problem. The techniques given are based on prims algorithms. Problem statement – Given a set of University buildings, connect them by a fibre network cables of direct terminal-to- terminal links having the smallest possible total length (total sum of cable lengths). A set of buildings are connected, if and only if there is an unbroken chain of fibre links between every two buildings in the set. The purpose of the study was to investigate the effectiveness of PRIMs algorithm in the design of University LAN networks and to establish the effect of prims algorithm in the design of a Campus Network at Chuka University.