Traffic transmission method and device, computer equipment and readable storage medium

Abstract

The invention relates to the technical field of networks, in particular to a traffic transmission method and device, computer equipment and a readable storage medium. The method comprises the following steps: acquiring transmission time period information and transmission network information corresponding to flow to be transmitted in a communication network; wherein the communication network comprises a plurality of communication nodes, and according to transmission time period information, determining that each transmission sub-time period takes transmission network information as a constraint condition, and according to node information of each communication node when the communication network transmits the to-be-transmitted flow in each transmission sub-time period, determining a target transmission path corresponding to the to-be-transmitted flow; and transmitting the to-be-transmitted traffic based on the target transmission path.

Description

Technical Field

[0001] The present application relates to the field of network technology, and in particular to a traffic transmission method, apparatus, computer equipment and readable storage medium. Background Art

[0002] Large operators and cloud service providers have multiple data centers with different geographical distributions. These data centers often need to transmit a large amount of business data, and some services have deadlines, and the amount of data that must be transmitted must be completed within the specified time. The deadlines for these services are generally limited to a few hours or days, and their priority is between interactive traffic that is most sensitive to latency (for example, 100 milliseconds) and background traffic that does not have strict time requirements. By effectively utilizing network bandwidth resources in different time periods, network resource utilization can be improved without violating the transmission deadline regulations of the service.

[0003] Traditional traffic engineering technology does not consider network resources and network transmission in different time periods. It usually optimizes bandwidth allocation based on a certain objective function and cannot meet the requirements of completing data transmission before the deadline. Therefore, it is in urgent need of improvement. Summary of the invention

[0004] Based on this, it is necessary to provide a traffic transmission method, device, computer equipment and readable storage medium that can optimize the traffic transmission path in response to the above technical problems.

[0005] In a first aspect, the present application provides a traffic transmission method, the method comprising:

[0006] Acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes;

[0007] Determine each transmission sub-period according to the transmission period information;

[0008] Taking the transmission network information as a constraint condition, determining the target transmission path corresponding to the traffic to be transmitted according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0009] Based on the target transmission path, the traffic to be transmitted is transmitted.

[0010] In one embodiment, the transmission network information includes a communication cost requirement, a communication quality requirement, and a transmission start point and a transmission end point selected from the communication network.

[0011] In one embodiment, the target transmission path corresponding to the traffic to be transmitted is determined based on the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, with the transmission network information as a constraint condition, including:

[0012] Taking the transmission network information as a constraint condition, determining candidate transmission paths corresponding to the traffic to be transmitted from the communication network according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0013] According to the cost weight corresponding to the communication cost requirement and the quality weight corresponding to the communication quality requirement, a target transmission path corresponding to the flow to be transmitted is selected from each candidate transmission path.

[0014] In one embodiment, with the transmission network information as a constraint condition, determining candidate transmission paths corresponding to the traffic to be transmitted from the communication network according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period includes:

[0015] Constructing a time expansion graph of the communication network according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0016] Taking the transmission network information as the constraint condition, the time expansion graph is analyzed to generate candidate transmission paths corresponding to the traffic to be transmitted.

[0017] In one embodiment, the time expansion graph is analyzed with the transmission network information as a constraint condition to generate candidate transmission paths corresponding to the traffic to be transmitted, including:

[0018] Analyze the time extension diagram to generate optional paths for the traffic to be transmitted between the transmission start point and the transmission end point;

[0019] Selecting an alternative transmission path that meets communication cost requirements and communication quality requirements from the optional paths;

[0020] According to the path evaluation value of each candidate transmission path under the communication cost requirement and the communication quality requirement, candidate transmission paths corresponding to the to-be-transmitted traffic are selected from the candidate transmission paths.

[0021] In one embodiment, the transmission period information includes a transmission time starting point and a total transmission duration; and each transmission sub-period is determined according to the transmission period information, including:

[0022] Taking the transmission time starting point as the starting point, the total transmission time is evenly divided to obtain each transmission sub-period.

[0023] In one of the embodiments, the target transmission path includes each target node selected from each communication node and a traffic processing task corresponding to each target node;

[0024] The traffic processing task corresponding to any target node includes the traffic processing operation that the target node needs to perform on the traffic to be transmitted and the processing time corresponding to when the target node performs the traffic processing operation.

[0025] In one of the embodiments, the traffic processing operation is a transmission operation and a storage operation, and the node information includes a transmission state parameter and a storage state parameter;

[0026] Among them, the transmission status parameters include at least one of node communication cost, node available bandwidth, bandwidth utilization, network jitter and communication reliability; the storage status parameters include storage resource parameters.

[0027] In one of the embodiments, different traffic processing operations of the target node correspond to different processing moments, and each processing moment corresponds to a transmission sub-period.

[0028] In a second aspect, the present application also provides a flow transmission device, including:

[0029] An acquisition module, used to acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes;

[0030] Determine each transmission sub-period according to the transmission period information;

[0031] A path selection module is used to determine a target transmission path corresponding to the traffic to be transmitted based on the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, taking the transmission network information as a constraint condition;

[0032] The transmission module is used to transmit the traffic to be transmitted based on the target transmission path.

[0033] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0034] Acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes;

[0035] Determine each transmission sub-period according to the transmission period information;

