Cross multi-layer network data transmission method and system based on whole-link security management and control

Abstract

The application provides a cross multi-layer network data transmission method and system based on full-link security management and control, which comprises the following steps: based on the node relationship pairs with data transmission correlation in the cross multi-layer network, a first transmission link is constructed, the state of each first transmission link is detected based on a detection data packet to obtain real-time state parameters; link screening is performed based on the security attribute label obtained after security attribute analysis of the data to be transmitted in combination with the real-time state parameters of each first transmission link to obtain a second transmission link, and an initial service path from a source node to a destination node is constructed based on the second transmission link; based on the resource use information of the source node and the traffic occupation information of the intermediate nodes in the initial service path, a target node with resource competition is determined, and the initial service path is shared and scheduled and optimized based on the target node to obtain a target service path; and the data to be transmitted is transmitted based on the target service path. The application improves the stability of data transmission.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a method and system for cross-multi-layer network data transmission based on end-to-end security management. Background Technology

[0002] In the field of data transmission, with the explosive growth of data volume and the increasing complexity of network application scenarios, the demand for efficient and secure data transmission is becoming increasingly urgent. Traditional data transmission methods mainly rely on broadcast transmission. When transmitting data, broadcast transmission requires independent consideration of the data distribution task for each sending end and uses a contention-based method for transmission.

[0003] However, when faced with large-scale data processing and high-speed network transmission, if data streams from different senders pass through the same network path, they will compete for bandwidth, resulting in packet loss and data retransmission until all senders successfully send their data to all receivers. In this way, when multiple data flows pass through the same path in the distribution network, severe competition and packet loss will occur. In order to successfully send the data to the receiver, it is necessary to retransmit continuously, which reduces the stability of data transmission. Summary of the Invention

[0004] The purpose of this invention is to provide a method and system for cross-layer network data transmission based on end-to-end security management. The method filters links based on the security attribute tags of the data to be transmitted and the real-time status parameters of each first transmission link, ensuring that each initial service path meets the transmission requirements of the corresponding data. This initially guarantees the stability of data transmission. Furthermore, based on the resource usage information of the source node and the traffic occupancy information of the intermediate nodes in the initial service path, the initial service path is optimized through shared scheduling. This adapts each piece of data to a target service path free from resource contention, preventing data packet loss due to resource contention during data transmission and ensuring the stability of data transmission.

[0005] In a first aspect, the present invention provides a method for cross-layer network data transmission based on end-to-end security management, comprising:

[0006] Based on the node relationship pairs with data transmission association in the multi-layer network, the first transmission link is constructed, and the status of each first transmission link is detected based on the probe data packet to obtain the real-time status parameters of each first transmission link.

[0007] Based on the security attribute labels obtained after security attribute analysis of the data to be transmitted, and combined with the real-time status parameters of each first transmission link, the second transmission link is obtained, and an initial service path from the source node to the destination node is constructed based on the second transmission link.

[0008] Based on the resource usage information of the source node and the traffic occupancy information of the intermediate node in the initial business path, the target node with resource contention is determined, and the initial business path is optimized by shared scheduling based on the target node to obtain the target business path.

[0009] The data to be transmitted is transmitted based on the target service path.

[0010] Optionally, the step of optimizing the initial service path based on the target node to obtain the target service path includes:

[0011] The initial business path is divided based on the path position of the target node in the initial business path to obtain a preceding sub-path and a following sub-path;

[0012] Based on the node contention impact of the target node and the total data transmission volume of the initial business path, combined with the traffic diversion security threshold, the load diversion requirement value is determined.

[0013] Based on the terminal node of the preceding sub-path and the starting node of the following sub-path, the access position of the traffic splitting node is determined, and based on the relationship between the remaining resource capacity of each adjacent node in the network topology corresponding to the access position and the load splitting demand value, candidate traffic splitting nodes are determined.

[0014] Based on the candidate traffic splitting nodes, the preceding sub-path and the following sub-path are optimized through shared scheduling to obtain the target service path.

[0015] Optionally, the step of performing shared scheduling optimization on the preceding and following sub-paths based on candidate traffic splitting nodes to obtain the target service path includes:

[0016] The traffic splitting suitability is determined based on the reciprocal of the transmission delay between each candidate splitting node and the terminal node, and the ratio of the remaining resource capacity of each candidate splitting node to the load splitting demand value.

[0017] The optimal routing node is obtained by filtering nodes based on the routing adaptability of each candidate routing node and the network connectivity of each candidate routing node at the access location.

[0018] Based on the forward connection link from the optimal routing node to the terminal node, and the backward connection link from the optimal routing node to the target node, a routing sub-path is constructed;

[0019] Based on the split sub-path, the preceding sub-path and the following sub-path are optimized through shared scheduling to obtain the target service path.

[0020] Optionally, the step of performing shared scheduling optimization on the preceding and following sub-paths based on the splitting sub-path to obtain the target service path includes:

[0021] Based on the split sub-path, the preceding sub-path and the following sub-path are respectively optimized by shared scheduling to obtain the optimized preceding segment and the optimized following segment.

[0022] Based on the fusion of the optimized pre-sequence segment and the optimized post-sequence segment, candidate service paths are obtained; based on the transmission delay of each candidate service path and the transmission delay of the initial service path, the delay optimization rate of each candidate service path is determined.

[0023] The target service path is determined based on the latency optimization rate of each candidate service path.

[0024] Optionally, determining the target node with resource contention based on the resource usage information of the source node and the traffic occupancy information of the intermediate nodes in the initial business path includes:

[0025] The remaining resource amount is determined based on the difference between the total resource capacity and the current resource usage of the source node. The remaining resource threshold is determined based on the difference between the remaining resource amount and the resource requirement of the data to be transmitted for the source node.

[0026] The traffic utilization rate is determined by the ratio of the current traffic utilization of the intermediate node and the expected traffic increment of the data to be transmitted in the intermediate node to the maximum traffic capacity of the intermediate node.

[0027] Based on the resource remaining threshold and resource contention trigger threshold of the source node, the resource relationship of the source node is determined, and based on the traffic occupancy rate and traffic contention trigger threshold of the intermediate node, the traffic relationship of the intermediate node is determined; the resource relationship characterizes whether resource contention is triggered, and the traffic relationship characterizes whether traffic contention is triggered.

[0028] Based on the resource relationships and the flow relationships, target nodes with resource competition are identified.

[0029] Optionally, determining the target node with resource contention based on the resource relationship and the flow relationship includes:

[0030] Based on the resource relationship and the traffic relationship, and combined with the positions of the source node and intermediate node in the initial business path, a node competition association matrix is ​​constructed; the matrix elements in the node competition association matrix represent whether all nodes trigger competition and have a path adjacency relationship.

[0031] The node that triggers the competition is determined based on the node competition correlation matrix.

[0032] The node competition impact of each triggering node is determined based on the number of adjacent competing nodes of each triggering node and its data transmission ratio in the initial service path; the data transmission ratio is determined based on the amount of data processed by the node and the total amount of data in the path.

[0033] The target node is determined based on the node competition influence of each triggering node.

[0034] Optionally, the method further includes:

[0035] Construct a transmission structure tree based on the network traffic of each node across multiple layers of network at the current time.

[0036] Based on the transmission structure tree, traffic is allocated to each transmission node in the target service path to obtain the allowable transmission traffic for each transmission node;

[0037] Based on the allowable transmission traffic of two adjacent transmission nodes in the target service path, determine the data transmission rate between the two adjacent transmission nodes;

[0038] The data transmission rate of the data to be transmitted in the target service path is controlled based on the data transmission rate between two adjacent transmission nodes in the target service path.

[0039] Optionally, the step of allocating traffic to each transmission node in the target service path based on the transmission structure tree to obtain the allowable transmission traffic for each transmission node includes:

[0040] Based on the transmission structure tree, traverse the upstream bearer nodes and downstream demand nodes of each transmission node, and determine the remaining available traffic that can be allocated to the target service path based on the current total traffic capacity of the upstream bearer node in the transmission structure tree and the traffic already allocated to non-target service paths.

[0041] Based on the remaining available traffic of the upstream bearer node and the number of child nodes connected by the upstream bearer node to the target service path, determine the upstream traffic constraint value obtained by each transmission node from the upstream bearer node;

[0042] Based on the downstream demand flow constraint value of the downstream demand node, combined with the upstream flow constraint value of each transmission node and its own capacity constraint value in the transmission structure tree, the initial flow candidate value is determined.

[0043] Based on the total traffic of the data to be transmitted and the initial traffic candidate value of each transmission node, traffic allocation is performed to obtain the allowable transmission traffic of each transmission node.

[0044] Optionally, determining the data transmission rate between two adjacent transmission nodes based on the allowable transmission traffic of two adjacent transmission nodes in the target service path includes:

[0045] By traversing the transmission structure tree based on two adjacent transmission nodes, the maximum transmission capacity, transmission capacity attenuation degree, and minimum transmission rate threshold of the physical link between the two adjacent transmission nodes are obtained; the transmission capacity attenuation degree is determined based on the position of the physical link in the target service path.

[0046] Based on the allowable transmission traffic of each of the two adjacent transmission nodes, determine the traffic limit threshold of the two adjacent transmission nodes, and based on the maximum transmission capacity of the link between the two adjacent transmission nodes and the traffic limit threshold, determine the upper limit of the link transmission between the two adjacent transmission nodes.

[0047] The available link rate between two adjacent transmission nodes is determined based on the link transmission upper limit and the degree of transmission capacity attenuation between the two adjacent transmission nodes.

[0048] The data transmission rate between two adjacent transmission nodes is determined based on the available link rate and minimum transmission rate threshold of the two adjacent transmission nodes.

[0049] Secondly, the present invention also provides a cross-layer network data transmission system based on end-to-end security management, applied to the cross-layer network data transmission method based on end-to-end security management as described in the first aspect; the cross-layer network data transmission system based on end-to-end security management includes:

[0050] The network link detection module is used to construct the first transmission link based on the node relationship pairs with data transmission association in the multi-layer network, and to perform status detection on each first transmission link based on the detection data packet to obtain the real-time status parameters of each first transmission link.

[0051] The path construction module is used to filter links based on the security attribute labels obtained after security attribute analysis of the data to be transmitted, combined with the real-time status parameters of each first transmission link, to obtain the second transmission link, and to construct the initial service path from the source node to the destination node based on the second transmission link.

