Multi-path routing method based on maximum flow of time expansion graph and electronic device

Abstract

The invention provides a multipath routing method based on time extension graph maximum flow and an electronic device, and belongs to the technical field of communication, in the method, a maximum flow algorithm is adopted to search all augmented paths, the path selection of a subsequent routing method is congenital, and large flow can be transmitted, and in addition, the path selection efficiency is improved. When the service quality evaluation value of each target augmented path is calculated, the service type of the to-be-transmitted data is considered, and then the next network node of the to-be-transmitted data is determined according to the service quality evaluation value of each target augmented path, that is, personalized load balancing routing for different service requirements of the data is realized; according to the service type of the to-be-transmitted data, the data transmission is enabled to have the minimum path time delay, or the maximum path residual bandwidth, or the minimum path packet loss rate.

Description

Technical Field

[0001] The present invention relates to the technical field of communications, and in particular to a multipath routing method and electronic device based on a maximum flow of a time-expanded graph. Background Art

[0002] Space information networks are integrated networks consisting of satellite networks, near-space vehicles, aviation networks, and ground communication infrastructure. Their application scenarios and communication missions are rapidly expanding with the increasing number of space missions and the growing global user and data volumes. This demands that space information networks provide greater communication speeds and capacity. However, the limited resources, time-varying network topology, and extended link transmission times of space information networks restrict the growth of their capacity and throughput. Therefore, improving the communication capacity and throughput of space information networks has become a major research topic.

[0003] Routing algorithms, as an optimization tool, can significantly improve communication capacity and throughput. Their core approach is to change the network's capacity allocation by changing the forwarding priority of nodes. The following are some common optimization ideas for routing algorithms: Dynamic routing algorithm: performs routing selection based on the real-time status of the network (such as node location, link status, network load, etc.) to improve network efficiency and adaptability; Multipath routing algorithm: Shares the load by using multiple paths simultaneously, improving the network's fault tolerance and throughput; Delay-Tolerant Network (DTN) routing algorithm: To address the long delays and intermittent connectivity issues that may exist in spatial information networks, the DTN routing algorithm uses a store-and-forward mechanism to ensure that data is ultimately transmitted to its destination. 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 routing and network optimization. These algorithms can predict future network changes and make corresponding optimization decisions by learning from historical data and network status.

[0004] By selecting appropriate routing algorithm optimization ideas, spatial information networks can significantly improve communication capacity and throughput under limited resources and complex environments.

[0005] Spatial information networks are delay-tolerant networks. Graph-based routing algorithms suitable for this characteristic include contact graph routing, temporal aggregation graph routing, and temporal expansion graph routing. Different routing methods have different optimization goals, leading to significant differences between routing algorithms.

[0006] How to perform personalized load balancing routing based on different business needs of data has become a technical problem that urgently needs to be solved. Summary of the Invention

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

[0008] In view of this, the object of the present invention is to provide a multipath routing method based on a time-extended graph maximum flow, comprising: Obtaining a time-expanded graph of a dynamic spatial information network, and performing an augmenting path search on the time-expanded graph using a maximum flow algorithm to obtain an augmenting path that maximizes the flow of the dynamic spatial information network; Determining a service quality evaluation method based on the service type of the data to be transmitted, and using the service quality evaluation method to evaluate the service quality of the target augmenting path to which the target network node of the data to be transmitted belongs in the current time slice, to obtain a service quality evaluation value for each of the target augmenting paths; transmitting the data to be transmitted from the target network node of the current time slice to a next network node corresponding to each target augmenting path according to the service quality evaluation value of each target augmenting path, wherein the next network node is a network node connected to the target network node; The next network node is used as the target network node, and the steps of determining the service quality evaluation method based on the service type of the data to be transmitted are returned to execute until the current time slice is the last time slice, thereby obtaining the target route of the data to be transmitted.

[0009] Furthermore, determining a service quality evaluation method based on the service type of the data to be transmitted, and using the service quality evaluation method to perform a service quality evaluation on a target augmenting path to which a target network node of the data to be transmitted belongs in the current time slice, includes: placing the target network node of the current time slice where the data to be transmitted exists in a routing node queue; Determine whether the routing node queue is empty; If the routing node queue is not empty, determining weight data according to the service type of the data to be transmitted, and determining the service quality evaluation method according to the weight data; The service quality evaluation method is used to perform service quality evaluation on the target augmenting paths to which the target network node of the data to be transmitted belongs in the current time slice, and a service quality evaluation value of each target augmenting path is obtained.

[0010] Furthermore, the method further comprises: If the routing node queue is empty, determining whether the current time slice is the last time slice; If the current time slice is the last time slice, taking 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, the current time slice is incremented by one, and the process returns to the step of placing the target network node with the data to be transmitted in the current time slice into a routing node queue.

