A deterministic network resource allocation method, device and system

Abstract

The present application discloses a deterministic network resource allocation method, including: calculating the optimal flow order and flow offset of all intra-layer flows, and determining the intra-layer flow scheduling time block; calculating the flow of all intra-layer flows and all inter-layer flows, and determining the separation ratio of the super cycle and the inter-layer flow scheduling time block; according to the segmentation ratio of the super cycle, in the super cycle, aligning the end time of the intra-layer flow scheduling time block with the start time of the inter-layer flow scheduling time block at a preset position. Also disclosed is a device and system for implementing the present method. The present application optimizes the scheduling time configuration of intra-layer flows and inter-layer flows, especially minimizes the waiting delay of inter-layer flows at the boundary switch, improves the utilization rate of network resources, and enhances the flexibility and scalability of network resource scheduling.

Description

Technical Field

[0001] The present application relates to the field of network communications, and in particular to a deterministic network resource allocation method, device and system. Background Art

[0002] The traditional factory network relies on a hierarchical architecture, and its classic three-layer structure mainly includes field-level network (field equipment), workshop-level network and factory-level network, such as Figure 1 The field-level network is usually configured as a linear or ring topology, connected to the shop-level network (also usually a linear or ring topology), representing the assembly line or production unit, which is connected to a larger ring topology to ultimately form the factory backbone network.

[0003] Time Sensitive Network (TSN) is an extension of Ethernet. Based on clock synchronization, traffic shaping and scheduling, it not only ensures the deterministic transmission of high-priority services, but also meets the needs of co-transmission of various types of traffic. It is considered to be the evolution direction of the next generation of industrial networks in factories. However, the factory hierarchical network based on TSN technology faces many challenges in the communication process. The factory hierarchical deterministic network system is composed of a controller, terminal devices, ordinary switches and edge switches.

[0004] According to whether the source node and destination node of the traffic are at the same level, the traffic in the network can be divided into two types, namely intra-layer flow and inter-layer flow. The source node and destination node of the intra-layer flow are in the same layer. Since the communication distance is short and the routing is simple, the scheduling calculation of the intra-layer flow is relatively simple; the source node and destination node of the inter-layer flow are in different layers, the communication distance is long, and the transmission of the inter-layer flow needs to pass through the boundary switch of each layer, which not only affects the scheduling within each layer, but also due to the incomplete consistency of the traffic conditions of each layer and the configuration of the TSN switch, the inter-layer flow will generate additional waiting delay when passing through the boundary switch, which seriously affects the deterministic transmission of cross-layer services. In addition, the scheduling strategy of traditional factory networks is generally offline calculation. With the development of smart factories and flexible manufacturing, devices in the network often need to be added, reduced or dynamically moved, which brings huge challenges to the flexibility of factory network scheduling.

[0005] How to reduce the impact of inter-layer flow scheduling on intra-layer flow scheduling is a technical problem to be solved in this application. Summary of the invention

[0006] The present application proposes a deterministic network resource allocation method, device and system, which overcomes the adverse effects of inter-layer flow scheduling on intra-layer flow scheduling and realizes the optimized scheduling of intra-layer flow and inter-layer flow.

[0007] In a first aspect, an embodiment of the present application provides a deterministic network resource allocation method, including:

[0008] Calculate the optimal flow order and flow offset of all intra-layer flows, and determine the intra-layer flow scheduling time block;

[0009] Calculating the flow rates of all the intra-layer flows and all the inter-layer flows, and determining the division ratio of the super period and the scheduling time block of the inter-layer flows;

[0010] According to the division ratio of the super cycle, in the super cycle, the end time of the intra-layer flow scheduling time block is aligned with the start time of the inter-layer flow scheduling time block at a preset position.

[0011] In a second aspect, the embodiment of the present application further provides a deterministic network resource allocation device, including: an intra-layer scheduling module, an inter-layer scheduling module and a time scheduling module,

[0012] The intra-layer scheduling module is used to calculate the optimal flow order and flow offset of all intra-layer flows and determine the intra-layer flow scheduling time block;

