Packet routing in computer networks provides complex challenges in environments with distrustful routers due to security vulnerabilities or potential malicious behaviors. The literature offers solutions to the problem designed for different types of networks. This paper introduces a novel method to mitigate risks associated with distrustful routers by constructing secure and efficient routing paths in Open Shortest Path First (OSPF) networks. Networks in which routing is carried out based on OSPF protocols are currently the most widespread, hence ensuring the security of data transmission in such networks is urgently needed. In turn, distrustful routers can degrade the overall security and performance of the network, creating vulnerabilities that can be used for malicious purposes. The proposed method is based on the Dijkstra algorithm which is enhanced to identify and mitigate the risk connected with potential distrustful network nodes. Analysis of the proposed method shows its ability to build efficient routes exclusively through trusted routers if such paths exist. As a criterion for effectiveness, a metric such as the channel weight is used. The proposed method is validated using applications across networks of varying topologies and sizes, including large-scale networks. For networks containing post-distrustful routers to which there is no path without distrustful nodes, the proposed method is able to build the shortest paths that are marked as not secure but have a minimum number of distrustful nodes on their path. In scenarios with multiple compromised routers with different locations in the network, the proposed method significantly increases network resilience.
Read full abstract