[0052] The shared scheduling optimization module is used to determine the target node with resource contention based on the resource usage information of the source node and the traffic occupancy information of the intermediate node in the initial business path, and to perform shared scheduling optimization on the initial business path based on the target node to obtain the target business path.

[0053] The data transmission module is used to transmit the data to be transmitted based on the target service path.

[0054] The cross-layer network data transmission system based on end-to-end security management also includes:

[0055] The transmission structure tree construction module is used to construct a transmission structure tree based on the network traffic of each node across multiple network layers at the current time.

[0056] The traffic allocation module is used to allocate traffic to each transmission node in the target service path based on the transmission structure tree, so as to obtain the allowable transmission traffic of each transmission node;

[0057] The transmission rate analysis module is used to determine the data transmission rate between two adjacent transmission nodes based on the allowable transmission traffic of two adjacent transmission nodes in the target service path.

[0058] The transmission rate optimization module is used to control the data transmission rate of the data to be transmitted in the target service path based on the data transmission rate between two adjacent transmission nodes in the target service path.

[0059] Thirdly, the present invention also provides an electronic device, comprising: a memory for storing computer software programs; and a processor for reading and executing the computer software programs, thereby realizing the cross-layer network data transmission method based on end-to-end security control as described above.

[0060] Fourthly, the present invention also provides a non-transitory computer-readable storage medium storing a computer software program, which, when executed by a processor, implements the cross-multi-layer network data transmission method based on end-to-end security control as described above.

[0061] Fifthly, the present invention also provides a computer program product, including a computer program that, when executed by a processor, implements a method for cross-multi-layer network data transmission based on end-to-end security control.

[0062] The cross-layer network data transmission method based on end-to-end security management provided in this invention performs link filtering based on the security attribute tags of the data to be transmitted and the real-time status parameters of each first transmission link. This generates initial transmission paths that conform to the security attributes of the data to be transmitted, ensuring that each initial service path meets the transmission requirements of the corresponding data, thus initially guaranteeing the stability of data transmission. Furthermore, based on the resource usage information of the source node and the traffic occupancy information of the intermediate nodes in the initial service path, shared scheduling optimization is performed on the initial service path. This adapts each piece of data to a target service path free from resource contention, avoiding data packet loss due to resource contention during data transmission and further ensuring the stability of data transmission. Attached Figure Description

[0063] Figure 1 This is one of the flowcharts illustrating the cross-multi-layer network data transmission method based on end-to-end security management provided in this embodiment of the invention.

[0064] Figure 2 This is the second flowchart of the cross-multi-layer network data transmission method based on end-to-end security management provided in this embodiment of the invention;

[0065] Figure 3 This is a schematic diagram of the structure of a cross-multi-layer network data transmission system based on end-to-end security management provided in an embodiment of the present invention;

[0066] Figure 4 An embodiment diagram of the electronic device provided in this invention;

[0067] Figure 5 An embodiment diagram of a computer-readable storage medium provided in accordance with the present invention. Detailed Implementation

[0068] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. 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.

[0069] In the description of this invention, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the stated features. In the description of this invention, "a plurality of" means two or more, unless otherwise explicitly specified.

[0070] In the description of this invention, the term "for example" is used to mean "used as an example, illustration, or description." Any embodiment described as "for example" in this invention is not necessarily to be construed as being more preferred or advantageous than other embodiments. The following description is provided to enable any person skilled in the art to make and use the invention. Details are set forth in the following description for purposes of explanation. It should be understood that those skilled in the art will recognize that the invention can be made without using these specific details. In other instances, well-known structures and processes will not be described in detail to avoid obscuring the description of the invention with unnecessary detail. Therefore, the invention is not intended to be limited to the embodiments shown, but is consistent with the broadest scope of the principles and features disclosed herein.

[0071] Optional, see below Figure 1, Figure 1 This is one of the flowcharts illustrating the cross-layer network data transmission method based on end-to-end security control provided by the present invention. In this embodiment of the invention, the execution entity of the cross-layer network data transmission method based on end-to-end security control is the data transmission system. Therefore, the cross-layer network data transmission method based on end-to-end security control includes:

[0072] Step 10: Based on the node relationship pairs with data transmission association in the multi-layer network, construct the first transmission link, and perform state detection on each first transmission link based on probe data packets to obtain the real-time state parameters of each first transmission link.

[0073] Optionally, the data transmission system traverses nodes across multiple network layers based on network topology discovery technology and routing protocol information to obtain node relationship pairs with data transmission associations. Here, a node relationship pair refers to a combination of nodes that can directly interact with data in different network layers. For example, nodes in an enterprise intranet and Internet access nodes, or routing nodes in the Internet and access nodes in external partner networks, may all form node relationship pairs with data transmission associations.

[0074] Furthermore, the data transmission system constructs all possible first transmission links from the source node to the destination node based on the node relationship pairs with data transmission associations.

[0075] Furthermore, the data transmission system performs status probing on each first transmission link based on probe data packets. The probe data packets are transmitted along the link path. By recording information such as the sending time, receiving time, and packet loss during transmission of the probe data packets, the real-time status parameters of each first transmission link are calculated. These real-time status parameters include, for example, link bandwidth, transmission delay, and packet loss rate.

[0076] In one embodiment, assuming a multi-layered network environment consisting of an enterprise intranet, the Internet, and multiple external partner networks, data is transmitted from source node A in the enterprise intranet to destination node Z in the external partner network. Source node A is a server in the enterprise intranet, and destination node Z is a server in the external partner network. The data transmission system, through network topology discovery, obtains the following node relationship pairs with data transmission associations: A with enterprise intranet exit node B, B with Internet access node C, C with Internet routing node D, D with external partner network access node E, and E with Z; there are also node relationship pairs such as A with another enterprise intranet exit node F, F with Internet access node G, G with Internet routing node D, D with E, and E with Z. Based on these node relationship pairs, two first transmission links are constructed: Link 1: A→B→C→D→E→Z and Link 2: A→F→G→D→E→Z.

[0077] Furthermore, the data transmission system sends probe packets to each link. For link 1, multiple probe packets are sent, and the time it takes for each packet to travel from A to Z is recorded. The average transmission delay is calculated to be 20ms. By statistically analyzing the ratio of the number of received packets to the number of sent packets, the packet loss rate is obtained as 1%. Based on the size of the probe packets and the transmission time, the link bandwidth is calculated to be 100Mbps. For link 2, the same probe process is performed, assuming an average transmission delay of 25ms, a packet loss rate of 2%, and a link bandwidth of 80Mbps.

[0078] Step 20: Based on the security attribute labels obtained after security attribute analysis of the data to be transmitted, and combined with the real-time status parameters of each first transmission link, the link is filtered to obtain the second transmission link, and the initial service path from the source node to the destination node is constructed based on the second transmission link.

[0079] Furthermore, the data transmission system performs security attribute analysis on the data to be transmitted. In this embodiment of the invention, the security attributes of the data need to be determined based on factors such as data type, sensitivity, and business requirements. For example, whether the data is classified information, whether encrypted transmission is required, whether there are high requirements for data integrity during transmission, and whether identity authentication is required. Further, the data transmission system assigns corresponding security attribute tags to the data to be transmitted based on the security attribute analysis results, such as tags like "encrypted transmission required," "high integrity requirements," and "classified data."

[0080] Furthermore, the data transmission system performs link filtering by combining the real-time status parameters of each first transmission link with the security attribute tags of the data to be transmitted. During the link filtering process, corresponding filtering rules are set. For example, for data with the tag "requires encrypted transmission", links that support encrypted transmission are selected; for the tag "high integrity requirements", links with low packet loss rates are prioritized; for data with transmission speed requirements, the second transmission link is obtained by combining link bandwidth and transmission latency.

[0081] Furthermore, the data transmission system constructs an initial service path from the source node to the destination node based on the second transmission link. In this embodiment of the invention, the initial service path is a link that can meet the data security attribute requirements and is in relatively good condition.

[0082] In one embodiment, the data to be transmitted is the enterprise's core business contract data. After the data transmission system performs security attribute analysis on it, it labels it with security attribute tags such as "encrypted transmission required" and "high integrity requirement". The real-time status parameters of the two first transmission links obtained in step 10 are known, where link 1 supports encrypted transmission, while link 2 does not. Furthermore, link 1 has a packet loss rate of 1%, lower than link 2's 2%, thus better meeting the "high integrity requirement". Based on the security attribute tags and real-time status parameters, link 2 is excluded because it does not support encrypted transmission, while link 1 meets all security attribute requirements; therefore, link 1 is determined as the second transmission link. The data transmission system constructs an initial business path based on link 1, i.e., the initial business path is A→B→C→D→E→Z.

[0083] Step 30: Based on the resource usage information of the source node and the traffic occupancy information of the intermediate node in the initial business path, determine the target node with resource contention, and optimize the shared scheduling of the initial business path based on the target node to obtain the target business path.

[0084] Furthermore, the data transmission system acquires resource usage information of the source node in the initial service path, as well as traffic usage information of intermediate nodes in the initial service path. Resource usage information includes CPU utilization, memory utilization, and network interface send queue length; traffic usage information includes the node's current input and output traffic, bandwidth utilization of each port, and whether traffic congestion exists. Intermediate nodes are the remaining nodes in the initial service path besides the source and destination nodes.

[0085] Furthermore, the data transmission system determines the target node with resource contention based on the resource usage information of the source node and the traffic occupancy information of the intermediate node, specifically as described in steps 301 to 304.

[0086] Furthermore, the data transmission system optimizes the initial service path based on the target node through shared scheduling to obtain the target service path, as described in steps 305 to 308. The optimization method of this embodiment is to add a diversion node before the target node, so that the diversion node can share the traffic pressure of the target node, avoid resource competition, and enable data to be transmitted more smoothly.

[0087] Step 40: Transmit the data to be transmitted based on the target service path.

[0088] Furthermore, the data transmission system configures corresponding routing information at each node of the target service path to ensure that data is forwarded in the order of the target service path. Simultaneously, based on the security attribute tags of the data to be transmitted, appropriate security mechanisms are enabled on the transmission path, such as data encryption, to meet the requirement of "encrypted transmission." The data transmission system then begins transmitting the data from the source node, sequentially passing through each intermediate node according to the target service path, and finally to the destination node. During transmission, the data transmission system monitors the data transmission status in real time, including the data transmission rate, whether packet loss occurs, and whether the transmission latency is within a reasonable range. If any abnormalities are detected during transmission, adjustments are made promptly to ensure that the data is accurately transmitted to the destination node.