[0011] Furthermore, the service quality evaluation method is used to perform a service quality evaluation on the target augmenting 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 evaluation method Calculate the service quality evaluation value of each target augmenting path, where: represents the service quality evaluation value of the target augmenting path, represents the augmenting path from the source node S to the sink node D, represents the set of augmenting paths from the source node S to the sink node D, represents the communication link between network node i and network node j, represents the delay of the communication link, represents the remaining bandwidth of the communication link, represents the packet loss rate of the communication link, represents the maximum path delay in the augmenting path set, represents the minimum residual bandwidth of the path in the augmenting path set, represents the maximum path packet loss rate in the augmenting path set, Represents the weight data in the service quality evaluation method.

[0012] Further, transmitting the data to be transmitted from the target network node of the current time slice to the next network node corresponding to each target augmenting path according to the service quality evaluation value of each target augmenting path includes: Determining a flow ratio of each target augmenting path according to a service quality evaluation value of each target augmenting path; Splitting the data to be transmitted according to the flow ratio of each target augmenting path, and transmitting the sub-data to be transmitted obtained by the splitting from the target network node of the current time slice to the next network node corresponding to each target augmenting path; The target network node is removed from the routing node queue, the next network node is placed in the routing node queue as the target network node, and the process returns to the step of determining whether the routing node queue is empty.

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

[0014] In a second aspect, an embodiment of the present invention further provides a multipath routing device based on a maximum flow of a time-extended graph, comprising: an augmenting path search unit, configured to obtain a time-extended graph of a dynamic spatial information network and perform an augmenting path search on the time-extended graph using a maximum flow algorithm to obtain an augmenting path that maximizes the flow of the dynamic spatial information network; a quality of service evaluation unit, configured to determine a quality of service evaluation method based on the service type of the data to be transmitted, and use the quality of service evaluation method to perform a quality of service evaluation on a target augmenting path to which a target network node of the data to be transmitted belongs in a current time slice, to obtain a quality of service evaluation value for each target augmenting path; a transmitting unit, configured to transmit the data to be transmitted from the target network node of the current time slice to a next network node corresponding to each target augmenting path according to the service quality evaluation value of each target augmenting path, wherein the next network node is a network node connected to the target network node; The return execution unit is used to use the next network node as the target network node, return to execute the steps of determining the service quality evaluation method based on the business 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.

[0015] Furthermore, the service quality evaluation unit is further configured to: placing the target network node of the current time slice where the data to be transmitted exists in a routing node queue; Determine whether the routing node queue is empty; If the routing node queue is not empty, determining weight data according to the service type of the data to be transmitted, and determining the service quality evaluation method according to the weight data; The service quality evaluation method is used to perform service quality evaluation on the target augmenting paths to which the target network node of the data to be transmitted belongs in the current time slice, and a service quality evaluation value of each target augmenting path is obtained.

[0016] In a third aspect, an embodiment of the present invention further provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of any one of the methods described in the first aspect when executing the computer program.

[0017] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores machine-executable instructions. When the machine-executable instructions are called and executed by a processor, the machine-executable instructions prompt the processor to execute any method described in the first aspect above.

[0018] In an embodiment of the present invention, a multipath routing method based on maximum flow of a time-extended graph is provided, comprising: obtaining a time-extended graph of a dynamic spatial information network, and performing an augmenting path search on the time-extended graph using a maximum flow algorithm to obtain an augmenting path that maximizes the flow of the dynamic spatial information network; determining a service quality evaluation method based on the service type of data to be transmitted, and performing a service quality evaluation on a target augmenting path belonging to a target network node of the data to be transmitted in a current time slice using the service quality evaluation method to obtain a service quality evaluation value for each target augmenting path; transmitting the data to be transmitted from the target network node of the current time slice to a next network node corresponding to each target augmenting path based on the service quality evaluation value of each target augmenting path, wherein the next network node is a network node that has a connection relationship with the target network node; using the next network node as the target network node, returning to the step of determining the service quality evaluation method based on the service type of the data to be transmitted, until the current time slice becomes the last time slice, thereby obtaining a target route for the data to be transmitted. As can be seen from the above description, in the multipath routing method based on the maximum flow of the time-expanded graph of the present invention, the maximum flow algorithm is used to search for all augmenting paths, and the path selection of the subsequent routing method can inherently transmit larger traffic. In addition, when calculating the service quality evaluation value of each target augmenting path, the business type of the data to be transmitted is taken into account, and then the next network node of the data to be transmitted is determined based on the service quality evaluation value of each target augmenting path. In other words, personalized load-balanced routing is achieved for different business needs of the data. According to the business type of the data to be transmitted, the data transmission has the minimum path delay, or the maximum path remaining bandwidth, or the minimum path packet loss rate, which alleviates the technical problem that traditional technologies cannot perform personalized load-balanced routing for different business needs of the data. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the specific embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0020] Figure 1 A flowchart of a multipath routing method based on a maximum flow of a time-extended graph provided by an embodiment of the present invention; Figure 2 A flowchart of another multipath routing method based on the maximum flow of a time-extended graph provided by an embodiment of the present invention; Figure 3 A schematic diagram of a multipath routing device based on a maximum flow of a time-extended graph provided by an embodiment of the present invention; Figure 4 A schematic diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0021] The following will clearly and completely describe the technical solutions of the present invention in conjunction with the embodiments. Obviously, the embodiments described are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present invention.

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

