A new source route algorithm of communication network

For the source route algorithm of network based on the calculation of the shortest route in graph theory, it is difficult to satisfy the requirement of the network reliability analysis, route centralizing layout and management and network future development because the optimal route of the current network state can be obtained according to the special parameters, but all the route can not be obtained, what´s more, the complex calculation must be performed again when the parameters are changed. In this paper, a new source route algorithm based on logic algebra is studied, which is fit for all kinds of topology network. For a network with n nodes, all the routes between any two nodes expressed through symbols can be obtained after n time matrix transformation. The validity and rationality of the algorithm are discussed and the compatibility and superiority of the algorithm for the classical Dijkstra and Bellman-Floyd algorithm are introduced. The calculating course of the algorithm is illuminated and the correctness is validated through an example