[0089] In one embodiment, assuming the target service path is A→B→K→C→D→E→Z, the data transmission system configures the corresponding routing information on nodes A, B, K, C, D, E, and Z to ensure that the data can be forwarded along this path. Since the data to be transmitted carries a "transmission requires encryption" label, the data is encrypted at the source node A before transmission begins.

[0090] Therefore, data originates from source node A, is forwarded through node B to the newly added intermediate node K, and then node K forwards the data to node C. At this point, the traffic pressure on node C is reduced due to the sharing of bandwidth by intermediate node K, and the bandwidth utilization drops to around 60%. The data then passes through nodes D and E sequentially, and is finally successfully transmitted to the destination node Z. During the transmission process, the data transmission system monitors in real time and finds that the data transmission rate is stable at around 80Mbps, with no packet loss, and the transmission latency remains at around 22ms, indicating that the data transmission process is normal.

[0091] This invention employs a link filtering method based on the security attribute tags of the data to be transmitted and the real-time status parameters of each first transmission link. This generates initial transmission paths that conform to the security attributes of the data to be transmitted, ensuring that each initial service path meets the transmission requirements of the corresponding data and initially guaranteeing the stability of data transmission. Furthermore, based on the resource usage information of the source node and the traffic occupancy information of the intermediate nodes in the initial service path, shared scheduling optimization is performed on the initial service path. This adapts each piece of data to a target service path free from resource contention, preventing data packet loss due to resource contention during data transmission and further ensuring the stability of data transmission.

[0092] In one embodiment, steps 301 to 304 include:

[0093] Step 301: Determine the remaining resource amount based on the difference between the total resource capacity and the current resource usage of the source node; determine the remaining resource threshold based on the difference between the remaining resource amount and the resource requirement of the data to be transmitted for the source node.

[0094] Optionally, the data transmission system obtains the total resource capacity of the source node, which is the maximum resource limit that the source node can provide for data transmission, such as the maximum bandwidth of the source node's network interface and its maximum CPU processing power. Further, the data transmission system collects the amount of resources currently being used by the source node, i.e., the current resource usage. By calculating the difference between the total resource capacity and the current resource usage, the system obtains the remaining resource amount of the source node, which reflects the resource space currently available for allocation by the source node.

[0095] Furthermore, the data transmission system analyzes the characteristics of the data to be transmitted to determine the resource requirements of the data on the source node, that is, the amount of resources that the source node needs to provide during the transmission of the data. Finally, the resource remaining threshold is obtained by subtracting the resource requirements of the data to be transmitted from the remaining resource amount. The remaining resource threshold reflects the remaining resources of the source node after satisfying the data transmission requirements.

[0096] In one embodiment, the maximum bandwidth (total resource capacity) of the network interface of source node A is 200Mbps, and the bandwidth currently occupied by other services (current resource usage) is 80Mbps. According to the formula: Remaining resource capacity = Total resource capacity - Current resource usage, the remaining resource capacity of source node A is 200 - 80 = 120Mbps.

[0097] The bandwidth requirement (resource requirement) of the core business contract data to be transmitted to source node A is 100Mbps. Based on the formula: Remaining resource threshold = Remaining resource amount - Resource requirement of the data to be transmitted to the source node, the remaining resource threshold of source node A is calculated to be 120 - 100 = 20Mbps.

[0098] Step 302: Determine the traffic occupancy rate based on the ratio of the current traffic occupancy of the intermediate node and the expected traffic increment of the data to be transmitted in the intermediate node to the maximum traffic capacity of the intermediate node.

[0099] Furthermore, the data transmission system obtains the maximum traffic capacity of each intermediate node. The maximum traffic capacity is the maximum data traffic that can be processed per unit time, determined by factors such as the node's hardware performance and network configuration. Further, the data transmission system collects the traffic data currently being processed by the intermediate nodes, i.e., the current traffic occupancy, and calculates the ratio of the current traffic occupancy to the maximum traffic capacity to obtain the current traffic occupancy ratio. Further, based on parameters such as the size and transmission rate of the data to be transmitted, the data transmission system estimates the additional traffic that will occur when the data passes through the intermediate nodes, i.e., the expected traffic increment, and calculates the ratio of the expected traffic increment to the maximum traffic capacity to obtain the expected traffic increment ratio.

[0100] Furthermore, the data transmission system adds the current traffic occupancy ratio to the expected traffic increment ratio to obtain the traffic occupancy rate, which reflects the traffic load of the intermediate node after carrying this data transmission.

[0101] In one embodiment, among the intermediate nodes B, C, D, and E of the initial service path, let's take node C as an example. Node C's maximum traffic capacity is 100Mbps, and the current traffic being transmitted (current traffic occupancy) is 70Mbps. Therefore, the current traffic occupancy rate is 70Mbps / 100Mbps × 100% = 70%. It is estimated that the expected traffic increase when the core service contract data to be transmitted passes through node C is 20Mbps, and the expected traffic increase rate is 20Mbps / 100Mbps × 100% = 20%. According to the formula "Traffic occupancy rate = Current traffic occupancy rate + Expected traffic increase rate", the traffic occupancy rate of node C is calculated to be 70% + 20% = 90%.

[0102] Step 303: Based on the resource remaining threshold and resource contention trigger threshold of the source node, determine the resource relationship of the source node; and based on the traffic occupancy rate and traffic contention trigger threshold of the intermediate node, determine the traffic relationship of the intermediate node. Resource relationship indicates whether resource contention is triggered, and traffic relationship indicates whether traffic contention is triggered.

[0103] Optionally, in this embodiment of the invention, a resource contention trigger threshold and a traffic contention trigger threshold are preset for the source node. The resource contention trigger threshold is a critical value for determining whether resource contention occurs at the source node, and the traffic contention trigger threshold is a critical value for determining whether traffic contention occurs at the intermediate node.

[0104] Therefore, the data transmission system compares the remaining resource threshold of the source node obtained in step 301 with the resource contention trigger threshold. If the remaining resource threshold is less than the resource contention trigger threshold, the resource relationship of the source node is that resource contention has been triggered; otherwise, it is that resource contention has not been triggered.

[0105] Furthermore, for intermediate nodes, the data transmission system compares the intermediate node traffic occupancy rate obtained in step 302 with the traffic contention trigger threshold. If the traffic occupancy rate is greater than the traffic contention trigger threshold, the traffic relationship of the intermediate node is that traffic contention has been triggered; otherwise, it is that traffic contention has not been triggered.

[0106] In one embodiment, the resource contention trigger threshold for the source node is 30 Mbps, and the traffic contention trigger threshold for the intermediate nodes is 70%. The remaining resource threshold for source node A is 20 Mbps. Since 20 Mbps is less than 30 Mbps, the resource relationship of source node A is that no resource contention has been triggered.

[0107] The traffic utilization rate of intermediate node C is 90%, which is greater than 70%, so the traffic relationship of node C is one of triggering traffic contention. Assuming that the current traffic utilization of intermediate node B is 50Mbps and the expected traffic increase is 10Mbps, its traffic utilization rate is (50 / 100×100%) + (10 / 100×100%) = 60%, which is less than 70%, so the traffic relationship is one of not triggering traffic contention. The traffic utilization rates of intermediate nodes D and E are calculated to be 65% and 55% respectively, both of which are less than 70%, so the traffic relationship is one of not triggering traffic contention.

[0108] Step 304: Based on resource relationships and flow relationships, identify target nodes where resource competition exists.

[0109] Furthermore, the data transmission system determines the target node with resource contention based on the resource relationship of the source node and the traffic relationship of the intermediate nodes, as described in steps 3041 to 3044.

[0110] The embodiments of the present invention can accurately identify target nodes with resource contention in the initial business path, thereby adapting a target business path without resource contention for each data to be transmitted, effectively alleviating resource contention of target nodes, avoiding data packet loss due to resource contention during data transmission, and improving the stability of data transmission.

[0111] In one embodiment, steps 3041 to 3044 include:

[0112] Step 3041: Based on resource and traffic relationships, and combining the positions of the source node and intermediate nodes in the initial business path, construct a node competition association matrix. The matrix elements in the node competition association matrix represent whether all nodes have triggered competition and whether a path adjacency exists.

[0113] Optionally, the data transmission system defines the positional order of the source node and all intermediate nodes in the initial business path, and numbers the nodes according to the order of data transmission. For example, the source node is node 1, the first intermediate node is node 2, and so on. Further, based on the resource relationship and traffic relationship obtained in step 303, the data transmission system determines whether each node triggers contention: if the resource relationship of the source node triggers resource contention, it is marked as a "competitive node"; otherwise, it is marked as a "non-competitive node". If the traffic relationship of the intermediate node triggers traffic contention, it is marked as a "competitive node"; otherwise, it is marked as a "non-competitive node".

[0114] Furthermore, the data transmission system constructs a node competition association matrix, where the rows and columns of the matrix correspond to nodes in the initial business path (arranged in positional order). The value rules for matrix elements are as follows: if the node corresponding to the row and the node corresponding to the column are both competing nodes, and there is an adjacency relationship in the initial business path (i.e., the two nodes are consecutive nodes in the path), then the value of the matrix element is 1; if none of the above conditions are met (such as the existence of non-competing nodes or the absence of an adjacency relationship), then the value of the matrix element is 0.

[0115] Continuing with the above embodiment, the initial business path is A→B→C→D→E→Z, and the nodes are numbered in order of position as: Node 1 (A), Node 2 (B), Node 3 (C), Node 4 (D), and Node 5 (E).

[0116] Node 1 (A) is a non-competitive node (resource relationships did not trigger resource competition); Node 2 (B) is a non-competitive node (flow relationships did not trigger flow competition); Node 3 (C) is a competing node (flow relationships triggered flow competition); Node 4 (D) is a non-competitive node; Node 5 (E) is a non-competitive node. Therefore, a 5×5 node competition association matrix is ​​constructed (rows and columns correspond to nodes 1 to 5 respectively):

[0117] Node 1 and other nodes: Node 1 is a non-contending node, and all its elements are 0.

[0118] Node 2 and other nodes: Node 2 is a non-contending node, and all its elements are 0.

[0119] Node 3 and other nodes: Node 3 is a competing node, and its adjacent nodes are Node 2 (non-competing node) and Node 4 (non-competing node), both of which are 0.