[0013] The inter-layer scheduling module is used to calculate the flow rates of all intra-layer flows and all inter-layer flows, and determine the division ratio of the super cycle and the inter-layer flow scheduling time block;

[0014] The time scheduling module is used to align the end time of the intra-layer flow scheduling time block with the start time of the inter-layer flow scheduling time block at a preset position in the super cycle according to the division ratio of the super cycle.

[0015] In a third aspect, the embodiment of the present application further provides a deterministic network resource allocation system, including: a controller, an end device, a common switch and an edge switch,

[0016] The controller is used to implement any method described in any embodiment provided in this application;

[0017] The terminal device is used to receive the scheduling schedule configured by the controller to complete the configuration;

[0018] The common switch is used to receive the scheduling schedule configured by the controller and complete the configuration;

[0019] The border switch is used to receive the scheduling schedule configured by the controller to complete the configuration.

[0020] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium on which a computer program is stored, and when the program is executed by a processor, the method described in any embodiment provided in the present application is implemented.

[0021] In a fifth aspect, an embodiment of the present application further provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the method described in any embodiment provided in the present application is implemented.

[0022] At least one of the above-mentioned technical solutions adopted in the embodiments of the present application can achieve the following beneficial effects: by determining the optimal flow order and flow offset of all intra-layer flows, determining the intra-layer flow scheduling time block, combining the calculation of the traffic of all intra-layer flows and all inter-layer flows, determining the segmentation ratio of the super cycle and the inter-layer flow scheduling time block, according to the segmentation ratio of the super cycle, in the super cycle, the end time of the intra-layer flow scheduling time block and the start time of the inter-layer flow scheduling time block are aligned at a preset position, thereby optimizing the scheduling time configuration of the intra-layer flows and inter-layer flows, especially minimizing the waiting delay of the inter-layer flows at the boundary switch, improving the utilization rate of network resources, and enhancing the flexibility and scalability of network resource scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0024] Figure 1 A schematic diagram of a factory hierarchical network architecture in the prior art;

[0025] Figure 2 A flow chart of a deterministic network resource allocation method provided in an embodiment of the present application;

[0026] Figure 3.a and 3.b A schematic diagram of optimizing flow sorting and flow offset provided in an embodiment of the present application;

[0027] Figure 4.a and 4.b A schematic diagram of an intra-layer flow and inter-layer flow scheduling scheme provided in an embodiment of the present application;

[0028] Figure 5 A schematic diagram of a deterministic network architecture provided for an embodiment of the present application;

[0029] Figure 6 A flowchart of a deterministic network resource allocation method provided in an embodiment of the present application;

[0030] Figure 7 A schematic diagram of a deterministic network resource allocation device provided in an embodiment of the present application;

[0031] Figure 8A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0032] In order to make the purpose, technical solution and advantages of the present application clearer, the technical solution of the present application will be clearly and completely described below in combination with the specific embodiments of the present application and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present application.

[0033] The technical solutions provided by various embodiments of the present application are described in detail below in conjunction with the accompanying drawings.

[0034] like Figure 2 The figure is a flow chart of a deterministic network resource allocation method provided in an embodiment of the present application, comprising the following steps:

[0035] Step 210: Calculate the optimal flow order and flow offset of all intra-layer flows, and determine the intra-layer flow scheduling time block;

[0036] In a deterministic network, is the set of all periodic time-sensitive flows. Each time-sensitive flow can be represented by a six-tuple, namely (s f ,d f ,p f ,t f ,r f ,ddl f ), where s f represents the source node, d f represents the destination node, p f represents the flow period, t f represents the transmission delay of the flow at the port, r f Represents the path of the flow, ddl f Represents the maximum delay of the flow. The network adopts the Time-Aware Shaper (TAS) scheduling mechanism in TSN technology, and the period of the Gate Control List (GCL) is set to the lowest common multiple of all traffic periods in the network, that is, the super period H.

[0037] The network traffic scheduling will be divided into two stages: intra-layer scheduling and inter-layer scheduling. Before scheduling calculation, the network centralized controller collects information about all traffic in the network.

[0038] (1) Intra-layer scheduling: In the intra-layer scheduling phase, the controller analyzes the information of all intra-layer flows and calculates the intra-layer schedule for each layer. In order to minimize the end-to-end delay of intra-layer flows, the intra-layer flows are scheduled in a wait-free transmission manner, that is, a dedicated transmission time slot is allocated to each flow. Since dedicated resources are reserved for each flow in advance, the intra-layer flows do not need to queue after arriving at the switch and can be transmitted immediately, thereby eliminating the queuing delay at the switch.

[0039] (2) Inter-layer scheduling: In the inter-layer scheduling stage, in order to eliminate the extra waiting delay of inter-layer flows at the edge switch, the start transmission time of each inter-layer flow is aligned. In order to avoid the impact of inter-layer flows on the transmission of intra-layer flows, the end time of intra-layer scheduling is aligned with the start transmission time of inter-layer flows, thereby determining the final scheduling schedule. The remaining resources can be used to incrementally schedule new traffic or transmit best effort (BE) flows.

[0040] Specifically, in the intra-layer scheduling phase, the controller first determines the dedicated time slot allocation scheme for the intra-layer flows. The flow span refers to the time difference between the start time of the first flow transmission and the completion time of the last flow transmission. In the resource allocation process, the order of flow transmission and the start transmission time of each flow are important factors in determining the flow span. Figure 3.a and Figure 3.b A schematic diagram of optimizing stream ordering and stream offset provided for an embodiment of the present application illustrates that the order (ordering) of stream transmission and stream offset (changing the start transmission time of the stream to achieve a stream compression effect) can both affect the stream span.

[0041] Figure 3.a The effect of the order of stream transmission on the stream span is illustrated. The white legend is stream 1, the black legend is stream 2, and the shaded legend is stream 3. Figure 3.a The upper part schedules the flows in the order of flow 1, flow 2, and flow 3. Figure 3.a The lower part schedules the flows in the order of flow 3, flow 1, and flow 2. The flow span of the second scheduling order is smaller than that of the first scheduling order.

[0042] Figure 3.b The influence of the stream transmission order on the stream span is explained. On the premise that the scheduling order of the streams remains unchanged, the stream offset method is used to postpone the transmission start time of streams 1 and 2. After completing the offset of the above two streams, the stream span is also reduced.

[0043] When the number of scheduled flows is the same, the smaller the flow span, the more remaining resources and the higher the time slot utilization. Therefore, in the intra-layer scheduling stage, the scheduling scheme that can minimize the flow span can be found by changing the flow order and flow offset. This stage is usually more complicated to calculate. The optimization goal can be to minimize the compressed flow span and use heuristic algorithms such as Tabu Search and genetic algorithms to obtain an approximate optimal solution. At this point, the controller determines the relative position of the flow span of the intra-layer scheduling and the dedicated transmission resources of each intra-layer flow. The set of all resources in the flow span can be regarded as a dedicated time block for intra-layer flow scheduling, that is, the intra-layer flow scheduling time block, which is represented by B. intra express.

[0044] Step 220: Calculate the flow rates of all the intra-layer flows and all the inter-layer flows, and determine the division ratio of the super period and the scheduling time block of the inter-layer flows;

[0045] In the inter-layer scheduling stage, the resources for intra-layer scheduling and inter-layer scheduling can be reasonably allocated to determine the final scheduling schedule.

[0046] Figure 4.a and 4.b This is a schematic diagram of a scheduling scheme for intra-layer flows and inter-layer flows provided by an embodiment of the present application. The specific steps are as follows: The controller evaluates the size and quantity of intra-layer flows and inter-layer flows based on all existing network traffic information, and allocates resources according to a certain ratio, such as the ratio of the volume (size * quantity) of intra-layer and inter-layer flows in the entire network, and sets the ratio as the division ratio λ of the super period. In step 210, the intra-layer scheduling stage has calculated the time block B for scheduling the existing intra-layer flows. intra Based on the above information and the needs of the existing inter-layer flows (usually less than the intra-layer flows) in the network, the first half of the super cycle is allocated to the intra-layer flow scheduling and the second half is allocated to the inter-layer flow scheduling, while the transmission needs of each layer are met and there is a certain surplus. The time length of the inter-layer flow scheduling is λ·H, which is called the inter-layer scheduling time block B. inter , and the time length of intra-layer scheduling is (1-λ)·H.

[0047] Step 230: According to the division ratio of the super cycle, in the super cycle, the end time of the intra-layer flow scheduling time block is aligned with the start time of the inter-layer flow scheduling time block at a preset position.

[0048] Preferably, the preset position is the product of 1 minus the division ratio of the super period and the super period.

[0049] In one embodiment, Figure 4.aIn the original scheme, if there is an inter-layer flow that needs to be transmitted from layer 1 to layer 3, since the inter-layer flow at layer 3 starts transmitting later, the flow needs to wait for a period of time t after it reaches the border switch of layer 3 from the border switch of layer 1. inter_wait , until the inter-layer traffic gating of layer 3 is opened, it can successfully enter this layer and reach the final destination node.

[0050] In the improved solution provided by the present application, based on the λ value determined during the resource allocation, the start transmission time of each layer's inter-layer flow is aligned at the time (1-λ)·H, so that no matter which layer the inter-layer flow reaches, it does not need to wait at the edge switch and can be transmitted directly. At this time, the inter-layer flow scheduling time block B inter The scheduling position in the super cycle is determined.

[0051] Schedule the intra-layer flow to time block B intra The end time of is also set to (1-λ)·H. According to the flow span scheduled within the layer, B can be calculated. intra At the beginning of intra The scheduling position in the super cycle is also determined.

[0052] Further, after the alignment, it includes: calculating a scheduling schedule for all the intra-layer flows and all the inter-layer flows.

[0053] Furthermore, after calculating the scheduling schedule of all the intra-layer flows and all the inter-layer flows, the newly added intra-layer flows are added to the front of the intra-layer flow scheduling time block, and the scheduling schedule of all the intra-layer flows and all the inter-layer flows is updated.

[0054] Further, after calculating the scheduling schedules of all the intra-layer flows and all the inter-layer flows, the newly added inter-layer flows are added to the inter-layer flow scheduling time block, and the scheduling schedules of all the intra-layer flows and all the inter-layer flows are updated and calculated.

[0055] In one embodiment, B intra and B inter After the position of the superperiod is determined, the newly added intralayer flow is placed at B intra Before; for the newly added interlayer flow, the interlayer flow on site did not fill B inter In the case of B, the newly added inter-layer flow is directly added to the existing batch of inter-layer flows for transmission. Different from the intra-layer scheduling, the inter-layer flow adopts the flow batch scheduling method. As long as the newly added inter-layer flow does not overflow B inter , then the transmission with low latency can be maintained. intra There are still resources left that can be used to transmit BE streams.

[0056] In one embodiment, each port of the TSN switch has 8 queues, corresponding to traffic of 8 priorities 0 to 7. intra and B inter The planning of the TSN switch will affect the configuration of the TSN switch gating list. For example, if the priority of the flow in the layer is set to 7, then in B intra During the time period, the gate of the queue with priority 7 is opened, and the gates of all other queues are closed; the priority of the inter-layer flow is set to 6, then in B inter In the time range, the gate of the priority 6 queue is opened, and the gates of all other queues are closed. Except for queues 7 and 6, all other queues are used to transmit BE traffic when there is no time-sensitive traffic in the network.

[0057] The present application provides a deterministic network resource allocation method, which determines the optimal flow order and flow offset of all intra-layer flows, determines the intra-layer flow scheduling time block, combines the calculation of the traffic of all intra-layer flows and all inter-layer flows, determines the segmentation ratio of the super cycle and the inter-layer flow scheduling time block, and aligns the end time of the intra-layer flow scheduling time block with the start time of the inter-layer flow scheduling time block at a preset position in the super cycle according to the segmentation ratio of the super cycle, thereby optimizing the scheduling time configuration of the intra-layer flows and inter-layer flows, especially minimizing the waiting delay of the inter-layer flows at the boundary switch, improving the utilization rate of network resources, and enhancing the flexibility and scalability of network resource scheduling.

[0058] Figure 5 This is a schematic diagram of a deterministic network architecture provided by an embodiment of the present application. It includes: a controller, an end device, a common switch and an edge switch.

[0059] The intra-layer scheduling module in the controller is responsible for calculating the optimal flow order and flow offset of all intra-layer flows in each layer, outputting the intra-layer scheduling plan for the layer, and determining the intra-layer flow scheduling time block;

[0060] The inter-layer scheduling module in the controller is responsible for calculating the resource ratio required for the inter-layer flow and ultimately determining the overall scheduling schedule within the super cycle.

[0061] At the same time, the controller also has functions such as topology management, information collection, access control and configuration delivery.

[0062] Figure 6 A flowchart of a deterministic network resource allocation method provided in an embodiment of the present application includes the following steps:

[0063] Step 610: The centralized controller collects information of all existing flows in the network;

[0064] The centralized controller can collect the resource status of the entire network and provide globally optimized resource configuration.

[0065] Step 620: sort and offset all intra-layer flows, and find a scheduling solution for the intra-layer flows when the flow span is minimum;

[0066] Step 630: Obtaining the intra-layer flow scheduling time block B intra ;

[0067] Step 640: Evaluate the volume of intra-layer and inter-layer flows and determine the segmentation ratio of the super period H;

[0068] In one embodiment, intra-layer and inter-layer are statistics of the entire network. If there are three layers, then intra-layer includes intra-layer traffic of layer 1, layer 2, and layer 3; inter-layer includes traffic passing through the boundary between layer 1 and layer 2 and / or the boundary between layer 2 and layer 3. Volume can be expressed as flow size*number.

[0069] Step 650: Determine inter-layer flow scheduling time block B inter ;

[0070] Step 660: According to the value of λ, B intra The end time of B inter The start time of is aligned at (1-λ)·H;

[0071] Step 670: Determine a scheduling schedule for existing traffic;

[0072] Step 680: The controller processes the new traffic request;

[0073] Step 690: Determine whether the newly added traffic is an intra-layer traffic: if so, jump to step 691 for execution; if not, jump to step 694 for execution;

[0074] Step 691: Determine whether the resources in the layer are sufficient: if yes, jump to step 692 to execute; if no, jump to step 693 to execute;

[0075] Step 692: Add to B intra Before, jump to step 696 for execution;

[0076] Step 693: the scheduling of the new flow fails, and the process jumps to step 697 to end the execution;

[0077] Step 694: Determine whether the inter-layer resources are sufficient: if yes, jump to step 695 to execute; if no, jump to step 693 to execute;

[0078] Step 695: Join B inter among;

[0079] Step 696: The scheduling is successful, the overall scheduling table is updated, and the network resource status is updated to the controller;

[0080] Step 697: End.

[0081] Figure 7 A schematic diagram of a deterministic network resource allocation device provided in an embodiment of the present application, the device is used to implement any of the methods described in the foregoing of the present application, including: an intra-layer scheduling module 710, an inter-layer scheduling module 720 and a time scheduling module 730,

[0082] The intra-layer scheduling module 710 is used to calculate the optimal flow order and flow offset of all intra-layer flows and determine the intra-layer flow scheduling time block;

[0083] The inter-layer scheduling module 720 is used to calculate the flow of all the intra-layer flows and all the inter-layer flows, and determine the separation ratio of the super cycle and the inter-layer flow scheduling time block;

[0084] The time scheduling module 730 is used to align the end time of the intra-layer flow scheduling time block with the start time of the inter-layer flow scheduling time block at a preset position in the super cycle according to the division ratio of the super cycle.

[0085] In one embodiment, the time scheduling module 730 is further used to: determine the preset position as the product of 1 minus the division ratio of the super period and the super period.

[0086] In one embodiment, the time scheduling module 730 is further used to: after the alignment, calculate the scheduling schedule of all the intra-layer flows and all the inter-layer flows.

[0087] In one embodiment, the time scheduling module 730 is also used to: after calculating the scheduling schedule of all the intra-layer flows and all the inter-layer flows, add the newly added intra-layer flows to the front of the intra-layer flow scheduling time block, and update the scheduling schedule of all the intra-layer flows and all the inter-layer flows.

[0088] In one embodiment, the time scheduling module 730 is also used to: after calculating the scheduling schedule of all the intra-layer flows and all the inter-layer flows, add the newly added inter-layer flows to the inter-layer flow scheduling time block, and update the scheduling schedule of all the intra-layer flows and all the inter-layer flows.

[0089] In the aforementioned apparatus embodiment, the time module 730 is further used to: configure the scheduling schedule to the network device.

[0090] The embodiment of the present application also provides a deterministic network resource allocation system, including: a controller, an end device, a common switch and an edge switch,

[0091] The controller is used to implement the method described in any embodiment of the first aspect of the present application;

[0092] The terminal device is used to receive the scheduling schedule configured by the controller to complete the configuration;

[0093] The common switch is used to receive the scheduling schedule configured by the controller and complete the configuration;

[0094] The border switch is used to receive the scheduling schedule configured by the controller to complete the configuration.

[0095] Furthermore, after completing the configuration, the terminal device updates the network resource status of the terminal device to the controller.

[0096] Furthermore, after completing the configuration, the common switch updates the network resource status of the common switch to the controller.

[0097] Furthermore, after completing the configuration, the border switch updates the network resource status of the border switch to the controller.

[0098] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0099] Therefore, the present application also proposes a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the method described in any embodiment of the first aspect of the present application is implemented.

[0100] Furthermore, in order to generate the device described in the embodiment of the second aspect of this application, the present application also proposes an electronic device (or computing device), comprising a processor and a memory storing program instructions, wherein the processor is configured to implement the method described in the embodiment of the first aspect of this application when running the program instructions.

[0101] Figure 8 The electronic device 800 shown in the figure is only an example and should not bring any limitation to the functions and application scope of the embodiment of the present application.

[0102] It includes: one or more processors 820; a storage device 810, used to store one or more programs. When the one or more programs are executed by the one or more processors 820, the one or more processors 820 implement the deterministic network resource allocation method provided in the embodiments of the present application, and the method includes at least one step described in each embodiment of the present application.

[0103] The number of processors 820 in the electronic device may be one or more. Figure 8 A processor 820 is taken as an example; the processor 820, storage device 810, input device 830 and output device 840 in the electronic device can be connected via a bus or other methods, and the figure takes the connection via bus 850 as an example.

[0104] The storage device 810, as a computer-readable storage medium, can be used to store software programs, computer executable programs, and module units, such as program instructions corresponding to the deterministic network resource allocation method in the embodiment of the present application. The storage device 810 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to the use of the terminal, etc. In addition, the storage device 810 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some embodiments, the storage device 810 may further include a memory remotely arranged relative to the processor 820, and these remote memories may be connected via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0105] It can be understood that the processor 820 of this embodiment includes at least one module among the intra-layer scheduling module 710, the inter-layer scheduling module 720 and the time scheduling module 730 of the embodiment of the present application, which is used to implement at least one part of the functions of the above-mentioned embodiment, and can be an entity composed of one or more components. The specific functions of each module will not be repeated here.

[0106] The input device 830 may be used to receive input numbers, character information or voice information, and to generate key signal inputs related to user settings and function controls of the electronic device.

[0107] The output device 840 may include electronic devices such as a display screen and a speaker.

[0108] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0109] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims

1. A deterministic network resource allocation method, characterized in that: include: Minimize the flow span by changing the transmission order and start transmission time of the flow in the layer, where the flow span refers to the time difference between the start time of the first flow transmission and the completion time of the last flow transmission; calculate the optimal flow order and flow offset of all the flows in the layer, and determine the set of all resources in the flow span, i.e., the scheduling time block of the flow in the layer; Calculate the flow of all intra-layer flows and all inter-layer flows, and determine the division ratio of the super period and the scheduling time block of the inter-layer flows according to the volume ratio of the intra-layer and inter-layer flows in the whole network; the volume is the product of the size and the number of flows; According to the division ratio of the super cycle, in the super cycle, the end time of the intra-layer flow scheduling time block is aligned with the start time of the inter-layer flow scheduling time block at a preset position, and the preset position is 1 minus the division ratio of the super cycle multiplied by the super cycle.

2. The method according to claim 1, after the alignment, characterized in that: include: A scheduling schedule for all the intra-layer flows and all the inter-layer flows is calculated.

3. According to the method of claim 2, after calculating the scheduling schedule of all the intra-layer flows and all the inter-layer flows, the newly added intra-layer flows are added to the front of the intra-layer flow scheduling time block, and the scheduling schedule of all the intra-layer flows and all the inter-layer flows is updated.

4. According to the method of claim 2, after calculating the scheduling schedule of all the intra-layer flows and all the inter-layer flows, the newly added inter-layer flows are added to the inter-layer flow scheduling time block, and the scheduling schedule of all the intra-layer flows and all the inter-layer flows is updated.

5. The method according to any one of claims 2 to 4, characterized in that: include: The scheduling schedule is configured to the network device.

6. A deterministic network resource allocation device, used to implement the method described in any one of claims 1 to 5, characterized in that: include: Intra-layer scheduling module, inter-layer scheduling module and time scheduling module, The intra-layer scheduling module is used to calculate the optimal flow order and flow offset of all intra-layer flows by changing the transmission order and the start transmission time of the intra-layer flows, and determine the intra-layer flow scheduling time block; The inter-layer scheduling module is used to calculate the flow of all intra-layer flows and all inter-layer flows, and determine the division ratio of the super cycle and the inter-layer flow scheduling time block according to the volume ratio of the intra-layer and inter-layer flows in the whole network; The time scheduling module is used to align the end time of the intra-layer flow scheduling time block with the start time of the inter-layer flow scheduling time block at a preset position in the super cycle according to the division ratio of the super cycle. The preset position is the product of 1 minus the division ratio of the super cycle and the super cycle.

7. The device according to claim 6, characterized in that The time scheduling module is further used to calculate the scheduling timetable of all the intra-layer flows and all the inter-layer flows after the alignment.

8. The device according to claim 7, characterized in that The time scheduling module is also used to: after calculating the scheduling schedule of all the intra-layer flows and all the inter-layer flows, add the newly added intra-layer flows to the front of the intra-layer flow scheduling time block, and update the scheduling schedule of all the intra-layer flows and all the inter-layer flows.

9. The device according to claim 7, characterized in that The time scheduling module is also used to: after calculating the scheduling schedule of all the intra-layer flows and all the inter-layer flows, add the newly added inter-layer flows to the inter-layer flow scheduling time block, and update the scheduling schedule of all the intra-layer flows and all the inter-layer flows.

10. The device according to any one of claims 7 to 9, characterized in that The time module is further used to configure the scheduling timetable to the network device.

11. A deterministic network resource allocation system, characterized in that: include: Controllers, end devices, ordinary switches and edge switches, The controller is used to implement any method described in claims 1 to 5; The terminal device is used to receive the scheduling schedule configured by the controller to complete the configuration; The common switch is used to receive the scheduling schedule configured by the controller and complete the configuration; The border switch is used to receive the scheduling schedule configured by the controller to complete the configuration.

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

13. An electronic device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method according to any one of claims 1 to 5 is implemented.

Images