Intra-domain dynamic multipath generating method based on generating tree

Abstract

The invention discloses an intra-domain dynamic multipath generating method based on a generating tree. The method comprises the following steps: adding root nodes into a created priority queue according to a priority structure; judging whether the priority queue is empty or not, if not, selecting a first queue element of the priority queue, and deleting the first queue element; accessing all neighbor nodes of the first queue element, judging whether each node is accessed or not, if not, updating node information, adding updated information into the priority queue, otherwise, calculating a next hop from the root nodes to the first queue element and a next hop from the root nodes to a current neighbor node according to a set rule; after all neighbor nodes are accessed, returning to the step for judging whether the priority queue is empty or not. When a chain state changes, a generated shortest path tree is adjusted dynamically, and a next hop is updated without recalculation. According to the method, a plurality of loop-free paths are calculated from the root nodes to all destination nodes; meanwhile, the complexity of an algorithm is lowered.

Description

technical field [0001] The invention belongs to the technical field of the Internet, and in particular relates to an intra-domain routing algorithm, in particular to a spanning tree-based intra-domain dynamic multi-path generation method. Background technique [0002] The Internet is composed of tens of thousands of autonomous systems AS (Autonomous System) that are independently operated and maintained. [0003] Intra-domain link-state routing protocols (OSPF and ISIS) control the packet forwarding path inside the AS, but OSPF and ISIS protocols do not make good use of the inherent path diversity in the network, and can only calculate from node c to node d Therefore, the reliability and security of the network are relatively poor. However, the multipath routing algorithm makes good use of the diversity of paths in the network, and can calculate multiple paths from node c to node d, so it is easy to achieve load balancing. [0004] Many solutions for multipath routing have...

AI Technical Summary

Problems solved by technology

There are two ways to get the minimum cost from all neighbor nodes of node c to node d. The first method is to construct an SPT with the neighbor node as the root on node c, but this method increases the complexity of the algorithm. complexity, another method is that the neighbor node transmits the calculated minimum cost to node d to node c, and this method increases the communication overhead

Recently, the IETF proposed Multi-topology routing. This method is characterized by pre-assuming that some links fail, and calculating the shortest path in the network topology diagram where the failed links are removed. This method also needs to calculate multiple SPTs on one node. Therefore, the time complexity of the algorithm is relatively high

Images