[0120] Node 4 and other nodes: Node 4 is a non-contending node, and all its elements are 0.

[0121] Node 5 and other nodes: Node 5 is a non-competitive node, and all its elements are 0. Therefore, all elements in the node competition association matrix are 0.

[0122] Step 3042: Determine the node that triggers the competition based on the node competition association matrix.

[0123] Furthermore, the data transmission system analyzes the node competition association matrix, extracting the nodes corresponding to all rows or columns in the matrix where the nodes are considered competing nodes. Specifically, it iterates through each row of the matrix; if a node in a given row is marked as a competing node, then that node is the node that triggered the competition.

[0124] The determination of a node that triggers competition depends solely on whether the node itself triggers competition, and is unrelated to the values ​​of the elements in the matrix. The matrix serves to help organize the adjacency competition relationships between nodes, while the core criterion for determining a node that triggers competition is the node competition state determined in step 303.

[0125] Continuing with the above embodiment, according to the node competition status marking in step 303, node 3 (C) is marked as a competing node among the nodes in the initial business path. By traversing the rows of the node competition association matrix, the node associated with the row corresponding to node 3 is a competing node, therefore the competing node is node 3 (C).

[0126] Step 3043: Determine the node competition impact of each triggering node based on the number of adjacent competing nodes of each triggering node and its data transmission ratio in the initial business path. The data transmission ratio is determined based on the amount of data processed by the node and the total amount of data in the path.

[0127] Furthermore, the data transmission system counts the number of adjacent competing nodes for each competing node, that is, the number of nodes that are adjacent to the competing node in the initial service path and are also competing nodes. If there are no adjacent competing nodes, the number is 0.

[0128] Furthermore, the data transmission system calculates the data transmission percentage of each node that triggers contention: Data transmission percentage = (Node-processed data volume / Total path data volume) × 100%, where the node-processed data volume refers to the amount of traffic processed when the data to be transmitted passes through that node, and the total path data volume refers to the total amount of traffic of the data to be transmitted. Finally, the formula for calculating the node contention impact is: Node contention impact = Number of adjacent contention nodes + Data transmission percentage. The node contention impact reflects the degree to which the node triggering contention affects path transmission due to its own contention state; the more adjacent contention nodes and the higher the data transmission percentage, the greater the impact.

[0129] Continuing with the above embodiment, the node triggering the contention is node 3 (C). In the initial service path, the adjacent nodes of node 3 (C) are node 2 (B) and node 4 (D), both of which are non-contention nodes, therefore the number of adjacent contention nodes is 0. The total traffic of data to be transmitted (total data volume of the path) is 1000MB, and the amount of data processed by node 3 (C) is 300MB. Therefore, the data transmission ratio = (300 / 1000) × 100% = 30%, and the node contention impact of node 3 (C) = 0 + 30% = 30%.

[0130] Step 3044: Determine the target node based on the node competition influence of each triggering node.

[0131] Furthermore, the data transmission system compares the node contention impact of all competing nodes and selects the competing node with the highest node contention impact as the target node.

[0132] If multiple nodes that trigger contention have the same and highest impact, then the node closer to the source node is selected as the target node based on its position in the initial service path (because contention of nodes closer to the source node affects subsequent transmissions earlier).

[0133] Continuing with the above embodiment, the only node triggering the contention is node 3 (C), whose contention influence is 30%. Since there are no other nodes triggering contention, the target node is determined to be node 3 (C). Assuming there is another node triggering contention (node ​​X), whose contention influence is 12%, since the contention influence of node 3 is greater than that of node X, the target node is node 3.

[0134] In this embodiment of the invention, the target node with the greatest impact on data transmission is selected from the nodes that trigger competition based on the node's competition status, adjacency relationship, and data transmission ratio. This ensures that the selected target node is the node with the most prominent resource competition problem in the initial business path. Therefore, it can accurately adapt a target business path without resource competition for each piece of data to be transmitted, avoiding data packet loss due to resource competition during data transmission and ensuring the stability of data transmission.

[0135] In one embodiment, steps 305 to 308 include:

[0136] Step 305: Based on the path position of the target node in the initial business path, the initial business path is divided into a preceding sub-path and a following sub-path.

[0137] Optionally, the data transmission system specifies the exact location of the target node in the initial service path, i.e., which node the target node is in the path. Then, using the target node as the dividing point, the initial service path is divided into two parts: the path part starting from the source node and ending at the node preceding the target node is called the preceding sub-path; the path part starting from the target node and ending at the destination node is called the following sub-path.

[0138] Continuing with the above embodiment, the initial business path is A→B→C→D→E→Z, and the target node is C, which is the third node in the path (the source node A is the first node). Taking the target node C as the dividing point, the preceding sub-path is the path from the source node A to the node B preceding the target node C, i.e., the preceding sub-path is A→B; the following sub-path is the path from the target node C to the destination node Z, i.e., the following sub-path is C→D→E→Z.

[0139] Step 306: Determine the load balancing requirement based on the node contention impact of the target node and the total data transmission volume of the initial business path, combined with the load balancing security threshold.

[0140] Optionally, in this embodiment of the invention, a traffic splitting safety threshold is preset. The traffic splitting safety threshold is a proportional value set to ensure that the load of the target node is within a safe range after traffic splitting, and is usually determined based on node performance and business requirements. Therefore, the data transmission system obtains the node contention impact of the target node and the total data transmission volume of the initial business path (the total traffic size of the data to be transmitted), and determines the load splitting requirement value based on the node contention impact of the target node, the total data transmission volume of the initial business path, and the traffic splitting safety threshold. In this embodiment of the invention, the calculation formula for the load splitting requirement value is: Load splitting requirement value = (Node contention impact of the target node × Total data transmission volume of the initial business path) × Traffic splitting safety threshold. The load splitting requirement value represents the amount of traffic that needs to be split by the traffic splitting node to alleviate the resource contention of the target node.

[0141] In one embodiment, the node contention impact of target node C is 30%, the total data transmission volume of the initial service path is 1000MB, and the preset traffic offloading security threshold is 80%. According to the formula, the load offloading requirement value = (30% × 1000) × 80% = 240MB, that is, 240MB of traffic needs to be offloaded through the offloading node.

[0142] Step 307: Based on the terminal node of the preceding sub-path and the starting node of the following sub-path, determine the access location of the traffic splitting node, and based on the relationship between the remaining resource capacity and the load splitting demand value of each adjacent node in the network topology corresponding to the access location, determine the candidate traffic splitting node.

[0143] Furthermore, the data transmission system determines the access location of the splitter node: the terminal node of the preceding sub-path is the last node of the preceding sub-path, and the starting node of the following sub-path is the target node. Therefore, the access location is between the terminal node of the preceding sub-path and the starting node of the following sub-path, that is, the splitter node needs to be accessed between the node before the target node and the target node.

[0144] Furthermore, the data transmission system queries the network topology corresponding to the access location to obtain adjacent nodes that have data transmission relationships with both the terminal node of the preceding sub-path and the starting node of the following sub-path. Next, it collects the remaining resource capacity (i.e., the amount of resources currently available for allocation to each adjacent node) and compares it with the load balancing demand value. If the remaining resource capacity of an adjacent node is greater than or equal to the load balancing demand value, then that adjacent node is identified as a candidate load balancing node.

[0145] In one embodiment, the terminal node of the preceding sub-path is B, and the starting node of the following sub-path is C. Therefore, the access position of the load balancing node is between B and C. Querying the network topology reveals that node K is an adjacent node with data transmission relationships with both node B and node C. The remaining resource capacity of node K is detected to be 300MB, and the load balancing requirement is 240MB. Since 300MB > 240MB, the load balancing requirement is met; therefore, node K is determined as a candidate load balancing node.

[0146] Step 308: Based on the candidate traffic splitting nodes, perform shared scheduling optimization on the preceding and following sub-paths to obtain the target service path.

[0147] Furthermore, the data transmission system performs shared scheduling optimization on the preceding and following sub-paths based on the candidate diversion nodes to obtain the target service path, as detailed in steps 3081 to 3084.

[0148] The embodiments of the present invention can optimize the shared scheduling of the initial business path based on the diversion node, reduce the degree of resource competition among the target nodes in the business path, and ensure the stability of data transmission by avoiding data packet loss due to resource competition during the final target business path.

[0149] In one embodiment, steps 3081 to 3084 include:

[0150] Step 3081: Determine the traffic splitting suitability based on the reciprocal of the transmission delay between each candidate traffic splitting node and the terminal node, and the ratio of the remaining resource capacity of each candidate traffic splitting node to the load splitting demand value.

[0151] Optionally, the data transmission system obtains the transmission delay between each candidate splitting node and the terminal node of the preceding sub-path, calculates the reciprocal of the transmission delay, and the reciprocal of the transmission delay reflects the transmission speed efficiency between the candidate splitting node and the terminal node. The smaller the delay, the larger the reciprocal, and the higher the transmission efficiency.

[0152] Furthermore, the data transmission system calculates the ratio of the remaining resource capacity of each candidate distribution node to the load distribution demand. This ratio reflects whether the resources of the candidate distribution node can meet the distribution demand. The larger the ratio, the higher the resource redundancy.

[0153] Furthermore, the data transmission system sums the reciprocal and the ratio to obtain the traffic splitting adaptability. Therefore, the calculation formula for traffic splitting adaptability is: Traffic splitting adaptability = (reciprocal of transmission delay) + (ratio of remaining resource capacity to load splitting demand). Traffic splitting adaptability reflects the comprehensive performance of candidate traffic splitting nodes in terms of transmission efficiency and resource adaptability. The larger the value, the more suitable it is as a traffic splitting node.

[0154] In one embodiment, the candidate offloading node is K, and the terminal node of the preceding sub-path is B. The transmission delay between node B and node K is detected to be 10ms, the reciprocal of which is 1 / 10 = 0.1. Node K has a remaining resource capacity of 300MB, and the load balancing demand is 240MB. The ratio of the remaining resource capacity to the load balancing demand is 300MB / 240MB = 1.25. Therefore, the offloading fit is 0.1 + 1.25 = 1.35.

[0155] Step 3082: Based on the traffic adaptation of each candidate traffic splitting node and the network connectivity of each candidate traffic splitting node at the access location, the node is screened to obtain the optimal traffic splitting node.

