DOI QR코드

DOI QR Code

PRIM-MST: AN Algorithm for Designing and Optimizing Local Area Network Planning

  • Received : 2024.10.05
  • Published : 2024.10.30

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

References

  1. Gen, Mitsuo, Runwei Cheng, and Shumuel S. Oren. "Network design techniques using adapted genetic algorithms." Advances in Engineering Software 32.9 (2001): 731-744. 
  2. Zhang, Q., Yang, S., Liu, M., Liu, J., & Jiang, L. (2020). A New Crossover Mechanism for Genetic Algorithms for Steiner Tree Optimization. IEEE Transactions on Cybernetics. 
  3. Hamamoto, A. H., Carvalho, L. F., Sampaio, L. D. H., Abrao, T., & Proenca Jr, M. L. (2018). Network anomaly detection system using genetic algorithm and fuzzy logic. Expert Systems with Applications, 92, 390-402. 
  4. Vecchio, F., Miraglia, F., & Rossini, P. M. (2017). Connectome: Graph theory application in functional brain network architecture. Clinical neurophysiology practice, 2, 206-213. 
  5. Dey, A., Broumi, S., Son, L. H., Bakali, A., Talea, M., & Smarandache, F. (2019). A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs. Granular Computing, 4(1), 63-69.. 
  6. Brindescu, C., Ahmed, I., Jensen, C., & Sarma, A. (2020). An empirical investigation into merge conflicts and their effect on software quality. Empirical Software Engineering, 25(1), 562-590. 
  7. Skiena, S. S. (2020). The algorithm design manual. Springer International Publishing. 
  8. Chauhan, M. S. (2019, February). GPU-based Concurrent Multi-UAVs Path Flow Analysis using K-MST Algorithm. In 2019 1st International Conference on Unmanned Vehicle Systems-Oman (UVS) (pp. 1-5). IEEE. 
  9. Ismagilova, E., Hughes, L., Dwivedi, Y. K., & Raman, K. R. (2019). Smart cities: Advances in research-An information systems perspective. International Journal of Information Management, 47, 88-100. 
  10. Alsuwaiyel, M. H. (2016). Algorithms: design techniques and analysis. World Scientific. 
  11. Cormen, Thomas H. Introduction to algorithms. MIT press, 2009. 
  12. Almotahari, A., & Yazici, A. (2020). Impact of topology and congestion on link criticality rankings in transportation networks. Transportation Research Part D: Transport and Environment, 87, 102529. 
  13. Kaewwit, C., & Chulajata, K. (2017, January). Adoption of a hybrid model to investigate user retention for the cisco packet tracer tool for computer networks. In Proceedings of the 5th International Conference on Information and Education Technology (pp. 135-139). 
  14. Mikroyannidis, A., Gomez-Goiri, A., Smith, A., & Domingue, J. (2017, April). Online experimentation and interactive learning resources for teaching network engineering. In 2017 IEEE Global Engineering Education Conference (EDUCON) (pp. 181-188). IEEE. 
  15. Drori, I., Kharkar, A., Sickinger, W. R., Kates, B., Ma, Q., Ge, S., ... & Udell, M. (2020, December). Learning to solve combinatorial optimization problems on real-world graphs in linear time. In 2020 19th IEEE International Conference on Machine Learning and Applications (ICMLA) (pp. 19-24). IEEE. 
  16. Wang, X. F. (2002). Complex networks: topology, dynamics and synchronization. International journal of bifurcation and chaos, 12(05), 885-916. 
  17. Qaqos, N. N., Zeebaree, S. R., & Hussan, B. K. (2018). Opnet Based Performance Analysis and Comparison Among Different Physical Network Topologies. Academic Journal of Nawroz University, 7(3), 48-54.