[0036] Taking the transmission network information as a constraint condition, determining the target transmission path corresponding to the traffic to be transmitted according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0037] Based on the target transmission path, the traffic to be transmitted is transmitted.

[0038] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the following steps are implemented:

[0039] Acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes;

[0040] Determine each transmission sub-period according to the transmission period information;

[0041] Taking the transmission network information as a constraint condition, determining the target transmission path corresponding to the traffic to be transmitted according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0042] Based on the target transmission path, the traffic to be transmitted is transmitted.

[0043] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0044] Acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes;

[0045] Determine each transmission sub-period according to the transmission period information;

[0046] Taking the transmission network information as a constraint condition, determining the target transmission path corresponding to the traffic to be transmitted according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0047] Based on the target transmission path, the traffic to be transmitted is transmitted.

[0048] The above-mentioned traffic transmission method, device, computer equipment and readable storage medium obtain the transmission period information of the traffic to be transmitted, subdivide the transmission process into multiple transmission sub-periods, so that the allocation of network resources is more refined and dynamic. This helps to give priority to the transmission of high-priority traffic during time periods with low network load, thereby improving the overall transmission efficiency. Based on the transmission network information (such as network topology, link status, etc.) as a constraint condition, the optimal target transmission path is determined for the traffic to be transmitted in each transmission sub-period. This avoids network congestion and unnecessary transmission delays, further improves transmission efficiency, and optimizes the traffic transmission path. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0050] Figure 1 A schematic diagram of a flow chart of a traffic transmission method in an embodiment;

[0051] Figure 2 A schematic diagram of a flow chart of a step of determining a target transmission path corresponding to a flow to be transmitted in an embodiment;

[0052] Figure 3 A schematic diagram of a flow chart of a step of determining candidate transmission paths corresponding to traffic to be transmitted from a communication network in one embodiment;

[0053] Figure 4 A schematic diagram of a time expansion diagram in one embodiment;

[0054] Figure 5 A schematic diagram of a flow chart of steps for generating candidate transmission paths corresponding to traffic to be transmitted in one embodiment;

[0055] Figure 6 is a structural block diagram of a flow transmission device in an embodiment;

[0056] Figure 7 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0057] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0058] In an exemplary embodiment, Figure 1 As shown, a traffic transmission method is provided, and the method is applied to a computer device as an example for description, including the following S101 to S104. Among them:

[0059] S101, obtaining transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network.

[0060] The transmission period information refers to when the transmission of the traffic to be transmitted is planned to start, the duration of the transmission, and the possible transmission time window. The user can enter the start time, end time, and duration of the transmission through the interface or command line.

[0061] The communication network includes multiple communication nodes. The transmission network information includes key parameters such as the location, connection status, bandwidth capacity, delay, packet loss rate, etc. of all relevant nodes in the communication network, as well as communication cost requirements, communication quality requirements, and the selected transmission start and end points.

[0062] The way to obtain transmission network information is to use network management tools or protocols (such as SNMP, ICMP, etc.) to discover nodes and connection relationships in the network. Use real-time monitoring tools to obtain information such as the operating status, bandwidth utilization, delay, and packet loss rate of each node. According to business needs and network policies, analyze and determine the communication cost and quality requirements required for transmission. According to the specific requirements of the transmission task, select the appropriate transmission starting point and transmission end point. This is usually determined by user input or predefined policies.

[0063] S102: Determine each transmission sub-period according to the transmission period information.

[0064] Specifically, the entire transmission period is divided into multiple shorter, continuous or discontinuous time periods, each of which is a transmission sub-period. The purpose of dividing the transmission sub-periods is usually to better manage network resources, optimize transmission efficiency, meet different business needs or respond to changes in network conditions.

[0065] Optionally, the method for determining the transmission sub-period may include:

[0066] Method (1), uniform division: The transmission period is evenly divided into several sub-periods of equal length according to the total duration of the transmission and the number of sub-periods required. This method is suitable for scenarios where the transmission demand is relatively stable and the network conditions do not change much.

[0067] Method (2), on-demand division: dynamically adjust the length and number of sub-periods according to the specific transmission tasks and network conditions. For example, during periods of low network load, the length or number of sub-periods can be increased to fully utilize network resources; during periods of high network load, the length or number of sub-periods can be reduced to avoid network congestion.

[0068] Method (3) Division based on business needs: Consider the requirements of different business needs for transmission time periods, such as real-time performance, data volume, priority, etc. Different transmission sub-periods are divided according to different business needs, and corresponding network resources and transmission strategies are allocated to each sub-period.

[0069] Method (4), division considering network constraints: Combine the constraints of the transmission network information (such as bandwidth capacity, delay, packet loss rate, etc.) to determine the feasible transmission path and transmission rate in each transmission sub-period. When dividing the transmission sub-period, fully consider the network constraints to ensure the feasibility and efficiency of transmission.

[0070] S103, taking the transmission network information as a constraint condition, determining a target transmission path corresponding to the traffic to be transmitted according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period.

[0071] First, clarify the transmission goals, such as minimizing delay, maximizing bandwidth utilization, minimizing costs, etc. According to the transmission network information, set constraints, such as bandwidth limit, delay requirement, packet loss rate threshold, etc.

[0072] Then, mathematical methods (such as linear programming, nonlinear programming, integer programming, etc.) are used to build an optimization model. In the model, the choice of transmission path is represented as a decision variable, and the objectives and constraints are represented as mathematical expressions. The optimization model is solved using optimization algorithms (such as genetic algorithms, simulated annealing, particle swarm optimization, etc.). These algorithms can search the solution space to find solutions that meet all constraints and achieve a balance between the objectives. The solution found by the algorithm is evaluated to check whether it meets all constraints. If there are multiple Pareto optimal solutions, the most appropriate solution is selected as the target transmission path according to specific needs.

[0073] S104: Transmit the traffic to be transmitted based on the target transmission path.

[0074] Specifically, each data packet or stream in the transmission traffic is encapsulated and necessary header information is added, such as source address, destination address, sequence number, checksum, etc., to ensure the integrity and identifiability of the data during transmission.

[0075] Use appropriate transport protocols (such as TCP, UDP, etc.) to control the transmission of traffic. TCP provides reliable, connection-oriented transmission services, which are suitable for scenarios that need to ensure the integrity and order of data transmission; while UDP provides connectionless, unreliable transmission services, which are suitable for scenarios that are sensitive to delays or have high real-time requirements. According to network conditions and transmission requirements, the transmission rate and window size are dynamically adjusted to avoid network congestion and packet loss.

[0076] Along the target transmission path, each node forwards the data packet or flow to the next node according to the routing table or forwarding strategy. During the forwarding process, the node may perform some additional processing, such as packet filtering, security checks, load balancing, etc. During the transmission process, the network status and traffic transmission are continuously monitored, including indicators such as bandwidth utilization, latency, and packet loss rate. If an abnormal situation is found (such as network congestion, node failure, link interruption, etc.), timely fault handling measures are taken, such as rerouting, traffic redistribution, and enabling backup paths.

[0077] When all packets or flows are successfully transmitted to the destination node, the transmission process is completed. The destination node can send a confirmation message to the source node to confirm the successful reception of the traffic. Subsequent data processing or interaction can be carried out between the source node and the destination node as needed.

[0078] In the above-mentioned traffic transmission method, by obtaining the transmission period information of the traffic to be transmitted, the transmission process is subdivided into multiple transmission sub-periods, making the allocation of network resources more refined and dynamic. This helps to give priority to the transmission of high-priority traffic during time periods with low network load, thereby improving the overall transmission efficiency. Based on the transmission network information (such as network topology, link status, etc.) as a constraint condition, the optimal target transmission path is determined for the traffic to be transmitted in each transmission sub-period. This avoids network congestion and unnecessary transmission delays, further improves transmission efficiency, and optimizes the traffic transmission path.

[0079] In an exemplary embodiment, the transmission network information includes a communication cost requirement, a communication quality requirement, and a transmission start point and a transmission end point selected from the communication network.

[0080] It can be understood that the communication cost requirement refers to reducing the costs incurred during the communication process as much as possible while meeting the data transmission requirements. Communication costs may include multiple aspects, such as: Network usage fees: based on data transmission volume, transmission duration, or specific network service fees. Equipment costs: including the purchase and maintenance costs of hardware equipment such as routers, switches, and transmission media (such as optical fiber, twisted pair). Energy costs: The cost of electricity consumed by equipment operation. Human cost: The cost of human resources required for network planning, maintenance, and management.

[0081] It is understandable that the communication quality requirements focus on the reliability, efficiency, security and other performance indicators during the data transmission process. These requirements may include: Reliability: ensuring that data is not lost or damaged during transmission and can reach the target node intact and accurately. Efficiency: improving data transmission speed and reducing transmission delay to meet real-time requirements. Security: protecting data from being intercepted or tampered with by unauthorized third parties during transmission. Other performance indicators: such as bandwidth utilization, jitter, packet loss rate, etc., which together determine the overall quality of data transmission.

[0082] Furthermore, the transmission starting point and transmission end point are the starting and ending positions of the data transmission path. Their positions in the network have an important impact on the path selection, cost and quality of data transmission. Among them, the transmission starting point: is usually the source of data, which can be a server, computer, sensor and other devices. When selecting the transmission starting point, it is necessary to consider factors such as its network access capability and data processing capability. The transmission end point: is the destination of data transmission and the receiver of the data. When selecting the transmission end point, it is necessary to ensure that it can reliably receive and process the transmitted data.

[0083] Correspondingly, such as Figure 2 As shown, with the transmission network information as a constraint condition, according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, the target transmission path corresponding to the traffic to be transmitted is determined, including:

[0084] S201, taking the transmission network information as a constraint condition, and according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, determining each candidate transmission path corresponding to the traffic to be transmitted from the communication network.

[0085] The determination of candidate transmission paths may involve multiple factors, including: 1) Feasibility of the path: Ensure that all nodes and links on the path are available for data transmission. 2) Bandwidth and latency of the path: Select a path with sufficient bandwidth and low latency. 3) Cost of the path: Consider the communication cost of each node and link on the path. 4) Reliability of the path: Evaluate the stability and reliability of each node and link on the path.

[0086] S202 , selecting a target transmission path corresponding to the to-be-transmitted traffic from each candidate transmission path according to a cost weight corresponding to the communication cost requirement and a quality weight corresponding to the communication quality requirement.