[0156] Furthermore, the data transmission system sorts all candidate traffic splitting nodes by their traffic splitting adaptability, initially selecting nodes with higher adaptability. Then, it evaluates the network connectivity of these nodes at their access locations, including the stability of links between nodes (e.g., whether the packet loss rate is below a preset threshold) and whether the links are functioning normally. If the network connectivity of a candidate traffic splitting node meets preset requirements (e.g., packet loss rate ≤ 1%, link fault-free), the node with the highest traffic splitting adaptability and satisfactory network connectivity is selected as the optimal traffic splitting node. If only one candidate traffic splitting node exists and meets the network connectivity requirements, that node is directly selected as the optimal traffic splitting node.

[0157] Continuing with the above embodiment, the only candidate offloading node is K, with an offloading adaptability of 1.35. The network connectivity of node K at the access location (between B and C) is evaluated: the packet loss rate of the link between nodes B and K is 0.5% (lower than the preset threshold of 1%), and the packet loss rate of the link between nodes K and C is 0.8% (lower than the preset threshold of 1%), and both links are in normal working condition, meeting the network connectivity standard. Therefore, node K is determined as the optimal offloading node.

[0158] Step 3083: Construct a splitting sub-path based on the forward connection link from the optimal splitting node to the terminal node and the backward connection link from the optimal splitting node to the target node.

[0159] Furthermore, the data transmission system constructs a forward connection link from the terminal node to the optimal splitter node based on the optimal splitter node. This forward connection link must ensure smooth data transmission from the terminal node to the optimal splitter node. Simultaneously, a backward connection link is constructed from the optimal splitter node to the target node to ensure smooth data transmission from the optimal splitter node to the target node. Optionally, in this embodiment, the forward and backward connection links together form a splitter sub-path, i.e., the splitter sub-path = terminal node of the preceding sub-path → optimal splitter node → target node. This splitter sub-path serves as the channel for data splitting and transmission.

[0160] Continuing with the above embodiment, the optimal splitting node is K, the terminal node of the preceding sub-path is B, and the target node is C. A forward connection link is constructed as B→K, and this link has been tested and found to be stable. A backward connection link is constructed as K→C, and the link status is normal. Therefore, the splitting sub-path is B→K→C.

[0161] Step 3084: Based on the split sub-path, perform shared scheduling optimization on the preceding and following sub-paths to obtain the target service path.

[0162] Furthermore, the data transmission system performs shared scheduling optimization on the preceding and following sub-paths based on the split sub-paths to obtain the target service path, as detailed in steps 30841 to 30844.

[0163] In this embodiment of the invention, the initial business path is optimized by sharing the scheduling based on the sub-path corresponding to the optimal distribution node. This reduces the resource contention among target nodes in the business path, ensuring that the final target business path avoids data packet loss due to resource contention during data transmission. This guarantees the stability of data transmission and ensures that a large amount of business data can be smoothly transmitted from the source node to the destination node.

[0164] In one embodiment, the process of steps 30841 to 30844 includes:

[0165] Step 30841: Based on the split sub-path, perform shared scheduling optimization on the preceding sub-path and the following sub-path respectively to obtain the optimized preceding segment and the optimized following segment.

[0166] Optionally, the transmission system performs shared scheduling optimization on the preceding sub-path: the starting point of the preceding sub-path is the source node, and the ending point is the terminal node (the last node of the preceding sub-path). The starting point of the split sub-path (which coincides with the terminal node) is connected to the terminal node to form an optimized preceding segment that includes the original preceding sub-path and the starting part of the split sub-path. The optimized preceding segment needs to retain the basic transmission link from the source node to the terminal node and add a branch link from the terminal node to the optimal split node.

[0167] Furthermore, the data transmission system performs shared scheduling optimization for subsequent sub-paths: the starting point of the subsequent sub-path is the target node, and the ending point is the destination node. The ending point of the split sub-path (which coincides with the target node) is connected to the target node to form an optimized subsequent segment containing the ending point of the split sub-path and the original subsequent sub-path. The optimized subsequent segment needs to retain the basic transmission link from the target node to the destination node and add a branch link from the optimal split node to the target node.

[0168] Continuing with the above embodiment, the preceding sub-path is A→B, and the branching sub-path is B→K→C. The preceding sub-path is optimized as follows: the basic link A→B is retained, and a branch link B→K is added, resulting in the optimized preceding segment A→B→K. The following sub-path is C→D→E→Z, and the branching sub-path is B→K→C. The following sub-path is optimized as follows: the basic link C→D→E→Z is retained, and a branch link K→C is added, resulting in the optimized following segment K→C→D→E→Z.

[0169] Step 30842: Based on the fusion of the pre-optimized sequence and the post-optimized sequence, candidate service paths are obtained.

[0170] Furthermore, the data transmission system merges the pre-optimized and post-optimized segments. The fusion point is the endpoint of the pre-optimized segment (optimal routing node) and the starting point of the post-optimized segment (optimal routing node), forming a complete path chain. The merged path must ensure that data can start from the source node, pass through the pre-optimized segment, the optimal routing node, and the post-optimized segment, and finally reach the destination node. This path is the candidate service path. If multiple optimal routing nodes exist, multiple candidate service paths will be formed.

[0171] Continuing with the above embodiment, the optimized pre-sequence segment is A→B→K, and the optimized post-sequence segment is K→C→D→E→Z, with node K as the connection point between the two. After merging the two paths, the candidate service path is formed as A→B→K→C→D→E→Z.

[0172] Step 30843: Determine the latency optimization rate of each candidate service path based on the transmission latency of each candidate service path and the transmission latency of the initial service path.

[0173] Furthermore, the data transmission system obtains the transmission delay of the initial service path (the total transmission time from the source node to the destination node) and the transmission delay of each candidate service path (also the total transmission time from the source node to the destination node). The delay optimization rate in this embodiment is calculated as follows: Delay optimization rate = (Transmission delay of the initial service path - Transmission delay of the candidate service path) / Transmission delay of the initial service path × 100%. The delay optimization rate reflects the degree of optimization in transmission delay between the candidate service path and the initial service path; a larger value indicates a better optimization effect.

[0174] Continuing with the above embodiment, the transmission delay of the initial service path A→B→C→D→E→Z is 50ms, and the transmission delay of the candidate service path A→B→K→C→D→E→Z is 40ms.

[0175] Therefore, the latency optimization rate = (50ms - 40ms) / 50ms × 100% = 10ms / 50ms × 100% = 20%.

[0176] Step 30844: Determine the target business path based on the latency optimization rate of each candidate business path.

[0177] Furthermore, the data transmission system compares the latency optimization rates of all candidate service paths and selects the candidate service path with the highest latency optimization rate as the target service path. If multiple candidate service paths have the same and highest latency optimization rate, the candidate service path with the shortest path length (number of nodes) is selected as the target service path to reduce intermediate links in data transmission.

[0178] Continuing with the example provided by Xu, the only candidate service path is A→B→K→C→D→E→Z, with a latency optimization rate of 20%. Since there are no other candidate service paths, this is determined as the target service path.

[0179] This invention optimizes the initial service path through shared scheduling based on the split sub-path and latency optimization rate, reducing the resource contention and latency of the target nodes in the service path. This ensures that the final target service path avoids data packet loss due to resource contention during data transmission, guarantees the stability of data transmission, and ensures that a large amount of service data can be smoothly transmitted from the source node to the destination node.

[0180] Optional, see below Figure 2 , Figure 2This is the second flowchart of the cross-multi-layer network data transmission method based on end-to-end security control provided by the present invention. The cross-multi-layer network data transmission method based on end-to-end security control also includes steps 50 to 80:

[0181] Step 50: Construct a transmission structure tree based on the network traffic of each node across multiple network layers at the current time.

[0182] Optionally, the data transmission system collects network traffic data for each node across multiple network layers at the current time, including information such as each node's input traffic, output traffic, and link traffic with other nodes. Then, with source node A as the root node, it organizes all nodes and links participating in data transmission into a tree structure, i.e., a transmission structure tree, according to the actual connection relationships between nodes in the network and the direction of data transmission. In the transmission structure tree, the root node is the source node, and the child nodes are the nodes directly connected to the root node, and so on. Each node's child nodes represent the next-hop transmission node for that node's data, and the branches of the tree reflect the branching of the data transmission path in the network.

[0183] In one embodiment, at the current time, network traffic information for relevant nodes across multiple layers of the network has been collected. A transmission structure tree is constructed with source node A as the root node: Node B is the child node of root node A (A and B have a direct data transmission link); Node K is the child node of node B (B and K have a link); Node C is the child node of node K (K and C have a link); Node D is the child node of node C (C and D have a link); Node E is the child node of node D (D and E have a link); and Node Z is the child node of node E (E and Z have a link). The resulting transmission structure tree clearly shows all relevant nodes and connections from source node A to destination node Z.

[0184] Step 60: Based on the transmission structure tree, allocate traffic to each transmission node in the target service path to obtain the allowable transmission traffic for each transmission node.

[0185] Furthermore, based on the constructed transmission structure tree, the data transmission system allocates traffic to each transmission node in the target service path, taking into account the maximum traffic capacity of each node, the currently occupied traffic, and the overall network traffic balancing requirements. The allowable transmission traffic refers to the amount of data transmission traffic from the target service path that a node can handle, provided that the node and link operate stably. During the allocation process, it is necessary to ensure that the allowable transmission traffic of each node does not exceed the difference between its maximum traffic capacity and the currently occupied traffic, while avoiding excessive concentration of traffic allocation to a single node that could lead to network congestion, as detailed in steps 601 to 604.

[0186] Step 70: Determine the data transmission rate between two adjacent transmission nodes based on the allowable transmission traffic of two adjacent transmission nodes in the target service path.

[0187] Furthermore, for each pair of adjacent transmission nodes in the target service path, the data transmission system compares the allowable transmission traffic of the two transmission nodes and determines the data transmission rate between the two adjacent nodes based on the smaller allowable transmission traffic, as described in steps 701 to 704.

[0188] Step 80: Control the data transmission rate of the data to be transmitted in the target service path based on the data transmission rate between two adjacent transmission nodes in the target service path.

[0189] Furthermore, based on the data transmission rate between two adjacent transmission nodes in the target service path determined in step 70, the data transmission system performs rate control on the entire data transmission process in the target service path. By setting flow control mechanisms at the source node and each intermediate node, the data transmission system ensures that the transmission rate of the data to be transmitted between adjacent nodes does not exceed the corresponding determined data transmission rate for that segment during the transmission from the source node to the destination node. Simultaneously, it monitors the actual transmission rate of each link segment in real time. If the actual rate of a link segment exceeds the set rate, adjustments are made promptly, such as reducing the data transmission frequency, to ensure the stability and security of data transmission.

