A Network Routing Method Using Topologically Dispersed Short Path Set

Abstract

A network routing method using topologically dispersed short path sets, the following processes are performed sequentially: process 1, collecting topology information of the network; process 2, calculating and storing node o to node for each pair of nodes o and d in the network in advance d's topologically dispersed short path set PS o,d , where PS o,d Refers to a collection of one or more paths from node o to node d with shorter length and less topological overlap between each other; process three, for each network data packet Φ to be transmitted, Φ is from its starting node to From the topologically dispersed short paths of the destination node, a path P with the smallest estimated transmission delay is selected as the routing path. The network routing method proposed by the present invention can comprehensively utilize network topology and transmission status information, quickly determine a routing path that can avoid congestion areas in the network as much as possible for network data packets in a computer communication network, and effectively improve the overall transmission performance of the network.

Description

technical field [0001] The invention relates to the fields of network science and computer communication network, in particular to a network routing method using topologically dispersed short path sets. Background technique [0002] Computer communication network is an important infrastructure supporting the modern information society. This type of network transmits network data packets carrying information from an initial node of the network to a destination node by running a certain routing protocol. In the computer communication network, the application of efficient routing methods can ensure that the network has excellent transmission performance, that is, the network is not prone to congestion, and network data packets can quickly reach the destination node. At present, in the existing computer communication network, a large number of mature commercial routing protocol stacks are used, such as OSPF protocol, BGP v4 protocol and so on. An important theoretical basis of ...

AI Technical Summary

Problems solved by technology

For the fixed routing method, the routing path has been calculated in advance, so the routing path can be quickly determined in the transmission stage, but its environmental adaptability is not ideal. If the transmission environment changes, such as the OD demand distribution of traffic flow changes or some nodes fail, etc., They may not be able to guarantee the efficient transmission of the network; for the dynamic routing method, since the routing path is dynamically calculated during the transmission of network data packets, they can determine an efficient routing path according to the transmission environment, but the dynamic calculation of the routing path requires a certain amount of time. Computing resources (including computing time and storage space), which may bring a large transmission delay and operational burden to the system

Images