[0087] Specifically, according to the importance of communication cost and quality, corresponding weights are assigned to cost and quality. These weights can reflect the organization's preference for cost and quality. Each candidate transmission path is scored, and the score may be based on factors such as the path's bandwidth, delay, cost, reliability, etc., and is calculated in combination with the assigned weights. Based on the scoring results, the path with the highest score or that meets a specific threshold is selected as the target transmission path.

[0088] In this embodiment, through steps S201 and S202, the target transmission path corresponding to the to-be-transmitted traffic can be determined by taking the transmission network information as a constraint condition and combining the situation of the communication network in each transmission sub-period. This method helps to optimize the utilization of network resources and reduce communication costs while meeting communication needs.

[0089] In an exemplary embodiment, Figure 3As shown, with the transmission network information as a constraint condition, according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, each candidate transmission path corresponding to the traffic to be transmitted is determined from the communication network, including:

[0090] S301, constructing a time expansion graph of the communication network according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period.

[0091] It is understandable that if Figure 4 As shown, the time expansion graph refers to a graph established based on the network status (topology, node capacity, node resources, etc.) of different sub-periods, where the sub-graph of each transmission sub-period corresponds to the network status within the transmission sub-period. In the same transmission sub-period, the edge of the topology in the graph is a transmission edge, indicating that it has transmission capability. Between adjacent transmission sub-periods, the same node can have a connection, indicating the resource service capability of the node, such as a storage edge, indicating that the node has storage capability between these two sub-periods.

[0092] In an exemplary embodiment, the transmission period information includes a transmission time starting point and a total transmission duration; based on the transmission period information, each transmission sub-period is determined, including: taking the transmission time starting point as the starting point, the total transmission duration is evenly divided to obtain each transmission sub-period.

[0093] In this embodiment, the transmission period can be evenly and reasonably divided by the average segmentation method, which is suitable for scenarios where data needs to be transmitted in a scheduled or segmented manner. Of course, in actual applications, the division method of the sub-periods can also be adjusted according to specific needs, such as dynamically adjusting the length of each sub-period according to factors such as the amount of data and changes in network conditions.

[0094] Correspondingly, the target transmission path includes each target node selected from each communication node and a flow processing task corresponding to each target node; wherein the flow processing task corresponding to any target node includes a flow processing operation that the target node needs to perform on the flow to be transmitted and a processing time corresponding to when the target node performs the flow processing operation. Different flow processing operations of the target node correspond to different processing times, and each processing time corresponds to a transmission sub-period.

[0095] It can be understood that the target transmission path is a route that defines the nodes and links that the traffic passes through from the starting point to the end point. It includes the target nodes carefully selected from all communication nodes and the traffic processing tasks that these nodes need to perform.

[0096] Destination nodes are key communication points on the transmission path, which are responsible for specific processing of received traffic. These nodes may be routers, switches, servers, firewalls, etc., depending on the network architecture and traffic processing requirements.

[0097] Traffic processing tasks: For each target node, the specific processing operations it needs to perform on the traffic are defined. These operations may include routing, data encapsulation / decapsulation, filtering, conversion, encryption / decryption, etc. In addition to the processing operations, the corresponding processing moments when these operations are performed are also specified. This can be a time-based trigger (such as scheduled processing) or an event or condition-based trigger (such as processing when the traffic reaches a certain threshold).

[0098] Processing time: This refers to the specific time point or time range when the target node performs traffic processing operations. It may be predefined (such as data processing at 3 am every day) or dynamically determined (such as adjusting the processing time according to real-time network conditions).

[0099] In this embodiment, the target transmission path not only plans the transmission route of the traffic, but also clarifies the specific processing tasks of each target node and the time points for executing these tasks. Such a design helps to ensure that the traffic is efficiently and accurately transmitted and processed in the network while meeting specific security, performance and reliability requirements. In actual applications, it may be necessary to comprehensively determine the target transmission path and node processing tasks based on multiple factors such as network topology, business requirements, and security policies.

[0100] Among them, the traffic processing operations are transmission operations and storage operations, and the node information includes transmission status parameters and storage status parameters; among them, the transmission status parameters include at least one of the node communication cost, node available bandwidth, bandwidth utilization, network jitter and communication reliability; the storage status parameters include storage resource parameters.

[0101] Among them, transmission operation: This usually refers to the node forwarding, routing or switching the received traffic to ensure that the traffic can reach the next target node or the final destination along the predetermined path. Storage operation: In some cases, the target node may need to temporarily or long-term store the traffic data for subsequent processing, analysis or backup.

[0102] Among them, node information: In order to effectively manage and optimize the target transmission path, we need to obtain and monitor the status information of each target node. Transmission status parameters: These parameters reflect the performance and status of the node in terms of transmission, including but not limited to the node communication cost (i.e. the cost or resource consumption required to transmit data), node available bandwidth (the maximum transmission rate that the current node can provide), bandwidth utilization (the ratio of currently used bandwidth to total bandwidth), network jitter (the change in transmission delay, which affects the stability of communication) and communication reliability (the accuracy and integrity of data transmission). Storage status parameters: This type of parameters mainly focuses on the storage capacity of the node, especially the storage resource parameters, which indicate the storage space currently available to the node and the utilization of storage resources.

