Deterministic flow transmission method and device, electronic equipment and machine readable storage medium

Abstract

A deterministic flow transmission method and apparatus, an electronic device and a machine readable storage medium, the method planning a VPFC of a deterministic flow by d * n scheduling time slots, and planning the VPFC of the deterministic flow through a global scheduling time slot number, a certain scheduling time slot, such as slot0 scheduling, of the deterministic flow in a certain cycle period can be accurately determined by the head node of the deterministic flow based on the global time slot number, and the utilization rate of the VPFC of the deterministic flow is improved.

Description

Deterministic stream transmission method, device, electronic device and machine-readable storage medium Technical Field

[0001] The present application relates to network communication technology, and in particular to a deterministic stream transmission method, apparatus, electronic device, and machine-readable storage medium. Background Art

[0002] In a deterministic network, in order to ensure the transmission of deterministic flows, it is often necessary to construct a virtual periodic forwarding path (VPFP) for deterministic flows. VPFP adds a scheduling forwarding mapping relationship between any node in the forwarding path except the tail node and the next hop node on the basis of the forwarding path used to transmit deterministic flows. The scheduling forwarding mapping relationship here specifically refers to the mapping relationship between the target scheduling time slot (Slot) for scheduling the deterministic flow configured on the target output interface for transmitting the deterministic flow on any node except the tail node on the above-mentioned forwarding path and the target scheduling Slot for scheduling the deterministic flow configured on the target output interface for transmitting the deterministic flow on the next hop node.

[0003] After determining the VPFP of the deterministic flow, the target transmission resources for transmitting the deterministic flow within the target scheduling Slot on each node in the VPFP can be planned from the idle transmission resources corresponding to the target scheduling Slot. This is equivalent to planning a virtual periodic forwarding channel (VPFC: Virtual Periodic Forwarding Channel) for transmitting the above-mentioned deterministic flow within the VPFP.

[0004] In specific applications, the scheduling slot configured on the outbound interface of any node, such as the target scheduling slot described above, will correspond to a forwarding queue. However, due to resource constraints, the number of forwarding queues that can be implemented on any node is limited, and the number of scheduling time slots corresponding to the limited number of forwarding queues is also limited. Correspondingly, the time range expressed by the scheduling time slot is also limited. This makes it difficult to achieve fine-grained control during the above-mentioned resource planning. The inability to fine-tune resource control may cause conflicts in the transmission resources planned for each deterministic flow.

[0005] Summary of the Invention

[0006] The embodiments of the present application provide a deterministic stream transmission method, apparatus, electronic device, and machine-readable storage medium to implement refined planning of transmission resources for the deterministic stream based on the VPFC corresponding to the VPFP of the deterministic stream.

[0007] An embodiment of the present application provides a deterministic stream transmission method, characterized in that the method is applied to a management control plane entity (MCPE), where the MCPE is used to manage and control network nodes in a deterministic network. The method includes:

[0008] Determine an orchestration calendar Orchestrating-calendar for a network node in the deterministic network; the Orchestrating-calendar is composed of n scheduling calendars Scheduling-calendars, where n is greater than 1, and each Scheduling-calendar includes d scheduling time slots configured on an outbound interface of the network node for scheduling transmission of deterministic flows, where d is greater than 1;

[0009] Number the scheduling time slots in each Scheduling-calendar in the Orchestrating-calendar to obtain the global time slot number of each scheduling time slot; the global time slot numbers of any two scheduling time slots are different;

[0010] Based on the global time slot number and the determined virtual periodic forwarding path VPFP of the deterministic flow, a virtual periodic forwarding channel VPFC of the deterministic flow is determined; the VPFC of the deterministic flow includes: an identifier of the VPFP of the deterministic flow, an outbound interface on each node in the VPFP for scheduling transmission of the deterministic flow, a global scheduling time slot number on the outbound interface for scheduling transmission of the deterministic flow, and an amount of data scheduled for transmission of the deterministic flow in the scheduling time slot corresponding to the global scheduling time slot number;

[0011] Based on the VPFC of each deterministic flow, the first node on the VPFP of each deterministic flow is controlled to create a resource registration table RRT; the RRT contains RRT table entries corresponding to each global time slot number, and any RRT table entry includes: the identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table entry, or the identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot; the RRT table entry is used to schedule the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ assigned to the VPFC, and the data volume.

[0012] An embodiment of the present application provides a deterministic stream transmission method, which is applied to a network node in a deterministic network. The method includes:

[0013] This node acts as the first node on the virtual periodic forwarding path VPFP of each deterministic flow, and under the management and control of the management control plane entity MCPE, creates a resource registration table RRT based on the virtual periodic forwarding channel VPFC of each deterministic flow; the VPFC of any deterministic flow includes: the identifier of the VPFP of the deterministic flow, the output interface on each node in the VPFP for scheduling the transmission of the deterministic flow, the global scheduling time slot number on the output interface for scheduling the transmission of the deterministic flow, and the amount of data scheduled for transmission of the deterministic flow in the scheduling time slot corresponding to the global scheduling time slot number; the global scheduling time slot number is obtained by numbering the scheduling time slots in each scheduling calendar Scheduling-calendar in the orchestration calendar Orchestrating-calendar The global time slot numbers of any two scheduling time slots are different; the Orchestrating-calendar is composed of n Scheduling-calendars, where n is greater than 1, and any Scheduling-calendar includes d scheduling time slots configured on the outbound interface of the network node for scheduling and transmitting deterministic flows, where d is greater than 1; the RRT includes RRT table entries corresponding to each global time slot number, and any RRT table entry includes: an identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table entry, or an identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot;

[0014] This node acts as the first node on the VPFP of each deterministic flow. Based on the VPFC identifier in the RRT table entry or the identifier of the VQ to which the VPFC is assigned, as well as the data volume, it schedules the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue.

[0015] An embodiment of the present application further provides a deterministic stream transmission device, which is applied to a management control plane entity MCPE, wherein the MCPE is used to manage and control network nodes in a deterministic network. The device includes:

[0016] An orchestration unit is configured to determine an orchestration calendar Orchestrating-calendar for a network node in a deterministic network; the Orchestrating-calendar is composed of n scheduling calendars Scheduling-calendars, where n is greater than 1, and each Scheduling-calendar includes d scheduling time slots configured on an outbound interface of the network node for scheduling transmission of deterministic flows, where d is greater than 1;

[0017] And, numbering the scheduling time slots in each Scheduling-calendar in the Orchestrating-calendar to obtain the global time slot number of each scheduling time slot; the global time slot numbers of any two scheduling time slots are different;

[0018] a control unit, configured to determine a virtual periodic forwarding channel VPFC for the deterministic flow based on a global time slot number and a determined virtual periodic forwarding path VPFP for the deterministic flow; the VPFC for the deterministic flow including: an identifier of the VPFP for the deterministic flow, an outbound interface on each node in the VPFP for scheduling transmission of the deterministic flow, a global scheduling time slot number on the outbound interface for scheduling transmission of the deterministic flow, and an amount of data scheduled for transmission of the deterministic flow in the scheduling time slot corresponding to the global scheduling time slot number; and,

