A multipath routing method and electronic device based on time-spread graph maximum flow

Abstract

This invention provides a multipath routing method and electronic device based on maximum flow in a time-spread graph, belonging to the technical field of communication. In this method, the maximum flow algorithm is used to search for all augmenting paths. Subsequent routing methods inherently select paths capable of transmitting larger volumes of data. Furthermore, when calculating the quality of service (QoS) assessment value of each target augmenting path, the service type of the data to be transmitted is considered. Then, based on the QoS assessment value of each target augmenting path, the next network node for the data to be transmitted is determined. This achieves personalized load balancing routing for different service requirements of the data, ensuring that data transmission has the minimum path latency, the maximum remaining path bandwidth, or the minimum path packet loss rate, based on the service type of the data to be transmitted.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a multipath routing method and electronic device based on the maximum flow of a time-spread graph. Background Technology

[0002] Space information networks are integrated networks comprised of satellite networks, near-space vehicles, aviation networks, and ground communication facilities. Their application scenarios and communication tasks are rapidly increasing due to the growing number of space missions in various countries and the ever-growing demand for users and data globally. This necessitates that space information networks provide greater communication speeds and capacities. However, the limited resources, time-varying network topology, and link transmission latency of space information networks constrain their capacity and throughput growth. Therefore, improving the communication capacity and throughput of space information networks has become one of the main research topics related to space information networks.

[0003] Routing algorithms, as an optimization technique, can significantly improve communication capacity and throughput. Their core lies in altering network capacity allocation by changing the forwarding priorities of nodes. Below are some commonly used optimization ideas for routing algorithms:

[0004] Dynamic routing algorithms: select routes based on the real-time status of the network (such as node location, link status, network load, etc.) to improve network efficiency and adaptability;

[0005] Multi-path routing algorithms: By using multiple paths simultaneously to distribute the load, they improve the network's fault tolerance and throughput.

[0006] Delay-Tolerant Network (DTN) Routing Algorithm: To address the potential long delays and intermittent connectivity issues in spatial information networks, the DTN routing algorithm uses a store-and-forward mechanism to ensure that data is eventually transmitted to its destination.

[0007] Machine Learning-Driven Routing Algorithms: With the development of machine learning technology, more and more research is applying machine learning to routing algorithms to achieve more efficient route selection and network optimization. These algorithms can learn from historical data and network conditions to predict future network changes and make corresponding optimization decisions.

[0008] By selecting appropriate routing algorithms and optimization strategies, spatial information networks can significantly improve communication capacity and throughput in environments with limited resources and complex conditions.

[0009] Spatial information networks are delay-tolerant networks. Graph-based routing algorithms suitable for this characteristic include contact graph routing, time-aggregated graph routing, and time-spreading graph routing. Different routing methods have different ultimate optimization objectives, leading to significant differences among various routing algorithms.

[0010] How to perform personalized load balancing routing for different business needs of data has become an urgent technical problem to be solved. Summary of the Invention

[0011] In view of this, the purpose of the present invention is to provide a multipath routing method and electronic device based on time-spread graph maximum flow, so as to alleviate the technical problem that traditional technologies cannot perform personalized load balancing routing for different business needs of data.

[0012] In view of this, the purpose of this invention is to provide a multipath routing method based on the maximum flow of a time-spread graph, comprising:

[0013] The time spread graph of the dynamic spatial information network is obtained, and the maximum flow algorithm is used to perform augmenting path search on the time spread graph to obtain the augmenting path that maximizes the traffic of the dynamic spatial information network.

[0014] The service quality assessment method is determined based on the service type of the data to be transmitted, and the service quality assessment method is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, so as to obtain the service quality assessment value of each target augmentation path.

[0015] Based on the quality of service (QoS) assessment value of each target augmentation path, the data to be transmitted is transmitted from the target network node in the current time slice to the next network node corresponding to each target augmentation path, wherein the next network node is a network node that has a connection relationship with the target network node;

[0016] The next network node is taken as the target network node, and the process returns to the step of determining the quality of service assessment method based on the service type of the data to be transmitted, until the current time slice is the last time slice, so as to obtain the target route of the data to be transmitted.

[0017] Furthermore, a service quality assessment method is determined based on the service type of the data to be transmitted, and the service quality assessment method is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, including:

[0018] Place the target network node containing the data to be transmitted in the current time slice into the routing node queue;

[0019] Determine whether the routing node queue is empty;

[0020] If the routing node queue is not empty, then weight data is determined according to the service type of the data to be transmitted, and the service quality assessment method is determined according to the weight data.

[0021] The service quality assessment method is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, and the service quality assessment value of each target augmentation path is obtained.

[0022] Furthermore, the method also includes:

[0023] If the routing node queue is empty, then determine whether the current time slice is the last time slice;

[0024] If the current time slice is the last time slice, then the forwarding decision of the data to be transmitted is taken as the target route of the data to be transmitted.

[0025] If the current time slice is not the last time slice, then increment the current time slice by one, and return to the step of placing the target network node containing the data to be transmitted in the current time slice into the routing node queue.

[0026] Furthermore, the service quality assessment method described above is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, including:

[0027] According to the service quality assessment method Calculate the quality of service (QoS) evaluation value for each of the target augmentation paths, where, This represents the quality of service (QoS) assessment value of the target augmenting path. This represents the augmenting path from source node S to sink node D. Let S represent the set of augmenting paths from source node S to sink node D. This represents the communication link between network node i and network node j. This indicates the latency of the communication link. This indicates the remaining bandwidth of the communication link. This indicates the packet loss rate of the communication link. This represents the maximum path delay in the augmented path set. This represents the minimum remaining bandwidth of the path in the augmented path set. This represents the maximum packet loss rate of the path in the augmented path set. This refers to the weight data in the service quality assessment method.

[0028] Furthermore, based on the quality of service (QoS) assessment value of each target augmentation path, the data to be transmitted is transferred from the target network node in the current time slice to the next network node corresponding to each target augmentation path, including:

[0029] The traffic ratio of each target augmentation path is determined based on the quality of service assessment value of each target augmentation path;

[0030] The data to be transmitted is segmented according to the traffic ratio of each target augmentation path, and the segmented sub-data to be transmitted is transmitted from the target network node of the current time slice to the next network node corresponding to each target augmentation path.

[0031] Remove the target network node from the routing node queue, place the next network node as the target network node in the routing node queue, and return to the step of determining whether the routing node queue is empty.

[0032] Furthermore, the service types of the data to be transmitted include: latency-sensitive type, bandwidth-sensitive type, and packet loss rate-sensitive type.

[0033] Secondly, embodiments of the present invention also provide a multipath routing device based on the maximum flow of a time-spread graph, comprising:

[0034] An augmenting path search unit is used to obtain the time spread graph of a dynamic spatial information network and to perform augmenting path search on the time spread graph using the maximum flow algorithm to obtain the augmenting path that maximizes the traffic of the dynamic spatial information network.

[0035] The service quality assessment unit is used to determine the service quality assessment method based on the service type of the data to be transmitted, and to use the service quality assessment method to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, so as to obtain the service quality assessment value of each target augmentation path.

[0036] A transmission unit is configured to transmit the data to be transmitted from the target network node in the current time slice to the next network node corresponding to each target augmentation path based on the quality of service assessment value of each target augmentation path, wherein the next network node is a network node that has a connection relationship with the target network node.

[0037] The execution unit is used to select the next network node as the target network node and return to execute the step of determining the quality of service assessment method based on the service type of the data to be transmitted until the current time slice is the last time slice, so as to obtain the target route of the data to be transmitted.

[0038] Furthermore, the service quality assessment unit is also used for:

[0039] Place the target network node containing the data to be transmitted in the current time slice into the routing node queue;

[0040] Determine whether the routing node queue is empty;

[0041] If the routing node queue is not empty, then weight data is determined according to the service type of the data to be transmitted, and the service quality assessment method is determined according to the weight data.

[0042] The service quality assessment method is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, and the service quality assessment value of each target augmentation path is obtained.

[0043] Thirdly, embodiments of the present invention also provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the method described in any of the first aspects above.

[0044] Fourthly, embodiments of the present invention also provide a computer-readable storage medium storing machine-executable instructions, which, when invoked and executed by a processor, cause the processor to perform the method described in any of the first aspects above.

[0045] In this embodiment of the invention, a multipath routing method based on maximum flow in a time-spread graph is provided, comprising: obtaining a time-spread graph of a dynamic spatial information network, and performing augmented path search on the time-spread graph using a maximum flow algorithm to obtain augmented paths that maximize the traffic of the dynamic spatial information network; determining a quality of service (QoS) assessment method based on the service type of the data to be transmitted, and using the QoS assessment method to perform QoS assessment on the target augmented paths to which the target network node of the data to be transmitted belongs in the current time slice, obtaining QoS assessment values ​​for each target augmented path; transmitting the data to be transmitted from the target network node in the current time slice to the next network node corresponding to each target augmented path according to the QoS assessment values ​​of each target augmented path, wherein the next network node is a network node that has a connection relationship with the target network node; taking the next network node as the target network node, returning to execute the step of determining the QoS assessment method based on the service type of the data to be transmitted, until the current time slice is the last time slice, to obtain the target route of the data to be transmitted. As described above, the multipath routing method based on maximum flow in the time-spreading graph of the present invention uses the maximum flow algorithm to search for all augmenting paths. The subsequent routing method's path selection inherently allows for the transmission of larger volumes of traffic. Furthermore, when calculating the quality of service (QoS) evaluation value of each target augmenting path, the service type of the data to be transmitted is considered. Then, the next network node for the data to be transmitted is determined based on the QoS evaluation value of each target augmenting path. This achieves personalized load balancing routing for different service requirements of the data. Based on the service type of the data to be transmitted, the data transmission achieves the minimum path latency, or the maximum remaining path bandwidth, or the minimum path packet loss rate, thus alleviating the technical problem that traditional technologies cannot perform personalized load balancing routing for different service requirements of the data. Attached Figure Description

[0046] To more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the specific embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0047] Figure 1 A flowchart of a multipath routing method based on maximum flow in a time-spread graph, provided in an embodiment of the present invention;

[0048] Figure 2 A flowchart of another multipath routing method based on maximum flow in a time-spread graph provided in an embodiment of the present invention;

[0049] Figure 3A schematic diagram of a multipath routing device based on time spread graph maximum flow provided in an embodiment of the present invention;