[0190] In one embodiment, it is assumed that the data transmission system sets rate control parameters in the target service path according to the data transmission rate between each adjacent node determined in step 70: the maximum transmission rate between A and B is 100Mbps, the maximum between B and K is 100Mbps, the maximum between K and C is 70Mbps, the maximum between C and D is 70Mbps, the maximum between D and E is 80Mbps, and the maximum between E and Z is 120Mbps.

[0191] During data transmission, the link rates of each segment are monitored in real time. When the actual transmission rate between K and C reaches 72 Mbps, the transmission rate between K and C is immediately controlled below 70 Mbps by reducing the frequency at which the preceding node B sends data to K. This control ensures that the transmission rate of the data to be transmitted meets the set requirements of each segment throughout the entire target service path.

[0192] The embodiments of the present invention construct a transmission structure tree, reasonably allocate the allowable transmission traffic of each node, accurately determine the data transmission rate between adjacent nodes, and realize effective control of the transmission rate of the entire target service path. This reasonably limits the transmission rate between adjacent nodes, avoids node traffic overflow and network congestion, ensures that the data to be transmitted can be transmitted stably and efficiently in the target service path, and improves the security and reliability of cross-multi-layer network data transmission.

[0193] In one embodiment, steps 601 to 604 include:

[0194] Step 601: Traverse the upstream bearer nodes and downstream demand nodes of each transmission node based on the transmission structure tree, and determine the remaining available traffic that can be allocated to the target service path based on the current total traffic capacity of the upstream bearer nodes in the transmission structure tree and the traffic already allocated to non-target service paths.

[0195] Optionally, the data transmission system is based on a transmission structure tree, traversing the upstream bearer node (i.e., the node preceding the transmission node in the path) and the downstream demand node (i.e., the node following the transmission node in the path) of each transmission node in the target service path.

[0196] For each upstream bearer node, obtain its current total traffic capacity (i.e., the node's maximum traffic carrying capacity) in the transmission structure tree, as well as the traffic already allocated to non-target service paths (the traffic occupied by the node for transmitting data to other service paths). By calculating the difference between the current total traffic capacity and the traffic already allocated to non-target service paths, obtain the remaining available traffic that the upstream bearer node can allocate to the target service path. The remaining available traffic is the maximum traffic support that the upstream node can provide for the target service path.

[0197] Continuing with the target service path, the transmission nodes are A, B, K, C, D, E, and Z. Based on the transmission structure tree, traverse the upstream bearer nodes of each node:

[0198] The upstream node of node B is A; the upstream node of node K is B; the upstream node of node C is K; the upstream node of node D is C; the upstream node of node E is D; and the upstream node of node Z is E.

[0199] The current total traffic capacity and traffic allocated to non-target service paths for each upstream bearer node are as follows: Node A: Current total traffic capacity 200Mbps, 80Mbps allocated to non-target service paths; Node B: Current total traffic capacity 150Mbps, 50Mbps allocated to non-target service paths; Node K: Current total traffic capacity 180Mbps, 60Mbps allocated to non-target service paths; Node C: Current total traffic capacity 100Mbps, 30Mbps allocated to non-target service paths; Node D: Current total traffic capacity 120Mbps, 40Mbps allocated to non-target service paths; Node E: Current total traffic capacity 180Mbps, 60Mbps allocated to non-target service paths.

[0200] According to the formula, the remaining available bandwidth for node A is 200-80=120Mbps; for node B, it is 150-50=100Mbps; for node K, it is 180-60=120Mbps; for node C, it is 100-30=70Mbps; for node D, it is 120-40=80Mbps; and for node E, it is 180-60=120Mbps.

[0201] Step 602: Based on the remaining available traffic of the upstream bearer node and the number of child nodes connected by the upstream bearer node in the target service path, determine the upstream traffic constraint value obtained by each transmission node from the upstream bearer node.

[0202] Furthermore, for each transmission node, the data transmission system obtains the remaining available traffic of its upstream bearer node, and at the same time counts the number of child nodes of the upstream bearer node related to the target service path in the transmission structure tree (i.e. the number of next-hop nodes directly connected to the upstream bearer node in the target service path).

[0203] If the upstream bearer node has only one child node (i.e., the current transmission node) in the target service path, then the upstream traffic constraint value of the transmission node is equal to the remaining available traffic of the upstream bearer node.

[0204] If there are multiple child nodes, the remaining available traffic of the upstream bearer node is evenly distributed to each child node. The upstream traffic constraint value of each child node is the remaining available traffic divided by the number of child nodes. The upstream traffic constraint value represents the maximum traffic limit that the transmission node can obtain from the upstream node.

[0205] Continuing with the upstream bearer node of node B, A is connected to only one child node B in the target service path. Therefore, the upstream traffic constraint value of node B = the remaining available traffic of node A = 120Mbps.

[0206] The upstream bearer of node K is node B. Node B only connects to one child node K in the target service path. Therefore, the upstream traffic constraint value of node K = the remaining available traffic of node B = 100Mbps.

[0207] The upstream bearer of node C is node K. Node K connects only one child node, C, in the target service path. Therefore, the upstream traffic constraint value of node C = the remaining available traffic of node K = 120Mbps.

[0208] The upstream bearer node of node D is node C. Node C is connected to only one child node D in the target service path. Therefore, the upstream traffic constraint value of node D = the remaining available traffic of node C = 70Mbps.

[0209] The upstream bearer node of node E is node D. Node D is connected to only one child node E in the target service path. Therefore, the upstream traffic constraint value of node E = the remaining available traffic of node D = 80Mbps.

[0210] The upstream bearer of node Z is node E. Node E connects only one child node Z in the target service path. Therefore, the upstream traffic constraint value of node Z = the remaining available traffic of node E = 120Mbps.

[0211] Step 603: Determine the initial traffic candidate value based on the downstream demand flow constraint value of the downstream demand node, combined with the upstream flow constraint value of each transmission node and its own capacity constraint value in the transmission structure tree.

[0212] Furthermore, the data transmission system obtains the downstream demand flow constraint value of each downstream demand node (i.e., the upstream flow constraint value of the downstream node, since the upstream flow constraint value of the downstream node reflects its upper limit of flow demand on the current node), and combines it with the upstream flow constraint value of the transmission node itself, as well as its own capacity constraint value in the transmission structure tree (i.e., the remaining available flow of the transmission node), to determine the initial flow candidate value. The initial flow candidate value is the minimum value among the upstream flow constraint value, its own capacity constraint value, and the downstream demand flow constraint value, because the flow of the transmission node is limited by three factors: upstream supply, its own carrying capacity, and downstream demand.

[0213] Continuing with the above embodiment, node B's upstream traffic constraint is 120Mbps, its own capacity constraint (node ​​B's remaining available traffic) is 100Mbps, and the downstream demand traffic constraint of downstream node K is 100Mbps. The initial traffic candidate value is the minimum of these three values, i.e., node B's initial traffic candidate value = min(120Mbps, 100Mbps, 100Mbps) = 100Mbps.

[0214] Node K has an upstream traffic constraint of 100Mbps and a self-capacity constraint of 120Mbps. The downstream demand traffic constraint of node C is 120Mbps. The initial candidate traffic value for node K is min(100Mbps, 120Mbps, 120Mbps) = 100Mbps.

[0215] Node C has an upstream traffic constraint of 120Mbps and a self-capacity constraint of 70Mbps. The downstream demand traffic constraint of node D is 70Mbps. The initial candidate traffic value for node C is min(120Mbps, 70Mbps, 70Mbps) = 70Mbps.

[0216] Node D has an upstream traffic constraint of 70 Mbps and a self-capacity constraint of 80 Mbps. The downstream demand traffic constraint of node E is 80 Mbps. The initial candidate traffic value for node D is min(70 Mbps, 80 Mbps, 80 Mbps) = 70 Mbps.

[0217] Node E has an upstream traffic constraint of 80Mbps and a self-capacity constraint of 120Mbps. The downstream demand traffic constraint of node Z is 120Mbps. The initial candidate traffic value for node E is min(80Mbps, 120Mbps, 120Mbps) = 80Mbps.

