A shortest path selection mechanism based on static network path switching

In response to the technical requirements for redundant switching of static network paths in special backgrounds, this paper aims to solve the problems of inadequate path selection and inability to achieve expected communication in a timely manner after switching. Research on the technology of static network priority shortest path in redundant Ethernet multi link switching applications. Modeled the problem of selecting the optimal path for static redundant Ethernet and designed a parallel computing path method based on computational neural networks. Completed the process solution based on FNN (feedforward neural network) and calculated and statistically analyzed the time performance of the algorithm. Subsequently, based on the network topology dataset collected from special industry applications, comparative validation with similar algorithms was completed, and the data confirmed the good performance of the FNN algorithm.