[0019] Based on the VPFC of each deterministic flow, the first node on the VPFP of each deterministic flow is controlled to create a resource registration table RRT; the RRT contains RRT table entries corresponding to each global time slot number, and any RRT table entry includes: the identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table entry, or the identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot; the RRT table entry is used to schedule the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ assigned to the VPFC, and the data volume.

[0020] An embodiment of the present application further provides a deterministic stream transmission device, which is applied to a network node in a deterministic network, and includes:

[0021] The table entry unit is used to create a resource registration table RRT based on the virtual periodic forwarding channel VPFC of each deterministic flow when the node serves as the first node on the virtual periodic forwarding path VPFP of each deterministic flow under the management and control of the management control plane entity MCPE; the VPFC of any deterministic flow includes: the identifier of the VPFP of the deterministic flow, the output interface on each node in the VPFP for scheduling the transmission of the deterministic flow, the global scheduling time slot number on the output interface for scheduling the transmission of the deterministic flow, and the amount of data scheduled for transmission of the deterministic flow in the scheduling time slot corresponding to the global scheduling time slot number; the global scheduling time slot number is obtained by scheduling the time slots in each scheduling calendar Scheduling-calendar in the orchestration calendar Orchestrating-calendar The global time slot numbers of any two scheduling time slots are different; the Orchestrating-calendar is composed of n Scheduling-calendars, n is greater than 1, and any Scheduling-calendar includes d scheduling time slots configured on the outbound interface of the network node for scheduling the transmission of deterministic flows, d is greater than 1; the RRT includes an RRT table entry corresponding to each global time slot number, and any RRT table entry includes: an identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table entry or an identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot;

[0022] The message processing unit is used to schedule the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the VPFC identifier in the RRT table entry or the VQ identifier and the data volume when the node is the first node on the VPFP of any deterministic flow.

[0023] An embodiment of the present application further provides an electronic device, the electronic device comprising: a processor and a machine-readable storage medium;

[0024] A machine-readable storage medium stores machine-executable instructions that can be executed by the processor;

[0025] The processor is configured to execute machine-executable instructions to implement any of the above methods.

[0026] The embodiment of the present application further provides a machine-readable storage medium, wherein the machine-readable storage medium stores machine-executable instructions that can be executed by a processor;

[0027] The machine executable instructions are executed by a processor to implement any of the above methods.

[0028] It can be seen from the above technical solution that in the embodiment of the present application, the VPFC of the deterministic flow is no longer planned based on the d scheduling time slots configured on the outbound interface of the network node for scheduling the transmission of the deterministic flow, but the VPFC of the deterministic flow is planned based on d*n scheduling time slots. The VPFC of the deterministic flow is planned by the global scheduling time slot number. The first node of the deterministic flow can accurately determine, based on the global time slot number, that the deterministic flow will be scheduled in a specific scheduling time slot within a certain cycle, such as slot0. For example, the packet sending period of a deterministic flow is 1000us, each scheduling time slot is 10us, and d is 10. If the global time slot number is used to accurately determine the specific cycle in which the deterministic flow will be scheduled in slot0 (the global time slot number / d can obtain the corresponding cycle), such as slot0 scheduling in the first cycle, slot0 scheduling in the 10th cycle, slot0 scheduling in the 20th cycle, and so on, then other business flows can continue to be scheduled in slot0 in other cycle periods, rather than completely occupying the resources in slot0 in all cycle periods. The utilization rate of the VPFC of the deterministic flow can reach 100%, which is very high. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the present disclosure.

[0030] FIG1 is a diagram of a time slot-queue structure provided in an embodiment of the present application;

[0031] FIG2 is a flow chart of a method provided in an embodiment of the present application;

[0032] FIG3 is a schematic diagram of time slot numbering of a scheduling calendar provided in an embodiment of the present application;

[0033] FIG4 is a structural diagram of a resource registration table created by an MCPE controlling a network node according to an embodiment of the present application;

[0034] FIG5 is a schematic diagram of a resource registration table provided in an embodiment of the present application;

[0035] FIG6 is a flow chart of another method provided in an embodiment of the present application;

[0036] FIG7 is a diagram of a message processing architecture provided in an embodiment of the present application;

[0037] FIG8 is a structural diagram of a device provided in an embodiment of the present application;

[0038] FIG9 is a structural diagram of another device provided in an embodiment of the present application;

[0039] FIG10 is a structural diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0040] Exemplary embodiments are described in detail herein, with examples illustrated in the accompanying drawings. When the following description refers to the drawings, identical numerals in different figures represent identical or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments are not intended to represent all embodiments consistent with the present application. Rather, they are merely examples of apparatuses and methods consistent with certain aspects of the present application.

[0041] The terms used in this application are for the purpose of describing particular embodiments only and are not intended to limit this application. The singular forms "a", "the" and "the" used in this application are also intended to include plural forms, unless the context clearly indicates otherwise.

[0042] In a specific implementation, the outbound interfaces of network nodes in a deterministic network are configured with d scheduling slots (where d is greater than 1) for scheduling the transmission of deterministic flows. These d scheduling slots correspond to d scheduling queues. Figure 1 illustrates this structure. Correspondingly, on the control plane, such as the Management Control Plane Entity (MCPE), there are also d scheduling slots corresponding to the aforementioned d scheduling queues. Therefore, when planning the VPFC for transmitting deterministic flows within the VPFP based on deterministic flows, these d scheduling slots are used. For example, the planned VPFC is:

[0043] The head node in the VPFP for a deterministic flow only knows to schedule the flow within a specific scheduling slot (Slot 0, for example) but does not know within which cycle (d scheduling slots constitute a cycle) Slot 0 is forwarded. This means that it is unable to fine-tune resource control. This inability to fine-tune resource control results in very low utilization of the VPFC for the deterministic flow. For example, if the packet transmission period for the deterministic flow is 1000µs and each scheduling slot is 10µs, the utilization of the VPFC for the deterministic flow is only 10%, which is very low.

[0044] In order to solve the above technical problems, the embodiment of the present application expands the d scheduling time slots / scheduling queues configured on the outbound interface of the network node for scheduling the transmission of deterministic flows through MCPE on the control plane. For details, see the process shown in Figure 2.

[0045] Referring to Figure 2, which is a flow chart of a method provided by an embodiment of the present application, the method is applied to MCPE, which is used to manage and control network nodes in a deterministic network.

[0046] As shown in Figure 2, the process may include the following steps:

[0047] Step 201: Determine an orchestration calendar for a network node.

[0048] In this embodiment, the Orchestrating-calendar is composed of n scheduling calendars (Scheduling-calendar), where n is greater than 1 and can be determined based on actual business needs, such as the packet sending period of each deterministic flow passing through the network node, etc. This embodiment does not specifically limit it.