[0218] The upstream traffic constraint for node Z is 120Mbps, and its own capacity constraint is 130Mbps (node ​​Z's maximum traffic carrying capacity is 200Mbps - 70Mbps already occupied). There are no downstream demand nodes, and the downstream demand traffic constraint is taken from its own capacity constraint. The initial candidate traffic value for node Z = min(120Mbps, 130Mbps, 130Mbps) = 120Mbps.

[0219] Step 604: Based on the total traffic of the data to be transmitted and the initial traffic candidate value of each transmission node, traffic allocation is performed to obtain the allowable transmission traffic of each transmission node.

[0220] Furthermore, the data transmission system obtains the total traffic of the data to be transmitted and compares the initial traffic candidate value of each transmission node with the total traffic. If the minimum value among all initial traffic candidate values ​​is greater than or equal to the total traffic, then the allowable transmission traffic of each transmission node is the total traffic; if the minimum value is less than the total traffic, then the minimum value is used as the benchmark to ensure that the allowable transmission traffic of each transmission node does not exceed its initial traffic candidate value, and that the allowable transmission traffic of all nodes is consistent (equal to the minimum value), so as to ensure stable data transmission in the path and avoid a certain node becoming a traffic bottleneck.

[0221] In one embodiment, the total data traffic to be transmitted is 1000MB, corresponding to a transmission traffic requirement of 100Mbps (assuming that traffic corresponds to data volume rate). The minimum initial traffic candidate value among each node is 70Mbps (initial traffic candidate values ​​for nodes C and D). This value is less than the rate requirement corresponding to the total traffic, but due to node capacity limitations, the minimum value must be used as the benchmark. Therefore, the allowable transmission traffic for each transmission node is determined as follows: Node A: 120Mbps (not exceeding its initial related constraints), Node B: 100Mbps, Node K: 100Mbps, Node C: 70Mbps, Node D: 70Mbps, Node E: 80Mbps, and Node Z: 120Mbps. The allowable transmission traffic for bottleneck nodes C and D in the path is 70Mbps, ensuring that the overall transmission matches the bottleneck node capacity.

[0222] The embodiments of the present invention take into account upstream supply, self-capacity, and downstream demand, and accurately allocate allowable transmission traffic to each transmission node in the target service path. This ensures that the allowable transmission traffic of each node meets both the node's own capacity limit and the traffic constraints of upstream and downstream nodes, avoiding network congestion caused by traffic overflow or uneven distribution, and guaranteeing the efficiency and security of cross-multi-layer network data transmission.

[0223] In one embodiment, steps 701 to 704 include:

[0224] Step 701: Traverse the transmission structure tree based on two adjacent transmission nodes to obtain the maximum transmission capacity, transmission capacity attenuation level, and minimum transmission rate threshold of the physical link between the two adjacent transmission nodes. The transmission capacity attenuation level is determined based on the position of the physical link in the target service path.

[0225] Optionally, the data transmission system traverses the transmission structure tree for each pair of adjacent transmission nodes in the target service path to obtain the maximum transmission capacity, transmission capacity attenuation level, and minimum transmission rate threshold of the physical link between them. The maximum transmission capacity refers to the maximum data transmission rate that the physical link can achieve under ideal conditions, determined by the link's hardware specifications (such as fiber type and cable bandwidth). The transmission capacity attenuation level is a percentage determined based on the physical link's location in the target service path; for example, links at the network edge or over long distances experience higher attenuation, typically expressed as a percentage. The minimum transmission rate threshold is the lowest rate standard set to ensure data transmission quality; below this threshold, transmission instability or failure may occur.

[0226] Continuing with the above embodiment, the adjacent node pairs in the target service path are A and B, B and K, K and C, C and D, D and E, and E and Z. Traversing the transmission structure tree, the parameters of each link are obtained as follows: A and B: Maximum link transmission capacity 200Mbps, due to short-distance transmission within the enterprise intranet, transmission capacity attenuation is 5%, minimum transmission rate threshold 50Mbps. B and K: Maximum link transmission capacity 180Mbps, an intranet to internet access link, transmission capacity attenuation 8%, minimum transmission rate threshold 40Mbps. K and C: Maximum link transmission capacity 150Mbps, an inter-network intermediate link, transmission capacity attenuation 10%, minimum transmission rate threshold 30Mbps. C and D: Maximum link transmission capacity 120Mbps, a partner network access link, transmission capacity attenuation 12%, minimum transmission rate threshold 20Mbps. D and E: Maximum link transmission capacity 160Mbps, an internal internet link, transmission capacity attenuation 7%, minimum transmission rate threshold 35Mbps. E and Z: The maximum transmission capacity of the link is 220Mbps. It is an internal link within the partner network. The transmission capacity attenuation is 6%, and the minimum transmission rate threshold is 60Mbps.

[0227] Step 702: Based on the allowable transmission traffic of each of the two adjacent transmission nodes, determine the traffic limit threshold of the two adjacent transmission nodes, and based on the maximum transmission capacity of the link and the traffic limit threshold of the two adjacent transmission nodes, determine the upper limit of the link transmission of the two adjacent transmission nodes.

[0228] Furthermore, for each pair of adjacent transmission nodes, the data transmission system compares the allowable transmission traffic of the two nodes and takes the smaller value as the traffic limit threshold for the two adjacent transmission nodes. The traffic limit threshold reflects the maximum capacity constraint of the node on the link traffic. Then, the maximum transmission capacity of the link is compared with the traffic limit threshold, and the smaller value is taken as the upper limit of the link transmission between the two adjacent transmission nodes. The upper limit of the link transmission is the maximum possible transmission rate of the link under the dual constraints of the node's capacity and its own hardware capabilities.

[0229] Continuing with the above embodiments, A and B: A is allowed to transmit traffic of 120Mbps, and B is allowed to transmit traffic of 100Mbps. The traffic limit threshold = min(120Mbps, 100Mbps) = 100Mbps; the maximum link transmission capacity is 200Mbps, and the maximum link transmission limit = min(200Mbps, 100Mbps) = 100Mbps. B and K: B is allowed to transmit traffic of 100Mbps, and K is allowed to transmit traffic of 100Mbps. The traffic limit threshold = min(100Mbps, 100Mbps) = 100Mbps; the maximum link transmission capacity is 180Mbps, and the maximum link transmission limit = min(180Mbps, 100Mbps) = 100Mbps. K and C: K is allowed to transmit traffic of 100Mbps, and C is allowed to transmit traffic of 70Mbps. The traffic limit threshold = min(100Mbps, 70Mbps) = 70Mbps; the maximum link transmission capacity is 150Mbps, and the maximum link transmission limit = min(150Mbps, 70Mbps) = 70Mbps. C and D: Both C and D allow a transmission rate of 70 Mbps. The traffic limit threshold is min(70 Mbps, 70 Mbps) = 70 Mbps. The maximum link transmission capacity is 120 Mbps, and the maximum link transmission capacity is min(120 Mbps, 70 Mbps) = 70 Mbps. D and E: Both D and E allow a transmission rate of 70 Mbps and 80 Mbps. The traffic limit threshold is min(70 Mbps, 80 Mbps) = 70 Mbps. The maximum link transmission capacity is 160 Mbps, and the maximum link transmission capacity is min(160 Mbps, 70 Mbps) = 70 Mbps. E and Z: Both E and Z allow a transmission rate of 80 Mbps and 120 Mbps. The traffic limit threshold is min(80 Mbps, 120 Mbps) = 80 Mbps. The maximum link transmission capacity is 220 Mbps, and the maximum link transmission capacity is min(220 Mbps, 80 Mbps) = 80 Mbps.

[0230] Step 703: Determine the available link rate between two adjacent transmission nodes based on the link transmission upper limit and the degree of transmission capacity attenuation between the two adjacent transmission nodes.

[0231] Furthermore, for each pair of adjacent transmission nodes, the data transmission system calculates the available link rate based on the link transmission limit and the degree of transmission capacity attenuation. The calculation formula is: Available link rate = Link transmission limit × (1 - Transmission capacity attenuation). This rate takes into account the capacity attenuation of the link during actual transmission and is the actual achievable rate of the link after deducting the attenuation effect.

[0232] Continuing with the above, for A and B: the maximum transmission speed of the link is 100Mbps, the transmission capacity attenuation is 5%, and the available link speed is 100Mbps × (1-5%) = 95Mbps. For B and K: the maximum transmission speed of the link is 100Mbps, the transmission capacity attenuation is 8%, and the available link speed is 100Mbps × (1-8%) = 92Mbps. For K and C: the maximum transmission speed of the link is 70Mbps, the transmission capacity attenuation is 10%, and the available link speed is 70Mbps × (1-10%) = 63Mbps. For C and D: the maximum transmission speed of the link is 70Mbps, the transmission capacity attenuation is 12%, and the available link speed is 70Mbps × (1-12%) = 61.6Mbps. For D and E: the maximum transmission speed of the link is 70Mbps, the transmission capacity attenuation is 7%, and the available link speed is 70Mbps × (1-7%) = 65.1Mbps. For E and Z: the maximum transmission speed of the link is 80Mbps, the transmission capacity attenuation is 6%, and the available link speed is 80Mbps × (1-6%) = 75.2Mbps.

[0233] Step 704: Determine the data transmission rate between two adjacent transmission nodes based on the link availability rate and minimum transmission rate threshold of the two adjacent transmission nodes.

[0234] Furthermore, the data transmission system compares the available link rate of each pair of adjacent transmission nodes with a minimum transmission rate threshold.

[0235] If the available link rate is greater than or equal to the minimum transmission rate threshold, then the available link rate is the data transmission rate between two adjacent transmission nodes; if the available link rate is less than the minimum transmission rate threshold, then the data transmission rate is taken as the minimum transmission rate threshold to ensure that the data transmission quality meets the basic requirements.

[0236] Continuing with the above, for A and B: the available link speed is 95Mbps > the minimum transmission rate threshold of 50Mbps, and the data transmission rate is 95Mbps. For B and K: the available link speed is 92Mbps > the minimum transmission rate threshold of 40Mbps, and the data transmission rate is 92Mbps. For K and C: the available link speed is 63Mbps > the minimum transmission rate threshold of 30Mbps, and the data transmission rate is 63Mbps. For C and D: the available link speed is 61.6Mbps > the minimum transmission rate threshold of 20Mbps, and the data transmission rate is 61.6Mbps. For D and E: the available link speed is 65.1Mbps > the minimum transmission rate threshold of 35Mbps, and the data transmission rate is 65.1Mbps. For E and Z: the available link speed is 75.2Mbps > the minimum transmission rate threshold of 60Mbps, and the data transmission rate is 75.2Mbps.

[0237] This invention takes into account link hardware capabilities, node carrying capacity limitations, transmission attenuation, and quality requirements. It determines a reasonable data transmission rate for each pair of adjacent transmission nodes in the target service path, so that the transmission rate between adjacent nodes matches the node's allowable transmission traffic, adapts to the actual transmission capacity of the link, and meets the minimum transmission quality. This avoids node overload or link congestion caused by excessively high rates, as well as transmission quality problems caused by excessively low rates, thus ensuring the stability and efficiency of cross-multi-layer network data transmission.

[0238] Optionally, the cross-multi-layer network data transmission system based on end-to-end security management provided by the present invention will be described below. The cross-multi-layer network data transmission system based on end-to-end security management described below can be referred to in correspondence with the cross-multi-layer network data transmission method based on end-to-end security management described above.

[0239] Reference Figure 3 , Figure 3 This is a schematic diagram of the structure of the cross-layer network data transmission system based on end-to-end security management provided by the present invention. The cross-layer network data transmission system based on end-to-end security management includes:

[0240] The network link detection module 310 is used to construct a first transmission link based on the node relationship pairs with data transmission association in a multi-layer network, and to perform status detection on each first transmission link based on the detection data packet to obtain the real-time status parameters of each first transmission link.

[0241] The path construction module 320 is used to filter links based on the security attribute labels obtained after security attribute analysis of the data to be transmitted, combined with the real-time status parameters of each first transmission link, to obtain the second transmission link, and to construct an initial service path from the source node to the destination node based on the second transmission link.

[0242] The shared scheduling optimization module 330 is used to determine the target node with resource contention based on the resource usage information of the source node and the traffic occupancy information of the intermediate node in the initial business path, and to perform shared scheduling optimization on the initial business path based on the target node to obtain the target business path.

[0243] The data transmission module 340 is used to transmit the data to be transmitted based on the target service path.

[0244] The embodiments of the present invention ensure the stability of data transmission.

[0245] Please see Figure 4 , Figure 4 An embodiment diagram of an electronic device provided in accordance with the present invention. For example... Figure 4As shown, an embodiment of the present invention provides an electronic device 400, including a memory 410, a processor 420, and a computer program 411 stored in the memory 410 and executable on the processor 420. When the processor 420 executes the computer program 411, it implements the processes of steps 10 to 40.

[0246] Please see Figure 5 , Figure 5 An embodiment diagram of a computer-readable storage medium provided in accordance with an embodiment of the present invention is shown. Figure 5 As shown, this embodiment provides a computer-readable storage medium 500 on which a computer program 411 is stored. When the computer program 411 is executed by a processor, it implements the processes of steps 10 to 40.

[0247] On the other hand, the present invention also provides a computer program product, which includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer is able to execute the cross-layer network data transmission method based on end-to-end security control provided by the above methods, which includes steps 10 to 40.

[0248] The system embodiments described above are merely illustrative. 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 modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0249] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0250] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for cross-multi-layer network data transmission based on full-link security management and control, characterized in that, The method comprises the following steps: Based on the node relationship pairs with data transmission association relationship in the multi-layer network, a first transmission link is constructed, and the state of each first transmission link is detected based on a probe data packet to obtain real-time state parameters of each first transmission link; Based on the security attribute label obtained after security attribute analysis of the to-be-transmitted data, the real-time state parameters of each first transmission link are used for link screening to obtain a second transmission link, and an initial service path from a source node to a destination node is constructed based on the second transmission link; Based on the resource usage information of the source node and the traffic occupation information of the intermediate nodes in the initial service path, a target node with resource competition is determined, and the initial service path is shared and scheduled based on the target node to obtain a target service path; The to-be-transmitted data is transmitted based on the target service path; The method of sharing and scheduling the initial service path based on the target node to obtain a target service path comprises the following steps: The initial service path is segmented based on the path position of the target node in the initial service path to obtain a preceding sub-path and a subsequent sub-path; Based on the node competition influence degree of the target node and the total data transmission amount of the initial service path, a load shunting demand value is determined in combination with a shunting security threshold value; Based on the access position of the shunting node determined based on the terminal node of the preceding sub-path and the starting node of the subsequent sub-path, the size relationship between the residual resource capacity of each adjacent node in the network topology corresponding to the access position and the load shunting demand value is determined to determine a candidate shunting node; The preceding sub-path and the subsequent sub-path are shared and scheduled based on the candidate shunting node to obtain the target service path.