[0023] Based on this, in the multipath routing method based on the maximum flow of the time-expanded graph of the present invention, a maximum flow algorithm is used to search for all augmenting paths. The path selection of the subsequent routing method can inherently transmit a larger flow. In addition, when calculating the service quality evaluation value of each target augmenting path, the business type of the data to be transmitted is taken into account, and then the next network node of the data to be transmitted is determined based on the service quality evaluation value of each target augmenting path. In other words, personalized load-balanced routing is achieved for different business needs of the data. According to the business type of the data to be transmitted, the data transmission has the minimum path delay, or the maximum path residual bandwidth, or the minimum path packet loss rate.

[0024] To facilitate understanding of this embodiment, a multipath routing method based on maximum flow of a time-extended graph disclosed in an embodiment of the present invention is first introduced in detail.

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

[0026] Figure 1 FIG. 1 is a flow chart of a multipath routing method based on a maximum flow of a time-expanded graph according to an embodiment of the present invention. Figure 1 As shown, the method includes the following steps: Step S102: obtaining a time-expanded graph of the dynamic spatial information network, and performing an augmenting path search on the time-expanded graph using a maximum flow algorithm to obtain an augmenting path that maximizes the flow of the dynamic spatial information network; In this embodiment of the present invention, a maximum flow routing algorithm is designed based on different service requirements (services can be roughly divided into three types: delay-sensitive, bandwidth-sensitive, and packet loss-sensitive). Specifically, after determining several augmenting paths with the highest traffic flow, the algorithm then considers the characteristics of different services and selects appropriate paths for them. Otherwise, if the present invention prioritizes paths solely based on maximum traffic flow, data could quickly occupy the bandwidth of the augmenting path with the highest capacity, causing congestion on that augmenting path and, consequently, increasing network latency and packet loss.

[0027] Because the dynamic spatial information network is a fully predictable network, this invention employs multipath routing, with diverse service needs as the primary goal and maximum transmission throughput as the secondary goal. A multipath routing method was designed to minimize data transmission path delay, maximize path remaining bandwidth, and minimize path packet loss rate.

[0028] The following describes the basic process of multipath routing: 1) Path discovery: Use an algorithm to discover all possible augmenting paths from the source node to the sink node; 2) Path evaluation: Evaluate and score each augmenting path based on the predetermined optimization strategy; 3) Path selection: Based on the evaluation results, one or more optimal augmenting paths are selected for data transmission.

[0029] The differences between different multipath routing algorithms are mainly reflected in path evaluation. Different factors considered lead to different evaluation scores of different algorithms, which ultimately changes the routing strategy.

[0030] In other words, the optimization objective of a routing algorithm significantly impacts its performance. Traditional routing algorithms have varying optimization objectives, but none prioritize specific service requirements over maximizing throughput as a secondary objective. Furthermore, different routing algorithms also have different foundations, and none are based on the maximum flow algorithm of the present invention. Therefore, traditional routing algorithms cannot meet the needs of latency-sensitive, bandwidth-sensitive, and packet loss-sensitive services. Therefore, the present invention proposes a new routing algorithm based on the maximum flow algorithm of the present invention.

[0031] The routing algorithm proposed in this paper is designed for a fully predictable dynamic spatial information network. This involves knowing the edge capacity, service type, and data size of the network (i.e., the dynamic spatial information network) at every moment. This provides a routing algorithm that ensures data transmission meets service requirements as closely as possible. Like all multipath routing methods, this invention employs a three-step approach.

[0032] Path discovery: The optimization approach adopted by the present invention is to first apply the maximum flow algorithm to the network, which will obtain all augmenting paths that maximize network traffic. In the present invention, the augmenting path of the maximum flow algorithm is used as a possible path because the path of the maximum flow algorithm itself has the advantage of "high traffic", so when choosing among these augmenting paths, there is no need to consider the factor of traffic size. As for which maximum flow algorithm is used, it has little to do with the present invention. The source node and sink node of the maximum flow algorithm are the source node and sink node of the data to be transmitted, regardless of whether the source node and sink node are the same.