[0049] In this embodiment, any scheduling calendar includes d scheduling time slots configured on an outbound interface of a network node for scheduling transmission of deterministic flows, where d is greater than 1. As described above, the d scheduling time slots configured on the outbound interface of the network node correspond to the d scheduling queues configured on the outbound interface of the network node.

[0050] For example, if d is 10 and n is 10, it means that MCPE expands the existing 10 scheduling time slots uniformly planned for the outbound interface of the network node to 10*10 (that is, 100) scheduling time slots uniformly planned for the outbound interface of the network node to achieve more accurate resource planning, which will be further explained below.

[0051] Step 202: Number the scheduling time slots in each Scheduling-calendar in the Orchestrating-calendar to obtain a global time slot number for each scheduling time slot.

[0052] In this embodiment, all scheduling time slots of all scheduling calendars within the orchestration calendar may be globally numbered in chronological order to form a global time slot number, wherein any two scheduling time slots have different global time slot numbers.

[0053] As an embodiment, this embodiment can arrange each Scheduling-calendar in chronological order. For each Scheduling-calendar, if the Scheduling-calendar is the first Scheduling-calendar in the Orchestrating-calendar, the scheduling time slots in the first Scheduling-calendar are numbered sequentially starting from a preset initial value, such as 0. Otherwise, the number of the last scheduling time slot in the previous Scheduling-calendar is increased by a set value to obtain a numbering start value, and the scheduling time slots in the Scheduling-calendar are numbered sequentially starting from the numbering start value. For example:

[0054] a) The time slots of the first scheduling calendar are numbered 0, 1, ..., d-1, corresponding to the global time slots 0, 1, ..., d-1;

[0055] b) The time slots 0, 1, ..., d-1 of the second scheduling calendar correspond to the global time slots d, d+1, ..., 2d-1;

[0056] c) The time slot numbers 0, 1, ..., d-1 of the kth scheduling calendar correspond to the global time slot numbers (k-1)*d, (k-1)*d+1, ..., k*d-1, and so on. Figure 3 shows an example of the time slot numbers of each scheduling calendar.

[0057] Step 203: Determine the VPFC of the deterministic flow based on the global time slot number and the determined VPFP of the deterministic flow.

[0058] This embodiment differs from existing VPFCs in that it no longer plans based on the d scheduling time slots configured on the outbound interfaces of network nodes for scheduling and transmitting deterministic flows, but instead plans based on d*n scheduling time slots. Specifically, when planning a VPFC, after determining the global scheduling time slot number for scheduling and transmitting the deterministic flow on the outbound interface of the head node in the planned VPFP for the deterministic flow, the global scheduling time slot number for scheduling and transmitting the deterministic flow on the outbound interface of any node in the VPFP other than the head node is determined according to the following formula: y = (x + k) mod M;

[0059] Among them, y represents the global scheduling time slot number used for scheduling the transmission of this deterministic flow on the outgoing interface of the current node for scheduling the transmission of this deterministic flow; x represents the global scheduling time slot number used for scheduling the transmission of this deterministic flow on the outgoing interface of the previous node of the current node for scheduling the transmission of this deterministic flow. The value range of x is {x|0≤x<M, x belongs to natural numbers}, M is the product of n and d, k is the calibration value corresponding to the current node, and the k values corresponding to adjacent nodes in VPFP are the same or different. The value range of k is: {k|0≤k<d, k belongs to natural numbers}.

[0060] As an embodiment, the calibration value k corresponding to the above-mentioned current node is determined based on the phase difference (Offset) of the scheduling time slots used for scheduling the transmission of this deterministic flow on the outgoing interface between the current node and the previous node. Among them, Offset is determined by the following method: Offset = (d + j - i) % d;

[0061] Among them, i represents the scheduling time slot (i is less than or equal to d) used for scheduling the transmission of this deterministic flow on the outgoing interface of the previous node of the current node

[0062] used for scheduling the transmission of this deterministic flow, and j represents the scheduling time slot (j is less than or equal to d) used for scheduling the transmission of this deterministic flow on the outgoing interface of the current node for scheduling the transmission of this deterministic flow.

[0063] Based on the above description, in this step 202, the VPFC of the deterministic flow at least includes: the identifier of the VPFP of this deterministic flow, the outgoing interfaces of each node in the VPFP used for scheduling the transmission of this deterministic flow, the global scheduling time slot number used for scheduling the transmission of this deterministic flow on this outgoing interface, and the amount of data scheduled for transmission in the scheduling time slot corresponding to this global scheduling time slot number of this deterministic flow (which can be planned through testing, specifically referring to the planning of existing data volumes).

[0064] Step 203, based on the VPFC of each deterministic flow, control the first node on the VPFP of each deterministic flow to create a Resource Registering Table (RRT).

[0065] As an embodiment, MCPE can construct the RRT corresponding to the first node on the VPFP of each deterministic flow and send it to this first node to implement the control in step 203 to create an RRT by the first node on the VPFP of each deterministic flow based on the VPFC of each deterministic flow.

[0066] As another example, the MCPE can send the RRT parameters (information required to construct the RRT) corresponding to the head node on the VPFP of each deterministic flow to the head node, allowing the head node to construct the RRT based on the received parameters. This ultimately implements the control of the head node on the VPFP of each deterministic flow to create the RRT based on the VPFC of each deterministic flow as described in step 203. Figure 4 illustrates how the MCPE controls each network node to create the resource registration table structure.

[0067] In this embodiment, the RRT includes RRT entries corresponding to each global time slot number. For example, the number of RRT entries in the RRT is M, where M is the product of n and d. In this embodiment, any RRT entry includes: the identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT entry, or the identifier of the virtual periodic forwarding channel queue (VQ) to which the VPFC is assigned, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot. In a specific implementation, the global time slot number corresponding to the first RRT entry in the RRT is the smallest, the global time slot number corresponding to the second RRT entry is the second smallest, and so on until the global time slot number corresponding to the last RRT entry is the largest. Figure 5 illustrates RRT using VQ as an example.

[0068] In this embodiment, the RRT table entry is used to schedule deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ assigned to the VPFC, as well as the data volume. The following will be described in detail from the perspective of the network node and will not be repeated here.

[0069] At this point, the process shown in Figure 2 is completed.

