Method, device and equipment for determining routing scheduling strategy of edge computing network

Abstract

The invention provides a method, a device and equipment for determining a routing scheduling strategy of an edge computing network. The method comprises the following steps: determining a source host set formed by source hosts for sending data streams and a destination host set formed by destination hosts for receiving the data streams; determining a switch set formed by switches between the source host and the destination host; determining a data stream set formed by each data stream needing to be sent by each source host in the source host set in a time period and a time period set formed by each time period in the time period; determining the priority of each data stream in the data stream set; determining a data stream transmission network topology structure; determining a corresponding link matrix; constructing an integer linear programming model; and solving the integer linear programming model to obtain a network route scheduling strategy. According to the invention, the transmission delay of the data stream can be reduced.

Description

Technical Field

[0001] The present invention relates to the field of data transmission technology, and in particular to a method, device and equipment for determining a routing scheduling strategy for an edge computing network. Background Art

[0002] With the continuous development of industrial Internet and artificial intelligence technology, industrial intelligence, informatization and dataization are gaining more and more attention. The edge computing network architecture of industrial sites can be roughly divided into three layers: industrial underlying equipment, edge computing resources and cloud computing resources. Due to the different equipment manufacturers, operating systems and data formats between different industrial equipment and different computing resources, it is difficult to achieve unified communication between different devices. Even for devices from the same manufacturer, due to the complex structure of the network transmission link, the transmission delay is often too long and there is a large uncertainty, which cannot meet the requirements of the industrial edge computing network for real-time data transmission. Summary of the invention

[0003] In response to at least one of the above technical problems, an embodiment of the present invention provides a method, device and equipment for determining a routing scheduling strategy for an edge computing network.

[0004] According to a first aspect, a method for determining a routing scheduling strategy for an edge computing network provided by an embodiment of the present invention includes:

[0005] Determine a source host set formed by each source host sending a data stream and a destination host set formed by each destination host receiving a data stream; wherein the source host is an industrial underlying device in the edge computing network, and the destination host is an edge computing node or a cloud computing node in the edge computing network;

[0006] Determine a switch set formed by switches between the source host and the destination host;

[0007] Determine a data flow set formed by each data flow that each source host in the source host set needs to send within a time period and a time period set formed by each time period within the time period;

[0008] Determine the priority of each data flow in the data flow set;

[0009] Determine a data stream transmission network topology structure; wherein the data stream transmission network topology structure includes a plurality of vertices and a plurality of edges, the vertices are hosts in the source host set, hosts in the destination host set, or switches in the switch set, and the edge between two vertices is a data stream transmission link between the two vertices;

[0010] Determine a corresponding link matrix according to the data stream transmission network topology structure; wherein each element in the link matrix indicates whether there is a directly connected edge between the corresponding two vertices;

[0011] An integer linear programming model is constructed according to the source host set, the destination host set, the switch set, the data flow set, the time period set, the priority of each data flow in the data flow set, and the link matrix; wherein the objective function of the integer linear programming model is to minimize the sum of the transmission delays of all data flows of the data flow set;

[0012] The integer linear programming model is solved to obtain a network routing scheduling strategy; wherein the network routing scheduling strategy is used to characterize the switches that each data flow needs to pass through during the transmission process from the corresponding source host to the corresponding destination host.

[0013] In one embodiment, the objective function includes:

[0014]

[0015] Wherein, T is the time period set, k is the time period; m is the number of the data flow, TS is the data flow set; i and j are the device numbers in the device set, V is the device set, the device set includes the source host set, the destination host set and the switch set, and the device is the source host, the destination host or the switch; p m is the priority of the mth data stream; t ij Characterizes the path length corresponding to the i-th device and the j-th device in the device set; x mijk is the decision variable corresponding to the mth data flow between the ith device and the jth device in the kth time period.

[0016] In one embodiment, the decision variable x mijk The determination method is as follows: if the mth data stream is transmitted from the ith device to the jth device in the kth time period, then x mijk is 1, otherwise x mijk is 0.