[0050] Figure 4 This is a schematic diagram of an electronic device provided in an embodiment of the present invention. Detailed Implementation

[0051] The technical solution of the present invention will be clearly and completely described below with reference to the embodiments. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0052] Traditional technologies cannot provide personalized load balancing routing for different business needs of data.

[0053] Based on this, the multipath routing method based on maximum flow in the time-spreading graph of the present invention uses the maximum flow algorithm to search for all augmenting paths. The path selection of the subsequent routing method is inherently capable of transmitting a large amount of traffic. In addition, when calculating the service quality assessment value of each target augmenting path, the service type of the data to be transmitted is considered. Then, the next network node of the data to be transmitted is determined according to the service quality assessment value of each target augmenting path. That is, personalized load balancing routing is realized for different service requirements of the data. According to the service type of the data to be transmitted, the data transmission has the minimum path delay, or the maximum remaining path bandwidth, or the minimum path packet loss rate.

[0054] To facilitate understanding of this embodiment, a multipath routing method based on maximum flow in a time-spread graph, as disclosed in this embodiment of the invention, will first be described in detail.

[0055] Example 1:

[0056] According to an embodiment of the present invention, an embodiment of a multipath routing method based on the maximum flow of a time-spread graph is provided. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.

[0057] Figure 1 This is a flowchart of a multipath routing method based on the maximum flow of a time-spread graph according to an embodiment of the present invention, such as... Figure 1 As shown, the method includes the following steps:

[0058] Step S102: Obtain the time spread graph of the dynamic spatial information network, and use the maximum flow algorithm to perform augmenting path search on the time spread graph to obtain the augmenting path that maximizes the traffic of the dynamic spatial information network.

[0059] In this embodiment of the invention, a maximum flow routing algorithm is designed based on different service requirements (which can be broadly categorized into three types: latency-sensitive, bandwidth-sensitive, and packet loss-sensitive). That is, after obtaining the several augmentation paths with the highest transmission traffic, the characteristics of different services need to be considered to select a suitable path. Otherwise, if this invention relies solely on the condition of maximum traffic transmission for path priority selection, data may quickly occupy the bandwidth of the augmentation path with the largest capacity, leading to congestion on that augmentation path and consequently increasing network latency and packet loss rate.

[0060] Since dynamic spatial information networks are fully predictable networks, this invention employs multi-path routing, prioritizing different service requirements and maximizing transmission traffic as a secondary objective. A multi-path routing method is designed to achieve the minimum path latency, maximum path residual bandwidth, and minimum path packet loss rate for data transmission.

[0061] The basic process of multi-path routing is described below:

[0062] 1) Path discovery: Using a certain algorithm, discover all possible augmenting paths from the source node to the sink node;

[0063] 2) Path evaluation: Evaluate and score each augmentation path according to the predetermined optimization strategy;

[0064] 3) Path selection: Based on the evaluation results, select one or more optimal augmentation paths for data transmission.

[0065] The differences between various multipath routing algorithms are mainly reflected in path evaluation. Different factors are considered, resulting in different evaluation scores for different algorithms, which ultimately changes the routing strategy.

[0066] In other words, the optimization objective of a routing algorithm has a significant impact on its success. Traditional routing algorithms have varying optimization objectives, but none prioritize different service requirements while maximizing transmission traffic as a secondary objective. Furthermore, different routing algorithms are based on different fundamentals; none are grounded in the maximum flow algorithm described in this invention. Therefore, traditional routing algorithms cannot meet the needs of latency-sensitive, bandwidth-sensitive, and packet loss-sensitive services. Thus, this invention proposes a new routing algorithm based on the maximum flow algorithm described in this invention.

[0067] The routing algorithm proposed in this invention is designed for fully predictable dynamic spatial information networks, including knowledge of the edge capacity, data transmission service type, and data transmission size of the network (i.e., the dynamic spatial information network) at every moment. Therefore, a routing algorithm is proposed to ensure that data transmission meets service requirements as much as possible. Like all multi-path routing methods, this invention also consists of three steps.

[0068] Path Discovery: The optimization approach employed in this invention is to first apply the maximum flow algorithm to the network, which will yield all augmenting paths that maximize network traffic. In this invention, augmenting paths derived from the maximum flow algorithm are used as possible paths because these paths inherently possess the advantage of "high traffic," allowing selection from these augmenting paths without considering traffic volume. The specific maximum flow algorithm used is not crucial to this invention. The source and sink nodes in the maximum flow algorithm are the same as the source and sink nodes of the data to be transmitted, regardless of whether they are identical.

[0069] Step S104: Determine the service quality assessment method based on the service type of the data to be transmitted, and use the service quality assessment method to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, so as to obtain the service quality assessment value of each target augmentation path.

[0070] Specifically, path evaluation involves considering the forwarding methods of each target network node. These augmenting paths are treated as all possible paths. Then, based on the different data transmission metrics required by the service type, the weights of the optimization objective function (latency, remaining bandwidth, and packet loss rate) are adjusted (i.e., the service quality evaluation method is determined based on the service type of the data to be transmitted). The service quality evaluation method is then used to select the most suitable transmission path for the data to be transmitted from the augmenting paths found through maximum flow search. This is then used as the routing method. This step is the core of this invention and the multi-path routing algorithm.

[0071] Specifically, the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice is determined by first identifying the target network node of the data to be transmitted in the current time slice, and then determining the target augmentation path to which the target network node belongs.

[0072] Step S106: Based on the quality of service assessment value of each target augmentation path, the data to be transmitted is transmitted from the target network node of the current time slice to the next network node corresponding to each target augmentation path, wherein the next network node is a network node that has a connection relationship with the target network node.

[0073] Specifically, path selection: After the quality of service (QoS) assessment values ​​of each target augmenting path are calculated, selecting a target augmenting path is a dynamic process. Dynamic networks change rapidly and are highly dynamic, so it is necessary to constantly calculate the QoS assessment values ​​of each target augmenting path. For each target network node, it is necessary to constantly calculate the QoS assessment values ​​of each target augmenting path to determine the forwarding direction of its data.

[0074] Step S108: Take the next network node as the target network node, return to the step of executing the service quality assessment method based on the service type of the data to be transmitted, until the current time slice is the last time slice, and obtain the target route of the data to be transmitted.

[0075] In this embodiment of the invention, a multipath routing method based on maximum flow in a time-spread graph is provided, comprising: obtaining a time-spread graph of a dynamic spatial information network, and performing augmented path search on the time-spread graph using a maximum flow algorithm to obtain augmented paths that maximize the traffic of the dynamic spatial information network; determining a quality of service (QoS) assessment method based on the service type of the data to be transmitted, and using the QoS assessment method to perform QoS assessment on the target augmented paths to which the target network node of the data to be transmitted belongs in the current time slice, obtaining QoS assessment values ​​for each target augmented path; transmitting the data to be transmitted from the target network node in the current time slice to the next network node corresponding to each target augmented path according to the QoS assessment values ​​of each target augmented path, wherein the next network node is a network node that has a connection relationship with the target network node; taking the next network node as the target network node, returning to execute the step of determining the QoS assessment method based on the service type of the data to be transmitted, until the current time slice is the last time slice, to obtain the target route of the data to be transmitted. As described above, the multipath routing method based on maximum flow in the time-spreading graph of the present invention uses the maximum flow algorithm to search for all augmenting paths. The subsequent routing method's path selection inherently allows for the transmission of larger volumes of traffic. Furthermore, when calculating the quality of service (QoS) evaluation value of each target augmenting path, the service type of the data to be transmitted is considered. Then, the next network node for the data to be transmitted is determined based on the QoS evaluation value of each target augmenting path. This achieves personalized load balancing routing for different service requirements of the data. Based on the service type of the data to be transmitted, the data transmission achieves the minimum path latency, or the maximum remaining path bandwidth, or the minimum path packet loss rate, thus alleviating the technical problem that traditional technologies cannot perform personalized load balancing routing for different service requirements of the data.

[0076] In an optional embodiment of the present invention, a service quality assessment method is determined based on the service type of the data to be transmitted, and the service quality assessment method is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice. Specifically, the method includes the following steps:

[0077] (1) Place the target network node with data to be transmitted in the current time slice into the routing node queue;

[0078] (2) Determine if the routing node queue is empty;

[0079] (3) If the routing node queue is not empty, the weight data is determined according to the service type of the data to be transmitted, and the service quality assessment method is determined according to the weight data;

[0080] (4) Use the service quality assessment method to assess the service quality of the target augmentation path to which the target network node to which the data to be transmitted belongs in the current time slice, and obtain the service quality assessment value of each target augmentation path.

[0081] Specifically, according to service quality assessment methods Calculate the service quality assessment value for each objective augmentation path, where, This represents the service quality assessment value of the target augmentation path. This represents the augmenting path from source node S to sink node D obtained using the time-spreading graph maximum flow algorithm. Let S represent the set of augmenting paths from source node S to sink node D. This represents the communication link between network node i and network node j (if the target network node of the data to be transmitted in the current time slice is A, and there are 3 target augmentation paths through A, and these 3 target augmentation paths reach BCD respectively after passing through A, then network node i and network node j here refer to AB, AC and AD respectively). Indicates the latency of the communication link. Indicates the remaining bandwidth of the communication link. This indicates the packet loss rate of the communication link. This represents the maximum path delay in the augmented path set. This represents the minimum remaining bandwidth of the path in the augmenting path set. This represents the maximum packet loss rate of the path in the augmented path set. This represents the weighting data, specifically the weights assigned to the three metrics—latency, remaining bandwidth, and packet loss rate—in calculating the service quality assessment value. The values ​​of each parameter in the above formula can be obtained or calculated.

[0082] Path delay includes: transmission delay between spatial information network nodes, queuing delay of network nodes, and buffering delay of network nodes, which can be represented by the following formula: .

[0083] Packet loss rate represents the proportion of data packets lost out of the total amount of data transmitted per unit time in a communication link, and can be expressed by the following formula: .

[0084] This means that the final delay calculation will select the augmenting path with the largest delay from multiple augmenting paths, and the delay of each augmenting path is equal to the sum of the delays of its individual segments. and The meaning is similar, and will not be elaborated here.

[0085] This approach comprehensively considers the latency, remaining bandwidth, and packet loss rate of the target augmentation path, thereby matching it with three service types: latency-sensitive, bandwidth-sensitive, and packet loss-sensitive. This service quality assessment method can also be referred to as the joint optimization objective function of load balancing.

[0086] (5) If the routing node queue is empty, determine whether the current time slice is the last time slice;

[0087] (6) If the current time slice is the last time slice, then the forwarding decision of the data to be transmitted is used as the target route of the data to be transmitted;

[0088] Specifically, the aforementioned forwarding decision is the routing result obtained by transmitting the data to be transmitted from the target network node in the current time slice to the next network node corresponding to each target augmentation path based on the service quality assessment value of each target augmentation path.

[0089] (7) If the current time slice is not the last time slice, increment the current time slice by one and return to the step of placing the target network node with the data to be transmitted in the current time slice into the routing node queue.

[0090] In an optional embodiment of the present invention, the data to be transmitted is transferred from the target network node of the current time slice to the next network node corresponding to each target augmentation path according to the quality of service assessment value of each target augmentation path, specifically including the following steps:

[0091] (1) Determine the traffic ratio of each target augmentation path based on the service quality assessment value of each target augmentation path;

[0092] (2) Divide the data to be transmitted according to the traffic ratio of each target augmentation path, and transmit the divided sub-data to be transmitted from the target network node of the current time slice to the next network node corresponding to each target augmentation path;

[0093] Specifically, for example, if the traffic ratio of the three target augmentation paths is 5:3:2, and the data to be transmitted is 100 Mbps, then the data to be transmitted is divided into 50 Mbps, 30 Mbps, and 20 Mbps sub-data. The 50 Mbps sub-data is transmitted to the next network node of the target network node in the current time slice of the target augmentation path corresponding to the traffic ratio of 5; the 30 Mbps sub-data is transmitted to the next network node of the target network node in the current time slice of the target augmentation path corresponding to the traffic ratio of 3; and the 20 Mbps sub-data is transmitted to the next network node of the target network node in the current time slice of the target augmentation path corresponding to the traffic ratio of 2.

[0094] (3) Remove the target network node from the routing node queue, place the next network node as the target network node in the routing node queue, and return to the step of determining whether the routing node queue is empty.

[0095] Specifically, the next network node includes: a network node in the current time slice that is different from the target network node but has a connection relationship with the target network node, and / or a network node in the next time slice of the current time slice that is the same as the target network node (this case is actually caching, that is, caching is also a form of forwarding).

[0096] To facilitate a better understanding of the process of this invention, the method of this invention will be described again below, with reference to... Figure 2 :

[0097] Input: Time period Network topology time spread graph ,in, This represents the set of network nodes (i.e., the set of vertices). This represents the set of forward edge capacities (i.e., the connections between network nodes in the same time slice in the subsequent time expansion graph). This represents the set of forward cache edge capacities (i.e., the connections between the same network nodes in different time slices in the subsequent time expansion graph). Indicates a time period. Represents the set of reverse edge capacities. This indicates the size of the reverse cache capacity set, service type, source node, time slice, and service data (data to be transmitted).

[0098] Problem: Determine the data size forwarded by each network node after receiving data in each time slice of the time spread graph.

[0099] Step 0: Initialize the routing methods of all network nodes (i.e., initialize the service quality assessment value to 0), divide the network into time slices, and construct a time spread graph. The time spread graph consists of M time slices.

[0100] Step 1: (Path Discovery) Use the maximum flow algorithm on the dynamic network (time-extended graph of dynamic spatial information network) to obtain the augmenting path that can reach the maximum flow. Traverse each node (i.e. network node) on the augmenting path to obtain the set of selectable paths for each node in different time slices. Set the current time slice m to 1.

[0101] 1.1 Enqueue all network nodes with services (i.e., data to be transmitted) in the current time slice (i.e., the routing node queue). Check if the queue is empty. If yes: Check if the current time slice is equal to the last time slice: If yes: Go to Step 4; If no: Increment the current time slice m by 1, go to 1.1; If no (i.e., the queue is not empty): Go to Step 2.

[0102] Step 2: (Path Evaluation) When data arrives, for each network node, first determine the service type of the arriving data, and decide the weight of the joint optimization objective function of load balancing (i.e., the service quality evaluation method) above (if it is a latency-sensitive type, then the weight corresponding to latency is greater; if it is a bandwidth-sensitive type, then the weight corresponding to bandwidth is greater; users can adjust the weight as needed). Then, calculate the joint optimization objective function of load balancing for each augmentation path passing through this network node in the current time slice, and obtain the service quality evaluation value of each augmentation path.

[0103] Step 3: (Path Selection) Based on the routing calculation results from Step 2 (i.e., the service quality assessment values ​​of each augmenting path), the data is forwarded out according to the augmenting path, and the network status is updated, using the magnitude of the calculation results obtained from the joint optimization function as the weight (i.e., the routing ratio is divided according to the magnitude of the calculation results).

[0104] 3.1 Determine if there are any forwarded or cached objects (network node objects). If yes, dequeue the current node (network node) and enqueue the forwarded or cached nodes, then proceed to 1.1.

[0105] Step 4: Use the business forwarding / caching method as the route, and the routing algorithm ends.

[0106] This invention provides key protection for:

[0107] The joint optimization objective function for load balancing. Traditional routing algorithms are not designed to meet the optimization requirements of three types of services: latency-sensitive, bandwidth-sensitive, and packet loss-sensitive, nor are they based on the maximum flow algorithm.

[0108] The main innovation of this invention is as follows:

[0109] (1) Use the maximum flow algorithm to find all augmenting paths. The inherent path selection of this routing algorithm makes the spatial network using this routing algorithm have a large flow.

[0110] (2) Based on the load balancing evaluation path, considering the three types of service requirements—latency-sensitive, bandwidth-sensitive, and packet loss-sensitive—a joint optimization objective function with three factors—latency, remaining bandwidth, and packet loss rate—is proposed to ensure the efficiency and reliability of traffic transmission.

[0111] Comparison with existing work:

[0112] (1) Different methods of finding paths: In this invention, all augmented paths through a certain node are used as traffic transmission paths that each node can choose. This inherently ensures that forwarding information through the selected path is not easily blocked.

[0113] (2) Different evaluation path methods: This invention uses load balancing as the evaluation path method and uses a joint optimization objective function that includes three factors: latency, remaining bandwidth and packet loss rate as the evaluation basis for the path, so as to solve the service requirements of latency-sensitive, bandwidth-sensitive and packet loss rate-sensitive types.

[0114] Summarize:

[0115] (1) This invention is a routing algorithm for determining network service transmission, based on time spread graph and maximum flow algorithm;

[0116] (2) The greatest innovation of this invention is that it uses the augmented path of the maximum flow algorithm as the selectable path, which is inherently capable of transmitting a large flow rate;

[0117] (3) The path discovery itself is filtered, only the augmented paths of the maximum flow algorithm are used as the selectable paths. Using these paths will result in greater network traffic. Currently, there is no routing algorithm designed based on the maximum flow algorithm. While other algorithms are still focused on maximizing traffic, the algorithm of this invention prioritizes some other factors (i.e., the design of the objective function). This is the biggest advantage of this invention.

[0118] Example 2:

[0119] This invention also provides a multipath routing device based on the maximum flow of a time-spread graph. This multipath routing device is mainly used to execute the multipath routing method based on the maximum flow of a time-spread graph provided in Embodiment 1 of this invention. The following is a detailed description of the multipath routing device based on the maximum flow of a time-spread graph provided in this invention.

[0120] Figure 3 This is a schematic diagram of a multipath routing device based on the maximum flow of a time-spread graph according to an embodiment of the present invention, such as... Figure 3As shown, the device mainly includes: an augmented path search unit 10, a quality of service assessment unit 20, a transmission unit 30, and a return execution unit 40, wherein:

[0121] The augmented path search unit is used to obtain the time spread graph of the dynamic spatial information network and use the maximum flow algorithm to perform augmented path search on the time spread graph to obtain the augmented path that maximizes the traffic of the dynamic spatial information network.

[0122] The service quality assessment unit is used to determine the service quality assessment method based on the service type of the data to be transmitted, and to use the service quality assessment method to assess the service quality of the target augmented path to which the target network node of the data to be transmitted belongs in the current time slice, so as to obtain the service quality assessment value of each target augmented path.

[0123] The transmission unit is used to transmit the data to be transmitted from the target network node of the current time slice to the next network node corresponding to each target augmentation path according to the quality of service assessment value of each target augmentation path, wherein the next network node is a network node that has a connection relationship with the target network node.

[0124] Return to the execution unit, which is used to select the next network node as the target network node and return to execute the steps of determining the quality of service assessment method based on the service type of the data to be transmitted, until the current time slice is the last time slice, and obtain the target route of the data to be transmitted.

[0125] In this embodiment of the invention, a multipath routing device based on maximum flow in a time-spread graph is provided, comprising: acquiring a time-spread graph of a dynamic spatial information network, and performing augmented path search on the time-spread graph using a maximum flow algorithm to obtain augmented paths that maximize the traffic of the dynamic spatial information network; determining a quality of service (QoS) assessment method based on the service type of the data to be transmitted, and using the QoS assessment method to perform QoS assessment on the target augmented paths to which the target network node of the data to be transmitted belongs in the current time slice, obtaining QoS assessment values ​​for each target augmented path; transmitting the data to be transmitted from the target network node in the current time slice to the next network node corresponding to each target augmented path according to the QoS assessment values ​​of each target augmented path, wherein the next network node is a network node that has a connection relationship with the target network node; taking the next network node as the target network node, returning to execute the step of determining the QoS assessment method based on the service type of the data to be transmitted, until the current time slice is the last time slice, to obtain the target route for the data to be transmitted. As described above, the multipath routing device based on time-spread graph maximum flow of the present invention uses the maximum flow algorithm to search for all augmenting paths. The subsequent routing method's path selection inherently allows for the transmission of larger volumes of traffic. Furthermore, when calculating the service quality assessment value of each target augmenting path, the service type of the data to be transmitted is considered. Then, the next network node for the data to be transmitted is determined based on the service quality assessment value of each target augmenting path. This achieves personalized load balancing routing for different service requirements of the data. Based on the service type of the data to be transmitted, the data transmission achieves the minimum path latency, or the maximum remaining path bandwidth, or the minimum path packet loss rate, thus alleviating the technical problem that traditional technologies cannot perform personalized load balancing routing for different service requirements of the data.

[0126] Optionally, the service quality assessment unit is further configured to: place the target network node containing the data to be transmitted in the current time slice into the routing node queue; determine whether the routing node queue is empty; if the routing node queue is not empty, determine the weight data according to the service type of the data to be transmitted, and determine the service quality assessment method according to the weight data; use the service quality assessment method to perform service quality assessment on the target augmentation path to which the data to be transmitted belongs in the current time slice, and obtain the service quality assessment value of each target augmentation path.

[0127] Optionally, the quality of service assessment unit is also used to: if the routing node queue is empty, determine whether the current time slice is the last time slice; if the current time slice is the last time slice, use the forwarding decision of the data to be transmitted as the target route of the data to be transmitted; if the current time slice is not the last time slice, increment the current time slice by one, and return to execute the step of placing the target network node with the data to be transmitted in the current time slice into the routing node queue.

[0128] Optionally, the service quality assessment unit is also used to: assess service quality according to the service quality assessment methodology. Calculate the service quality assessment value for each objective augmentation path, where, This represents the service quality assessment value of the target augmentation path. This represents the augmenting path from source node S to sink node D. Let S represent the set of augmenting paths from source node S to sink node D. This represents the communication link between network node i and network node j. Indicates the latency of the communication link. Indicates the remaining bandwidth of the communication link. This indicates the packet loss rate of the communication link. This represents the maximum path delay in the augmented path set. This represents the minimum remaining bandwidth of the path in the augmenting path set. This represents the maximum packet loss rate of the path in the augmented path set. This represents the weighting data in the service quality assessment method.

[0129] Optionally, the transmission unit is further configured to: determine the traffic ratio of each target augmentation path based on the quality of service assessment value of each target augmentation path; segment the data to be transmitted according to the traffic ratio of each target augmentation path, and transmit the segmented sub-data to be transmitted from the target network node of the current time slice to the next network node corresponding to each target augmentation path; remove the target network node from the routing node queue, place the next network node as the target network node in the routing node queue, and return to execute the step of determining whether the routing node queue is empty.

[0130] Optionally, the service type of the data to be transmitted includes: latency-sensitive type, bandwidth-sensitive type, and packet loss rate-sensitive type.

[0131] The device provided in this embodiment of the invention has the same implementation principle and technical effect as the aforementioned method embodiment. For the sake of brevity, any parts not mentioned in the device embodiment can be referred to the corresponding content in the aforementioned method embodiment.

[0132] like Figure 4 As shown in the embodiment of this application, an electronic device 600 includes a processor 601, a memory 602, and a bus. The memory 602 stores machine-readable instructions executable by the processor 601. When the electronic device is running, the processor 601 communicates with the memory 602 via the bus. The processor 601 executes the machine-readable instructions to perform the steps of the multipath routing method based on the maximum flow of the time spread graph as described above.

[0133] Specifically, the memory 602 and processor 601 mentioned above can be general-purpose memory and processor, without any specific limitations. When the processor 601 runs the computer program stored in the memory 602, it can execute the multipath routing method based on the maximum flow of the time-spread graph.

[0134] The processor 601 may be an integrated circuit chip with signal processing capabilities. In implementation, each step of the above method can be completed by the integrated logic circuitry in the hardware of the processor 601 or by instructions in software form. The processor 601 may be a general-purpose processor, including a Central Processing Unit (CPU), a Network Processor (NP), etc.; it may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field-Programmable Gate Array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly manifested as execution by a hardware decoding processor, or execution by a combination of hardware and software modules in the decoding processor. The software module can reside in a mature storage medium in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, or registers. This storage medium is located in memory 602, and processor 601 reads the information from memory 602 and, in conjunction with its hardware, completes the steps of the above method.

[0135] Corresponding to the above-described multipath routing method based on the maximum flow of the time-spread graph, this application embodiment also provides a computer-readable storage medium storing machine-executable instructions. When the machine-executable instructions are invoked and executed by a processor, the machine-executable instructions cause the processor to perform the steps of the above-described multipath routing method based on the maximum flow of the time-spread graph.

[0136] The multipath routing device based on maximum flow in time-spread graphs provided in this application can be specific hardware on a device or software or firmware installed on the device. The implementation principle and technical effects of the device provided in this application are the same as those in the foregoing method embodiments. For the sake of brevity, any parts not mentioned in the device embodiments can be referred to the corresponding content in the foregoing method embodiments. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can all be referred to the corresponding processes in the above method embodiments, and will not be repeated here.

[0137] In the embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. The apparatus embodiments described above are merely illustrative. For example, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. Furthermore, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Additionally, the shown or discussed mutual couplings or direct couplings or communication connections may be through some communication interfaces, and the indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms.

[0138] For example, the flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than those marked in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram and / or flowchart, and combinations of blocks in block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0139] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0140] In addition, the functional units in the embodiments provided in this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0141] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause an electronic device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the multipath routing method based on the maximum flow of time-spread graphs described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0142] It should be noted that similar labels and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures. In addition, the terms "first", "second", "third", etc. are used only to distinguish descriptions and should not be construed as indicating or implying relative importance.

[0143] Finally, it should be noted that the above-described embodiments are merely specific implementation methods to illustrate the technical solutions of this application, and are not intended to limit them. The scope of protection of this application is not limited thereto. Although the solution has been described with reference to the foregoing embodiments, those skilled in the art should understand that any person skilled in the art can still modify or easily conceive of changes to the technical solutions described in the foregoing embodiments, or make equivalent substitutions for some of the technical features, within the scope of the technology disclosed in this application; and these modifications, changes, or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of this application. All should be covered within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A multipath routing method based on maximum flow in a time-spread graph, characterized in that, include: A time-spread graph of a dynamic spatial information network is obtained, and an augmenting path search is performed on the time-spread graph using the maximum flow algorithm to obtain the augmenting path that maximizes the traffic of the dynamic spatial information network. The service quality assessment method is determined based on the service type of the data to be transmitted, and the service quality assessment method is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, so as to obtain the service quality assessment value of each target augmentation path. Based on the quality of service (QoS) assessment value of each target augmentation path, the data to be transmitted is transmitted from the target network node in the current time slice to the next network node corresponding to each target augmentation path, wherein the next network node is a network node that has a connection relationship with the target network node; The next network node is taken as the target network node, and the process returns to the step of determining the quality of service assessment method based on the service type of the data to be transmitted, until the current time slice is the last time slice, so as to obtain the target route of the data to be transmitted.

2. The method according to claim 1, characterized in that, The service quality assessment method is determined based on the service type of the data to be transmitted, and the service quality assessment method is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, including: Place the target network node containing the data to be transmitted in the current time slice into the routing node queue; Determine whether the routing node queue is empty; If the routing node queue is not empty, then weight data is determined according to the service type of the data to be transmitted, and the service quality assessment method is determined according to the weight data. The service quality assessment method is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, and the service quality assessment value of each target augmentation path is obtained.

3. The method according to claim 2, characterized in that, The method further includes: If the routing node queue is empty, then determine whether the current time slice is the last time slice; If the current time slice is the last time slice, then the forwarding decision of the data to be transmitted is taken as the target route of the data to be transmitted. If the current time slice is not the last time slice, then increment the current time slice by one, and return to the step of placing the target network node containing the data to be transmitted in the current time slice into the routing node queue.

4. The method according to claim 2, characterized in that, The service quality assessment method described above is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, including: According to the service quality assessment method Calculate the quality of service (QoS) evaluation value for each of the target augmentation paths, where, This represents the quality of service (QoS) assessment value of the target augmenting path. This represents the augmenting path from source node S to sink node D. Let S represent the set of augmenting paths from source node S to sink node D. This represents the communication link between network node i and network node j. This indicates the latency of the communication link. This indicates the remaining bandwidth of the communication link. This indicates the packet loss rate of the communication link. This represents the maximum path delay in the augmented path set. This represents the minimum remaining bandwidth of the path in the augmented path set. This represents the maximum packet loss rate of the path in the augmented path set. This refers to the weight data in the service quality assessment method.

5. The method according to claim 2, characterized in that, Based on the quality of service (QoS) assessment values ​​of each target augmentation path, the data to be transmitted is transferred from the target network node in the current time slice to the next network node corresponding to each target augmentation path, including: The traffic ratio of each target augmentation path is determined based on the quality of service assessment value of each target augmentation path; The data to be transmitted is segmented according to the traffic ratio of each target augmentation path, and the segmented sub-data to be transmitted is transmitted from the target network node of the current time slice to the next network node corresponding to each target augmentation path. Remove the target network node from the routing node queue, place the next network node as the target network node in the routing node queue, and return to the step of determining whether the routing node queue is empty.

6. The method according to claim 1, characterized in that, The service types of the data to be transmitted include: latency-sensitive, bandwidth-sensitive, and packet loss-sensitive types.

7. A multipath routing device based on maximum flow in a time-spread graph, characterized in that, include: An augmenting path search unit is used to obtain the time spread graph of a dynamic spatial information network and to perform augmenting path search on the time spread graph using the maximum flow algorithm to obtain the augmenting path that maximizes the traffic of the dynamic spatial information network. The service quality assessment unit is used to determine the service quality assessment method based on the service type of the data to be transmitted, and to use the service quality assessment method to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, so as to obtain the service quality assessment value of each target augmentation path. A transmission unit is configured to transmit the data to be transmitted from the target network node in the current time slice to the next network node corresponding to each target augmentation path based on the quality of service assessment value of each target augmentation path, wherein the next network node is a network node that has a connection relationship with the target network node. The execution unit is used to select the next network node as the target network node and return to execute the step of determining the quality of service assessment method based on the service type of the data to be transmitted until the current time slice is the last time slice, so as to obtain the target route of the data to be transmitted.

8. The apparatus according to claim 7, characterized in that, The service quality assessment unit is also used for: Place the target network node containing the data to be transmitted in the current time slice into the routing node queue; Determine whether the routing node queue is empty; If the routing node queue is not empty, then weight data is determined according to the service type of the data to be transmitted, and the service quality assessment method is determined according to the weight data. The service quality assessment method is used to assess the service quality of the target augmentation path to which the target network node of the data to be transmitted belongs in the current time slice, and the service quality assessment value of each target augmentation path is obtained.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 6.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores machine-executable instructions that, when invoked and executed by a processor, cause the processor to perform the method according to any one of claims 1 to 6.

Images