To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
PRIM-MST: AN Algorithm for Designing and Optimizing Local Area Network Planning |
|
Author |
Rana Abu Bakar, Shafiq Hussain, and Saqib Javed |
| Citation |
Vol. 24 No. 10 pp. 97-104 |
|
Abstract |
This paper proposed n approaches to designing local area networks using Prim’s MST Algorithm of an organization. Designing the local area network of an organization is a typical problem faced with how we optimally arrange the networks between computers nodes while faced the imperative of area and installment cost. One of the cost parts that value to be considered is the local network cable price. The shorter the aggregate link length of the network, obviously the installation cost will be less. The MST problem has essential applications in network design which is broadly concentrated in the study of literature. The MST problem shows up in the local area network design where computers and other nodes connect them and must be picked most gainfully. The application of Prim’s algorithms is shown to the outline design of local area networks in an organization. This Prim’s algorithm works by picking the shortest path beginning from the first node until all nodes in the graph are linked. The following research is planned to design a prims algorithm to solve local area network design problems. Our research is analyzed, and intriguing results are gotten. The outcomes got to justify the need to apply this sort of algorithm for benefit and efficiency. |
|
Keywords |
MST, LAN, Graph, Minimum cost, network, Prim’s, Algorithm. |
|
URL |
