Sažetak
his work addresses the critical challenge of identifying the optimal intrusion path. This path is the most efficient trajectory an attacker traverses from initial entry to sensitive information and has the least resistance. At the core of this methodology is a graph-based cost model where network nodes represent system states or vulnerabilities and edges represent the computational cost required for exploitation. Mathematical determination of the path of least resistance is done by applying Dijkstra’s algorithm. Main contribution of this work is made through the development of a Python simulation prototype. Python was selected as having an extensive library ecosystem, specifically leveraging NetworkX for complex graph manipulations and Matplotlib for the real-time visualization of the pathfinding process. The implementation utilizes a custom class structure to represent network topologies. This allows the tool to simulate how an adversary might move through a network when faced with varying defensive hurdles. The simulation demonstrates the algorithm’s high efficiency, proving that Dijkstra’s approach remains computationally viable even for large network complexity. By visualizing attack paths security architects can prioritize patching efforts on specific nodes, thus significantly hardening system resilience.
Ključne riječi
network security Dijkstra’s algorithm intrusion path optimization vulnerability assessment