[0017] In one embodiment, the path length t corresponding to the i-th device and the j-th device ij The determination method is as follows: if the edge formed by the i-th device and the j-th device belongs to the edge set formed by the multiple edges, then t ij is 1, otherwise t ij Is positive infinity.

[0018] In one embodiment, the constraints of the integer linear programming model include:

[0019]

[0020] Where q is the number of the switch, Q is the set of switches, V d is the host set, V s is the source host set, d m is the number of the destination host corresponding to the mth data stream, s m The number of the source host corresponding to the mth data flow.

[0021] In one embodiment, the data flow is a delay-sensitive data flow; the acquisition process of the delay-sensitive data flow includes: for the data flow collected by the open platform unified architecture, using the delay-sensitive network protocol to identify the delay-sensitive data flow as the delay-sensitive data flow.

[0022] In one embodiment, the method is implemented by a control plane, and the process of transmitting data streams according to a network routing scheduling strategy is implemented in a data transmission plane. The separation of the control plane and the transmission plane is based on a software-defined network implementation.

[0023] According to the second aspect, the routing scheduling strategy determination device of the edge computing network provided by the embodiment of the present invention includes:

[0024] A first determination module is used to determine a source host set formed by each source host sending a data stream and a destination host set formed by each destination host receiving a data stream; wherein the source host is an industrial underlying device in the edge computing network, and the destination host is an edge computing node or a cloud computing node in the edge computing network;

[0025] A second determining module is used to determine a switch set formed by switches between the source host and the destination host;

[0026] A third determination module is used to determine a data flow set formed by each data flow that each source host in the source host set needs to send within a time period and a time period set formed by each time period within the time period;

[0027] A fourth determination module, used to determine the priority of each data flow in the data flow set;

[0028] a fifth determination module, configured to determine a data stream transmission network topology structure; wherein the data stream transmission network topology structure includes a plurality of vertices and a plurality of edges, wherein the vertices are hosts in the source host set, hosts in the destination host set, or switches in the switch set, and an edge between two vertices is a data stream transmission link between the two vertices;

[0029] A sixth determination module is used to determine a corresponding link matrix according to the data stream transmission network topology structure; wherein each element in the link matrix indicates whether there is a directly connected edge between the corresponding two vertices;

[0030] A model building module, used to build an integer linear programming model according to the source host set, the destination host set, the switch set, the data flow set, the time period set, the priority of each data flow in the data flow set and the link matrix; wherein the objective function of the integer linear programming model is to minimize the sum of the transmission delays of all data flows of the data flow set;

[0031] The model solving module is used to solve the integer linear programming model to obtain a network routing scheduling strategy; wherein the network routing scheduling strategy is used to characterize the switches that each data flow needs to pass through during the transmission process from the corresponding source host to the corresponding destination host.

[0032] According to a third aspect, an embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed in a computer, enables the computer to execute the method provided in the first aspect.

[0033] According to a fourth aspect, an embodiment of the present invention provides a computing device, including a memory and a processor, wherein the memory stores executable code, and when the processor executes the executable code, the method provided in the first aspect is implemented.

[0034] The method, device and equipment for determining the routing scheduling strategy of the edge computing network provided by the embodiment of the present invention determine the source host set, the destination host set, the switch set, the data flow set, the time period set and the priority of each data flow, and then determine the data flow transmission network topology structure, determine the corresponding link matrix based on the data flow transmission network topology structure, and then construct an integer linear programming model based on the above-mentioned sets and link matrices, and finally solve the integer linear programming model to obtain the network routing scheduling strategy. It can be seen that in the above process, the complex network topology structure of the source host, the destination host and the switch, the priority of the data flow, etc. are comprehensively considered to reduce the transmission delay of the data flow. Moreover, the data flow transmission network topology establishes an integer linear programming model, solves the integer linear programming model, and finally determines the scheduling scheme of the network routing. Since the objective function is to minimize the sum of the transmission delays of all data flows of the data flow set, this process solves the edge computing data flow transmission problem in the field of industrial Internet, and can reduce the transmission delay and queuing delay of the data flow, that is, it can improve the efficiency of data transmission and reduce the jitter of data transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 A schematic diagram of a process for determining a routing scheduling strategy for an edge computing network in one embodiment of the present invention;

[0036] Figure 2 It is a schematic diagram of separation of a control plane and a data transmission plane in one embodiment of the present invention;

[0037] Figure 3 It is a schematic diagram of a scheduling scheme in the prior art;

[0038] Figure 4 A schematic diagram of a scheduling scheme in an embodiment of the present invention;

[0039] Figure 5 is a schematic diagram of another scheduling solution in one embodiment of the present invention;

[0040] Figure 6 This is a structural block diagram of a device for determining a routing scheduling strategy for an edge computing network in one embodiment of the present invention. DETAILED DESCRIPTION

[0041] In a first aspect, an embodiment of the present invention provides a method for determining a routing scheduling strategy for an edge computing network, see Figure 1 The method includes the following steps S110 to S180:

[0042] S110, determining a source host set formed by each source host sending a data stream and a destination host set formed by each destination host receiving a data stream; wherein the source host is an industrial underlying device in the edge computing network, and the destination host is an edge computing node or a cloud computing node in the edge computing network;

[0043] The source host sending the data stream is an industrial bottom-layer device, and the destination host receiving the data stream can be an edge computing node or a cloud computing node. There are multiple switches between the source host and the destination host. The source host and the destination host of a data stream are both determined. What the embodiment of the present invention needs to determine is which switch the data stream will pass through.

[0044] S120, determining a switch set formed by switches between the source host and the destination host;

[0045] It can be seen that at this time, a device set can be formed, and the device set includes the source host set, the destination host set and the switch set.

[0046] S130, determining a data flow set formed by each data flow that each source host in the source host set needs to send within a time period and a time period set formed by each time period within the time period;

[0047] That is, each data stream within a time period forms a data stream set, and each time period within this time period forms a time period set.

[0048] S140, determining the priority of each data stream in the data stream set;

[0049] Among them, each data flow has its own priority. The higher the priority, the lower the delay required.

[0050] S150, determining a data stream transmission network topology structure; wherein the data stream transmission network topology structure includes a plurality of vertices and a plurality of edges, the vertices are hosts in the source host set, hosts in the destination host set, or switches in the switch set, and an edge between two vertices is a data stream transmission link between the two vertices;

[0051] For example, the topological structure of a data stream transmission network is G=(V,E), where V is a set of vertices, representing transmission nodes in the network; and E is a set of edges, representing transmission links in the network.

[0052] S160, determining a corresponding link matrix according to the data stream transmission network topology structure; wherein each element in the link matrix indicates whether there is a directly connected edge between the corresponding two vertices;

[0053] Among them, the element t in the i-th row and j-th column of the link matrix t ij Indicates whether there is a directly connected edge between the corresponding two vertices. In one embodiment, the path length t corresponding to the i-th device and the j-th device ij The determination method of t can be: if the edge formed by the i-th device and the j-th device belongs to the edge set formed by the multiple edges, then t ij is 1, otherwise t ij is positive infinity. It can be expressed as the following formula:

[0054]

[0055] S170, constructing an integer linear programming model according to the source host set, the destination host set, the switch set, the data flow set, the time period set, the priority of each data flow in the data flow set, and the link matrix; wherein the objective function of the integer linear programming model is to minimize the sum of the transmission delays of all data flows of the data flow set;

[0056] Wherein, the objective function may include:

[0057]

[0058] Wherein, T is the time period set, k is the time period; m is the number of the data flow, TS is the data flow set; i and j are the device numbers in the device set, V is the device set, the device set includes the source host set, the destination host set and the switch set, and the device is the source host, the destination host or the switch; p m is the priority of the mth data stream; t ij Characterizes the path length corresponding to the i-th device and the j-th device in the device set; x mijk is the decision variable corresponding to the mth data flow between the ith device and the jth device in the kth time period.

[0059] It can be seen that the objective function is to minimize the weighted sum of the transmission path lengths of all data flows.

[0060] Among them, the decision variable x mijk The determination method of x can be: if the mth data stream is transmitted from the ith device to the jth device in the kth time period, then x mijk is 1, otherwise x mijk is 0. It can be expressed as the following formula:

[0061]

[0062] The constraints of the integer linear programming model may include:

[0063]

[0064] Where q is the number of the switch, Q is the set of switches, V d is the host set, V s is the source host set, d m is the number of the destination host corresponding to the mth data stream, s m The number of the source host corresponding to the mth data flow.

[0065] It can be seen that the first constraint is the switch node constraint in the network path, which ensures that the in-degree and out-degree of all switch nodes are the same for any data flow in any time period. The second constraint is the source host node constraint. For any data flow in all time periods, the out-degree of the source host of the data flow is 1, that is, the source host only sends one data flow in a time period. The third constraint is the destination host node constraint. For any data flow in all time periods, the in-degree of the destination host of the data flow is 1, that is, the destination host only receives one data flow in a time period. The combined constraints of the first to third constraints can ensure that each data flow is transmitted within a time period and the transmission path is connected. Among them, V s ={s m|m∈TS},V d ={d m |m∈TS}. The fourth constraint indicates that any link can transmit at most one data stream in a single direction in any time period. The fifth constraint is the value range of the decision variable.

[0066] S180. Solve the integer linear programming model to obtain a network routing scheduling strategy; wherein the network routing scheduling strategy is used to characterize switches that each data flow needs to pass through during transmission from a corresponding source host to a corresponding destination host.

[0067] It is understandable that the time period for the source host of the data stream to send data to the destination host is fixed; the transmission speed of the data stream from the source host to the destination host is a fixed bit rate; all devices synchronize the clocks through the precise time protocol; and the minimum time slot of the time period can transmit a single transmission unit.

[0068] For example, the number of data flows is 5, the number of source hosts is 5, the number of destination hosts is 5, and the number of switches is 7.

[0069] In one embodiment, the data flow is a delay-sensitive data flow; the acquisition process of the delay-sensitive data flow may include: for the data flow collected by the open platform unified architecture, using the delay-sensitive network protocol to identify the delay-sensitive data flow as the delay-sensitive data flow.

[0070] It can be seen that the embodiment of the present invention is aimed at delay-sensitive data flows, that is, data flows that are sensitive to delay. Specifically, data flows are collected based on the open platform unified architecture, and then delay-sensitive data flows are identified based on the delay-sensitive network protocol, and then the above S110 to S180 are performed on the delay-sensitive data flows. Among them, the delay-sensitive data flow can reach the destination host from the source host through a complex network topology structure through a publish-subscribe mechanism.

[0071] In one embodiment, see Figure 2 The method can be implemented by a control plane, and the process of transmitting data streams according to a network routing scheduling strategy is implemented in a data transmission plane. The separation of the control plane and the transmission plane is based on a software-defined network.

[0072] It can be seen that the control plane executes S110 to S180, and the transmission plane executes data transmission. The control plane and the transmission plane are separated and implemented based on software defined network. That is, the embodiment of the present invention separates the control plane that implements the network routing scheduling algorithm from the transmission plane of the data flow.

[0073] See Table 1 below, which gives the source host, destination host and priority of the data flow, and gives the specific functions of different data flows.

[0074] Table 1 Data flow related information table

[0075]

[0076] like Figure 3 As shown in FIG. 1 , when multiple source hosts transmit data streams to a destination host via the same network route at the same time, multiple data streams will be queued in the network route, which will greatly increase the transmission delay of the network route; at the same time, due to the uncertainty of the number of transmitted data streams, the transmission delay of the network data stream also fluctuates greatly. This is the current status of scheduling. In the embodiment of the present invention, Figure 4 and Figure 5 These are two specific examples given in the examples of the present invention.

[0077] A small-scale calculation example is designed to illustrate the embodiment of the present invention by taking a small production line as an example. There are multiple open platform unified architecture terminals for collecting data on the production line, and the collected data is sent to the subscribed host for receiving data via a certain network routing protocol. The specific information of the data flow is shown in Table 1. The mathematical model is solved by the above method, and the solution result is shown in Table 2.

[0078] Table 2 Data flow scheduling results

[0079] Data Flow Transmission Path Transmission period 1 A-S1-S7-S6-F 1 2 B-S1-S7-S6-G 2 3 C-S1-S7-S6-H 3 4 D-S1-S2-S3-S6-I 2 5 E-S1-S4-S5-S6-J 1

[0080] It can be seen from the solution results that all data streams are transmitted to the subscriber via different paths in different time periods and are isolated in time and space, which can effectively reduce the transmission delay of the data stream and reduce the transmission delay jitter.

[0081] It can be seen that the embodiment of the present invention discloses an edge computing network routing scheduling method based on a delay-sensitive network. The method is a technical solution that adopts an open platform unified architecture and a delay-sensitive network protocol fusion, isolates delay-sensitive data flows in time and space, and thereby reduces the transmission delay and queuing delay of data flows on the transmission link. Moreover, the embodiment of the present invention solves the integer linear programming model to determine the scheduling scheme of the network routing. Specifically, the embodiment of the present invention first determines the source host set of edge computing data transmission and the destination host set of receiving information, and then establishes an integer linear programming model based on the description of the undirected graph, and calls the solver based on the integer linear programming model to solve the mathematical model, and finally determines the scheduling scheme of the network routing. In the above process, the embodiment of the present invention comprehensively considers the priority relationship and network path relationship of the data flow, designs a path optimization method based on the delay-sensitive network, solves the edge computing data flow transmission problem in the field of the industrial Internet, reduces the transmission delay and queuing delay of the data flow, improves the efficiency of data transmission, and reduces the jitter of data transmission.

[0082] Among them, the fusion technology solution of open platform unified architecture and delay-sensitive network is a solution proposed by the embodiment of the present invention to solve the data transmission between different layers in the industrial edge computing network architecture. The open platform unified architecture solves the problem of semantic consistency in communication between different devices by establishing information models for industrial equipment in a targeted manner and adopting mechanisms such as publishing and subscribing. The delay-sensitive network isolates the data flow in time and space by dividing the delay-sensitive data flow, thereby reducing the transmission delay of the data flow in the network topology.

[0083] Among them, the data flow transmission problem in the network topology is one of the key issues in the edge computing network architecture, and its scheduling algorithm is related to the transmission delay of the data flow and the delay determinism of the data transmission. However, due to the limited network path resources, the delay-sensitive data flow needs to queue in the link in the network switch to wait for the transmission of other data flows, which increases the transmission delay of the delay-sensitive data flow, and because the queuing time of the delay-sensitive data flow is uncertain, its transmission time often has large jitter. Based on this problem, the embodiment of the present invention is based on the open platform unified architecture and the delay-sensitive network protocol, separates the control plane from the data transmission plane, describes the problem as an integer linear programming model based on an undirected graph, and solves it to obtain the data flow network routing decision result, which effectively reduces the transmission delay of the data flow and reduces the transmission jitter of the data flow. Based on the delay-sensitive network, the embodiment of the present invention takes into account the priority of the data flow and the network topology structure, and provides a new research idea for the data flow network routing scheduling problem of the edge computing network architecture.

[0084] The embodiments of the present invention have the following beneficial effects:

[0085] 1. Comprehensively considering the complex network topology of the source host, destination host and switch, and the priority of the data flow, the transmission delay of the data flow can be reduced.

[0086] 2. It adopts the fusion technology of open platform unified architecture and delay-sensitive network protocol, and provides a specific integer linear programming model, which can effectively reduce the jitter of data stream transmission delay. The software-defined network architecture based on the separation of control plane and data plane can be effectively applied to the edge computing network architecture deployment in the field of industrial Internet.

[0087] Of course, in the embodiments of the present invention, the heterogeneity of on-site operation equipment manufacturers and interface protocols in the field of industrial Internet can be taken into consideration, while the time and space separation of data stream transmission is considered, and specific definitions of industrial field equipment, switch nodes, and network topology are given. The embodiments of the present invention can be applied to edge computing network routing scheduling problems in the field of industrial Internet.

[0088] In a second aspect, an embodiment of the present invention provides a device for determining a routing scheduling strategy for an edge computing network, see Figure 6 , the device 100 comprises:

[0089] A first determination module 110 is used to determine a source host set formed by each source host sending a data stream and a destination host set formed by each destination host receiving a data stream; wherein the source host is an industrial underlying device in the edge computing network, and the destination host is an edge computing node or a cloud computing node in the edge computing network;

[0090] A second determining module 120 is used to determine a switch set formed by switches between the source host and the destination host;

[0091] The third determination module 130 is used to determine a data flow set formed by each data flow that each source host in the source host set needs to send within a time period and a time period set formed by each time period within the time period;

[0092] A fourth determination module 140, configured to determine the priority of each data stream in the data stream set;

[0093] A fifth determination module 150 is used to determine a data stream transmission network topology structure; wherein the data stream transmission network topology structure includes a plurality of vertices and a plurality of edges, wherein the vertices are hosts in the source host set, hosts in the destination host set, or switches in the switch set, and an edge between two vertices is a data stream transmission link between the two vertices;

[0094] A sixth determination module 160 is used to determine a corresponding link matrix according to the data stream transmission network topology structure; wherein each element in the link matrix indicates whether there is a directly connected edge between the corresponding two vertices;

[0095] The model building module 170 is used to build an integer linear programming model according to the source host set, the destination host set, the switch set, the data flow set, the time period set, the priority of each data flow in the data flow set, and the link matrix; wherein the objective function of the integer linear programming model is to minimize the sum of the transmission delays of all data flows of the data flow set;

[0096] The model solving module 180 is used to solve the integer linear programming model to obtain a network routing scheduling strategy; wherein the network routing scheduling strategy is used to characterize the switches that each data flow needs to pass through during the transmission process from the corresponding source host to the corresponding destination host.

[0097] In one embodiment, the objective function includes:

[0098]

[0099] Wherein, T is the time period set, k is the time period; m is the number of the data flow, TS is the data flow set; i and j are the device numbers in the device set, V is the device set, the device set includes the source host set, the destination host set and the switch set, and the device is the source host, the destination host or the switch; p m is the priority of the mth data stream; t ij Characterizes the path length corresponding to the i-th device and the j-th device in the device set; x mijk is the decision variable corresponding to the mth data flow between the ith device and the jth device in the kth time period.

[0100] In one embodiment, the decision variable x mijk The determination method is as follows: if the mth data stream is transmitted from the ith device to the jth device in the kth time period, then x mijk is 1, otherwise x mijk is 0.

[0101] In one embodiment, the path length t corresponding to the i-th device and the j-th device ij The determination method is as follows: if the edge formed by the i-th device and the j-th device belongs to the edge set formed by the multiple edges, then t ij is 1, otherwise t ij Is positive infinity.

[0102] In one embodiment, the constraints of the integer linear programming model include:

[0103]

[0104]

[0105] Where q is the number of the switch, Q is the set of switches, V d is the host set, V s is the source host set, d m is the number of the destination host corresponding to the mth data stream, s m The number of the source host corresponding to the mth data flow.

[0106] In one embodiment, the data flow is a delay-sensitive data flow; the acquisition process of the delay-sensitive data flow includes: for the data flow collected by the open platform unified architecture, using the delay-sensitive network protocol to identify the delay-sensitive data flow as the delay-sensitive data flow.

[0107] In one embodiment, the device is implemented by a control plane, and the process of transmitting data streams according to a network routing scheduling strategy is implemented in a data transmission plane. The separation of the control plane and the transmission plane is based on a software-defined network implementation.

[0108] It is understandable that the explanation, specific implementation, beneficial effects, examples, etc. of the relevant contents in the device provided in the embodiment of the present invention can be found in the corresponding parts of the method provided in the first aspect, and will not be repeated here.

[0109] In a third aspect, an embodiment of the present invention provides a computer-readable medium, on which computer instructions are stored. When the computer instructions are executed by a processor, the processor executes the method provided in the first aspect.

[0110] Specifically, a system or device equipped with a storage medium can be provided, on which software program code that implements the functions of any of the above-mentioned embodiments is stored, and a computer (or CPU or MPU) of the system or device can be enabled to read and execute the program code stored in the storage medium.

[0111] In this case, the program code itself read from the storage medium can realize the function of any one of the above-mentioned embodiments, and thus the program code and the storage medium storing the program code constitute a part of the present invention.

[0112] The storage medium embodiments for providing the program code include a floppy disk, a hard disk, a magneto-optical disk, an optical disk (such as CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD+RW), a magnetic tape, a non-volatile memory card, and a ROM. Alternatively, the program code can be downloaded from a server computer by a communication network.

[0113] In addition, it should be clear that the functions of any of the above embodiments can be implemented not only by executing the program code read by the computer, but also by enabling an operating system operating on the computer to complete part or all of the actual operations based on instructions from the program code.

[0114] In addition, it can be understood that the program code read from the storage medium is written to a memory provided in an expansion board inserted into the computer or to a memory provided in an expansion module connected to the computer, and then based on the instructions of the program code, a CPU installed on the expansion board or expansion module is enabled to perform part or all of the actual operations, thereby realizing the functions of any of the above-mentioned embodiments.

[0115] It is understandable that the explanation, specific implementation methods, beneficial effects, examples, etc. of the relevant contents in the computer-readable medium provided in the embodiment of the present invention can be found in the corresponding parts of the method provided in the first aspect, and will not be repeated here.

[0116] In a fourth aspect, an embodiment of the present specification provides a computing device, including a memory and a processor, wherein the memory stores executable code, and when the processor executes the executable code, it implements the method in any embodiment of the specification.

[0117] It is understandable that the explanation, specific implementation, beneficial effects, examples, etc. of the relevant contents in the computing device provided in the embodiment of the present invention can be found in the corresponding parts of the method provided in the first aspect, and will not be repeated here.

[0118] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0119] Those skilled in the art should be aware that in one or more of the above examples, the functions described in the present invention can be implemented by hardware, software, widgets, or any combination thereof. When implemented by software, these functions can be stored in a computer-readable medium or transmitted as one or more instructions or codes on a computer-readable medium.

[0120] The specific implementation methods described above further illustrate the objectives, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above description is only a specific implementation method of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc. made on the basis of the technical solution of the present invention should be included in the scope of protection of the present invention.

Claims

1. A method for determining a routing scheduling strategy for an edge computing network, characterized in that: include: Determine a source host set formed by each source host sending a data stream and a destination host set formed by each destination host receiving a data stream; wherein the source host is an industrial underlying device in the edge computing network, and the destination host is an edge computing node or a cloud computing node in the edge computing network; Determine a switch set formed by switches between the source host and the destination host; Determine a data flow set formed by each data flow that each source host in the source host set needs to send within a time period and a time period set formed by each time period within the time period; Determine the priority of each data flow in the data flow set; Determine a data stream transmission network topology structure; wherein the data stream transmission network topology structure includes a plurality of vertices and a plurality of edges, the vertices are hosts in the source host set, hosts in the destination host set, or switches in the switch set, and the edge between two vertices is a data stream transmission link between the two vertices; Determine a corresponding link matrix according to the data stream transmission network topology structure; wherein each element in the link matrix indicates whether there is a directly connected edge between the corresponding two vertices; An integer linear programming model is constructed according to the source host set, the destination host set, the switch set, the data flow set, the time period set, the priority of each data flow in the data flow set, and the link matrix; wherein the objective function of the integer linear programming model is to minimize the sum of the transmission delays of all data flows of the data flow set; The integer linear programming model is solved to obtain a network routing scheduling strategy; wherein the network routing scheduling strategy is used to characterize the switches that each data flow needs to pass through during the transmission process from the corresponding source host to the corresponding destination host.

2. The method according to claim 1, characterized in that The objective function includes: Wherein, T is the time period set, k is the time period; m is the number of the data flow, TS is the data flow set; i and j are the device numbers in the device set, V is the device set, the device set includes the source host set, the destination host set and the switch set, and the device is the source host, the destination host or the switch; p m is the priority of the mth data stream; t ij Characterizes the path length corresponding to the i-th device and the j-th device in the device set; x mijk is the decision variable corresponding to the mth data flow between the ith device and the jth device in the kth time period.

3. The method according to claim 2, characterized in that The decision variable x mijk The determination method is as follows: if the mth data stream is transmitted from the ith device to the jth device in the kth time period, then x mijk is 1, otherwise x mijk is 0.

4. The method according to claim 2, characterized in that: The path length t between the i-th device and the j-th device ij The determination method is as follows: if the edge formed by the i-th device and the j-th device belongs to the edge set formed by the multiple edges, then t ij is 1, otherwise t ij Is positive infinity.

5. The method according to claim 2, characterized in that: The constraints of the integer linear programming model include: Where q is the number of the switch, Q is the set of switches, V d is the host set, V s is the source host set, d m is the number of the destination host corresponding to the mth data stream, s m The number of the source host corresponding to the mth data flow.

6. The method according to claim 1, characterized in that The data stream is a delay-sensitive data stream; The acquisition process of the delay-sensitive data flow includes: for the data flow collected by the open platform unified architecture, using the delay-sensitive network protocol to identify the delay-sensitive data flow as the delay-sensitive data flow.

7. The method according to claim 1, characterized in that The method is implemented by a control plane, and the process of transmitting data streams according to a network routing scheduling strategy is implemented in a data transmission plane. The separation of the control plane and the transmission plane is based on a software-defined network implementation.

8. A device for determining a routing scheduling strategy for an edge computing network, characterized in that: include: A first determination module is used to determine a source host set formed by each source host sending a data stream and a destination host set formed by each destination host receiving a data stream; wherein the source host is an industrial underlying device in the edge computing network, and the destination host is an edge computing node or a cloud computing node in the edge computing network; A second determining module is used to determine a switch set formed by switches between the source host and the destination host; A third determination module is used to determine a data flow set formed by each data flow that each source host in the source host set needs to send within a time period and a time period set formed by each time period within the time period; A fourth determination module, used to determine the priority of each data flow in the data flow set; a fifth determination module, configured to determine a data stream transmission network topology structure; wherein the data stream transmission network topology structure includes a plurality of vertices and a plurality of edges, wherein the vertices are hosts in the source host set, hosts in the destination host set, or switches in the switch set, and an edge between two vertices is a data stream transmission link between the two vertices; A sixth determination module is used to determine a corresponding link matrix according to the data stream transmission network topology structure; wherein each element in the link matrix indicates whether there is a directly connected edge between the corresponding two vertices; A model building module, used to build an integer linear programming model according to the source host set, the destination host set, the switch set, the data flow set, the time period set, the priority of each data flow in the data flow set and the link matrix; wherein the objective function of the integer linear programming model is to minimize the sum of the transmission delays of all data flows of the data flow set; The model solving module is used to solve the integer linear programming model to obtain a network routing scheduling strategy; wherein the network routing scheduling strategy is used to characterize the switches that each data flow needs to pass through during the transmission process from the corresponding source host to the corresponding destination host.

9. A computer-readable storage medium, characterized in that: A computer program is stored thereon, and when the computer program is executed in a computer, the computer is caused to execute the method according to any one of claims 1 to 7.

10. A computing device, characterized in that: The method comprises a memory and a processor, wherein the memory stores executable codes, and when the processor executes the executable codes, the method according to any one of claims 1 to 7 is implemented.

Images