[0103] In this embodiment, by collecting and analyzing this node information, we can better understand the overall performance and status of the target transmission path, so as to make more intelligent decisions to optimize traffic transmission. For example, we can adjust the traffic distribution strategy according to the available bandwidth and bandwidth utilization of the node to avoid network congestion; or decide whether to perform storage operations on a certain node according to storage resource parameters to ensure data security and accessibility.

[0104] Exemplarily, the process of constructing the time expansion graph is as follows: obtain relevant information of the business from the business scheduling system. A business can be modeled as {starting point s, end point t, amount of data to be transmitted Q, deadline T, other resource requirements (such as computing power)}.

[0105] Based on the network status of each transmission sub-period (the available amount of relevant resources in the network status is determined by the inherent resource amount minus the allocated service occupied resources, the relevant cost can be determined by the historical actual operation cost, and the topology can be obtained from the controller), for a service demand with a transmission deadline of T, a time expansion graph is established, such as Figure 4 The transmission sub-period granularity of the time expansion diagram is τ (τ depends on the operator, for example, τ can be set to 1 hour), and the time expansion diagram starts from T1=1τ, indicating the first transmission sub-period. Sure, Indicates rounding up.

[0106] In each transmission sub-period, each transmission edge of the topology (solid line edge in the figure) has multi-factor attributes, such as Figure 4As shown, the multi-factor attributes set in this embodiment include available bandwidth, bandwidth utilization, and cost, and more attributes can be considered, such as jitter and reliability; the node intra-resource edge across the transmission sub-period (the dotted edge in the figure) indicates that the node can cache traffic, but it is not necessarily only used for caching, and more or more detailed resource attributes can also be considered, such as GPU, CPU and other computing resources. No specific value is set for the node intra-resource edge here, because in the wide area network that often connects data centers, the link bandwidth is the bottleneck, and the data center nodes have strong data processing capabilities.

[0107] S302, taking the transmission network information as a constraint condition, analyzing the time expansion graph, and generating candidate transmission paths corresponding to the traffic to be transmitted.

[0108] Specifically, based on the established time expansion graph, a multi-factor path calculation algorithm is used to calculate the optimal path (set) from the starting point (s1, s2, ..., sN) to the end point (t1, t2, ..., tN) corresponding to the same transmission sub-period or a later time, that is, the optimal path (set) from s1 to t1, t2, ..., tN, s2 to t2, ..., tN, and so on, from sN to tN is calculated.

[0109] It can be understood that, as shown in the figure, due to time constraints, when the starting point is s1 (i.e., transmission starts in the T1 transmission sub-period), the destination end point can be (t1, t2, ..., tN), that is, it is possible to complete the transmission and reach the end point in the T1 transmission sub-period, or it is possible to complete the transmission and reach the end point in the T2, T3, ..., TN transmission sub-period. When the starting point is s2 (i.e., transmission starts in the T2 transmission sub-period), the destination end point can only be (t2, t3..., tN), not t1, because it is already the T2 transmission sub-period at this time and cannot return to the T1 transmission sub-period. After calculating the optimal path (set), it is screened according to the business constraints to select the most suitable path, and the transmission bandwidth required for the path is determined according to the bandwidth of Q / τ, and other resources required to be occupied on the path are determined according to business needs.

[0110] According to the calculated traffic scheduling scheme, the transmission action of the traffic to be transmitted is executed, and the remaining bandwidth and other resources of each transmission sub-period are updated at the same time. For multiple services, traffic is scheduled for the services according to the order in which the services arrive and the first-in-first-out logic. New service information is obtained from the service scheduling, and the above steps are repeated to allocate bandwidth and other resources for each transmission sub-period for the new service.

[0111] Further, such as Figure 5 As shown, with the transmission network information as the constraint condition, the time expansion graph is analyzed to generate candidate transmission paths corresponding to the traffic to be transmitted, including:

[0112] S501, analyzing the time extension diagram to generate optional paths for the traffic to be transmitted between the transmission start point and the transmission end point.

[0113] Specifically, when analyzing the time extension diagram, a multi-factor path calculation algorithm can be used.

[0114] Among them, the optional path refers to one or more potential transmission paths from the transmission starting point to the transmission end point under certain constraints (such as transmission time, bandwidth requirements, network reliability, etc.). These paths are represented as different link combinations connecting the starting point and the end point in the network topology diagram.

[0115] It can be understood that multi-factor path calculation refers to considering multiple attributes of the topological edges, such as cost, bandwidth, bandwidth utilization, etc., and comprehensively calculating multiple factors to calculate the optimal path (Pareto optimal path set) between the business starting point and the business destination.

[0116] Domination means: when a network link has multiple factors, if all factor values ​​of a path are not worse than all factor values ​​of another path, and at least one factor value is better, then the path is said to dominate the other path.

[0117] The Pareto optimal path set means: given a starting node and a destination node, all paths between the two points that do not dominate each other are calculated. These paths constitute the Pareto optimal path set about the two points, that is, the multi-factor optimal path set. For simplicity, the Pareto optimal path set from the starting point to the destination node is called the Pareto optimal path set of the destination node.

[0118] The Pareto optimality constraint means that when the factor value is positive, the continued expansion of the path will only lead to worse and worse values ​​of each factor of the path. Therefore, if a path is dominated by a certain path set, no matter how the path continues to expand, it will still be dominated by the path set.

[0119] S502: Select an alternative transmission path that meets communication cost requirements and communication quality requirements from the optional paths.

[0120] Among them, communication cost refers to the cost incurred during data transmission, which may include bandwidth usage fees, node processing fees, transmission distance fees, etc. When selecting an alternative transmission path, we need to consider these factors comprehensively to ensure that the total communication cost of the selected path is within an acceptable range.

[0121] Communication quality refers to the performance indicators during data transmission, such as transmission delay, packet loss rate, bandwidth utilization, network jitter, etc. These indicators directly affect the efficiency and reliability of data transmission. Therefore, when selecting an alternative transmission path, we must ensure that the selected path can meet specific communication quality requirements, such as low latency and high reliability.

[0122] A comprehensive evaluation of all previously generated optional paths is required. This includes calculating the communication cost of each path and measuring its communication quality indicators; next, the evaluated optional paths are screened according to the preset communication cost requirements and communication quality requirements. Only those paths that meet both requirements will be selected as alternative transmission paths. If there are multiple alternative transmission paths that meet the requirements, we can sort them according to actual needs. For example, we can sort them from low to high according to communication cost, or from high to low according to communication quality. Then, according to the sorting results, select the best one or several paths as the final transmission path.

[0123] S503 , selecting candidate transmission paths corresponding to the to-be-transmitted traffic from the candidate transmission paths according to the path evaluation value of each candidate transmission path under the communication cost requirement and the communication quality requirement.

[0124] Optionally, it is first necessary to calculate a communication cost evaluation value for each alternative transmission path. This usually involves adding up the communication costs (such as bandwidth costs, processing costs, etc.) of each node on the path to obtain the communication cost of the entire path. The lower the communication cost evaluation value, the better the path performs in terms of economy. Next, evaluate the communication quality of each alternative transmission path. This usually includes measuring key indicators such as the transmission delay, packet loss rate, bandwidth utilization, and network jitter of the path. The higher the communication quality evaluation value, the better the path is in terms of transmission efficiency and reliability.

[0125] After determining the communication cost evaluation value and communication quality evaluation value of each candidate transmission path, we can assign corresponding weights to these two evaluation values ​​according to actual needs. Then, we use weighted summation or other multi-criteria decision analysis methods to comprehensively consider the performance of each path in terms of communication cost and communication quality, so as to calculate the comprehensive evaluation value of each path. We sort the candidate transmission paths according to the comprehensive evaluation value, and select the top-ranked paths as the candidate transmission paths corresponding to the traffic to be transmitted.

[0126] Further, according to the path evaluation value of each candidate transmission path under the communication cost requirement and the communication quality requirement, each candidate transmission path corresponding to the to-be-transmitted traffic is selected from each candidate transmission path, including:

[0127] For each candidate transmission path, we need to calculate its path evaluation value under the communication cost requirement and communication quality requirement. Quantify the communication cost: Calculate the communication cost of the entire path based on the communication cost parameters of each node on the path (such as transmission fee, resource consumption, etc.). Quantify the communication quality: Similarly, comprehensively evaluate the communication quality of the entire path based on the communication quality parameters of each node on the path (such as reliability, delay, jitter, etc.). Comprehensive score: Combine the quantified results of communication cost and communication quality to obtain a path evaluation value. This evaluation value can be a simple weighted sum or a more complex function form, depending on the specific application scenario and requirements. After calculating the path evaluation values ​​of all candidate transmission paths, we can select the candidate transmission path corresponding to the traffic to be transmitted based on the evaluation value. This usually involves the following steps: Sort all candidate transmission paths according to the path evaluation value, from high to low or from low to high, depending on whether the evaluation indicator is positive or negative (i.e., the higher the evaluation value, the better or the lower the better). According to the sorting results, select several paths with the best (or worst, depending on the requirements) evaluation values ​​as candidate transmission paths. The number of candidate paths can be determined based on actual needs and network conditions.

[0128] In an exemplary embodiment, a traffic transmission method is provided, including:

[0129] A service to be allocated is obtained from the service scheduling system. The information of the service is as follows: {starting point s, end point t, data volume to be transmitted 100 GB, deadline 3 hours}.

[0130] Specifically, the time period τ is set to 1 hour, so a time expansion diagram of three time periods is established, such as Figure 3As shown in the figure, this service only needs to be transmitted, so the resources in the node only consider storage. Now it is necessary to find the multi-factor optimal path in this time expansion graph. A suitable multi-factor path calculation method can be used, such as a label correction method or a label setting method. Here, a more efficient algorithm based on breadth-first search and Pareto optimal condition pruning in the label correction method is used for path finding. The algorithm uses a queue to store the path to be expanded in the path calculation process and traverses the path between the starting point and the end point. For each node in the topology of the graph, the Pareto optimal path set from the starting point to the node is stored. During the path traversal process, the path is pushed into the queue, and the previously stored path is popped out of the queue. According to the topological connection relationship, all the end nodes of the path are found to form a new path. The Pareto optimal path set of the new path and the end node of the new path and the Pareto optimal path set of the end point are dominated and judged to determine whether the new path needs to be further expanded, and the path that needs to be further expanded is pushed into the queue. By continuously traversing the path by queueing and dequeuing, the path is pruned using the Pareto optimality constraint until the queue is empty. The multi-factor path calculation is completed and the multi-factor optimal path set from the starting point s to the end point t (s1 to t1, t2, t3; s2 to t2, t3; s3 to t3) is output: Path 1 ['s1', 'B1', 'B2', 'C2', 'C3', 't3'], available bandwidth 500Mbps, maximum link bandwidth utilization in the path 50%, normalized cost 0.3; Path 2 ['s1', 'B1', 'C1', 'C2', 't2'], available bandwidth 800Mbps, maximum bandwidth utilization in the path 20%, normalized cost 1.1. At this moment, if the cost is considered more important, then path 1 is selected. If you want to achieve better load balancing, you can choose a link with lower bandwidth utilization, then path 2 is selected. Assume that path 1 is selected. According to the required transmission data volume Q = 100GB, the required bandwidth for each time slot τ of the path is Q / τ = 100GB / 1 hour = 227.5Mbps. Path 1 ['s1', 'B1', 'B2', 'C2', 'C3', 't3'], the available bandwidth is 500Mbps. Remove 227.5Mbps of bandwidth capacity from each transmission link of the path, and update the network status. And feed back the scheduling results to the business scheduling system. The business scheduling system performs traffic scheduling according to the scheduling result path 1 ['s1', 'B1', 'B2', 'C2', 'C3', 't3'] transmission rate of 226.5Mbps, and updates the network status, that is, in the first hour, it is transmitted from node s to node B, node B stores the transmission data volume, and in the second hour, it is transmitted from node B to node C. It is cached at node C and transmitted from node C to the end point t in the third hour. Next, new service information and network status are obtained from the service scheduling system (the link BC capacity is changed to 500Mbps-227.5=272.5Mbps), and the above steps are continued to calculate the traffic scheduling plan for the new service.

[0131] Furthermore, the above process only shows the storage capacity of the node. You can also consider other resource service capabilities of the node, such as computing power resources. You can consider more resources by expanding the factor attributes of the storage edge. At the same time, in the above example, considering the situation where node resources are sufficient, you can introduce more specific values ​​in the storage edge to distinguish the resource conditions of each node. In the multi-factor path calculation process, you can also consider the resource utilization, and further improve resource utilization.

[0132] It should be understood that, although the steps in the flowcharts involved in the above embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above embodiments may include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0133] Based on the same inventive concept, the embodiment of the present application also provides a flow transmission device for implementing the flow transmission method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more flow transmission device embodiments provided below can refer to the limitations on the flow transmission method above, and will not be repeated here.

[0134] In an exemplary embodiment, Figure 6 As shown, a flow transmission device is provided, including: an acquisition module 11, a time period division module, a path selection module and a transmission module, wherein:

[0135] The acquisition module 11 is used to acquire the transmission period information and the transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes;

[0136] The time period division module 12 is used to determine each transmission sub-time period according to the transmission time period information;

[0137] The path selection module 13 is used to determine the target transmission path corresponding to the traffic to be transmitted based on the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, taking the transmission network information as a constraint condition;

[0138] The transmission module 14 is used to transmit the traffic to be transmitted based on the target transmission path.

[0139] In one embodiment, the transmission network information includes a communication cost requirement, a communication quality requirement, and a transmission start point and a transmission end point selected from the communication network.

[0140] In one embodiment, the path selection module 13 is used to determine each candidate transmission path corresponding to the traffic to be transmitted from the communication network according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, taking the transmission network information as a constraint condition;

[0141] According to the cost weight corresponding to the communication cost requirement and the quality weight corresponding to the communication quality requirement, a target transmission path corresponding to the flow to be transmitted is selected from each candidate transmission path.

[0142] In one embodiment, the path selection module 13 is used to construct a time expansion diagram of the communication network according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0143] Taking the transmission network information as the constraint condition, the time expansion graph is analyzed to generate candidate transmission paths corresponding to the traffic to be transmitted.

[0144] In one embodiment, the path selection module 13 is used to analyze the time extension diagram to generate an optional path for the transmission of the traffic to be transmitted between the transmission start point and the transmission end point;

[0145] Selecting an alternative transmission path that meets communication cost requirements and communication quality requirements from the optional paths;

[0146] According to the path evaluation value of each candidate transmission path under the communication cost requirement and the communication quality requirement, candidate transmission paths corresponding to the to-be-transmitted traffic are selected from the candidate transmission paths.

[0147] In one embodiment, the time period division module 12 is used to divide the total transmission time evenly with the transmission time starting point as the starting point to obtain each transmission sub-time period.

[0148] In one of the embodiments, the target transmission path includes each target node selected from each communication node and a traffic processing task corresponding to each target node;

[0149] The traffic processing task corresponding to any target node includes the traffic processing operation that the target node needs to perform on the traffic to be transmitted and the processing time corresponding to when the target node performs the traffic processing operation.

[0150] In one of the embodiments, the traffic processing operation is a transmission operation and a storage operation, and the node information includes a transmission state parameter and a storage state parameter;

[0151] Among them, the transmission status parameters include at least one of node communication cost, node available bandwidth, bandwidth utilization, network jitter and communication reliability; the storage status parameters include storage resource parameters.