[0070] Through the process shown in Figure 2, this embodiment realizes that the VPFC of the deterministic flow is no longer planned based on the d scheduling time slots configured on the outbound interface of the network node for scheduling the transmission of the deterministic flow, but rather the VPFC of the deterministic flow is planned based on d*n scheduling time slots. The VPFC of the deterministic flow is planned based on the global scheduling time slot number. The first node of the deterministic flow can accurately determine, based on the global time slot number, that the deterministic flow will be scheduled in a specific scheduling time slot within a certain cycle, such as slot0. For example, the packet sending period of a deterministic flow is 1000us, each scheduling time slot is 10us, and d is 10. If the global time slot number is used to accurately determine the specific cycle in which the deterministic flow will be scheduled in slot0 (the global time slot number / d can obtain the corresponding cycle), such as slot0 scheduling in the first cycle, slot0 scheduling in the 10th cycle, slot0 scheduling in the 20th cycle, and so on, then other business flows can continue to be scheduled in slot0 in other cycle periods, rather than completely occupying the resources in slot0 in all cycle periods. The utilization rate of the VPFC of the deterministic flow can reach 100%, which is very high.

[0071] The following describes the method provided by the embodiment of the present application from the perspective of a network node:

[0072] Refer to Figure 6, which is a flowchart of another method provided by an embodiment of the present application. This process is applied to a network node in a deterministic network. As shown in Figure 6, the process may include the following steps:

[0073] In step 601, the node serves as the head node on the VPFP of each deterministic flow and creates an RRT based on the VPFC of each deterministic flow under the management and control of the MCPE.

[0074] This step 601 corresponds to step 203 in the process shown in FIG. 2 , and will not be described in detail here.

[0075] In step 602, this node, as the head node on the VPFP of any deterministic flow, schedules the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the VPFC identifier in the RRT table entry or the identifier of the VQ assigned to the VPFC and the data volume.

[0076] Before step 602, the node, as the head node on the VPFP of any deterministic flow, will cache the deterministic data packet to the VQ allocated to the VPFC of the deterministic flow after receiving the deterministic data packet belonging to the deterministic flow.

[0077] Under this premise, based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ to which the VPFC is assigned, and the data volume, scheduling deterministic data that meets the data volume and is cached in the VQ to which the VPFC is assigned to the corresponding forwarding queue may include:

[0078] Step 1) In the current time slot, determine the target RRT table entry corresponding to the next time slot of the current time slot in the RRT; the current time slot refers to the time slot corresponding to the global time slot number currently indicated by the time slot counter, the time slot counter indicates a global time slot number every time slot interval, such as 10us, the number of global time slot numbers allowed to be indicated by the time slot counter is M, where M is the product of n and d, and the time slot counter is reset every M time slot intervals; the next time slot refers to the time slot corresponding to the next global time slot number to be indicated by the time slot counter. In this embodiment, the time slot interval here refers to the time slot interval between two adjacent scheduling time slots among the d scheduling time slots configured on the outbound interface of the network node for scheduling the transmission of deterministic flows, such as the aforementioned 10us.

[0079] Step 2) Based on the VPFC identifier or VQ identifier and data volume in the target RRT table entry, obtain at least one deterministic data packet from the VQ corresponding to the identifier, and the data volume of the obtained deterministic data packet is less than or equal to the data volume in the target RRT table entry; for each deterministic data packet obtained, determine whether the deterministic data packet is an expired message based on the reception time of the deterministic data packet and the current time; if not, store the deterministic data packet in the corresponding forwarding queue.

[0080] As an embodiment, the above-mentioned determination of whether each deterministic data packet obtained is an expired packet based on the reception time of the deterministic data packet and the current time includes: for each deterministic data packet obtained, calculating the time difference between the reception time of the deterministic data packet and the current time, checking whether the time difference is greater than the delay required by the deterministic flow to which the deterministic data packet belongs, if so, determining that the deterministic data packet is an expired packet, and if not, determining that the deterministic data packet is not an expired packet. Here, the delay required by the deterministic flow to which the deterministic data packet belongs can be pre-configured, and this embodiment does not specifically limit it. In this embodiment, if it is determined that the deterministic data packet is an expired packet, the expired packet can be discarded.

[0081] In addition, as an embodiment, in the above step 1), under the current time slot, the global time slot number of the current time slot is mapped to the corresponding scheduling time slot configured for the outgoing interface on this node for scheduling the transmission of the deterministic data message, and the deterministic data message in the forwarding queue corresponding to the scheduling time slot is scheduled. Based on the global scheduling time slot number, this ensures that the above-mentioned head node can accurately determine that the above-mentioned deterministic data message is scheduled in a certain scheduling time slot of a certain cycle (if the above-mentioned outgoing interface is configured with d scheduling time slots, the cycle can be determined by the global time slot number of the current time slot / d), so as to fully utilize the resources in the scheduling time slot of other cycle periods to schedule other deterministic flows and improve resource utilization.

[0082] In addition, in this embodiment, the d scheduling time slots configured on the above-mentioned outbound interface for scheduling the transmission of deterministic flows correspond to d forwarding queue identifiers (ISQs). The RRT is grouped into d RRT table entries, where d is an even number, such as 10. The RRT table entries in each group are sequentially configured with corresponding ISQs. The d ISQs are grouped into 2 ISQs, and the ISQs in each group are sequentially mapped to corresponding physical queues. Different ISQs in the same group are mapped to different physical queues. Based on this, the above-mentioned forwarding queue refers to the physical queue to which the ISQ corresponding to the target RRT table entry is mapped. Figure 7 illustrates an example of the architecture of a network node as the head node of a deterministic flow receiving a deterministic data packet belonging to the deterministic flow from the outside.

[0083] At this point, the process shown in Figure 6 is completed.

[0084] Through the process shown in Figure 6, this embodiment realizes that the VPFC of the deterministic flow is no longer planned based on the d scheduling time slots configured on the outbound interface of the network node for scheduling the transmission of the deterministic flow, but rather the VPFC of the deterministic flow is planned based on d*n scheduling time slots. The VPFC of the deterministic flow is planned based on the global scheduling time slot number. The first node of the deterministic flow can accurately determine, based on the global time slot number, that the deterministic flow will be scheduled in a specific scheduling time slot within a certain cycle, such as slot0. For example, the packet sending period of a deterministic flow is 1000us, each scheduling time slot is 10us, and d is 10. If the global time slot number is used to accurately determine the specific cycle in which the deterministic flow will be scheduled in slot0 (the global time slot number / d can obtain the corresponding cycle), such as slot0 scheduling in the first cycle, slot0 scheduling in the 10th cycle, slot0 scheduling in the 20th cycle, and so on, then other business flows can continue to be scheduled in slot0 in other cycle periods, rather than completely occupying the resources in slot0 in all cycle periods. The utilization rate of the VPFC of the deterministic flow can reach 100%, which is very high.

[0085] The above describes the method provided in the embodiment of the present application. The following describes the system and device provided in the embodiment of the present application:

[0086] The system provided by the embodiment of the present application mainly includes: MCPE and network nodes in a deterministic network, wherein the MCPE executes the process shown in FIG2 , and the network nodes execute the process shown in FIG6 .

[0087] See Figure 8, which is a diagram of the structure of a device provided in an embodiment of the present application. The device is applied to MCPE, which is used to manage and control network nodes in a deterministic network. The device includes:

[0088] An orchestration unit is configured to determine an orchestration calendar Orchestrating-calendar for a network node in a deterministic network; the Orchestrating-calendar is composed of n scheduling calendars Scheduling-calendars, where n is greater than 1, and each Scheduling-calendar includes d scheduling time slots configured on an outbound interface of the network node for scheduling transmission of deterministic flows, where d is greater than 1;

[0089] And, numbering the scheduling time slots in each Scheduling-calendar in the Orchestrating-calendar to obtain the global time slot number of each scheduling time slot; the global time slot numbers of any two scheduling time slots are different;

[0090] a control unit, configured to determine a virtual periodic forwarding channel VPFC for the deterministic flow based on a global time slot number and a determined virtual periodic forwarding path VPFP for the deterministic flow; the VPFC for the deterministic flow including: an identifier of the VPFP for the deterministic flow, an outbound interface on each node in the VPFP for scheduling transmission of the deterministic flow, a global scheduling time slot number on the outbound interface for scheduling transmission of the deterministic flow, and an amount of data scheduled for transmission of the deterministic flow in the scheduling time slot corresponding to the global scheduling time slot number; and,

[0091] Based on the VPFC of each deterministic flow, the first node on the VPFP of each deterministic flow is controlled to create a resource registration table RRT; the RRT contains RRT table entries corresponding to each global time slot number, and any RRT table entry includes: the identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table entry, or the identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot; the RRT table entry is used to schedule the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ assigned to the VPFC, and the data volume.

[0092] As an embodiment, numbering the scheduling time slots in each Scheduling-calendar in the Orchestrating-calendar to obtain the global time slot number of each scheduling time slot includes:

[0093] Arrange each Scheduling-calendar in chronological order. For each Scheduling-calendar, if the Scheduling-calendar is the first Scheduling-calendar in the Orchestrating-calendar, number the scheduling time slots in the first Scheduling-calendar in sequence starting from the preset initial value. Otherwise, increase the number of the last scheduling time slot in the previous Scheduling-calendar by the set value to obtain the numbering start value, and number the scheduling time slots in the Scheduling-calendar in sequence starting from the numbering start value.

[0094] As an embodiment, the global scheduling time slot number for scheduling transmission of any deterministic flow on the outbound interface of each node in the VPFP for scheduling transmission of the deterministic flow is determined according to the following formula: y=(x+k)mod M;

[0095] Among them, y represents the outbound interface on the current node used to schedule the transmission of the deterministic flow.

[0096] The global scheduling time slot number for transmitting the deterministic flow, where the current node refers to any node other than the head node in the VPFP of the deterministic flow; x represents the global scheduling time slot number on the outgoing interface of the previous node of the current node for scheduling the transmission of the deterministic flow, and the value range of x is {x|0 ≤ x < M, x belongs to natural numbers}, k is the calibration value corresponding to the current node, and the k values corresponding to adjacent nodes in the VPFP are the same or different, and the value range of k is: {k|0 ≤ k < d, k belongs to natural numbers}; M is the product of n and d.

[0097] As an embodiment, the calibration value k corresponding to the current node is determined based on the phase difference Offset of the scheduling time slot for scheduling the transmission of the deterministic flow on the outgoing interface between the current node and the previous node;

[0098] where, Offset is determined by the following method: Offset = (d + j - i) % d;

[0099] where, i represents the scheduling time slot on the outgoing interface of the previous node of the current node for scheduling the transmission of the deterministic flow

[0100] and j represents the scheduling time slot on the outgoing interface of the current node for scheduling the transmission of the deterministic flow.

[0101] As an embodiment, the number of RRT entries in the RRT is M, and M is the product of n and d;

[0102] The global time slot number corresponding to the first RRT entry in the RRT is the smallest, the global time slot number corresponding to the second RRT entry is the second smallest, and so on until the global time slot number corresponding to the last RRT entry is the largest.

[0103] So far, the structural description of the device shown in FIG. 8 is completed.

[0104] Referring to FIG. 9, FIG. 9 is another structural diagram of a device provided by an embodiment of the present application. This device is applied to a network node in a deterministic network, and this device includes:

[0105] The table entry unit is used to create a resource registration table RRT based on the virtual periodic forwarding channel VPFC of each deterministic flow when the node serves as the first node on the virtual periodic forwarding path VPFP of each deterministic flow under the management and control of the management control plane entity MCPE; the VPFC of any deterministic flow includes: the identifier of the VPFP of the deterministic flow, the output interface on each node in the VPFP for scheduling the transmission of the deterministic flow, the global scheduling time slot number on the output interface for scheduling the transmission of the deterministic flow, and the amount of data scheduled for transmission of the deterministic flow in the scheduling time slot corresponding to the global scheduling time slot number; the global scheduling time slot number is obtained by scheduling the time slots in each scheduling calendar Scheduling-calendar in the orchestration calendar Orchestrating-calendar The global time slot numbers of any two scheduling time slots are different; the Orchestrating-calendar is composed of n Scheduling-calendars, n is greater than 1, and any Scheduling-calendar includes d scheduling time slots configured on the outbound interface of the network node for scheduling the transmission of deterministic flows, d is greater than 1; the RRT includes an RRT table entry corresponding to each global time slot number, and any RRT table entry includes: an identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table entry or an identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot;

[0106] The message processing unit is used to schedule the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the VPFC identifier in the RRT table entry or the VQ identifier and the data volume when the node serves as the first node on the VPFP of each deterministic flow.

[0107] As an embodiment, the message processing unit further receives a deterministic data message at the local node, and when the local node is the head node of the deterministic flow to which the deterministic data message belongs, caches the deterministic data message into a VQ allocated to the VPFC of the deterministic flow;

[0108] The scheduling of the deterministic data that meets the data volume and is cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ assigned to the VPFC and the data volume includes:

[0109] In a current time slot, determining a target RRT table entry corresponding to a next time slot of the current time slot in the RRT; the current time slot refers to a time slot corresponding to a global time slot number currently indicated by a time slot counter, the time slot counter indicates a global time slot number every other time slot interval, the number of global time slot numbers that the time slot counter is allowed to indicate is M, where M is the product of n and d, and the time slot counter is reset every M time slot intervals; the next time slot refers to a time slot corresponding to a next global time slot number to be indicated by the time slot counter;

[0110] Based on the VPFC identifier or VQ identifier and data volume in the target RRT table entry, at least one deterministic data packet is obtained from the VQ corresponding to the identifier, and the data volume of the obtained deterministic data packet is less than or equal to the data volume in the target RRT table entry; for each deterministic data packet obtained, determine whether the deterministic data packet is an expired message based on the reception time and current time of the deterministic data packet; if not, store the deterministic data packet in the corresponding forwarding queue.

[0111] As an embodiment, determining, for each obtained deterministic data message, whether the deterministic data message is an expired message based on the reception time of the deterministic data message and the current time includes:

[0112] For each deterministic data message obtained, calculate the time difference between the reception time of the deterministic data message and the current time, and check whether the time difference is greater than the delay required by the deterministic flow to which the deterministic data message belongs. If so, determine that the deterministic data message is an expired message; if not, determine that the deterministic data message is not an expired message.

[0113] As an embodiment, the message processing unit is further used to map the global time slot number of the current time slot to the corresponding scheduling time slot configured on the output interface of this node for scheduling the transmission of the deterministic data message in the current time slot, and schedule the deterministic data message in the forwarding queue corresponding to the scheduling time slot.

[0114] As an embodiment, the d scheduling time slots configured on the outbound interface for scheduling the transmission of deterministic flows correspond to d forwarding queue identifiers ISQ, where d is an even number. The RRT is grouped into d RRT table entries, and the RRT table entries in each group are sequentially configured with corresponding ISQs; the d ISQs are grouped into 2 ISQs, and the ISQs in each group are sequentially mapped to corresponding physical queues, and different ISQs in the same group are mapped to different physical queues;

[0115] The forwarding queue refers to the physical queue to which the ISQ corresponding to the target RRT table entry is mapped.

[0116] At this point, the structural description of the device shown in FIG9 is completed.

[0117] The present application also provides a hardware structure for the aforementioned apparatus. Figure 10 is a block diagram of an electronic device provided in the present application. As shown in Figure 10, the hardware structure may include: a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor; the processor is configured to execute the machine-executable instructions to implement the method disclosed in the above example of the present application.

[0118] Based on the same application concept as the above method, an embodiment of the present application also provides a machine-readable storage medium, on which a number of computer instructions are stored. When the computer instructions are executed by a processor, the method disclosed in the above example of the present application can be implemented.

[0119] Exemplarily, the machine-readable storage medium may be any electronic, magnetic, optical, or other physical storage device that may contain or store information, such as executable instructions, data, and the like. For example, the machine-readable storage medium may be: RAM (Random Access Memory), volatile memory, non-volatile memory, flash memory, a storage drive (such as a hard disk drive), a solid-state drive, any type of storage disk (such as a CD, DVD, etc.), or similar storage media, or a combination thereof.

[0120] The systems, devices, modules, or units described in the above embodiments may be implemented by computer chips or entities, or by products having certain functions. A typical implementation device is a computer, which may be in the form of a personal computer, laptop computer, cellular phone, camera phone, smartphone, personal digital assistant, media player, navigation device, email transceiver, game console, tablet computer, wearable device, or any combination of these devices.

[0121] For the convenience of description, the above devices are described as being divided into various units according to their functions. Of course, when implementing this application, the functions of each unit can be implemented in the same or multiple software and / or hardware.

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

[0123] The present application is described with reference to the flow chart and / or block diagram of the method, device (system) and computer program product according to the embodiment of the present application. It should be understood that each flow process and / or box in the flow chart and / or block diagram and the combination of the flow process and / or box in the flow chart and / or block diagram can be realized by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processing machine or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device for realizing the function specified in one flow chart flow or multiple flows and / or one box or multiple boxes of the block diagram.

[0124] Moreover, these computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device, which implements the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0125] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0126] The foregoing is merely 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 modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application should all be included within the scope of the claims of the present application.

Claims

1. A deterministic stream transmission method, characterized in that: The method is applied to a management control plane entity MCPE, where the MCPE is used to manage and control network nodes in a deterministic network. The method includes: Determine an orchestration calendar Orchestrating-calendar for a network node in the deterministic network; the Orchestrating-calendar is composed of n scheduling calendars Scheduling-calendars, n is greater than 1, and any Scheduling-calendar includes d scheduling time slots Slots configured on an outbound interface of the network node for scheduling transmission of deterministic flows, d is greater than 1; The scheduling time slots in each Scheduling-calendar in the Orchestrating-calendar are numbered to obtain the global time slot number of each scheduling time slot; the global time slot numbers of any two scheduling time slots are different; Based on the global time slot number and the determined virtual periodic forwarding path VPFP of the deterministic flow, determine the virtual periodic forwarding channel VPFC of the deterministic flow; the VPFC of the deterministic flow includes: the identifier of the VPFP of the deterministic flow, the outbound interface on each node in the VPFP for scheduling the transmission of the deterministic flow, the global scheduling time slot number on the outbound interface for scheduling the transmission of the deterministic flow, and the amount of data scheduled for transmission of the deterministic flow in the scheduling time slot corresponding to the global scheduling time slot number; Based on the VPFC of each deterministic flow, the head node on the VPFP of each deterministic flow is controlled to create a resource registration table RRT; the RRT contains RRT table entries corresponding to each global time slot number, and any RRT table entry includes: the identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table entry, or the identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot; the RRT table entry is used to schedule the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ assigned to the VPFC, and the data volume.

2. The method according to claim 1, characterized in that The numbering of the scheduling time slots in each Scheduling-calendar in the Orchestrating-calendar to obtain the global time slot number of each scheduling time slot includes: Arrange each Scheduling - calendar in chronological order. For each Scheduling - calendar, if the Scheduling - calendar is the first Scheduling - calendar in the Orchestrating - calendar, number the scheduling time slots in the first Scheduling - calendar in sequence starting from a preset initial value. Otherwise, obtain the number starting value by adding a set value to the number of the last scheduling time slot in the previous Scheduling - calendar, and number the scheduling time slots in this Scheduling - calendar in sequence starting from this number starting value.

3. The method according to claim 1, characterized in that The global scheduling time slot number for scheduling the transmission of a deterministic flow on the outgoing interface for scheduling the transmission of the deterministic flow on each node in the VPFP of any deterministic flow is determined according to the following formula: y=(x + k)mod M; Where, y represents the global scheduling time slot number for scheduling the transmission of the deterministic flow on the outgoing interface for scheduling the transmission of the deterministic flow on the current node, and the current node refers to any node other than the first node in the VPFP of the deterministic flow; x represents the global scheduling time slot number for scheduling the transmission of the deterministic flow on the outgoing interface for scheduling the transmission of the deterministic flow on the previous node of the current node, and the value range of x is {x|0≤x<M, x belongs to natural numbers}, k is the calibration value corresponding to the current node, the k values corresponding to adjacent nodes in the VPFP can be the same or different, and the value range of k is: {k|0≤k<d, k belongs to natural numbers}; M is the product of n and d. The calibration 4. The method according to claim 3, characterized in that value k corresponding to the current node is determined based on the phase difference Offset of the scheduling time slots for scheduling the transmission of the deterministic flow on the outgoing interface for scheduling the transmission of the deterministic flow between the current node and the previous node; Among them, Offset is determined by the following method: Offset=(d + j - i)%d; Where, i represents the scheduling time slot for scheduling the transmission of the deterministic flow on the outgoing interface for scheduling the transmission of the deterministic flow on the previous node of the current node for scheduling the transmission of the deterministic flow, and j represents the scheduling time slot for scheduling the transmission of the deterministic flow on the outgoing interface for scheduling the transmission of the deterministic flow on the current node for scheduling the transmission of the deterministic flow. The number of RRT entries in the RRT is M, and M is the product of n and d; 5. The method according to claim 1, characterized in that The global time slot number corresponding to the first RRT entry in the RRT is the smallest, the global time slot number corresponding to the second RRT entry is the second smallest, and so on until the global time slot number corresponding to the last RRT entry is the largest. This method is applied to network nodes in a deterministic network. This method includes:

6. A deterministic stream transmission method, characterized in that: ​ This node acts as the first node on the virtual periodic forwarding path VPFP of each deterministic flow. Under the management and control of the management control plane entity MCPE, it creates a resource registration table RRT based on the virtual periodic forwarding channel VPFC of each deterministic flow; the VPFC of any deterministic flow includes: the identifier of the VPFP of the deterministic flow, the output interface on each node in the VPFP used to schedule the transmission of the deterministic flow, the global scheduling time slot number on the output interface used to schedule the transmission of the deterministic flow, and the amount of data scheduled for transmission of the deterministic flow in the scheduling time slot corresponding to the global scheduling time slot number; the global scheduling time slot number is obtained by numbering the scheduling time slots in each scheduling calendar Scheduling-calendar in the orchestration calendar Orchestrating-calendar The global time slot numbers of any two scheduling time slots are different; the Orchestrating-calendar is composed of n Scheduling-calendars, n is greater than 1, and any Scheduling-calendar includes d scheduling time slots Slot configured by the outbound interface on the network node for scheduling the transmission of deterministic flows, d is greater than 1; the RRT contains RRT table items corresponding to each global time slot number, and any RRT table item includes: the identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table item or the identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot; This node acts as the head node on the VPFP of each deterministic flow. Based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ to which the VPFC is assigned, and the data volume, it schedules the deterministic data that meets the data volume cached in the VQ to which the VPFC is assigned to the corresponding forwarding queue.

7. The method according to claim 6, characterized in that The method further includes: receiving a deterministic data message at the node, and when the node is the head node of a deterministic flow to which the deterministic data message belongs, caching the deterministic data message to a VQ allocated to a VPFC of the deterministic flow; The step of scheduling the deterministic data that meets the data volume and is cached in the VQ to which the VPFC is allocated to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ to which the VPFC is allocated, and the data volume includes: In the current time slot, a target RRT table entry corresponding to the next time slot of the current time slot is determined in the RRT; the current time slot refers to the time slot corresponding to the global time slot number currently indicated by the time slot counter, the time slot counter indicates a global time slot number every other time slot interval, the number of global time slot numbers that the time slot counter is allowed to indicate is M, M is the product of n and d, and the time slot counter is reset every M time slot intervals; the next time slot refers to the time slot corresponding to the next global time slot number to be indicated by the time slot counter; Based on the VPFC identifier or the VQ identifier in the target RRT table entry, and the data volume, at least one deterministic data packet is obtained from the VQ corresponding to the identifier, and the data volume of the obtained deterministic data packet is less than or equal to the data volume in the target RRT table entry; for each deterministic data packet obtained, determine whether the deterministic data packet is an expired message based on the reception time and the current time of the received deterministic data packet, and if not, store the deterministic data packet in the corresponding forwarding queue.

8. The method according to claim 7, characterized in that The step of determining, for each obtained deterministic data message, whether the deterministic data message is an expired message based on the reception time of the deterministic data message and the current time includes: For each deterministic data packet obtained, calculate the time difference between the reception time of the deterministic data packet and the current time, and check whether the time difference is greater than the delay required by the deterministic flow to which the deterministic data packet belongs. If so, determine that the deterministic data packet is an expired message; if not, determine that the deterministic data packet is not an expired message.

9. The method according to claim 7, characterized in that: The method further includes: In the current time slot, the global time slot number of the current time slot is mapped to the corresponding scheduling time slot configured on the outbound interface of the node for scheduling transmission of the deterministic data message, and the deterministic data message in the forwarding queue corresponding to the scheduling time slot is scheduled.

10. The method according to claim 9, characterized in that The d scheduling time slots configured on the outbound interface for scheduling transmission of deterministic flows correspond to d forwarding queue identifiers ISQ, where d is an even number, and the RRT is grouped into d RRT table entries, and the RRT table entries in each group are sequentially configured with corresponding ISQs; the d ISQs are grouped into 2 ISQs, and the ISQs in each group are sequentially mapped to corresponding physical queues, and different ISQs in the same group are mapped to different physical queues; The forwarding queue refers to the physical queue to which the ISQ corresponding to the target RRT table entry is mapped.

11. A deterministic stream transmission device, characterized in that: The device is applied to a management control plane entity MCPE, wherein the MCPE is used to manage and control network nodes in a deterministic network. The device includes: An orchestration unit is used to determine an orchestration calendar Orchestrating-calendar for a network node in a deterministic network; the Orchestrating-calendar is composed of n scheduling calendars Scheduling-calendars, n is greater than 1, and any Scheduling-calendar includes d scheduling time slots Slots configured on an outbound interface of the network node for scheduling transmission of deterministic flows, d is greater than 1; And, numbering the scheduling time slots in each Scheduling-calendar in the Orchestrating-calendar to obtain the global time slot number of each scheduling time slot; the global time slot numbers of any two scheduling time slots are different; A control unit, used to determine a virtual periodic forwarding channel VPFC of a deterministic flow based on a global time slot number and a determined virtual periodic forwarding path VPFP of the deterministic flow; the VPFC of the deterministic flow includes: an identifier of the VPFP of the deterministic flow, an outbound interface on each node in the VPFP for scheduling transmission of the deterministic flow, a global scheduling time slot number on the outbound interface for scheduling transmission of the deterministic flow, and an amount of data scheduled for transmission of the deterministic flow in a scheduling time slot corresponding to the global scheduling time slot number; and, Based on the VPFC of each deterministic flow, the head node on the VPFP of each deterministic flow is controlled to create a resource registration table RRT; the RRT contains RRT table entries corresponding to each global time slot number, and any RRT table entry includes: the identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table entry, or the identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot; the RRT table entry is used to schedule the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ assigned to the VPFC, and the data volume.

12. The device according to claim 11, characterized in that The numbering of the scheduling time slots in each Scheduling-calendar in the Orchestrating-calendar to obtain the global time slot number of each scheduling time slot includes: Arrange each Scheduling-calendar in chronological order. For each Scheduling-calendar, if the Scheduling-calendar is the first Scheduling-calendar in the Orchestrating-calendar, the scheduling time slots in the first Scheduling-calendar are numbered in sequence starting from the preset initial value; otherwise, the number of the last scheduling time slot in the previous Scheduling-calendar is increased by the set value to obtain the starting numbering value, and the scheduling time slots in the Scheduling-calendar are numbered in sequence starting from the starting numbering value.

13. The device according to claim 11, characterized in that The global scheduling time slot number used for scheduling transmission of any deterministic flow on the outbound interface used for scheduling transmission of the deterministic flow on each node in the VPFP of the deterministic flow is determined according to the following formula: y=(x+k)mod M; Among them, y represents the outbound interface on the current node used to schedule the transmission of the deterministic flow. The global scheduling time slot number for transmitting the deterministic flow, where the current node refers to any node other than the first node in the VPFP of the deterministic flow; x represents the global scheduling time slot number used for scheduling the transmission of the deterministic flow on the outgoing interface of the previous node of the current node for scheduling the transmission of the deterministic flow, and the value range of x is {x|0 ≤ x < M, x belongs to natural numbers}, k is the calibration value corresponding to the current node, and the k values corresponding to adjacent nodes in the VPFP are the same or different, and the value range of k is: {k|0 ≤ k < d, k belongs to natural numbers}; M is the product of n and d.

14. The device according to claim 13, characterized in that The calibration value k corresponding to the current node is determined based on the phase difference Offset of the scheduling time slot used for scheduling the transmission of the deterministic flow on the outgoing interface between the current node and the previous node for scheduling the transmission of the deterministic flow; wherein, Offset is determined by the following method: Offset = (d + j - i) % d; wherein, i represents the scheduling time slot used for scheduling the transmission of the deterministic flow on the outgoing interface of the previous node of the current node for scheduling the transmission of the deterministic flow, and j represents the scheduling time slot used for scheduling the transmission of the deterministic flow on the outgoing interface of the current node for scheduling the transmission of the deterministic flow.

15. The device according to claim 11, characterized in that The number of RRT entries in the RRT is M, and M is the product of n and d; The global time slot number corresponding to the first RRT entry in the RRT is the smallest, the global time slot number corresponding to the second RRT entry is the second smallest, until the global time slot number corresponding to the last RRT entry is the largest.

16. A deterministic stream transmission device, characterized in that: This device is applied to a network node in a deterministic network, and this device includes: The table entry unit is used to create a resource registration table RRT based on the virtual periodic forwarding channel VPFC of each deterministic flow when the node is used as the first node on the virtual periodic forwarding path VPFP of each deterministic flow under the management and control of the management control plane entity MCPE; the VPFC of any deterministic flow includes: the identifier of the VPFP of the deterministic flow, the output interface on each node in the VPFP for scheduling the transmission of the deterministic flow, the global scheduling time slot number on the output interface for scheduling the transmission of the deterministic flow, and the amount of data scheduled for transmission of the deterministic flow in the scheduling time slot corresponding to the global scheduling time slot number; the global scheduling time slot number is obtained by scheduling time slots in each scheduling calendar Scheduling-calendar in the orchestration calendar Orchestrating-calendar The global time slot numbers of any two scheduling time slots are different; the Orchestrating-calendar is composed of n Scheduling-calendars, n is greater than 1, and any Scheduling-calendar includes d scheduling time slots Slot configured by the outbound interface on the network node for scheduling the transmission of deterministic flows, d is greater than 1; the RRT includes RRT table items corresponding to each global time slot number, and any RRT table item includes: the identifier of the VPFC of the deterministic flow scheduled for transmission in the scheduling time slot corresponding to the global time slot number corresponding to the RRT table item or the identifier of the virtual periodic forwarding channel queue VQ assigned to the VPFC, and the data volume of the deterministic flow scheduled for transmission in the scheduling time slot; The message processing unit is used to schedule the deterministic data that meets the data volume cached in the VQ assigned to the VPFC to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table item or the identifier of the VQ assigned to the VPFC and the data volume when the node serves as the head node on the VPFP of each deterministic flow.

17. The device according to claim 16, characterized in that The message processing unit further receives a deterministic data message at the node, and when the node is the head node of the deterministic flow to which the deterministic data message belongs, caches the deterministic data message to the VQ assigned to the VPFC of the deterministic flow; The step of scheduling the deterministic data that meets the data volume and is cached in the VQ to which the VPFC is allocated to the corresponding forwarding queue based on the identifier of the VPFC in the RRT table entry or the identifier of the VQ to which the VPFC is allocated, and the data volume includes: In the current time slot, a target RRT table entry corresponding to the next time slot of the current time slot is determined in the RRT; the current time slot refers to the time slot corresponding to the global time slot number currently indicated by the time slot counter, the time slot counter indicates a global time slot number every other time slot interval, the number of global time slot numbers that the time slot counter is allowed to indicate is M, M is the product of n and d, and the time slot counter is reset every M time slot intervals; the next time slot refers to the time slot corresponding to the next global time slot number to be indicated by the time slot counter; Based on the VPFC identifier or the VQ identifier in the target RRT table entry, and the data volume, at least one deterministic data packet is obtained from the VQ corresponding to the identifier, and the data volume of the obtained deterministic data packet is less than or equal to the data volume in the target RRT table entry; for each deterministic data packet obtained, determine whether the deterministic data packet is an expired message based on the reception time and current time of the deterministic data packet; if not, store the deterministic data packet in the corresponding forwarding queue.

18. The device according to claim 17, characterized in that The step of determining, for each obtained deterministic data message, whether the deterministic data message is an expired message based on the reception time of the deterministic data message and the current time includes: For each deterministic data packet obtained, calculate the time difference between the reception time of the deterministic data packet and the current time, and check whether the time difference is greater than the delay required by the deterministic flow to which the deterministic data packet belongs. If so, determine that the deterministic data packet is an expired message; if not, determine that the deterministic data packet is not an expired message.

19. The device according to claim 17, characterized in that The message processing unit is further used to map the global time slot number of the current time slot to the corresponding scheduling time slot configured on the output interface of the node for scheduling the transmission of the deterministic data message in the current time slot, and schedule the deterministic data message in the forwarding queue corresponding to the scheduling time slot.

20. The device according to claim 19, characterized in that The d scheduling time slots configured on the outbound interface for scheduling transmission of deterministic flows correspond to d forwarding queue identifiers ISQ, where d is an even number, and the RRT is grouped into d RRT table entries, and the RRT table entries in each group are sequentially configured with corresponding ISQs; the d ISQs are grouped into 2 ISQs, and the ISQs in each group are sequentially mapped to corresponding physical queues, and different ISQs in the same group are mapped to different physical queues; The forwarding queue refers to the physical queue to which the ISQ corresponding to the target RRT table entry is mapped.

21. An electronic device, characterized in that: The electronic device includes: a processor and a machine-readable storage medium; A machine-readable storage medium stores machine-executable instructions that can be executed by the processor; The processor is used to execute machine executable instructions to implement the method according to any one of claims 1 to 10.

22. A machine-readable storage medium, characterized in that: The machine-readable storage medium stores machine-executable instructions that can be executed by a processor; The machine executable instructions are executed by a processor to implement the method according to any one of claims 1 to 10.

Images