[0033] Step S104: Determine a service quality evaluation method based on the service type of the data to be transmitted, and use the service quality evaluation method to perform service quality evaluation on the target augmenting paths belonging to the target network node of the data to be transmitted in the current time slice, to obtain a service quality evaluation value for each target augmenting path; Specifically, path evaluation involves considering the forwarding method of each target network node, using these augmenting paths as all possible paths. Then, based on the different requirements of the service type for data transmission metrics, the weights of the optimization objective functions (latency, remaining bandwidth, and packet loss rate) are adjusted (i.e., the quality of service evaluation method is determined based on the service type of the data to be transmitted). The quality of service evaluation method is then used to select the transmission path that best suits the data to be transmitted for that service type from the augmenting paths found by the maximum flow search. This is then used as the routing method. This step is the core of the present invention and the multipath routing algorithm.

[0034] The target augmenting path to which the target network node of the data to be transmitted in the current time slice belongs is specifically to first determine the target network node where the data to be transmitted is located in the current time slice, and then determine the target augmenting path to which the target network node belongs.

[0035] Step S106 , transmitting the data to be transmitted from the target network node of the current time slice to the next network node corresponding to each target augmenting path according to the service quality evaluation value of each target augmenting path, wherein the next network node is a network node that has a connection relationship with the target network node; Specifically, path selection: After the QoS evaluation values ​​for each target augmenting path are calculated, selecting the target augmenting path is a dynamic process. Dynamic networks are highly dynamic and change rapidly, so the QoS evaluation values ​​for each target augmenting path must be constantly calculated. Each target network node must constantly calculate the QoS evaluation values ​​for each target augmenting path to determine the forwarding direction for its data.

[0036] Step S108 , taking the next network node as the target network node, returning to the step of determining the service quality evaluation method based on the service type of the data to be transmitted, until the current time slice is the last time slice, and obtaining the target route of the data to be transmitted.

[0037] In an embodiment of the present invention, a multipath routing method based on maximum flow of a time-extended graph is provided, comprising: obtaining a time-extended graph of a dynamic spatial information network, and performing an augmenting path search on the time-extended graph using a maximum flow algorithm to obtain an augmenting path that maximizes the flow of the dynamic spatial information network; determining a service quality evaluation method based on the service type of data to be transmitted, and performing a service quality evaluation on a target augmenting path belonging to a target network node of the data to be transmitted in a current time slice using the service quality evaluation method to obtain a service quality evaluation value for each target augmenting path; transmitting the data to be transmitted from the target network node of the current time slice to a next network node corresponding to each target augmenting path based on the service quality evaluation value of each target augmenting path, wherein the next network node is a network node that has a connection relationship with the target network node; using the next network node as the target network node, returning to the step of determining the service quality evaluation method based on the service type of the data to be transmitted, until the current time slice becomes the last time slice, thereby obtaining a target route for the data to be transmitted. As can be seen from the above description, in the multipath routing method based on the maximum flow of the time-expanded graph of the present invention, the maximum flow algorithm is used to search for all augmenting paths, and the path selection of the subsequent routing method can inherently transmit larger traffic. In addition, when calculating the service quality evaluation value of each target augmenting path, the business type of the data to be transmitted is taken into account, and then the next network node of the data to be transmitted is determined based on the service quality evaluation value of each target augmenting path. In other words, personalized load-balanced routing is achieved for different business needs of the data. According to the business type of the data to be transmitted, the data transmission has the minimum path delay, or the maximum path remaining bandwidth, or the minimum path packet loss rate, which alleviates the technical problem that traditional technologies cannot perform personalized load-balanced routing for different business needs of the data.

[0038] In an optional embodiment of the present invention, a service quality evaluation method is determined based on the service type of the data to be transmitted, and the service quality evaluation method is used to evaluate the service quality of the target augmenting path to which the target network node of the data to be transmitted belongs in the current time slice, specifically including the following steps: (1) Place the target network node with data to be transmitted in the current time slice into the routing node queue; (2) Determine whether the routing node queue is empty; (3) If the routing node queue is not empty, the weight data is determined according to the business type of the data to be transmitted, and the service quality evaluation method is determined based on the weight data; (4) The service quality evaluation method is used to evaluate the service quality of the target augmenting path to which the target network node of the data to be transmitted belongs in the current time slice, and the service quality evaluation value of each target augmenting path is obtained.

[0039] Specifically, according to the service quality evaluation method Calculate the service quality evaluation value of each target augmenting path, where represents the service quality evaluation value of the target augmenting path, represents the augmented path from the source node S to the sink node D obtained by the time-expanded graph maximum flow algorithm, represents the set of augmenting paths from the source node S to the sink node D, Represents the communication link between network node i and network node j (if the target network node where the data to be transmitted is located in the current time slice is A, there are three target augmenting paths passing through A, and these three target augmenting paths pass through A and reach BCD respectively, then network node i and network node j here refer to AB, AC and AD respectively). represents the delay of the communication link, represents the remaining bandwidth of the communication link, represents the packet loss rate of the communication link, represents the maximum path delay in the augmented path set, represents the minimum residual bandwidth of the path in the augmenting path set, represents the maximum path packet loss rate in the augmented path set, Represents weighted data, i.e., the weights of latency, remaining bandwidth, and packet loss rate in calculating the service quality evaluation value. The values ​​of each parameter in the above formula can be obtained or calculated.

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