[0152] In one of the embodiments, different traffic processing operations of the target node correspond to different processing moments, and each processing moment corresponds to a transmission sub-period.

[0153] Each module in the above-mentioned traffic transmission device can be implemented in whole or in part by software, hardware and a combination thereof. Each of the above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory in the computer device in the form of software, so that the processor can call and execute the operations corresponding to each of the above modules.

[0154] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 7 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. Among them, the processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data of the traffic transmission method. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a traffic transmission method is implemented.

[0155] Those skilled in the art will understand that Figure 7 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0156] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0157] Acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes;

[0158] Determine each transmission sub-period according to the transmission period information;

[0159] Taking the transmission network information as a constraint condition, determining the target transmission path corresponding to the traffic to be transmitted according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0160] Based on the target transmission path, the traffic to be transmitted is transmitted.

[0161] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0162] Acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes;

[0163] Determine each transmission sub-period according to the transmission period information;

[0164] Taking the transmission network information as a constraint condition, determining the target transmission path corresponding to the traffic to be transmitted according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0165] Based on the target transmission path, the traffic to be transmitted is transmitted.

[0166] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:

[0167] Acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes;

[0168] Determine each transmission sub-period according to the transmission period information;

[0169] Taking the transmission network information as a constraint condition, determining the target transmission path corresponding to the traffic to be transmitted according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period;

[0170] Based on the target transmission path, the traffic to be transmitted is transmitted.

[0171] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0172] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0173] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A traffic transmission method, It is characterized in that The method comprises: Acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes; Determine each transmission sub-period according to the transmission period information; Taking the transmission network information as a constraint condition, determining a target transmission path corresponding to the traffic to be transmitted according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period; Based on the target transmission path, the traffic to be transmitted is transmitted.

2. The method according to claim 1, It is characterized in that The transmission network information includes communication cost requirements, communication quality requirements, and a transmission start point and a transmission end point selected from the communication network.

3. The method according to claim 2, It is characterized in that The determining, using the transmission network information as a constraint condition and according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, a target transmission path corresponding to the traffic to be transmitted comprises: Taking the transmission network information as a constraint condition, determining candidate transmission paths corresponding to the traffic to be transmitted from the communication network according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period; According to the cost weight corresponding to the communication cost requirement and the quality weight corresponding to the communication quality requirement, a target transmission path corresponding to the to-be-transmitted traffic is selected from each candidate transmission path.

4. The method according to claim 3, It is characterized in that The determining, using the transmission network information as a constraint condition and according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, each candidate transmission path corresponding to the traffic to be transmitted from the communication network includes: Constructing a time expansion graph of the communication network according to the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period; Taking the transmission network information as a constraint condition, the time expansion graph is analyzed to generate candidate transmission paths corresponding to the traffic to be transmitted.

5. The method according to claim 4, It is characterized in that The step of analyzing the time expansion graph based on the transmission network information as a constraint condition to generate candidate transmission paths corresponding to the traffic to be transmitted includes: Analyze the time extension diagram to generate an optional path for the traffic to be transmitted between the transmission starting point and the transmission end point; Selecting an alternative transmission path that meets the communication cost requirement and the communication quality requirement from the optional paths; According to the path evaluation value of each candidate transmission path under the communication cost requirement and the communication quality requirement, candidate transmission paths corresponding to the to-be-transmitted traffic are selected from the candidate transmission paths.

6. The method according to claim 1, It is characterized in that The transmission period information includes the transmission time starting point and the total transmission time; The determining each transmission sub-period according to the transmission period information includes: Taking the transmission time starting point as the starting point, the total transmission duration is evenly divided to obtain each transmission sub-period.

7. The method according to claim 1, It is characterized in that The target transmission path includes each target node selected from each communication node and a flow processing task corresponding to each target node; Among them, the traffic processing task corresponding to any target node includes the traffic processing operation that the target node needs to perform on the to-be-transmitted traffic and the processing time corresponding to when the target node performs the traffic processing operation.

8. The method according to claim 7, It is characterized in that The traffic processing operation is a transmission operation and a storage operation, and the node information includes a transmission state parameter and a storage state parameter; The transmission status parameters include at least one of node communication cost, node available bandwidth, bandwidth utilization, network jitter and communication reliability; and the storage status parameters include storage resource parameters.

9. The method according to claim 8, It is characterized in that Different traffic processing operations of the target node correspond to different processing moments, and each processing moment corresponds to a transmission sub-period.

10. A flow transmission device, It is characterized in that The device comprises: An acquisition module, used to acquire transmission period information and transmission network information corresponding to the traffic to be transmitted in the communication network; wherein the communication network includes a plurality of communication nodes; A time period division module, used to determine each transmission sub-time period according to the transmission time period information; A path selection module, used to determine a target transmission path corresponding to the traffic to be transmitted based on the node information of each communication node when the communication network transmits the traffic to be transmitted in each transmission sub-period, taking the transmission network information as a constraint condition; A transmission module is used to transmit the traffic to be transmitted based on the target transmission path.

11. A computer device comprising a memory and a processor, wherein the memory stores a computer program. It is characterized in that When the processor executes the computer program, the steps of the method according to any one of claims 1 to 9 are implemented.

12. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 9 are implemented.

13. A computer program product comprising a computer program, It is characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 9 are implemented.

Images