Page 10 - SPM FINAL

BUSINESS CASE

DATE 30/12/2019
RA1811003020013 Ritesh Singh
SUBMITTED BY RA1811003020034 Shubham Nandi
RA1811003020032 Yash Bhatt
TITLE / ROLE Network Helper Using Kruskal’s & Dijkstra’s Algo
nWh

THE PROJECT

 Cheapest way to fix network issues.
 Shortest path between two nodes.
 Nodes reachable from a particular node.
 Disjoint -set view of a network.

THE HISTORY

 Low level of encryption.
 Speed of execution is slow.
 Highly dependent on human inputs.
 Improper inputs leads to less accurate results.
 End-to-End encryption is weak or not available.

LIMITATIONS

 Optimization of space complexity is reduced due to the formation of minimum spanning tree.
 Open source support is not available.
 Only support Windows/Linux & Mac.
 Execution Speed get reduced when race condition is encountered.

APPROACH

 Initial setup with admin credentials.
 Admin allocates different users with different roles.
 Network is analyzed using Kruskal’s algorithm.
 Forming disjoint set for different nodes.
 Determining shortest and cheapest route to connect a node.

BENEFITS
In bullet points, list the benefits that this project will bring to the organization.

 Helps in finding the cheapest way.
 Helps in saving the human resource.
 Higher accuracy then humans.
 Higher speed of execution helps in saving time.
 MD5 & ACT encryption to ensure military grade security.