2. The method of claim 1, wherein, The method of sharing and scheduling the initial service path based on the target node to obtain a target service path comprises the following steps: Based on the reciprocal of the transmission delay between each candidate shunting node and the terminal node, and the ratio of the residual resource capacity of each candidate shunting node to the load shunting demand value, a shunting adaptation degree is determined; Based on the shunting adaptation degree of each candidate shunting node and the network connectivity of each candidate shunting node at the access position, a node screening is performed to obtain an optimal shunting node; Based on the forward connection link from the optimal shunting node to the terminal node, and the backward connection link from the optimal shunting node to the target node, a shunting sub-path is constructed; The preceding sub-path and the subsequent sub-path are shared and scheduled based on the shunting sub-path to obtain the target service path. 3.The method of claim 2, wherein, The method of sharing and scheduling the initial service path based on the target node to obtain a target service path comprises the following steps: Based on the shunting sub-path, the preceding sub-path and the subsequent sub-path are shared and scheduled respectively to obtain an optimized preceding section and an optimized subsequent section; The optimized preceding section and the optimized subsequent section are fused to obtain a candidate service path; determine a latency optimization rate of each candidate service path based on the transmission latency of each candidate service path and the transmission latency of the initial service path; determine the target service path based on the latency optimization rate of each candidate service path.

4. The method of claim 1, wherein, determine the target node with resource competition based on the resource usage information of the source node and the traffic occupation information of the intermediate node in the initial service path, including: determine a resource remaining amount based on a difference between the total resource capacity and the current resource usage amount of the source node, and determine a resource remaining threshold based on a difference between the resource remaining amount and a resource demand amount of the source node for the to-be-transmitted data; determine a traffic occupation rate based on a ratio of a current traffic occupation amount of the intermediate node to a maximum traffic carrying capacity of the intermediate node, and a ratio of an expected traffic increment of the to-be-transmitted data at the intermediate node to the maximum traffic carrying capacity of the intermediate node; determine a resource relationship of the source node based on a difference between the resource remaining threshold of the source node and a resource competition triggering threshold, and determine a traffic relationship of the intermediate node based on a difference between the traffic occupation rate of the intermediate node and a traffic competition triggering threshold; the resource relationship represents whether to trigger resource competition, and the traffic relationship represents whether to trigger traffic competition; determine the target node with resource competition based on the resource relationship and the traffic relationship.

5. The method of claim 4, wherein, determine the target node with resource competition based on the resource relationship and the traffic relationship, including: construct a node competition association matrix based on the resource relationship and the traffic relationship, in combination with positions of the source node and the intermediate node in the initial service path; a matrix element in the node competition association matrix represents whether nodes trigger competition and there is a path adjacency relationship; determine a triggering competition node based on the node competition association matrix; determine a node competition influence degree of each triggering competition node based on a number of adjacent competition nodes of each triggering competition node and a data transmission proportion of each triggering competition node in the initial service path; the data transmission proportion is determined based on a node processing data amount and a total data amount of the path; determine the target node based on the node competition influence degree of each triggering competition node.

6. The method of claim 1 to 5, wherein, The method further includes: construct a transmission structure tree based on network traffic of each node at a current time across a multi-layer network; perform traffic allocation for each transmission node in the target service path based on the transmission structure tree, to obtain an allowable transmission traffic of each transmission node; determine a data transmission rate between two adjacent transmission nodes in the target service path based on the allowable transmission traffic of the two adjacent transmission nodes; control the data transmission rate of the to-be-transmitted data in the target service path based on the data transmission rate between the two adjacent transmission nodes in the target service path.

7. The method of claim 6, wherein, The method further includes: traverse an upstream carrying node and a downstream demand node of each transmission node based on the transmission structure tree, and determine a remaining available traffic that can be allocated to the target service path based on a current total traffic capacity of the upstream carrying node in the transmission structure tree and a traffic that has been allocated to a non-target service path; determining an upstream traffic constraint value for each transmission node from the upstream carrying node based on the remaining available traffic of the upstream carrying node and the number of nodes of the upstream carrying node in the target traffic path; determining an initial traffic candidate value for each transmission node based on the downstream demand traffic constraint value of the downstream demand node and the upstream traffic constraint value and its own capacity constraint value in the transmission structure tree; performing traffic allocation based on the total traffic of the to-be-transmitted data and the initial traffic candidate value of each transmission node to obtain an allowable transmission traffic of each transmission node. 8.The method of claim 6, wherein, determining a data transmission rate between two adjacent transmission nodes in the target traffic path based on the allowable transmission traffic of the two adjacent transmission nodes, including: determining a link maximum transmission capacity, a transmission capacity attenuation degree and a minimum transmission rate threshold of a physical link between the two adjacent transmission nodes based on the two adjacent transmission nodes traversing the transmission structure tree; the transmission capacity attenuation degree is determined based on the position of the physical link in the target traffic path; determining a traffic limit threshold of the two adjacent transmission nodes based on the allowable transmission traffic of each transmission node in the two adjacent transmission nodes, and determining a link transmission upper limit value of the two adjacent transmission nodes based on the link maximum transmission capacity and the traffic limit threshold of the two adjacent transmission nodes; determining a link available rate of the two adjacent transmission nodes based on the link transmission upper limit value and the transmission capacity attenuation degree of the two adjacent transmission nodes; determining a data transmission rate between the two adjacent transmission nodes based on the link available rate and the minimum transmission rate threshold of the two adjacent transmission nodes.

9. A cross-multi-layer network data transmission system based on full-link security management and control, characterized in that, The application is applied to the cross-multi-layer network data transmission method based on full-link security control according to any one of claims 1 to 8; the cross-multi-layer network data transmission system based on full-link security control comprises: a network link detection module, configured to construct a first transmission link based on a node relationship pair having a data transmission association relationship in a cross-multi-layer network, and perform state detection on each first transmission link based on a detection data packet to obtain real-time state parameters of each first transmission link; a path construction module, configured to perform link screening based on a security attribute label obtained after security attribute analysis of to-be-transmitted data and the real-time state parameters of each first transmission link to obtain a second transmission link, and construct an initial traffic path from a source node to a destination node based on the second transmission link; a shared scheduling optimization module, configured to determine a target node having resource competition based on resource usage information of the source node and traffic occupation information of an intermediate node in the initial traffic path, and perform shared scheduling optimization on the initial traffic path based on the target node to obtain a target traffic path; a data transmission module, configured to transmit the to-be-transmitted data based on the target traffic path; wherein the shared scheduling optimization on the initial traffic path based on the target node to obtain the target traffic path comprises: segmenting the initial traffic path based on a path position of the target node in the initial traffic path to obtain a preceding sub-path and a subsequent sub-path; determine a load distribution demand value based on the node competition influence degree of the target node and the total data transmission amount of the initial service path in combination with a load distribution security threshold value; determine an access position of a distribution node based on a terminal node of the preceding sub-path and a starting node of the subsequent sub-path, and determine a candidate distribution node based on a size relationship between a residual resource capacity of each adjacent node in a network topology corresponding to the access position and the load distribution demand value; perform shared scheduling optimization on the preceding sub-path and the subsequent sub-path based on the candidate distribution node to obtain the target service path.

10. An electronic device, comprising: a memory for storing a computer software program; a processor for reading and executing the computer software program, wherein the processor, when executing the computer software program, implements the cross-multi-layer network data transmission method based on full-link security control according to any one of claims 1 to 8.

11. A non-transitory computer readable storage medium having stored therein a computer software program, characterized in that, the computer software program, when executed by the processor, implements the cross-multi-layer network data transmission method based on full-link security control according to any one of claims 1 to 8.

12. A computer program product comprising a computer program, characterized in that, the computer program, when executed by the processor, implements the cross-multi-layer network data transmission method based on full-link security control according to any one of claims 1 to 8.

Images