Author Login IJIRT Partner Network (IPN) Login

FROM THEORY TO PRACTICE: APPLICATIONS OF KRUSKAL’S ALGORITHM FOR MINIMUM SPANNING TREES

  • Unique Paper ID: 167311
  • Volume: 11
  • Issue: 3
  • PageNo: 925-929
  • Abstract:
  • This study investigates the application of graph theory in computer network management utilizing the Kruskal algorithm. The goal is to enhance resource efficiency, decrease latency, and boost network throughput. The initial step involves modelling a computer network as an undirected weighted graph, where nodes represent network devices and edges symbolize the connections between these devices. The Kruskal algorithm is employed to identify the optimal connections by minimizing resource usage costs. The findings indicate that applying graph theory and the Kruskal algorithm can significantly enhance the performance and reliability of computer networks. The research process includes identifying network components, constructing graphs, sorting edges by weight, and initializing Union-Find data structures to prevent cycles. Testing with both simulated and real-world data confirms that a more resilient and redundant network structure can be created. This study offers new insights into efficient and reliable computer network management, supporting the advancement of future network technologies.
Download article email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 11
  • Issue: 3
  • PageNo: 925-929

FROM THEORY TO PRACTICE: APPLICATIONS OF KRUSKAL’S ALGORITHM FOR MINIMUM SPANNING TREES

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry