WO2023015644A1

WO2023015644A1 - Planning method and system architecture for scheduling of chained service flow

Info

Publication number: WO2023015644A1
Application number: PCT/CN2021/116974
Authority: WO
Inventors: 杨冬; 龚恺; 王洪超; 高德云; 张宏科
Original assignee: 北京交通大学
Priority date: 2021-08-10
Filing date: 2021-09-07
Publication date: 2023-02-16
Also published as: CN113765825A; CN113765825B

Abstract

The present application discloses a planning method and system architecture for scheduling of a chained service flow. The method comprises: obtaining network architecture information of an industrial network and service flow information transmitted in the industrial network to match the network architecture information with the service flow information to construct a service flow model, the service flow information at least comprising a service flow logic association relationship which is used for representing a logic association relationship of a service flow and a sub-service flow thereof; generating a time determinability constraint condition of the industrial network by using a constraint condition for the information in the service flow model; and generating a service flow time slot scheduling solution of the service flow model on the premise of the time determinability constraint condition. According to the technical solution provided by the present application, the planning of the overall scheduling of a service flow of an industrial network within a specified time period is completed, and the problems that a TSN scheduling service is difficult and complex and a single scheduling service flow may generate adverse effects are solved.

Description

A planning method and system architecture for chained business flow scheduling

technical field

The present application relates to the technical field of industrial networks, in particular to a planning method and system architecture for chained service flow scheduling.

Background technique

Driven by the new intelligent manufacturing industry, new manufacturing and production modes such as personalized customization and network collaboration have been widely developed. Under the new model, frequent data interaction between manufacturing equipment and industrial application information systems is required through industrial networks. However, the information technology (IT) and operational technology (OT) systems of the enterprise's internal wired network technology are independently networked; on the other hand, the industrial control technology system uses various incompatible field industrial bus networks and industrial Ethernet, making industrial data Interaction is cumbersome. Therefore, in order to flexibly process business flows and be compatible with the characteristics of industrial Ethernet, such as deterministic time delay and jitter, researching new industrial network architectures is currently a hot direction. Industrial networks are currently evolving towards Time Sensitive Networking (TSN) based on the widely used Ethernet. TSN can support the real-time and reliability requirements of the OT system on the network, and is compatible with the standard Ethernet used by the IT network. Therefore, TSN can effectively solve the above two problems and is considered to be a key technology for future industrial networks.

However, although time-sensitive networks have the characteristics of time-deterministic guarantee and flexible network scheduling, in actual industrial production, business flows of multiple subnets are often required to cooperate to complete tasks, and planning multiple service flows at the same time will bring new possibilities to TSN scheduling. challenge. In a time-deterministic network, all tasks need to be completed within the specified time. Since the business processes in the service chain have corresponding sequential logic relationships, a single scheduled business flow may not meet the delay and jitter range of the overall business flow, resulting in unpredictable consequences.

Contents of the invention

In view of this, the embodiments of the present application provide a planning method and system architecture for chained service flow scheduling, so as to provide a suitable scheduling scheme for deterministic network scheduling of industrial chained service flows.

According to the first aspect, a planning method for chained service flow scheduling, the method includes:

Acquiring the network architecture information of the industrial network and the service flow information transmitted in the industrial network, so as to construct a service flow model according to the network architecture information and the service flow information, the service flow information at least including the Describe the logical relationship between the business flow and its sub-business flows;

generating time-deterministic constraints of the industrial network using constraints of information in the business flow model;

A service flow time slot scheduling scheme of the service flow model is generated on the premise of the time deterministic constraint condition.

Optionally, using constraints of information in the service flow model to generate time-deterministic constraints of the industrial network includes:

Obtain a constraint set including at least chained service flow frame time slot constraints, network routing constraints, service flow delay requirement constraints, and relay node processing time constraints, and the constraint set is the time deterministic constraint condition.

Optionally, the network routing constraint is a constraint set including at least a start point constraint, an end point constraint and a relay node constraint.

Optionally, the expressions of the chained service flow frame time slot constraint, the service flow delay requirement constraint, and the relay node processing time constraint are as follows:

Wherein, the frame time slot constraint expression of the chained service flow is as follows:

In the formula, v _a and v _b respectively represent two terminals of a service flow transfer, v _i represents a relay node in a service flow,

Indicates a service flow, F indicates the full service flow, ε indicates the network edge, t _vi.start and t _vi-1.start respectively indicate two adjacent nodes in a service flow, T _trans , T _propa and T _handle respectively indicate Data frame transmission delay, switch processing delay and network port queuing delay, T _delay.max represents the total delay;

Wherein, the service flow delay requirement constraint expression is as follows:

In the formula

Indicates the network route identifier,

Indicates the delay period of the service flow, v _r indicates the relay node in the two terminals of the service flow,

Indicates the proportion of the time delay between sub-service flows to the total delay requirement,

Indicates the processing delay between two sub-service flows, where

and

Represent business flow

The two sub-traffic flows of ;

Wherein, the processing time constraint expression of the relay node is as follows:

In the formula,

Indicates the processing delay between two sub-service flows, P _i indicates the flow priority, n indicates the number of service flows,

Indicates the ratio of the time delay between two sub-service flows to the total delay requirement,

Indicates the network routing identifier, and TT is the industrial control time-triggered stream.

Optionally, the expressions of the start point constraint, end point constraint and relay node constraint are as follows:

Among them, the origin constraint expression is:

Among them, the end point constraint expression is:

Among them, the relay node constraint expression is:

In the formula, TT is the time-triggered flow of industrial control, v _a and v _b represent the starting point and end point of the business flow respectively, v _i , v _j and v _r respectively represent the relay nodes in a business flow, f ₍₎ represents the business flow, rel indicates the ratio of the time delay between two sub-service flows to the total delay requirement,

Represents a network route identifier.

Optionally, generating the service flow time slot scheduling scheme of the service flow model on the premise of the time deterministic constraint condition includes:

Taking the service flow information as the input of the solver, the time deterministic constraint condition as the constraint of the solver, and calculating all the time slot scheduling schemes of the service flow satisfying the constraint condition through the solver.

Optionally, the method also includes:

obtaining an optimization objective function, and matching the optimization objective function with the solver before solving;

Solving is performed according to the optimization objective of the optimization objective function, and an optimal solution among all the service flow time slot scheduling schemes satisfying the constraint conditions is generated.

Optionally, the logical association relationship is represented by a flow association identifier REL _i , and its expression is:

Among them, f _i and f _j represent two different sub-service flows,

Indicates the processing delay between two sub-service flows;

k represents the proportional value, and TT is the trigger flow of industrial control time;

in,

P _i represents the flow priority, and n represents the number of service flows.

According to the second aspect, a system architecture for chained service flow scheduling, the system includes:

The information collection module acquires the network architecture information of the industrial network and the business flow information transmitted in the industrial network, so as to construct a business flow model according to the network architecture information and the business flow information, and the business flow information includes at least Used to represent the logical relationship between the business flow and its sub-service flows;

A constraint module, which uses constraints of information in the business flow model to generate time-deterministic constraints of the industrial network;

The calculation module generates the service flow time slot scheduling scheme of the service flow model on the premise of the time deterministic constraint condition.

According to a third aspect, an electronic device comprising:

A memory and a processor, the memory and the processor are connected in communication with each other, computer instructions are stored in the memory, and the processor performs the first aspect by executing the computer instructions, or any of the first aspects A method described in an alternative embodiment.

The technical solution of the present application has the following advantages:

Embodiments of the present application provide a planning method and system architecture for chained service flow scheduling. The method specifically includes: firstly determining the service flow that needs to be transmitted in the industrial network and the information related to it. Then determine the specific network architecture of the industrial network according to the network topology and network status information of the industrial network. In this way, the business flow model is constructed according to the business flow information and the network architecture, and the time deterministic constraint conditions for formulating the scheduling scheme are determined by the business flow model, so that the formulated scheduling scheme meets the time determinism of the network through the constraints. Finally, taking the business flow information as the input of the solver, and the time deterministic constraints as the calculation index of the solver, the scheduling scheme that can complete the business flow transmission within the specified time is calculated. Further optimize the solving process of the solver by formulating the objective function to obtain the optimal scheduling scheme, which can reduce the resources occupied by scheduling and/or improve the scheduling efficiency, and further improve the schedulability of the scheduling scheme planned by this application . The generated scheduling scheme completes the overall scheduling of the industrial network business flow within a specified time, and overcomes the difficulty and complexity of TSN scheduling business, and the problem that a single scheduling business flow may have adverse effects.

Description of drawings

In order to more clearly illustrate the specific embodiments of the present application or the technical solutions in the prior art, the following will briefly introduce the accompanying drawings that need to be used in the description of the specific embodiments or prior art. Obviously, the accompanying drawings in the following description The drawings are some implementations of the present application, and those skilled in the art can obtain other drawings based on these drawings without creative work.

FIG. 1 is a schematic diagram of the steps of a planning method for chained service flow scheduling according to an embodiment of the present application;

FIG. 2 is a schematic diagram of an application scenario of a planning method for chained service flow scheduling according to an embodiment of the present application;

FIG. 3 is a schematic structural diagram of a system architecture for chained service flow scheduling according to an embodiment of the present application;

FIG. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed ways

In order to make the purposes, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments It is a part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without making creative efforts belong to the scope of protection of this application.

The technical features involved in the different embodiments of the present application described below may be combined as long as they do not constitute conflicts with each other.

Please refer to Figure 1 and Figure 2, a planning method for chained service flow scheduling provided by the embodiment of the present application, which specifically includes the following steps:

Step S101: Obtain the network architecture information of the industrial network and the business flow information transmitted in the industrial network to match the network architecture information and business flow information to build a business flow model. The business flow information includes at least the business flow logic association relationship, which is used to represent Logical association of a business flow and its sub-business flows.

Specifically, the current TSN processing service flow is completed in one network. This application is oriented to industrial chain service applications, that is, service flows in multiple subnets are chained together to complete industrial services collaboratively. Before generating the chained service flow scheduling scheme, it is necessary to know the specific network architecture of the industrial network used to transmit the service flow, so it is necessary to collect the network architecture information of the network architecture, where the network architecture information includes network topology information and network status information. Network topology information can be collected by sending and receiving LLDP link layer discovery protocol packets. Network topology information includes: connection information between switches, connection information between terminals and switches, specifically link ID, link source, and destination terminal MAC address, total link bandwidth, link available bandwidth, link packet loss rate, link end-to-end delay and other detailed parameters; network status information includes: link available bandwidth, switch processing delay, device network card speed.

First obtain the basic information of the network device, that is, the MAC address and IP address of the switch, the MAC address and IP address of the network terminal; secondly, obtain the network card information of the switch, including the switch ID, MAC address of the network card, and the identification number of the network card; after that, query and monitoring can be used Network card to obtain network status information. After obtaining the network architecture information, it is also necessary to obtain the service flow information transmitted in the industrial network. It is analogous to formulating a traffic plan that needs to be implemented in advance. The road structure of the plan and the vehicles passing on the road. The road structure is analogous to the network architecture in the embodiment of this application, and the vehicle is analogous to the business flow in the embodiment of this application. Therefore This application can plan a scheduling scheme for chained business flows in an industrial network, which is similar to a traffic plan, so that the business flows can be interacted within a specified time.

To obtain service flow information, first obtain the service flow identity information of the chained service flow and its sub-service flow, which is used to refer to the identity of the service flow to be transmitted, including: source, destination terminal (host) ID, service flow ID, source , the MAC address of the destination terminal, the IP address of the source and destination terminals; secondly, obtain the basic information of the chained service flow and its sub-service flow, which is used to describe the relevant attributes of the service flow, including but not limited to: service flow data Packet sending cycle, maximum number of frames sent in data packet cycle, maximum frame size of data packet, priority of business flow; and, it is also necessary to obtain the business flow requirement information of the business flow and its sub-service flow, which is used to represent the requirements and conditions of the business flow , including but not limited to: the maximum transmission delay of the flow, the range of the delay jitter of the flow, the data transmission offset, and the DSCP priority; In the example, it is also necessary to obtain the business flow logical association relationship between the chained business flow and its sub-business flow, which is uniquely used in the embodiment of this application to represent the logical relationship between the business flow and its sub-business flow, and the same chained business flow The logical association of each sub-service flow, etc. When an external device needs to communicate through the industrial network, the external device will send various information to the industrial network to form various business flows.

The TSN network can be expressed as N=(V,E), v∈V,ε∈E, V is a set of network nodes, and E is a set of network edges. Each flow can be uniformly represented by the following expression: <P _i , S _i , D _i , T _i , DDL _i , REL _i >, which are flow priority, source address, destination address, flow period, maximum transmission delay, Stream association ID. Among them, the flow association identifier REL _i is a unique identifier for the chained service flow in the embodiment of the present application, and represents the association information of the logical relationship between the sub-service flows in the chained service flow, expressed as

Among them, f _i and f _j are sub-service flows,

Indicates the ratio of the time delay between sub-service flows to the total delay requirement, as follows:

And, the processing delay between two sub-traffic flows can be expressed as follows:

Among them, the processing delay is quantified by taking the flow cycle as a time unit.

Step S102: Generate time-deterministic constraints of the industrial network using constraints of information in the business flow model.

Specifically, the planned scheduling scheme can realize the function that the service flow is transmitted within a specified time, and the time deterministic constraints of the industrial network need to be added to the planning calculation. Among them, the time-deterministic constraint condition analyzes the time-sensitive flow according to the network topology information, network state information and service flow information, and obtains the network constraint condition result. The embodiment of the present application uses but is not limited to chained service flow frame time slot constraints, network routing constraints, service flow delay requirement constraints, and relay node processing time constraints to generate deterministic constraint conditions. By using the set of the above constraints as Time Deterministic Constraints

Among them, according to information such as the size and period of the sub-service flow data frame, a chained service flow frame time slot constraint is generated, where the service flow frame period size can be expressed as

It is numerically expressed as the least common multiple of the frame period of all sub-service flows; the time of adjacent nodes in the service flow is not less than the sum of data frame transmission delay, switch processing delay and network port queuing delay, and the total end-to-end delay is not greater than the total delay required by the service flow, therefore, the chained service flow frame slot constraint can be expressed as follows:

Indicates a business flow node, and the two endpoints of the flow are indicated in brackets.

Among them, according to the chained service flow and its sub-service flow period, end-to-end delay, delay jitter and other requirements, the service flow delay requirement constraints of the chained service flow and its sub-service flows are generated. The delay constraint describes each An end-to-end flow should reach all destinations before the deadline, which takes into account the processing time of the relay nodes of the industrial network based on service chaining, so the equation of the delay constraint is described as follows:

The equation describes the end-to-end delay, and it can be seen that the end-to-end delay mainly considers the data transmission delay of the flow and the processing delay of the relay node. Delay period for business flow

specified by the user. In order to provide delay guarantees, the latency between the source and destination's sending time points (including the relay node's processing delay) should be within the deadline.

Among them, the processing time constraint of the relay node

Described as shown in the following formula. An equality becomes an equal sign if and only if the right-hand side of the inequality equals zero. and this means that the stream

There is no relay node v _r in the network, and the processing time of the relay node is zero.

TT stands for industrial control time-triggered stream, which belongs to the high-priority stream mainly scheduled by TSN.

The network routing constraints include, but are not limited to: starting point constraints, end point constraints, and relay node constraints. The network routing constraint is generated according to the network topology information and the link state information. First, for the nodes in the business flow

Define a network route identifier:

If any link in the service flow passes through the edge [v _i , v _j ] in the network topology, the value of the network routing identifier is 1; if any link in the service flow does not pass through this [v _i , v _j ], it is 0. Accordingly, the first constraint origin constraint of network routing is expressed as:

This constraint is to ensure that node v _a is always the first transmission node of the link in the network topology, and there will be no second node in the network topology to send initial data before node v _a , which means that before this point there is Any edge that a node is connected to is routed, formulated using a routing identifier.

In order to ensure that node _vb is the only terminal node of the traffic flow link, the second constraint endpoint constraint of network routing is expressed as:

After ensuring the constraints of the starting point and the ending point, based on the multi-flow cascading characteristics of this chained service flow, there is a relay node, which is not only the end point of the previous sub-service flow, but also the starting point of the next sub-service flow. Therefore, The third constraint for network routing, the relay node constraint, is expressed as:

Through the above constraints, it can be ensured that the planned scheduling scheme can complete the transmission of business flows within the specified time in most cases, thus ensuring the time-deterministic characteristics of the industrial network.

Step S103: Generate a service flow time slot scheduling scheme of the service flow model on the premise of time deterministic constraints.

Specifically, the solver is used to calculate the service flow time slot scheduling scheme to schedule the chained service flow in the industrial network. The service flow information is the input of the solver, and all available path groups are calculated. It is required to dynamically adjust the business flow information. The time-deterministic constraints are the constraints of the solver. The solver can use but not limited to SMT solver, ILP solver, OMT solver, etc., so as to solve the time-deterministic scheduling scheme that meets the user's time requirements. The principle of the solver is the prior art, and will not be repeated in the embodiment of the present application. For ease of understanding, the industrial network can be compared to the traffic road network, the business flow can be compared to the vehicle, the solver can be compared to the traffic police who formulate the plan, and the constraints can be compared to the traffic rules (the constraints in the embodiment of this application are when the business flow is transmitted. specifications and demand attributes), so as to formulate a set of command schemes that meet the traffic rules.

Specifically, in one embodiment, a planning method for chained service flow scheduling provided by the embodiment of the present application further includes the following steps:

Step S104: Obtain the optimization objective function, and match the optimization objective function with the solver before solving;

Step S105: Perform calculation according to the optimization objective of the optimization objective function, and generate an optimal solution among all service flow time slot scheduling schemes satisfying the constraints.

Specifically, the optimization objective function is generally the goal of the user's optimal demand, which is mainly reflected in the optimization of network performance such as packet loss rate, bandwidth utilization rate, and network schedulability. By setting the optimization function, the optimal scheme among all the time-deterministic scheduling schemes generated in steps S102 to S103 can be screened out, and the optimization objective function can be added to the solving process of the solver, which can reduce a large amount of time according to the optimization objective. Calculation time, thereby improving the efficiency of planning and scheduling schemes. In this application, the optimization objective function is selected as the minimum bandwidth occupancy rate, B is the link bandwidth, and the service flow scheduling is completed by using the minimum bandwidth to save link bandwidth resources and improve the schedulability of the service flow. The optimization objective function is as follows;

By performing the above steps, the embodiment of the present application provides a chained service flow scheduling planning method: firstly, determine the service flow that needs to be transmitted in the industrial network, and its related information. Then determine the specific network architecture of the industrial network according to the network topology and network status information of the industrial network. In this way, the business flow model is constructed according to the business flow information and the network architecture, and the time deterministic constraint conditions for formulating the scheduling scheme are determined by the business flow model, so that the formulated scheduling scheme meets the time determinism of the network through the constraints. Finally, taking the business flow information as the input of the solver, and the time deterministic constraints as the calculation index of the solver, the scheduling scheme that can complete the business flow transmission within the specified time is calculated. Further optimize the solving process of the solver by formulating the objective function to obtain the optimal scheduling scheme, which can reduce the resources occupied by scheduling and/or improve the scheduling efficiency, and further improve the schedulability of the scheduling scheme planned by this application . The generated scheduling scheme completes the overall scheduling of industrial network business flows within a specified time, and overcomes the difficulty and complexity of TSN scheduling business, and the problem that a single scheduling business flow may have adverse effects.

As shown in Figure 3, this embodiment also provides a system architecture for chained service flow scheduling, the system includes:

The information collection module 101 acquires the network architecture information of the industrial network and the business flow information transmitted in the industrial network to construct a business flow model according to the network architecture information and business flow information. The business flow information includes at least Logical relationship of sub-business flows. For details, refer to the relevant description of step S101 in the above method embodiment, and details are not repeated here.

The constraint module 102 generates a time-deterministic constraint condition of the industrial network by using the constraint condition of the information in the service flow model. For details, refer to the relevant description of step S102 in the above method embodiment, and details are not repeated here.

The solution module 103 uses a solver to obtain a service flow time slot scheduling scheme of a service flow model premised on time deterministic constraints. For details, refer to the relevant description of step S103 in the above method embodiment, and details are not repeated here.

The system architecture for chained service flow scheduling provided by the embodiment of the present application is used to implement the planning method for chained service flow scheduling provided in the above embodiment. The implementation method is the same as the principle. For details, refer to the above method embodiment The relevant descriptions will not be repeated here.

Through the cooperation of the above-mentioned components, the embodiment of the present application provides a chained service flow scheduling system architecture: first, determine the service flow that needs to be transmitted in the industrial network, and its related information. Then determine the specific network architecture of the industrial network according to the network topology and network status information of the industrial network. In this way, the business flow model is constructed according to the business flow information and the network architecture, and the time deterministic constraint conditions for formulating the scheduling scheme are determined by the business flow model, so that the formulated scheduling scheme meets the time determinism of the network through the constraints. Finally, taking the business flow information as the input of the solver, and the time deterministic constraints as the solving index of the solver, the scheduling scheme that can complete the business flow transmission within the specified time is calculated. Further optimize the solving process of the solver by formulating the objective function to obtain the optimal scheduling scheme, which can reduce the resources occupied by scheduling and/or improve the scheduling efficiency, and further improve the schedulability of the scheduling scheme planned by this application . The generated scheduling scheme completes the overall scheduling of industrial network business flows within a specified time, and overcomes the difficulty and complexity of TSN scheduling business, and the problem that a single scheduling business flow may have adverse effects.

FIG. 4 shows an electronic device according to an embodiment of the present application. The device includes: a processor 901 and a memory 902, which may be connected through a bus or in other ways. In FIG. 4, the connection through a bus is taken as an example.

The processor 901 may be a central processing unit (Central Processing Unit, CPU). The processor 901 can also be other general-purpose processors, digital signal processors (Digital Signal Processor, DSP), application-specific integrated circuits (Application Specific Integrated Circuit, ASIC), field-programmable gate array (Field-Programmable Gate Array, FPGA) or Other chips such as programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or combinations of the above-mentioned types of chips.

The memory 902, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs, non-transitory computer-executable programs and modules, such as program instructions/modules corresponding to the methods in the above method embodiments. The processor 901 executes various functional applications and data processing of the processor by running the non-transitory software programs, instructions and modules stored in the memory 902, that is, implements the methods in the above method embodiments.

The memory 902 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application program required by at least one function; the data storage area may store data created by the processor 901 and the like. In addition, the memory 902 may include a high-speed random access memory, and may also include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state storage devices. In some embodiments, the storage 902 may optionally include storages that are remotely located relative to the processor 901, and these remote storages may be connected to the processor 901 through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

One or more modules are stored in the memory 902, and when executed by the processor 901, the methods in the foregoing method embodiments are executed.

Specific details of the foregoing electronic device may be understood by correspondingly referring to corresponding relevant descriptions and effects in the foregoing method embodiments, and details are not repeated here.

Those skilled in the art can understand that realizing all or part of the processes in the methods of the above embodiments can be completed by instructing related hardware through computer programs, and the implemented programs can be stored in a computer-readable storage medium. During execution, it may include the processes of the embodiments of the above-mentioned methods. Wherein, the storage medium can be a magnetic disk, an optical disk, a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a flash memory (Flash Memory), a hard disk (Hard Disk Drive) , abbreviation: HDD) or solid-state drive (Solid-State Drive, SSD), etc.; the storage medium may also include a combination of the above-mentioned types of memory.

Although the embodiment of the application has been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the application, and such modifications and variations all fall into the scope defined by the appended claims. within the limited range.

Claims

A planning method for chained service flow scheduling, characterized in that the method comprises:

Acquiring the network architecture information of the industrial network and the service flow information transmitted in the industrial network, so as to construct a service flow model according to the network architecture information and the service flow information, the service flow information at least including the Describe the logical relationship between the business flow and its sub-business flows;

generating time-deterministic constraints of the industrial network using constraints of information in the business flow model;

A service flow time slot scheduling scheme of the service flow model is generated on the premise of the time deterministic constraint condition.
The method according to claim 1, wherein the time-deterministic constraints of the industrial network are generated using constraints of information in the business flow model, including:

Obtain a constraint set including at least chained service flow frame time slot constraints, network routing constraints, service flow delay requirement constraints, and relay node processing time constraints, and the constraint set is the time deterministic constraint condition.
The method according to claim 2, wherein the network routing constraint is a constraint set including at least a start point constraint, an end point constraint and a relay node constraint.
The method according to claim 2, wherein the expressions of the chained service flow frame time slot constraint, the service flow delay requirement constraint, and the processing time constraint of the relay node are as follows:

Wherein, the frame time slot constraint expression of the chained service flow is as follows:

t vi.start -t vi-1.start ≥T trans +T propa +T handle

In the formula, v a and v b respectively represent two terminals of a service flow transfer, v i represents a relay node in a service flow,
Indicates a service flow, F indicates the full service flow, ε indicates the network edge, t vi.start and t vi-1.start respectively indicate two adjacent nodes in a service flow, T trans , T propa and T handle respectively indicate Data frame transmission delay, switch processing delay and network port queuing delay, T delay.max represents the total delay;

Wherein, the service flow delay requirement constraint expression is as follows:

In the formula
Indicates the network route identifier,
Indicates the delay period of the service flow, v r indicates the relay node in the two terminals of the service flow,
Indicates the proportion of the time delay between sub-service flows to the total delay requirement,
Indicates the processing delay between two sub-service flows, where
and
Represent business flow
The two sub-traffic flows of ;

Wherein, the processing time constraint expression of the relay node is as follows:

In the formula,
Indicates the processing delay between two sub-service flows, P i indicates the flow priority, n indicates the number of service flows,
Indicates the ratio of the time delay between two sub-service flows to the total delay requirement,
Indicates the network routing identifier, and TT is the industrial control time-triggered flow.
The method according to claim 3, wherein the expressions of the starting point constraint, the end point constraint and the relay node constraint are as follows:

Among them, the origin constraint expression is:

Among them, the end point constraint expression is:

Among them, the relay node constraint expression is:

In the formula, TT is the time-triggered flow of industrial control, v a and v b represent the starting point and end point of the business flow respectively, v i , v j and v r respectively represent the relay nodes in a business flow, f () represents the business flow, rel indicates the ratio of the time delay between two sub-service flows to the total delay requirement,
Represents a network route identifier.
The method according to claim 1, wherein generating the service flow time slot scheduling scheme of the service flow model on the premise of the time deterministic constraint condition includes:

Taking the service flow information as the input of the solver, the time deterministic constraint condition as the constraint of the solver, and calculating all the time slot scheduling schemes of the service flow satisfying the constraint condition through the solver.
The method according to claim 6, further comprising:

obtaining an optimization objective function, and matching the optimization objective function with the solver before solving;

Solving is performed according to the optimization objective of the optimization objective function, and an optimal solution among all the service flow time slot scheduling schemes satisfying the constraint conditions is generated.
The method according to claim 1, wherein the logical association relationship is represented by a flow association identifier REL i , and its expression is:

Among them, f i and f j represent two different sub-service flows,
Indicates the proportion of the time delay between sub-service flows to the total delay requirement,
Indicates the processing delay between two sub-service flows;

in,

k represents the proportional value, and TT is the trigger flow of industrial control time;

in,

P i represents the flow priority, and n represents the number of service flows.
A system architecture for chained business flow scheduling, characterized in that the system architecture includes:

The information collection module acquires the network architecture information of the industrial network and the business flow information transmitted in the industrial network, so as to construct a business flow model according to the network architecture information and the business flow information, and the business flow information includes at least Used to represent the logical relationship between the business flow and its sub-service flows;

A constraint module, which uses constraints of information in the business flow model to generate time-deterministic constraints of the industrial network;

The calculation module generates the service flow time slot scheduling scheme of the service flow model on the premise of the time deterministic constraint condition.
An electronic device, characterized in that it comprises:

A memory and a processor, the memory and the processor are connected in communication with each other, computer instructions are stored in the memory, and the processor executes the computer instructions to perform any one of claims 1 to 8 the method described.