[0041] The packet loss rate indicates the proportion of data packets lost in the total amount of data transmitted per unit time on a communication link, and can be expressed by the following formula: .

[0042] Indicates that the final delay calculation will take 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 each path segment. and The meaning is similar to this and will not be repeated here.

[0043] This approach comprehensively considers the target augmenting path's latency, remaining bandwidth, and packet loss rate, thereby matching latency-sensitive, bandwidth-sensitive, and packet loss-rate-sensitive services. This QoS evaluation method can also be referred to as a joint optimization objective function for load balancing.

[0044] (5) If the routing node queue is empty, determine whether the current time slice is the last time slice; (6) If the current time slice is the last time slice, the forwarding decision of the data to be transmitted is used as the target route of the data to be transmitted; Specifically, the forwarding decision is a routing result obtained by transmitting the data to be transmitted from the target network node of the current time slice to the next network node corresponding to each target augmenting path according to the service quality evaluation value of each target augmenting path.

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

[0046] In an optional embodiment of the present invention, transmitting the data to be transmitted from the target network node of the current time slice to the next network node corresponding to each target augmenting path according to the service quality evaluation value of each target augmenting path specifically includes the following steps: (1) Determine the flow ratio of each target augmenting path based on the service quality evaluation value of each target augmenting path; (2) Split the data to be transmitted according to the traffic ratio of each target augmenting path, and transmit the sub-data to be transmitted from the target network node of the current time slice to the next network node corresponding to each target augmenting path; Specifically, for example, the traffic ratio of the three target augmenting paths is 5:3:2, and the data to be transmitted is 100 megabytes. Then, the sub-data to be transmitted obtained by segmentation are 50 megabytes, 30 megabytes, and 20 megabytes respectively. The 50 megabytes of sub-data to be transmitted are transmitted to the next network node of the target network node of the current time slice in the target augmenting path corresponding to the traffic ratio of 5, the 30 megabytes of sub-data to be transmitted are transmitted to the next network node of the target network node of the current time slice in the target augmenting path corresponding to the traffic ratio of 3, and the 20 megabytes of sub-data to be transmitted are transmitted to the next network node of the target network node of the current time slice in the target augmenting path corresponding to the traffic ratio of 2.

[0047] (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.

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

[0049] In order to facilitate a better understanding of the process of the present invention, the method of the present invention is introduced again below, with reference to Figure 2 : Input: Time period Network topology time expansion graph on ,in, represents the set of network nodes (i.e., vertex set), represents the forward edge capacity set (i.e., the connections between network nodes in the same time slice in the subsequent time expansion graph), represents the forward cache edge capacity set (i.e., the connections between the same network nodes at different time slices in the subsequent time expansion graph), Indicates the time period, represents the reverse edge capacity set, Indicates the reverse cache capacity set, service type, source node, time slice, and service data (data to be transmitted) size.

[0050] Question: Find the data size forwarded by each time slice and each network node after receiving the data in the time expansion graph.

[0051] Step 0: Initialize the routing mode of all network nodes (i.e., initialize the service quality evaluation value to 0), divide the network into time slices, and construct a time expansion graph. The time expansion graph is composed of M time slices.

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

[0053] 1.1. Add all network nodes with services (data to be transmitted) in the current time slot to a queue (i.e., the routing node queue). Check whether the queue is empty. If so, check whether the current time slot is equal to the last time slot. If so, proceed to Step 4. If not, increment the current time slot m by 1 and proceed to 1.1. If not (i.e., the queue is not empty), proceed to Step 2.

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

[0055] Step 3: (Path Selection) Based on the routing calculation results from Step 2 (i.e., the QoS evaluation values ​​of each augmenting path), the data is forwarded along the augmenting paths, using the weights obtained from the joint optimization function (i.e., the routing ratios are divided according to the size of the calculation results) to update the network status.

[0056] 3.1 Determine whether there is a forwarded or cached object (network node object). If yes, dequeue the current node (network node) and enqueue the forwarded or cached node, then go to 1.1. Step 4: Use the service forwarding / caching method as routing, and the routing algorithm ends.

[0057] The present invention focuses on protecting: The joint optimization objective function of load balancing. Traditional routing algorithms do not have routing algorithms designed to meet the needs of three types of services: delay-sensitive, bandwidth-sensitive, and packet loss-sensitive. There are also no routing algorithms designed based on maximum flow algorithms.

[0058] The main innovations of the present invention are: (1) Use the maximum flow algorithm to find all augmenting paths. The path selection of the routing algorithm is inherent, so that the spatial network using this routing algorithm has a larger flow rate. (2) Based on the load balancing evaluation path, the three types of service requirements, namely delay-sensitive type, bandwidth-sensitive type and packet loss rate-sensitive type, are comprehensively considered. A joint optimization objective function including the three factors of delay, remaining bandwidth and packet loss rate is proposed to ensure the efficiency and reliability of traffic transmission.

[0059] Comparison with existing work: (1) Different path-finding methods: In the present invention, all augmented paths passing through a node are used as traffic transmission paths that can be selected by each node. This inherently ensures that information forwarding through the selected path is not easily blocked; (2) Different ways of evaluating paths: The present invention uses load balancing as a way of evaluating paths, and uses a combined optimization objective function that includes three factors: delay, remaining bandwidth, and packet loss rate as the basis for path evaluation to address the business needs of delay-sensitive, bandwidth-sensitive, and packet loss rate-sensitive types.

[0060] Summarize: (1) The present invention is a routing algorithm for determining network service transmission, based on a time-expanded graph and a maximum flow algorithm; (2) The greatest innovation of this invention is the use of the augmented path of the maximum flow algorithm as an optional path, which inherently can transmit a large flow; (3) Path discovery itself is filtered, using only the augmented paths of the maximum flow algorithm as selectable paths. Using these paths will increase network throughput. Currently, there is no routing algorithm designed based on the maximum flow algorithm. While other algorithms still focus on maximum throughput, the algorithm of the present invention prioritizes other factors (i.e., the design of the objective function). This is the greatest advantage of the present invention.

[0061] Example 2: An embodiment of the present invention also provides a multipath routing device based on the maximum flow of a time-expanded graph. The multipath routing device based on the maximum flow of a time-expanded graph is mainly used to execute the multipath routing method based on the maximum flow of a time-expanded graph provided in the first embodiment of the present invention. The multipath routing device based on the maximum flow of a time-expanded graph provided in the embodiment of the present invention is specifically introduced below.

[0062] Figure 3 is a schematic diagram of a multipath routing device based on a maximum flow of a time-expanded graph according to an embodiment of the present invention. Figure 3 As shown, the apparatus mainly includes: an augmented path search unit 10, a service quality evaluation unit 20, a transmission unit 30 and a return execution unit 40, wherein: An augmenting path search unit is used to obtain a time-expanded graph of a dynamic spatial information network and use a maximum flow algorithm to perform an augmenting path search on the time-expanded graph to obtain an augmenting path that maximizes the flow of the dynamic spatial information network; a service quality evaluation unit, configured to determine a service quality evaluation method based on the service type of the data to be transmitted, and use the service quality evaluation method to evaluate the service quality of the target augmenting paths to which the target network node of the data to be transmitted belongs in the current time slice, thereby obtaining a service quality evaluation value for each target augmenting path; a transmission unit, configured 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 augmenting path according to the service quality evaluation value of each target augmenting path, wherein the next network node is a network node connected to the target network node; The return execution unit is used to take the next network node as the target network node, return to execute the step of determining the service quality evaluation method based on the business 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.

[0063] In an embodiment of the present invention, a multipath routing device based on maximum flow of a time-extended graph is provided, comprising: obtaining a time-extended graph of a dynamic spatial information network, and performing an augmenting path search on the time-extended graph using a maximum flow algorithm to obtain an augmenting path that maximizes the flow of the dynamic spatial information network; determining a service quality evaluation method based on the service type of data to be transmitted, and performing a service quality evaluation on a target augmenting path belonging to a target network node of the data to be transmitted in a current time slice using the service quality evaluation method to obtain a service quality evaluation value for each target augmenting path; transmitting the data to be transmitted from the target network node of the current time slice to a next network node corresponding to each target augmenting path based on the service quality evaluation value of each target augmenting path, wherein the next network node is a network node connected to the target network node; using the next network node as the target network node, returning to the step of determining the service quality evaluation method based on the service type of the data to be transmitted, until the current time slice becomes the last time slice, thereby obtaining a target route for the data to be transmitted. As can be seen from the above description, in the multipath routing device based on the maximum flow of the time-expanded graph of the present invention, the maximum flow algorithm is used to search for all augmented paths, and the path selection of the subsequent routing method can inherently transmit larger traffic. In addition, when calculating the service quality evaluation value of each target augmented path, the business type of the data to be transmitted is taken into account, and then the next network node of the data to be transmitted is determined based on the service quality evaluation value of each target augmented path, that is, personalized load balancing routing is realized for different business needs of the data. According to the business type of the data to be transmitted, the data transmission has the minimum path delay, or the maximum path remaining bandwidth, or the minimum path packet loss rate, which alleviates the technical problem that traditional technologies cannot perform personalized load balancing routing for different business needs of the data.

[0064] Optionally, the service quality evaluation unit is also used to: place the target network node with data to be transmitted in the current time slice in the routing node queue; determine whether the routing node queue is empty; if the routing node queue is not empty, determine weight data according to the business type of the data to be transmitted, and determine a service quality evaluation method according to the weight data; use the service quality evaluation method to perform service quality evaluation on the target augmenting 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 evaluation value of each target augmenting path.

[0065] Optionally, the service quality evaluation 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, add one to the current time slice, and return to execute the step of placing the target network node with the data to be transmitted in the current time slice in the routing node queue.

[0066] Optionally, the service quality evaluation unit is further configured to: Calculate the service quality evaluation value of each target augmenting path, where represents the service quality evaluation value of the target augmenting path, represents the augmenting path from the source node S to the sink node D, represents the set of augmenting paths from the source node S to the sink node D, represents the communication link between network node i and network node j, represents the delay of the communication link, represents the remaining bandwidth of the communication link, represents the packet loss rate of the communication link, represents the maximum path delay in the augmented path set, represents the minimum residual bandwidth of the path in the augmenting path set, represents the maximum path packet loss rate in the augmented path set, Represents the weight data in the service quality evaluation method.

[0067] Optionally, the transmission unit is further used to: determine the flow ratio of each target augmenting path based on the service quality evaluation value of each target augmenting path; split the data to be transmitted according to the flow ratio of each target augmenting path, and transmit the sub-data to be transmitted obtained by the splitting from the target network node of the current time slice to the next network node corresponding to each target augmenting 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.

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

[0069] The device provided in the embodiment of the present invention has the same implementation principle and technical effects as those in the aforementioned method embodiment. For the sake of brief description, for matters not mentioned in the device embodiment, reference can be made to the corresponding content in the aforementioned method embodiment.

[0070] like Figure 4 As shown, an electronic device 600 provided in an embodiment of the present application includes: a processor 601, a memory 602 and a bus, wherein 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 through the bus, and 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-expanded graph as described above.

[0071] Specifically, the memory 602 and processor 601 can be general memory and processor, which are not specifically limited here. 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 extension graph.

[0072] The processor 601 may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method can be completed by an integrated logic circuit of hardware in the processor 601 or by instructions in the form of software. The above-mentioned processor 601 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can 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 gates or transistor logic devices, discrete hardware components. The various methods, steps, and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiments of the present application can be directly embodied as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in memory 602, and processor 601 reads the information in memory 602 and performs the steps of the above method in conjunction with its hardware.

[0073] Corresponding to the above-mentioned multipath routing method based on the maximum flow of the time-expanded graph, an embodiment of the present application also provides a computer-readable storage medium, which stores machine-executable instructions. When the computer-executable instructions are called and executed by the processor, the computer-executable instructions prompt the processor to execute the steps of the above-mentioned multipath routing method based on the maximum flow of the time-expanded graph.

[0074] The multipath routing device based on the maximum flow of the time expansion graph provided in the embodiment of the present application can be specific hardware on the device or software or firmware installed on the device. The device provided in the embodiment of the present application has the same implementation principle and technical effects as the aforementioned method embodiment. For the sake of brief description, any part not mentioned in the device embodiment can be referred to the corresponding content in the aforementioned method embodiment. Those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can all refer to the corresponding processes in the aforementioned method embodiment, and will not be repeated here.

[0075] In the embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interface, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0076] For another example, the flowcharts and block diagrams in the accompanying drawings show the possible architectures, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of code, and the module, program segment or a part of code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in an order different from that marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of the boxes in the block diagram and / or flowchart, can be implemented with a dedicated hardware-based system that performs the specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0077] The units described as separate components may or may not be physically separate, and 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 these units may be selected to achieve the purpose of this embodiment according to actual needs.

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

[0079] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the existing technology, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a number of instructions for enabling an electronic device (which can 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 the time-expanded graph described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, and other media that can store program code.

[0080] It should be noted that similar numbers and letters represent similar items in the following figures. 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 only used to distinguish the description and are not to be understood as indicating or implying relative importance.

[0081] Finally, it should be noted that the above-described embodiments are only some specific implementation methods to illustrate the technical solutions of the present application, rather than to limit them. The scope of protection of the present application is not limited thereto. Although the present solution has been described with reference to the above-mentioned embodiments, those skilled in the art should understand that any person skilled in the art can modify or easily conceive of changes to the technical solutions described in the above-mentioned embodiments within the technical scope disclosed in the present application, or perform equivalent replacements on some of the technical features thereof. However, these modifications, changes, or replacements do not deviate from the essence of the corresponding technical solutions within the scope of the technical solutions of the embodiments of the present application. They should all be included in the scope of protection of the present application. Therefore, the scope of protection of the present application shall be based on the scope of protection of the claims.

Claims

1. A multipath routing method based on maximum flow of time-extended graph, characterized in that: include: Obtaining a time-expanded graph of a dynamic spatial information network, and performing an augmenting path search on the time-expanded graph using a maximum flow algorithm to obtain an augmenting path that maximizes the flow of the dynamic spatial information network; Determining a service quality evaluation method based on the service type of the data to be transmitted, and using the service quality evaluation method to evaluate the service quality of the target augmenting path to which the target network node of the data to be transmitted belongs in the current time slice, to obtain a service quality evaluation value for each of the target augmenting paths; transmitting the data to be transmitted from the target network node of the current time slice to a next network node corresponding to each target augmenting path according to the service quality evaluation value of each target augmenting path, wherein the next network node is a network node connected to the target network node; The next network node is used as the target network node, and the steps of determining the service quality evaluation method based on the service type of the data to be transmitted are returned to execute until the current time slice is the last time slice, thereby obtaining the target route of the data to be transmitted.

2. The method according to claim 1, characterized in that Determining a service quality evaluation method based on the service type of the data to be transmitted, and using the service quality evaluation method to perform a service quality evaluation on a target augmenting path to which a target network node of the data to be transmitted belongs in a current time slice, including: placing the target network node of the current time slice where the data to be transmitted exists in a routing node queue; Determine whether the routing node queue is empty; If the routing node queue is not empty, determining weight data according to the service type of the data to be transmitted, and determining the service quality evaluation method according to the weight data; The service quality evaluation method is used to perform service quality evaluation on the target augmenting paths to which the target network node of the data to be transmitted belongs in the current time slice, and a service quality evaluation value of each target augmenting path is obtained.

3. The method according to claim 2, characterized in that The method further comprises: If the routing node queue is empty, determining whether the current time slice is the last time slice; If the current time slice is the last time slice, taking 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, the current time slice is incremented by one, and the process returns to the step of placing the target network node with the data to be transmitted in the current time slice into a routing node queue.

4. The method according to claim 2, characterized in that The quality of service evaluation method is used to perform a quality of service evaluation on a target augmenting path to which a target network node of the data to be transmitted belongs in a current time slice, including: According to the service quality evaluation method Calculate the service quality evaluation value of each target augmenting path, where: represents the service quality evaluation value of the target augmenting path, represents the augmenting path from the source node S to the sink node D, represents the set of augmenting paths from the source node S to the sink node D, represents the communication link between network node i and network node j, represents the delay of the communication link, represents the remaining bandwidth of the communication link, represents the packet loss rate of the communication link, represents the maximum path delay in the augmenting path set, represents the minimum residual bandwidth of the path in the augmenting path set, represents the maximum path packet loss rate in the augmenting path set, Represents the weight data in the service quality evaluation method.

5. The method according to claim 2, characterized in that Transmitting the data to be transmitted from the target network node of the current time slice to a next network node corresponding to each target augmenting path according to the service quality evaluation value of each target augmenting path, comprising: determining a flow ratio of each target augmenting path according to a service quality evaluation value of each target augmenting path; Splitting the data to be transmitted according to the flow ratio of each target augmenting path, and transmitting the sub-data to be transmitted obtained by the splitting from the target network node of the current time slice to the next network node corresponding to each target augmenting path; The target network node is removed from the routing node queue, the next network node is placed in the routing node queue as the target network node, and the process returns 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: delay-sensitive type, bandwidth-sensitive type and packet loss rate-sensitive type.

7. A multipath routing device based on maximum flow of time-expanded graph, characterized in that: include: an augmenting path search unit, configured to obtain a time-extended graph of a dynamic spatial information network and perform an augmenting path search on the time-extended graph using a maximum flow algorithm to obtain an augmenting path that maximizes the flow of the dynamic spatial information network; a quality of service evaluation unit, configured to determine a quality of service evaluation method based on the service type of the data to be transmitted, and use the quality of service evaluation method to perform a quality of service evaluation on a target augmenting path to which a target network node of the data to be transmitted belongs in a current time slice, to obtain a quality of service evaluation value for each target augmenting path; a transmitting unit, configured to transmit the data to be transmitted from the target network node of the current time slice to a next network node corresponding to each target augmenting path according to the service quality evaluation value of each target augmenting path, wherein the next network node is a network node connected to the target network node; The return execution unit is used to use the next network node as the target network node, return to execute the steps of determining the service quality evaluation method based on the business 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.

8. The device according to claim 7, characterized in that The service quality evaluation unit is further configured to: placing the target network node of the current time slice where the data to be transmitted exists in a routing node queue; Determine whether the routing node queue is empty; If the routing node queue is not empty, determining weight data according to the service type of the data to be transmitted, and determining the service quality evaluation method according to the weight data; The service quality evaluation method is used to perform service quality evaluation on the target augmenting paths to which the target network node of the data to be transmitted belongs in the current time slice, and a service quality evaluation value of each target augmenting 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, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores machine-executable instructions. When the machine-executable instructions are called and executed by a processor, the machine-executable instructions prompt the processor to execute the method according to any one of claims 1 to 6.

Images