Flow scheduling method based on multistage link transmission, medium, equipment and product

By configuring and optimizing traffic scheduling strategies in multi-level links, the local optimal problem caused by single-level link scheduling is solved, and global optimal network traffic scheduling is achieved, which improves bandwidth resource utilization and reduces costs.

CN118972330APending Publication Date: 2024-11-15BEIJING VOLCANO ENGINE TECH CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411195140.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-28
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

The existing network traffic scheduling methods only consider single-level links, which leads to a lack of a global perspective on the traffic scheduling strategy, which may lead to higher bandwidth costs after selecting low-priced servers for service traffic, making it impossible to achieve global optimal scheduling.

Method used

By configuring traffic scheduling policies in multi-level links, building a logical constraint model, determining the target policy parameters of each traffic scheduling policy, realizing coordinated scheduling between adjacent links, and optimizing traffic scheduling parameters to achieve global optimization.

Benefits of technology

All traffic scheduling strategies are comprehensively considered in multi-level links to achieve global optimal scheduling, improve bandwidth resource utilization, and reduce user bandwidth usage costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118972330A_ABST
    Figure CN118972330A_ABST
Patent Text Reader

Abstract

The invention relates to a flow scheduling method based on multi-level link transmission, a medium, equipment and a product, and relates to the technical field of computers, in the method, target service flow is transmitted through multi-level links, and a flow scheduling strategy is configured between any two adjacent levels of links in the multi-level links. According to a flow scheduling strategy configured between two adjacent links, a logic constraint model corresponding to the flow scheduling strategy is constructed, and then based on the logic constraint model, a target strategy parameter corresponding to each flow scheduling strategy in the multi-level links is determined. And then traffic scheduling is carried out on the target service traffic according to the target policy parameters corresponding to the traffic scheduling policies, so that all the traffic scheduling policies can be comprehensively considered in a multi-level link to carry out scheduling decision making, and all the traffic scheduling policies can be cooperatively scheduled. And optimizing strategy parameters of all traffic scheduling strategies in a global view of traffic scheduling.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular, to a traffic scheduling method, medium, device and product based on multi-stage link transmission. Background Art

[0002] In related technologies, network traffic scheduling generally only considers transmission on a single-stage link, and does not involve coordinated scheduling between different traffic scheduling strategies in multi-stage links. When only single-stage links are considered for separate decision-making, the traffic scheduling strategy lacks a global perspective and falls into the problem of local optimality. For example, when business traffic selects a low-priced DCDN (Distributed Cache and Delivery Network) server, it may cause the business traffic to subsequently select a core computer room with higher bandwidth costs. Therefore, there is an urgent need to improve the way network traffic scheduling is used to achieve global optimal scheduling, improve bandwidth resource utilization, and reduce users' bandwidth usage costs. Summary of the invention

[0003] This summary is provided to introduce concepts in a brief form that will be described in detail in the detailed description below. This summary is not intended to identify key features or essential features of the claimed technical solution, nor is it intended to limit the scope of the claimed technical solution.

[0004] In a first aspect, the present disclosure provides a traffic scheduling method based on multi-stage link transmission, comprising:

[0005] Obtaining target service traffic, wherein the target service traffic is transmitted through a corresponding multi-level link, and a traffic scheduling strategy is configured between any two adjacent links in the multi-level link, wherein the traffic scheduling strategy is used to indicate a policy parameter for allocating service traffic from an upper link in the adjacent two-level links to a lower link;

[0006] According to the traffic scheduling strategy configured between two adjacent links, a logical constraint model corresponding to the traffic scheduling strategy is constructed, wherein the logical constraint model is used to represent the association between the egress service flow of the upper link, the ingress service flow of the lower link and the policy parameters corresponding to the traffic scheduling strategy;

[0007] Based on the logical constraint model, determining the target policy parameters corresponding to each traffic scheduling policy in the multi-stage link;

[0008] The target service traffic is traffic scheduled according to the target policy parameters corresponding to each of the traffic scheduling policies.

[0009] In a second aspect, the present disclosure provides a traffic scheduling device based on multi-stage link transmission, comprising:

[0010] An acquisition module is configured to acquire target service traffic, wherein the target service traffic is transmitted through a corresponding multi-level link, and a traffic scheduling strategy is configured between any two adjacent links in the multi-level link, wherein the traffic scheduling strategy is used to indicate a policy parameter for allocating service traffic from an upper link in the adjacent two-level link to a lower link;

[0011] A model building module is configured to construct a logical constraint model corresponding to the traffic scheduling strategy configured between two adjacent links, wherein the logical constraint model is used to represent the association between the egress service flow of the upper link, the ingress service flow of the lower link and the policy parameters corresponding to the traffic scheduling strategy;

[0012] A determination module is configured to determine the target policy parameters corresponding to each traffic scheduling policy in the multi-stage link based on the logical constraint model;

[0013] The scheduling module is configured to perform traffic scheduling on the target business traffic according to the target policy parameters corresponding to each of the traffic scheduling policies.

[0014] In a third aspect, the present disclosure provides a computer-readable medium having a computer program stored thereon, which, when executed by a processing device, implements the steps of the method described in the first aspect.

[0015] In a fourth aspect, the present disclosure provides an electronic device, including:

[0016] a storage device having a computer program stored thereon;

[0017] A processing device is used to execute the computer program in the storage device to implement the steps of the method described in the first aspect.

[0018] In a fifth aspect, the present disclosure provides a computer program product, including a computer program, which implements the steps of the method described in the first aspect when executed by a processor.

[0019] Based on the above technical solution, the target business traffic is transmitted through multi-level links, and a traffic scheduling strategy is configured between any two adjacent links in the multi-level links. By obtaining the target business traffic and building a logical constraint model corresponding to the traffic scheduling strategy according to the traffic scheduling strategy configured between the two adjacent links, the target policy parameters corresponding to each traffic scheduling strategy in the multi-level links are determined based on the logical constraint model, and then the target business traffic is scheduled according to the target policy parameters corresponding to each traffic scheduling strategy. All traffic scheduling strategies can be comprehensively considered in the multi-level links for scheduling decisions, so that all traffic scheduling strategies can be coordinated and scheduled, and the policy parameters of all traffic scheduling strategies are optimized in the global perspective of traffic scheduling, so that the obtained target policy parameters can enable traffic scheduling to achieve global optimization.

[0020] Other features and advantages of the present disclosure will be described in detail in the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and the originals and elements are not necessarily drawn to scale. In the drawings:

[0022] Figure 1 is a schematic diagram of a multi-stage link according to some embodiments.

[0023] Figure 2 It is a flowchart of a traffic scheduling method based on multi-stage link transmission according to some embodiments.

[0024] Figure 3 It is a structural diagram of a traffic scheduling device based on multi-stage link transmission according to an exemplary embodiment.

[0025] Figure 4 It is a schematic structural diagram of an electronic device according to an exemplary embodiment. DETAILED DESCRIPTION

[0026] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0027] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0028] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0029] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0030] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0031] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0032] Figure 1 FIG. 1 is a schematic diagram of a multi-stage link according to some embodiments. Figure 1 As shown in the figure, the multi-level links include terminal devices, DCDN servers, domain names, CNAME (Canonical Name), IP (Internet Protocol) addresses, computer room lines, L4 clusters, and L7 clusters. In other words, from the time a request is initiated by a terminal device to the time a request is processed by a computer room server, the transmission of service traffic (also known as terminal traffic) passes through multiple physical resources, including terminal devices, DCDN servers, computer room lines, L4 clusters, and L7 clusters. In this process, the conversion of logical objects such as domain names, CNAMEs, and IP addresses is also involved.

[0033] The traffic of various types of services can be distinguished from the operator (Internet Service Provider, ISP) dimension and resource dimension. The operator dimension refers to which operator provides the service traffic to the network service (such as China Mobile, China Unicom, China Telecom, etc.), and the resource dimension refers to the size of the service traffic measured by the number of requests per second (QPS), outbound bandwidth, and inbound bandwidth. By distinguishing service traffic by service type and operator, the subsequent traffic scheduling strategy will produce different scheduling behaviors according to the service type and operator.

[0034] In multi-level links, different traffic scheduling strategies are used to control the step-by-step distribution process of business traffic on multi-level links. For example, the DCDN strategy determines the distribution ratio of business traffic to each DCDN server. The computer room weight strategy determines the distribution ratio of business traffic on the DCDN server to different domain names. The back-to-source configuration strategy determines the distribution ratio of mapping the domain name accessed by business traffic to different CNAMEs. The back-to-source resolution strategy determines the distribution ratio of mapping the CNAME accessed by business traffic to the IP address. When the IP address of the computer room server accessed by business traffic is determined, the computer room line, L4 cluster, and L7 cluster that transmit and process business traffic will also be determined.

[0035] It is worth mentioning that Figure 1 The physical model of the multi-stage link provided is only used as an example, and does not limit the traffic scheduling method based on multi-stage link transmission provided by the present disclosure to only be applicable to Figure 1 The multi-stage link shown, the traffic scheduling method based on multi-stage link transmission provided by the embodiment of the present disclosure can also be applied to other multi-stage links.

[0036] Figure 2 FIG. 1 is a flow chart of a method for traffic scheduling based on multi-stage link transmission according to some embodiments. Figure 2 As shown, the embodiment of the present disclosure provides a traffic scheduling method based on multi-stage link transmission, which can be executed by an electronic device, specifically by a traffic scheduling device based on multi-stage link transmission, which can be implemented by software and / or hardware and configured in an electronic device. Figure 2 As shown, the method may include the following steps.

[0037] In step 210, the target business traffic is obtained, and the target business traffic is transmitted through the corresponding multi-level link. A traffic scheduling strategy is configured between any two adjacent links in the multi-level link. The traffic scheduling strategy is used to indicate the policy parameters of the upper link in the adjacent two-level links to allocate business traffic to the lower link.

[0038] Here, the target service flow may refer to the service flow generated by the terminal device, and the target service flow is routed to the server in the computer room through a multi-stage link. Figure 1 The multi-stage links shown are routed to the computer room server so that the computer room server processes the target business traffic.

[0039] It is worth noting that the target service traffic of the embodiments of the present disclosure may be heterogeneous traffic, which refers to different types of data traffic transmitted in the network, which may differ due to different sources, destinations, protocols or service quality requirements. For example, for small video submission traffic, its inbound bandwidth is usually much larger than the outbound bandwidth, while the outbound bandwidth of real-time communication and live broadcast traffic is the opposite, and the outbound bandwidth is usually much larger than the inbound bandwidth.

[0040] In a multi-level link, two adjacent links determine the policy parameters corresponding to the two adjacent links through the corresponding traffic scheduling strategy, wherein the policy parameters are used to indicate the proportion of service traffic allocated by the upper link in the two adjacent links to each node of the lower link.

[0041] For example, Figure 1 As shown, the link between the terminal device and the DCDN server determines the policy parameters through the DCDN policy, the link between the DCDN server and the domain name determines the policy parameters through the computer room weight policy, the link between the domain name and the CNAME determines the policy parameters through the back-to-source configuration policy, and the link between the CNAME and the IP address determines the policy parameters through the back-to-source resolution policy.

[0042] The target dimension of the DCDN policy is the service type dimension. The service traffic of the same service type shares policy parameters in various operators and resource dimensions. For example, the Unicom traffic of service type A is allocated to the DCND-1 server and the DCND-2 server in a ratio of 1:2, and the mobile traffic and telecom traffic of service type A are also allocated to the DCND-1 server and the DCND-2 server in a ratio of 1:2.

[0043] The data center weight strategy acts on the DCDN server, and its target dimension is the service type dimension. The service traffic of the same service type on the same DCDN server shares the policy parameters in various operator and resource dimensions.

[0044] The back-to-origin configuration policy acts on the link of the domain name. The target dimension of its action is the service type dimension. Service traffic of the same service type and accessing the same domain name shares policy parameters in various operator and resource dimensions.

[0045] The back-to-source resolution policy acts on the CNAME link, and its target dimension is the operator dimension. Traffic from the same operator and accessing the same CNAME shares policy parameters in various business and resource dimensions.

[0046] It should be understood that the DCDN strategy can be executed by modifying the configuration file on the DNS server, the computer room weight strategy can be executed by modifying the configuration file on the terminal device, the back-to-source configuration strategy can be executed by modifying the configuration file on the NGINX server, and the back-to-source resolution strategy can be executed by modifying the configuration file on the DNS server.

[0047] It is worth noting that the DCDN strategy, computer room weight strategy, back-to-source configuration strategy and back-to-source resolution strategy shown in the above embodiments are only used to explain the traffic scheduling strategy. In multi-level links of different physical models, different traffic scheduling strategies can be selected according to actual conditions.

[0048] In step 220, based on the traffic scheduling strategy configured between two adjacent links, a logical constraint model corresponding to the traffic scheduling strategy is constructed. The logical constraint model is used to represent the relationship between the export service flow of the upper link corresponding to the traffic scheduling strategy, the import service flow of the lower link and the policy parameters.

[0049] Here, the service flow includes three resource dimensions: QPS, outbound bandwidth, and inbound bandwidth. Therefore, the target service flow can be expressed by the vector x = [x qps , x bw_in , x bw_out ] T To represent this, we can use the vector c = [c qps , c bw_in , c bw_out ] T To represent the resource capacity, qps is the QPS of the target business traffic, bw_in is the outbound bandwidth of the target business traffic, and bw_out is the inbound bandwidth of the target business traffic.

[0050] For each level of the multi-level link, a logical constraint model corresponding to the traffic scheduling strategy of the link is constructed. Among them, each logical constraint model is actually used to reflect the correlation between the target business traffic received by the upper link, the target business traffic received by each node in the lower link, and the policy parameters. It should be understood that the amount of business traffic (ingress business traffic) received by each node in the lower link depends on the size of the policy parameters. For example, for the DCDN server, if the policy parameter indicates that the business traffic allocated to the DCND-1 server and the DCND-2 server (each DCDN server is equivalent to a node on the link of the DCDN server) is 1:2, then the business traffic received by the DCND-1 server is 1 / 3 multiplied by the business traffic and the business traffic received by the DCND-2 server is 2 / 3 multiplied by the business traffic.

[0051] like Figure 1 As shown, the logical constraint model of the DCDN strategy can be:

[0052] x biz,isp,dcdn =x biz,isp ·y biz,dcdn

[0053]

[0054] Among them, x biz,isp,dcdn The target business traffic belongs to the business type biz and the operator isp and accesses the DCDN server dcdn. biz,isp is the target service traffic of business type biz and operator isp, y biz,dcdn It is a policy parameter of the DCDN policy, representing the proportion of target service traffic of service type biz allocated from terminal devices to the DCDN server dcdn.

[0055] It should be noted that in the logical constraint model of the DCDN strategy, the ingress service traffic of a DCDN server (equivalent to the received target service traffic) is actually equal to the ingress service traffic of the upper link (equivalent to the total target service traffic) multiplied by the corresponding strategy parameter.

[0056] The logical constraint model of the computer room weight strategy is:

[0057]

[0058]

[0059] Among them, x biz,isp,dm y is the target business traffic of business type biz and operator isp, and access domain name dm. biz,dcdn,dmIt is the policy parameter of the computer room weight policy, which represents the traffic of the business type biz, and the proportion allocated from the DCDN server dcdn to the domain name dm.

[0060] It should be noted that ∑ dm y biz,dcdn,dm =1 actually indicates that the sum of the policy parameters corresponding to all domain names is equal to 1.

[0061] The logical constraint model of the back-to-source configuration strategy is:

[0062]

[0063]

[0064] Among them, x isp,cnm The target service traffic belongs to the operator isp and accesses CNAME (cnm), y biz,dm,cnm Policy parameters for back-to-origin configuration policy, representing the target service traffic of service type biz, and the ratio of domain name dm to CNAME.

[0065] The logical constraint model of the back-to-source resolution strategy is:

[0066]

[0067]

[0068] Among them, x ip y is the target service traffic accessing the IP address ip, isp,cnm,ip It is a policy parameter of the back-to-source resolution policy, which represents the target service traffic of the operator ISP and the proportion of the allocation from CNAME to IP address.

[0069] It should be understood that in Figure 1 In the multi-level links shown, the link between the IP address and the computer room line can determine the corresponding policy parameters through the pre-set traffic scheduling policy. Of course, the policy parameters corresponding to the link between the IP address and the computer room line can also be fixed values. In other words, z ip,line 、z ip,l4 、z ip,l7 Can be a fixed value. ip,line is the policy parameter of the computer room line, representing the proportion of the target service traffic of the access IP address ip allocated to the computer room line line, ip,l4 is the policy parameter of the L4 cluster, which represents the proportion of the target service traffic accessing the IP address ip allocated to the L4 cluster. ip,l7 It is a policy parameter of the L7 cluster, which represents the proportion of the target service traffic accessing the IP address ip allocated to the L7 cluster.

[0070] It is worth noting that in the above logical constraint model, target business traffic of different business types and operators is distinguished, but in actual application scenarios, target business traffic of different business types and operators may not be distinguished. Accordingly, the policy parameters corresponding to each traffic scheduling strategy may distinguish target business traffic of different business types and operators, or may not distinguish target business traffic of different business types and operators. In other words, each traffic scheduling strategy may set corresponding policy parameters for target business traffic of different business types and operators, or may set the same policy parameters for target business traffic of different business types and operators.

[0071] In step 230, based on the logical constraint model, target policy parameters corresponding to each traffic scheduling policy in the multi-stage link are determined.

[0072] Here, different traffic scheduling objectives can be combined with the logical constraint model to calculate the target policy parameters under the corresponding traffic scheduling objectives.

[0073] Exemplarily, different traffic scheduling targets may be set for different scheduling requirements. For example, if the scheduling requirement is to reduce the overall bandwidth cost of the multi-stage link, the traffic scheduling target may be to minimize the bandwidth cost generated by the multi-stage link.

[0074] In step 240, traffic scheduling is performed on the target service traffic according to the target policy parameters corresponding to each traffic scheduling policy.

[0075] Here, after obtaining the target policy parameters, the target policy parameters may be applied to the links corresponding to the multi-stage links, so as to schedule the target service traffic on the multi-stage links.

[0076] Therefore, the target business traffic is transmitted through multi-level links, and a traffic scheduling strategy is configured between any two adjacent links in the multi-level links. By obtaining the target business traffic and building a logical constraint model corresponding to the traffic scheduling strategy according to the traffic scheduling strategy configured between the two adjacent links, the target policy parameters corresponding to each traffic scheduling strategy in the multi-level links are determined based on the logical constraint model, and then the target business traffic is scheduled according to the target policy parameters corresponding to each traffic scheduling strategy. All traffic scheduling strategies can be comprehensively considered in the multi-level links for scheduling decisions, so that all traffic scheduling strategies can be coordinated and scheduled, and the policy parameters of all traffic scheduling strategies are optimized in the global view of traffic scheduling, so that the obtained target policy parameters can enable traffic scheduling to achieve global optimality, so as to achieve global optimal scheduling of business traffic scheduling, improve the bandwidth resource utilization of the network and reduce the bandwidth usage cost of users.

[0077] In some feasible implementations, in step 130, based on the logical constraint model, within a given traffic scheduling target and a first constraint condition, target policy parameters that meet the traffic scheduling target can be determined, wherein the target policy parameters include policy parameters corresponding to each traffic scheduling strategy, and the first constraint condition is used to describe the network resource constraints corresponding to each level of the multi-level link.

[0078] Here, different traffic scheduling targets can be set for different scheduling requirements, where the traffic scheduling target can be understood as an objective function.

[0079] The first constraint condition is used to describe the network resource constraints corresponding to each level of links. Exemplarily, the first constraint condition may include at least one of a resource load constraint, a bandwidth cost constraint, and a resource capacity constraint. Among them, the resource load constraint is used to ensure that each link in the multi-level link will not cause service interruption or performance degradation due to overload, the bandwidth cost constraint is used to constrain the bandwidth cost in the multi-level link so that the bandwidth cost does not exceed expectations, and the resource capacity constraint is used to ensure that the resources in the multi-level link can meet the expected traffic demand.

[0080] like Figure 1 As shown, in Figure 1 In the multi-stage link shown, the resource load constraint can be:

[0081]

[0082]

[0083]

[0084]

[0085] Among them, x dcdn is the total service traffic on the DCDN server dcdn, x line is the total business flow on the line in the computer room, x l4 is the total service traffic on the L4 cluster, x l7 Indicates the total service traffic on the L7 cluster.

[0086] exist Figure 1 In the multi-stage link shown, the bandwidth cost constraint can be:

[0087]

[0088]

[0089]

[0090]

[0091] in, The billing bandwidth for service traffic on the DCDN server dcdn. The billing bandwidth for business traffic on the line in the computer room. is the inbound bandwidth of the service traffic on the DCDN server dcdn, is the outbound bandwidth of the service traffic on the DCDN server dcdn, It is the inbound bandwidth of the business traffic on the line in the computer room. It is the outbound bandwidth of the service traffic on the line in the computer room.

[0092] exist Figure 1 In the multi-stage link shown, the resource capacity constraint can be:

[0093] x dcdn ≤c dcdn

[0094] x line ≤c line

[0095] x l4 ≤c l4

[0096] x l7 ≤c l7

[0097] Among them, c dcdn is the resource capacity of the DCDN server dcdn, c line is the resource capacity of the line in the computer room, c l4 is the resource capacity of L4 cluster l4, c l7 It is the resource capacity of L7 cluster l7.

[0098] It is worth noting that a set of target policy parameters corresponding to each traffic scheduling policy can be obtained by combining the objective function and the first constraint condition with the logical constraint model. It should be noted that the logical constraint model includes a bilinear term consisting of the multiplication of two continuous variables, traffic x and policy parameter y, so the logical constraint model can be understood as a nonlinear programming problem. Therefore, the interior point algorithm can be used to calculate the policy parameters in the logical constraint model.

[0099] Therefore, through the logical constraint model corresponding to all traffic scheduling strategies in the multi-level links, the policy parameters of all traffic scheduling strategies can be optimized in the global perspective of traffic scheduling, so that the obtained target policy parameters can enable the traffic scheduling to achieve global optimality and avoid the local optimality of a certain traffic scheduling strategy.

[0100] In some feasible implementations, based on a logical constraint model, target strategy parameters that meet the traffic scheduling target are determined within a given traffic scheduling target, a first constraint condition, and a second constraint condition, and the second constraint condition is used to constrain the difference between the target strategy parameters determined in multiple rounds to be within a preset range.

[0101] Here, the second constraint condition is used to ensure that the difference between the target policy parameter determined in the current round and the target policy parameter determined in the previous round is within a preset range.

[0102] like Figure 1 As shown, in the multi-stage link Figure 1 When the multi-stage link is shown, the second constraint can be:

[0103]

[0104]

[0105]

[0106]

[0107] Among them, δ is the preset threshold, is the currently calculated y biz,dcdn , is the currently calculated y biz,dcdn.dm , is the currently calculated y biz,dm,cnm , is the currently calculated y biz,cnm,ip .

[0108] Through the second constraint condition, the target policy parameters calculated each time can be adjusted within a small range (±δ), so that by adjusting the policy parameters by a small part in each round and adjusting the policy parameters for multiple rounds, the target policy parameters can gradually reach the optimum to maintain the stability of the network.

[0109] It is worth noting that the preset threshold δ can be set according to actual needs. For example, the preset threshold δ can be set to 5%.

[0110] Therefore, through the second constraint condition, the target policy parameter calculated each time will not change significantly relative to the target policy parameter calculated last time, thereby maintaining the stability of the network.

[0111] In some feasible implementations, the logical constraint model belonging to nonlinear programming can be converted into a logical constraint model belonging to linear programming. Based on the logical constraint model belonging to linear programming, the initial strategy parameters that meet the traffic scheduling target are determined within the given traffic scheduling target, the first constraint condition and the second constraint condition. Based on the logical constraint model belonging to nonlinear programming, the target strategy parameters that meet the traffic scheduling target are determined through the initial strategy parameters and the interior point algorithm within the given traffic scheduling target, the first constraint condition and the second constraint condition.

[0112] Here, since the logical constraint model includes a bilinear term formed by multiplying two continuous variables, traffic x and policy parameter y, the logical constraint model can be understood as a nonlinear programming problem. After adding the second constraint, the target policy parameter y calculated each time is limited to a smaller domain, and the increment between the target policy parameter calculated currently and the target policy parameter calculated last time satisfies: Δy≤δ. Therefore, the increment Δx of the business traffic x before and after the adjustment will also be much smaller than x, so the logical constraint model belonging to the nonlinear programming problem can be converted into a logical constraint model belonging to the linear programming problem.

[0113] Exemplarily, the bilinear item xy can be approximated as: in,

[0114] is the business flow before adjustment. are the strategy parameters before adjustment.

[0115] The logical constraint model of the computer room weight strategy, the logical constraint model of the back-to-source configuration strategy, and the logical constraint model of the back-to-source resolution strategy in the above embodiment can be rewritten as the following linear constraints:

[0116]

[0117]

[0118]

[0119] Therefore, in the case of including the second constraint condition, the logical constraint model belonging to the nonlinear programming problem can be converted into a logical constraint model belonging to the linear programming problem.

[0120] For the logical constraint model belonging to the linear programming problem, the simplex method or the interior point algorithm can be used to calculate the logical constraint model belonging to the linear programming problem through the objective function, the first constraint condition and the second constraint condition to obtain the initial strategy parameters corresponding to each traffic scheduling strategy.

[0121] Then, the initial strategy parameters can be used as the initial solution of the interior point algorithm. The interior point algorithm is used to calculate the logical constraint model belonging to the nonlinear programming problem in combination with the objective function, the first constraint condition and the second constraint condition to obtain the target strategy parameters corresponding to each traffic scheduling strategy.

[0122] It is worth noting that when the interior point algorithm is directly used to calculate the logical constraint model belonging to the nonlinear programming problem, the selection of the initial solution of the interior point algorithm can significantly affect the calculation speed and the quality of the final solution.

[0123] Therefore, through the above implementation, using the initial strategy parameters as the initial solution of the interior point algorithm can significantly improve the calculation speed and make the determined target strategy parameters more accurate.

[0124] In some achievable implementations, the traffic scheduling target includes a first traffic scheduling target or a second traffic scheduling target. The first traffic scheduling target is used to minimize the bandwidth costs incurred by multi-stage links, and the second traffic scheduling target is used to ensure that the target service traffic received by each node in each stage of the link remains load balanced.

[0125] Among them, the user can select the first traffic scheduling target or the second traffic scheduling target as the traffic scheduling target for calculating the target policy parameters according to needs.

[0126] In some embodiments, when the multi-stage link includes a distributed content delivery network DCDN server and a computer room line, the first traffic scheduling target is:

[0127]

[0128] Among them, p dcdn The unit price of the DCDN server's billable bandwidth. is the billing bandwidth of the service traffic on the DCDN server, p line The unit price of the billable bandwidth of the computer room line. The billing bandwidth for business traffic on the computer room line.

[0129] It is worth noting that, through the first traffic scheduling target, the resource loads in the multi-stage links can be controlled without exceeding their resource capacities, thereby achieving the minimum bandwidth cost of the multi-stage links.

[0130] In some embodiments, when the multi-stage link includes a distributed content delivery network DCDN server and a computer room line, the second traffic scheduling target is:

[0131]

[0132] in, The resource capacity of the billable bandwidth on the DCDN server. The resource capacity of the billable bandwidth on the computer room line. is the query rate per second of the resource capacity on the DCDN server, It is the query rate per second of the business traffic on the DCDN server.

[0133] In some feasible implementations, in step 120, a logical constraint model corresponding to the traffic scheduling strategy is constructed according to the target dimension of the traffic scheduling strategy configured between two adjacent links.

[0134] Here, the target dimension includes the service type dimension of the target service flow or the operator dimension of the target service flow. In the logical constraint model, target service flows of different service types have policy parameters corresponding to the service types, and target service flows of different network service providers have policy parameters corresponding to the network service providers. The network service provider may refer to an operator that provides network services.

[0135] For example, the target dimension of the DCDN policy is the service type dimension, and for each service type's target service flow, each service type's target service flow has a policy parameter. biz,dcdn Different business types biz are distinguished for setting, that is, the target business flow of each business type has its corresponding policy parameters belonging to the business type.

[0136] The target dimension of the room weight strategy is the business type dimension, and for each business type of target business flow, each business type of target business flow has a policy parameter. biz,dcdn,dm Different business types biz are distinguished for setting, that is, the target business flow of each business type has its corresponding policy parameters belonging to the business type.

[0137] The target dimension of the back-to-source configuration policy is the business type dimension, and for each business type of target business traffic, each business type of target business traffic has a policy parameter. biz,dm,cnm Different business types biz are distinguished for setting, that is, the target business flow of each business type has its corresponding policy parameters belonging to the business type.

[0138] The target dimension of the back-to-source resolution strategy is the network service provider dimension. In the above embodiment, the strategy parameter y in the back-to-source resolution strategy isp,cnm,ipDifferent network service providers (ISPs) are distinguished for setting, that is, the target service flow of each network service provider has its corresponding policy parameters belonging to the network service provider.

[0139] Among them, when the target dimension is the business type dimension, the logical constraint model is used to characterize the target business traffic of different business types received by the upper link corresponding to the traffic scheduling strategy, the target business traffic of different business types received by each node in the lower link, and the policy parameters corresponding to the target business traffic of different business types. When the target dimension is the business type dimension, the logical constraint model is used to characterize the target business traffic of different network service providers received by the upper link corresponding to the traffic scheduling strategy, the target business traffic of different network service providers received by each node in the lower link, and the policy parameters corresponding to the target business traffic of different network service providers.

[0140] Therefore, by distinguishing the target business traffic of different business types and network service providers, the target policy parameters can be integrated with different business types and network service providers for collaborative decision-making, so that the transmission of heterogeneous traffic on multi-level links can achieve global optimization.

[0141] It is worth noting that by constructing a logical constraint model corresponding to the traffic scheduling strategy according to the target dimension of the traffic scheduling strategy, the coordinated scheduling of heterogeneous traffic on multi-level links can be comprehensively considered, so that the business traffic of different business types and different network service providers can be comprehensively decided, and the heterogeneous characteristics of different business traffic can complement each other. For example, business traffic with an outbound bandwidth much larger than the inbound bandwidth and business traffic with an inbound bandwidth much larger than the outbound bandwidth can be bound together.

[0142] For example, in a scenario with diversified business forms, business traffic with different characteristics will be transmitted in the same multi-level link. For example, business traffic for marketing activities generally has a higher QPS, but its outbound bandwidth and inbound bandwidth are lower. For small video submission traffic, its inbound bandwidth is usually much larger than the outbound bandwidth. The opposite is true for real-time communication and live broadcast traffic, where the outbound bandwidth is usually much larger than the inbound bandwidth. These business traffic with different characteristics are heterogeneous and are not suitable for traffic scheduling using the same policy parameters. By constructing a logical constraint model corresponding to the traffic scheduling strategy according to the target dimension of the traffic scheduling strategy, comprehensive scheduling can be performed for heterogeneous traffic.

[0143] The traffic scheduling method based on multi-stage link transmission provided by the embodiment of the present disclosure can not only enable all traffic scheduling strategies configured in the multi-stage links to be coordinated and scheduled, but also enable the coordinated scheduling of heterogeneous traffic of various business types and network service providers, thereby achieving coordinated scheduling of heterogeneous traffic in multi-stage links and minimizing the bandwidth cost generated by the multi-stage links.

[0144] Figure 3 FIG. 1 is a schematic diagram of a structure of a traffic scheduling device based on multi-stage link transmission according to an exemplary embodiment. Figure 3 As shown, the embodiment of the present disclosure provides a traffic scheduling device 300 based on multi-stage link transmission, and the traffic scheduling device 300 based on multi-stage link transmission includes:

[0145] The acquisition module 301 is configured to acquire target service traffic, wherein the target service traffic is transmitted through a corresponding multi-level link, and a traffic scheduling strategy is configured between any two adjacent links in the multi-level link, wherein the traffic scheduling strategy is used to indicate a policy parameter for allocating service traffic from an upper link in the adjacent two-level link to a lower link;

[0146] The model building module 302 is configured to construct a logical constraint model corresponding to the traffic scheduling strategy configured between two adjacent links, wherein the logical constraint model is used to represent the association between the egress service flow of the upper link, the ingress service flow of the lower link and the policy parameters corresponding to the traffic scheduling strategy;

[0147] The determination module 303 is configured to determine the target policy parameters corresponding to each traffic scheduling policy in the multi-stage link based on the logical constraint model;

[0148] The scheduling module 304 is configured to perform traffic scheduling on the target service traffic according to the target policy parameters corresponding to each of the traffic scheduling policies.

[0149] Optionally, the determining module 303 is specifically configured to:

[0150] Based on the logical constraint model, within a given traffic scheduling target and a first constraint condition, target policy parameters that meet the traffic scheduling target are determined, wherein the target policy parameters include policy parameters corresponding to each traffic scheduling strategy, and the first constraint condition is used to describe the network resource constraints corresponding to each level of the multi-level link.

[0151] Optionally, the determining module 303 is specifically configured to:

[0152] Based on the logical constraint model, within the given traffic scheduling target, the first constraint condition and the second constraint condition, the target strategy parameters that meet the traffic scheduling target are determined, and the second constraint condition is used to constrain the difference between the target strategy parameters determined in multiple rounds to be within a preset range.

[0153] Optionally, the determining module 303 is specifically configured to:

[0154] Converting the logical constraint model belonging to nonlinear programming into a logical constraint model belonging to linear programming;

[0155] Based on the logical constraint model belonging to linear programming, within the given traffic scheduling target, the first constraint condition and the second constraint condition, determine the initial strategy parameters that meet the traffic scheduling target;

[0156] Based on the logical constraint model belonging to nonlinear programming, within the given traffic scheduling target, the first constraint condition and the second constraint condition, the target strategy parameters that meet the traffic scheduling target are determined through the initial strategy parameters and the interior point algorithm.

[0157] Optionally, the traffic scheduling target includes a first traffic scheduling target or a second traffic scheduling target, the first traffic scheduling target is used to minimize the bandwidth cost generated by the multi-stage links, and the second traffic scheduling target is used to ensure that the target service traffic received by each node in each stage of the links remains load balanced.

[0158] Optionally, the model building module 302 is specifically configured as follows:

[0159] According to the target dimension of the traffic scheduling strategy configured between two adjacent levels of links, a logical constraint model corresponding to the traffic scheduling strategy is constructed. The target dimension includes the business type dimension of the target business traffic or the operator dimension of the target business traffic. In the logical constraint model, target business traffic of different business types has policy parameters corresponding to the business types, and target business traffic of different network service providers has policy parameters corresponding to the network service providers.

[0160] The logic of the method executed by each functional module in the above-mentioned traffic scheduling device 300 based on multi-stage link transmission can refer to the part of the method related to the above-mentioned embodiment, and will not be repeated here.

[0161] Reference below Figure 4 , which shows a schematic diagram of the structure of an electronic device (such as a terminal device or a server) 400 suitable for implementing the embodiment of the present disclosure. The terminal device in the embodiment of the present disclosure may include but is not limited to mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 4 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0162] like Figure 4As shown, the electronic device 400 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 401, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 402 or a program loaded from a storage device 408 into a random access memory (RAM) 403. In the RAM 403, various programs and data required for the operation of the electronic device 400 are also stored. The processing device 401, the ROM 402, and the RAM 403 are connected to each other via a bus 404. An input / output (I / O) interface 405 is also connected to the bus 404.

[0163] Typically, the following devices may be connected to the I / O interface 405: an input device 406 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 407 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 408 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 409. The communication device 409 may allow the electronic device 400 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 4 The electronic device 400 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0164] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication device 409, or installed from the storage device 408, or installed from the ROM 402. When the computer program is executed by the processing device 401, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

[0165] It should be noted that the computer-readable medium disclosed above may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, device or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, in which a computer-readable program code is carried. This propagated data signal may take a variety of forms, including but not limited to an electromagnetic signal, an optical signal, or any suitable combination of the above. The computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0166] In some embodiments, the links at all levels can communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and can be interconnected with any form or medium of digital data communication (e.g., communication network). Examples of communication networks include local area networks ("LAN"), wide area networks ("WAN"), internets (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.

[0167] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0168] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: obtains target business traffic, the target business traffic is transmitted through the corresponding multi-level link, and a traffic scheduling strategy is configured between any two adjacent links in the multi-level link, and the traffic scheduling strategy is used to indicate the policy parameters of the upper link in the adjacent two-level link to allocate business traffic to the lower link; according to the traffic scheduling strategy configured between the adjacent two-level links, a logical constraint model corresponding to the traffic scheduling strategy is constructed, and the logical constraint model is used to represent the association between the export business traffic of the upper link, the import business traffic of the lower link and the policy parameters corresponding to the traffic scheduling strategy; based on the logical constraint model, the target policy parameters corresponding to each traffic scheduling strategy in the multi-level link are determined; and the target business traffic is scheduled according to the target policy parameters corresponding to each traffic scheduling strategy.

[0169] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages ​​or a combination thereof, including, but not limited to, object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0170] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0171] The modules involved in the embodiments described in the present disclosure may be implemented by software or hardware, wherein the name of a module does not, in some cases, limit the module itself.

[0172] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0173] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0174] The above description is only a preferred embodiment of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in the present disclosure (but not limited to) by each other to form a technical solution.

[0175] In addition, although each operation is described in a specific order, this should not be understood as requiring these operations to be performed in the specific order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.

[0176] Although the subject matter has been described in language specific to structural features and / or method logic actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims. Regarding the device in the above embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.

Claims

1. A traffic scheduling method based on multi-stage link transmission, It is characterized in that include: Obtaining target service traffic, wherein the target service traffic is transmitted through a corresponding multi-level link, and a traffic scheduling strategy is configured between any two adjacent links in the multi-level link, wherein the traffic scheduling strategy is used to indicate a policy parameter for allocating service traffic from an upper link in the adjacent two-level links to a lower link; According to the traffic scheduling strategy configured between two adjacent links, a logical constraint model corresponding to the traffic scheduling strategy is constructed, wherein the logical constraint model is used to represent the association between the egress service flow of the upper link, the ingress service flow of the lower link and the policy parameters corresponding to the traffic scheduling strategy; Based on the logical constraint model, determining the target policy parameters corresponding to each traffic scheduling policy in the multi-stage link; The target service traffic is traffic scheduled according to the target policy parameters corresponding to each of the traffic scheduling policies.

2. The method according to claim 1, It is characterized in that The determining, based on the logical constraint model, target policy parameters corresponding to each traffic scheduling policy in the multi-stage link includes: Based on the logical constraint model, within a given traffic scheduling target and a first constraint condition, target policy parameters that meet the traffic scheduling target are determined, wherein the target policy parameters include policy parameters corresponding to each traffic scheduling strategy, and the first constraint condition is used to describe the network resource constraints corresponding to each level of the multi-level link.

3. The method according to claim 2, It is characterized in that The step of determining, based on the logical constraint model, a target policy parameter that satisfies the traffic scheduling target within a given traffic scheduling target and a first constraint condition includes: Based on the logical constraint model, within the given traffic scheduling target, the first constraint condition and the second constraint condition, the target strategy parameters that meet the traffic scheduling target are determined, and the second constraint condition is used to constrain the difference between the target strategy parameters determined in multiple rounds to be within a preset range.

4. The method according to claim 3, It is characterized in that The step of determining, based on the logical constraint model, target policy parameters that meet the traffic scheduling target within the given traffic scheduling target, the first constraint condition, and the second constraint condition, includes: Converting the logical constraint model belonging to nonlinear programming into a logical constraint model belonging to linear programming; Based on the logical constraint model belonging to linear programming, within the given traffic scheduling target, the first constraint condition and the second constraint condition, determine the initial strategy parameters that meet the traffic scheduling target; Based on the logical constraint model belonging to nonlinear programming, within the given traffic scheduling target, the first constraint condition and the second constraint condition, the target strategy parameters that meet the traffic scheduling target are determined through the initial strategy parameters and the interior point algorithm.

5. The method according to claim 2, It is characterized in that The traffic scheduling target includes a first traffic scheduling target or a second traffic scheduling target. The first traffic scheduling target is used to minimize the bandwidth cost generated by the multi-stage links, and the second traffic scheduling target is used to ensure that the target service traffic received by each node in each stage of the link remains load balanced.

6. The method according to any one of claims 1 to 5, It is characterized in that The step of constructing a logical constraint model corresponding to the traffic scheduling strategy configured between two adjacent links includes: According to the target dimension of the traffic scheduling strategy configured between two adjacent levels of links, a logical constraint model corresponding to the traffic scheduling strategy is constructed. The target dimension includes the business type dimension of the target business traffic or the operator dimension of the target business traffic. In the logical constraint model, target business traffic of different business types has policy parameters corresponding to the business types, and target business traffic of different network service providers has policy parameters corresponding to the network service providers.

7. A traffic scheduling device based on multi-stage link transmission, It is characterized in that include: An acquisition module is configured to acquire target service traffic, wherein the target service traffic is transmitted through a corresponding multi-level link, and a traffic scheduling strategy is configured between any two adjacent links in the multi-level link, wherein the traffic scheduling strategy is used to indicate a policy parameter for allocating service traffic from an upper link in the adjacent two-level link to a lower link; A model building module is configured to construct a logical constraint model corresponding to the traffic scheduling strategy configured between two adjacent links, wherein the logical constraint model is used to represent the association between the egress service flow of the upper link, the ingress service flow of the lower link and the policy parameters corresponding to the traffic scheduling strategy; A determination module is configured to determine the target policy parameters corresponding to each traffic scheduling policy in the multi-stage link based on the logical constraint model; The scheduling module is configured to perform traffic scheduling on the target business traffic according to the target policy parameters corresponding to each of the traffic scheduling policies.

8. A computer readable medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processing device, the steps of the method according to any one of claims 1 to 6 are implemented.

9. An electronic device, It is characterized in that include: a storage device having a computer program stored thereon; A processing device, configured to execute the computer program in the storage device to implement the steps of the method according to any one of claims 1 to 6.

10. 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 6 are implemented.

Citation Information

Cited By

  • Flow scheduling method and device based on distributed network, medium and product

    CN119299388A