New routing algorithm for communication networks

With the advancement of high reliability, high availability rate and high service quality of communication networks, the existing routing algorithm is hard to meet the requirement and it is necessary to find a new one. In this paper, a fast routing algorithm is proposed. It is suitable for parallel calculation of multi-processor. The logic algebraic calculation rules are applied and the calculations are performed by transforming step by step, integrating or deleting the middle nodes and grouping based on relation. For a network with n nodes, all the routes between two nodes of the network can be obtained through incorporating calculation of n-2 times. The closed loop problem, which disobeys the transmission rule, will not appear. The validity and the feasibility of the algorithm are demonstrated and parallel calculation is illustrated. The calculation procedure is shown in details by an example.