CN118828901A - A time slot resource reservation method, communication device and storage medium - Google Patents

Abstract

The embodiment of the application provides a time slot resource reservation method, a communication device and a storage medium, which relate to the technical field of communication and are used for performing time slot scheduling in a mixed time slot length network and reserving time slot resources for a target message to be sent. The method specifically comprises the following steps: obtaining detection results of M detection time slots by receiving detection messages sent by a second node in the continuous M detection time slots; the detection result of each detection time slot is used for indicating a time slot in the transmission of a first node mapped by a detection message transmitted in the detection time slot, and M is a positive integer; determining a target mapping relation between a target of the second node and a time slot in target transmission of the first node based on detection results of the M detection time slots; based on the target mapping relationship, the output time slot of the first node is sent to the target report Wen Yuliu by the second node.

Description

A time slot resource reservation method, communication device and storage medium

Technical Field

The present application relates to the field of communication technology, and in particular to a time slot resource reservation method, a communication device and a storage medium.

Background Art

At present, in order to meet the needs of the underlying network for remote control delay-sensitive services such as telemedicine, remote driving and network manufacturing, the industry is studying how to enhance IP/MPLS networks to provide deterministic forwarding capabilities. IETF has released the standard RFC8655, which describes the architecture of deterministic networks and defines the quality of service (QoS) objectives of deterministic forwarding: the minimum and maximum delays from source to destination, as well as bounded delay jitter; the allowed message loss rate; and the upper bound of out-of-order message delivery. In this network architecture, a time slot (or cycle) scheduling mechanism can be used to meet different business needs.

However, the current time slot (or cycle) scheduling mechanism is usually aimed at a deterministic network with the same time slot length for each node. For a mixed time slot network with multiple time slot lengths, reasonable resource reservation and allocation cannot be achieved.

Summary of the invention

The present application provides a time slot resource reservation method, a communication device and a storage medium, which are used to establish a time slot mapping relationship in a mixed time slot length network and reserve time slot resources for a target message to be sent.

In order to achieve the above purpose, this application adopts the following technical solutions:

In a first aspect, the present application provides a time slot resource reservation method, which is applied to a first node, and the method includes:

By receiving the detection message sent by the second node in M consecutive detection time slots, the detection results of the M detection time slots are obtained; wherein the detection result of each detection time slot is used to indicate the sending time slot of the first node mapped by the detection message sent in the detection time slot, and M is a positive integer;

Determine a target mapping relationship between a target outgoing time slot of the second node and a target transmitting time slot of the first node based on the detection results of the M detection time slots;

Based on the target mapping relationship, an outgoing time slot of the first node is reserved for the target message sent by the second node.

In a second aspect, the present application provides another time slot resource reservation method, which is applied to a second node and includes:

Determine the number M of detection time slots used to send detection messages, where M is a positive integer;

Send a detection message to the first node in M consecutive detection time slots, so that the first node determines the target mapping relationship between the target outgoing time slot of the second node and the target sending time slot of the first node based on the detection results of the M detection time slots; wherein the detection message corresponding to each detection time slot is used to determine the sending time slot of the first node corresponding to the detection time slot, and the target mapping relationship is used to indicate the first node to reserve the outgoing time slot of the first node for the target message sent by the second node.

In a third aspect, a device for reserving time slot resources is provided, which is applied to a first node, and the device includes:

A receiving module, configured to obtain detection results of M detection time slots by receiving detection messages sent by the second node in M consecutive detection time slots; wherein the detection result of each detection time slot is used to indicate the sending time slot of the first node mapped by the detection message sent in the detection time slot, and M is a positive integer;

A processing module, configured to determine a target mapping relationship between a target outgoing time slot of the second node and a target transmitting time slot of the first node based on the detection results of the M detection time slots;

The processing module is further used to reserve an outgoing time slot of the first node for a target message sent by the second node based on the target mapping relationship.

In a fourth aspect, another device for reserving time slot resources is provided, which is applied to a second node, and includes:

A processing module, used to determine the number M of detection time slots used to send detection messages, where M is a positive integer;

A sending module is used to send a detection message to a first node in M consecutive detection time slots, so that the first node determines the target mapping relationship between the target outgoing time slot of the second node and the target sending time slot of the first node based on the detection results of the M detection time slots; wherein the detection message corresponding to each detection time slot is used to determine the sending time slot of the first node corresponding to the detection time slot, and the target mapping relationship is used to indicate that the first node reserves the outgoing time slot of the first node for the target message sent by the second node.

In a fifth aspect, a communication device is provided, comprising: a processor and a memory; the memory stores instructions executable by the processor; when the processor is configured to execute the instructions, the communication device implements the time slot resource reservation method provided in the first aspect or the second aspect above.

In a sixth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions. When the computer instructions are executed on a computer, the computer executes the time slot resource reservation method provided in the first aspect or the second aspect.

In a seventh aspect, a computer program product comprising computer instructions is provided. When the computer instructions are executed on a computer, the computer executes the time slot resource reservation method provided in the first aspect or the second aspect.

In an embodiment of the present application, in a mixed time slot length network, the mapping relationship between the outgoing time slot of the sending node of the adjacent node and the sending time slot of the receiving node can be determined, so that the determined mapping relationship will be used as a reference for selecting the outgoing time slot, and then time slot scheduling is performed in the mixed time slot length network, and time slot resources are reserved for the target message to be sent to meet the needs of deterministic services. In this way, a good foundation can also be provided for deploying a packet time slot scheduling mechanism in a cross-domain interconnected mixed time slot length network.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings are used to provide a further understanding of the technical solution of the present invention and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present invention and do not constitute a limitation on the technical solution of the present invention.

FIG1 is a schematic diagram of an application scenario provided by an embodiment of the present application;

FIG2 is a schematic diagram of a flow chart of a method for reserving time slot resources according to an embodiment of the present application;

FIG3 is a schematic diagram of a time slot mapping relationship provided in an embodiment of the present application;

FIG4 is a schematic diagram of another time slot mapping relationship provided in an embodiment of the present application;

FIG5 is a schematic diagram of another time slot mapping relationship provided in an embodiment of the present application;

FIG6 is a schematic diagram of another time slot mapping relationship provided in an embodiment of the present application;

FIG7 is a schematic diagram of a flow chart of another method for reserving time slot resources according to an embodiment of the present application;

FIG8 is a schematic diagram of a flow chart of another method for reserving time slot resources according to an embodiment of the present application;

FIG9 is a schematic diagram of the composition of a time slot resource reservation device provided in an embodiment of the present application;

FIG10 is a schematic diagram of the composition of another time slot resource reservation device provided in an embodiment of the present application;

FIG11 is a schematic diagram of the structure of a time slot resource reservation device provided in an embodiment of the present application.

DETAILED DESCRIPTION

The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. 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 creative work are within the scope of protection of this application.

In the description of this application, unless otherwise specified, "/" means "or", for example, A/B can mean A or B. "And/or" in this article is merely a description of the association relationship of associated objects, indicating that three relationships may exist. For example, A and/or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, "at least one" means one or more, and "plurality" means two or more. The words "first", "second", etc. do not limit the quantity and execution order, and the words "first", "second", etc. do not limit them to be different.

It should be noted that, in this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in this application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

Here, the relevant technical terms involved in this application are explained.

Timeslot: It is the smallest unit of time division multiplexing. A timeslot needs to be designed with a reasonable timeslot length value so that at least one complete message can be sent in a timeslot. For example, the timeslot length value can be 10us.

Timeslot Scheduling: refers to the scheduling behavior of sending messages in specified time slots.

Incoming Timeslot: For an intermediate node in a specific path, the timeslot contained in the message received by the intermediate node from the upstream node (that is, the outgoing timeslot of the upstream node) is the incoming timeslot.

Outgoing Timeslot: For an intermediate node in a specific path, when the intermediate node continues to send a message to a downstream node, it can choose to send the message in a specified timeslot based on resource reservation or certain rules. This timeslot is the outgoing timeslot.

Ongoing Sending Timeslot: For an intermediate node in a specific path, the intermediate node can continue to send the message received from the upstream node to the downstream node. When the message arrives at the egress port of the intermediate node, the time slot in which the egress port is currently in the sending state is the ongoing sending timeslot. Among them, the ongoing sending timeslot is not an outgoing timeslot.

Orchestration Period: refers to the orchestration period of the network node to implement the time division multiplexing scheduling mechanism. An orchestration period may include a fixed number of time slots. For example, an orchestration period includes 100 time slots.

The above is an introduction to the technical terms involved in this application, which will not be repeated below.

As described in the background technology, the technical core of deterministic network technology is the periodic scheduling mechanism, which can adopt resource reservation, explicit routing, service protection and other means to provide deterministic delay and jitter guarantees based on the existing network interconnection protocol forwarding mechanism. Among them, resource reservation refers to the occupation of resources by business traffic, including exclusive or shared in a certain proportion, such as physical links, link bandwidth, queue resources, etc. Explicit routing refers to the advance selection of the transmission path of the business flow in the network to ensure the stability of the route and not change with the real-time changes of the network topology. Based on this, the end-to-end delay upper bound and jitter upper bound can be accurately calculated. Service protection refers to the simultaneous sending of multiple business flows along multiple non-intersecting paths to reduce the packet loss rate.

At present, the relevant technology provides a scheduling mechanism for grouping time slots, which can convert time slots into resources and open and reserve services. At the ingress node of the network, it is necessary to reserve corresponding outgoing time slot resources on the egress port for service flows with corresponding arrival times. At the intermediate nodes in the network, it is necessary to reserve corresponding outgoing time slot resources on the egress port for service flows with corresponding inbound time slots. In particular, the path calculation module (such as a centralized controller or a distributed protocol) on the intermediate node needs to further determine the reserved outgoing time slot based on the fixed time slot phase difference between the upstream node and the intermediate node. However, the current technical solution is not suitable for phase difference detection using different time slot lengths at different nodes in the network.

In view of this, the present application provides a time slot resource reservation method, which is applied to a first node, and the method includes: obtaining the detection results of M detection time slots by receiving the detection message sent by the second node in M consecutive detection time slots; wherein the detection result of each detection time slot is used to indicate the sending time slot of the first node mapped by the detection message sent in the detection time slot, and M is a positive integer; based on the detection results of the M detection time slots, determining the target mapping relationship between the target outgoing time slot of the second node and the target sending time slot of the first node; based on the target mapping relationship, reserving the outgoing time slot of the first node for the target message sent by the second node. In this way, the determined mapping relationship can be used as a reference for selecting the outgoing time slot, and time slot scheduling can be performed in a mixed time slot length network to reserve time slot resources for the target message to be sent, thereby meeting the needs of deterministic services.

FIG1 shows a schematic diagram of an application scenario applicable to an embodiment of the present application. As shown in FIG1 , the network 100 includes a management node 01, a network node 02, a network node 03, a network node 04, a network node 05, a network node 06, and a network node 07. Generally, in practical applications, the connection between the above-mentioned devices or service functions can be a wireless connection. In order to conveniently and intuitively represent the connection relationship between the various devices, a solid line is used in FIG1 for illustration. Optionally, the network 100 can be a deterministic network.

In the embodiment of the present application, the management node 01, network node 02, network node 03, network node 04, network node 05, network node 06 and network node 07 may be network devices, or chips disposed inside network devices. The network devices may be network devices that support high-speed Ethernet interfaces (such as 200G, 400G). The network devices include but are not limited to: core routers, edge routers, optical transport network (OTN) transmission equipment, OTN optical service units (OSUs), etc., and Internet protocol radio access networks (IPRAs) based on Internet protocols for specific scenarios.

network, IPRAN), switch equipment, such as packet transport network (packet transport

network, PTN) box or frame switch equipment.

In the network 100 shown in FIG1 , the message of the upstream node can be forwarded to the downstream node, and then forwarded by the downstream node. For example, if network node 02 is the upstream node of network node 03, and network node 04 is the downstream node of network node 03, network node 02 can forward the message to network node 03, and network node 03 can also forward the message to network node 04.

It should be understood that the network 100 shown in FIG. 1 may also include other nodes or network devices, or other terminal devices that communicate with the network devices, and the present application does not limit this.

The time slot resource reservation method provided in the present application is described in detail below in conjunction with the accompanying drawings of the specification.

As shown in FIG. 2 , an embodiment of the present application provides a time slot resource reservation method, which is applied to a first node and includes the following steps:

S101. A first node receives detection messages sent by a second node in M consecutive detection time slots to obtain detection results of the M detection time slots.

The detection result of each detection time slot is used to indicate the sending time slot of the first node corresponding to the detection message sent in the detection time slot, and M is a positive integer.

It should be understood that in a path including a first node and a second node, the second node is an upstream node of the first node, and the first node may also forward a message received from the second node to a downstream node of the first node. The M detection time slots are the M outgoing time slots of the second node corresponding to the detection message.

In some embodiments, the detection message may include the number of the outgoing time slot corresponding to the detection message. In one example, the numbering rules of the time slots in each scheduling cycle may be the same. For example, in a scheduling cycle of the second node, the scheduling cycle may include M1 outgoing time slots, and the M1 outgoing time slots are numbered from 0 to M1-1 in sequence. And, in the next scheduling cycle adjacent to the scheduling cycle, the outgoing time slots may be repeatedly numbered from 0 to M1-1 in sequence. It should be understood that the numbering method of the outgoing time slots in other scheduling cycles of the second node may also be repeated from 0 to M1-1 in sequence.

In some embodiments, the orchestration period of the first node may be equal in length to the orchestration period of the second node.

In some embodiments, the detection message may also include at least one of the following items: the number of second time slots, the second time slot length and the value of M, the second time slot length is the length of the time slot in the scheduling period of the second node, and the second time slot number is the number of time slots measured by the second time slot length included in the scheduling period of the second node.

Exemplarily, the second node may adopt a time slot-based message scheduling mechanism at the output port connected to the downstream node, namely the first node. In this case, the scheduling period used by the second node when adopting the message scheduling mechanism is the scheduling period of the above-mentioned second node, and the time slot length used is the above-mentioned second time slot length.

In some embodiments, the value of M is determined according to the first time slot length and the second time slot length. In one example, the value of M may be equal to the quotient of the least common multiple between the first time slot length and the second time slot length and the second time slot length. It should be understood that M represents the number of outgoing time slots of the second node involved in the complete time slot mapping relationship with the first node that can be detected.

In actual implementation, the second node may initiate a time slot mapping relationship detection task between the first node and the second node when time slot scheduling is required, and the task parameters of the task include the first time slot length and the second time slot length.

The first time slot length is the length of the time slot in the scheduling period of the first node. It should be understood that the first node can adopt a message scheduling mechanism based on time slots at the egress port connected to its downstream node, and the time slot length used by the first node when adopting the message scheduling mechanism is the first time slot length, and the scheduling period used at this time is the scheduling period of the first node.

In one example, the second node may determine the value of M based on the first time slot length and the second time slot length, and send a detection message in M consecutive detection time slots, so that the first node can obtain detection results of M detection time slots.

In another example, the second node may send a detection message in a plurality of consecutive detection time slots, where the number of detection time slots may be greater than or equal to the value of M. The first node may determine the value of M based on the first time slot length and the second time slot length, and select detection messages sent in M consecutive detection time slots from the detection messages sent in the received plurality of detection time slots, so as to obtain detection results of the M detection time slots.

In some embodiments, the detection message may be sent at the end of the M detection time slots, or may be sent at the beginning of the M detection time slots. Alternatively, the detection message may be sent at other time domain positions of the M detection time slots, and the time domain position may be a time domain position pre-agreed between the first node and the second node.

In a possible implementation, the first node may determine the detection results of the M detection time slots based on the time when the detection messages sent in the M detection time slots arrive at the egress port of the first node. In some embodiments, the ingress port and egress port of the first node may use different time slot lengths.

Exemplarily, the first node may specifically perform the following steps S11-S12 to determine the detection results of M detection time slots.

S11. The first node obtains the time when the detection messages sent in M detection time slots arrive at the egress port of the first node.

When time slot scheduling is required, the second node can send a detection message in M consecutive detection time slots, and then the input port connecting the first node and the second node can receive the detection message and deliver the detection message to the output port between the first node and other downstream nodes. Thus, the output port of the first node can determine the time when the detection message sent in M detection time slots arrives at the output port of the first node.

Exemplarily, as shown in FIG3 , node U is the upstream node of node V, and node W is the downstream node of node V. For the path U—V—W, node V can forward the received message sent by node U to node W. If the time slot length of the egress port of node U connected to node V, that is, port 1 (link1) in FIG3 , is Lu, and the time slot length of the egress port of node V connected to node W, that is, port 2 (link2) in FIG3 , is Lv, assuming that the least common multiple of Lu and Lv is Lc, then the value of M is Lc/Lu. Node U sends a detection message to node V in M consecutive outgoing time slots (also referred to as detection time slots) of link1. The egress port of node V can receive the detection message and deliver the detection message to link2. Among them, the detection message can include the numbers of the M outgoing time slots, for example, the numbers of the M outgoing time slots in the scheduling cycle are i%Q, (i+1)%Q...(i+M-1)%Q, respectively, where % is a modulo operator. Q is the number of the second time slot.

S12: The first node determines detection results of the M detection time slots based on the time when the detection messages sent in the M detection time slots arrive at the egress port of the first node.

In some embodiments, the detection result may include the number of the sending time slot of the first node corresponding to the detection message sent in the detection time slot. In addition, the detection result is also used to indicate the remaining duration of the sending time slot of the first node corresponding to the detection message sent in the detection time slot. Exemplarily, taking the path U-V-W shown in Figure 3 as an example, a detection result of node V may include that the outgoing time slot i%Q of the outgoing port link1 of the node U is mapped to the sending time slot numbered j_1 of the outgoing port link2 of the node V, and there is T_uv_1 left until the end of the time slot j_1.

In some embodiments, the sending time slots of the first node corresponding to the detection messages sent in adjacent detection time slots may be the same, or may be different.

In some embodiments, the first node may record the acquisition of multiple detection results, for example, in the form of a time slot mapping relationship table.

Exemplarily, the above-mentioned time slot mapping relationship table can be shown in Table 1, wherein, for the convenience of searching, an identifier can also be determined for each detection result in turn. For example, table[0], table[1]...table[Q-1] can be recorded to represent the mapping results corresponding to the above-mentioned outgoing time slots i%Q, (i+1)%Q...(i+M-1)%Q in turn. In addition, the sending time slot in the table[].timeslot mapping result can also be used, and table[].remaining represents the remaining duration of the sending time slot. For example, according to Table 1, table[0].timeslot is j_1, table[0].remaining is T_uv_1, table[m1-1].timeslot is j_m1, and table[m1-1].remaining is T_uv_m1.

Table 1

Exemplarily, the above-mentioned time slot mapping relationship table may also be as shown in Table 2, wherein the mapping relationship table may also include the sending time slot and the remaining duration of the sending time slot in the mapping result.

Table 2

Logo Outgoing time slot of node U The sending time slot of node V Remaining time [0] i%Q j_1 T_uv_1 [1] (i+1)%Q j_2 T_uv_2 … … … … [m1-1] (i+M-1)%Q j_M T_uv_M

In a possible example, taking the path U—V—W shown in FIG3 as an example, it is assumed that the time slot length of the egress port of node U (referring to the egress port connected to node V) is 20us, and the scheduling cycle includes 25 time slots; the time slot length of the egress port of node V (referring to the egress port connected to node W) d is 50us, and the scheduling cycle includes 10 time slots. Since the least common multiple of the time slot lengths of node U and node V is 100us, node U needs to send a detection message to node V at the end of 5 consecutive time slots starting from any time slot number i of its scheduling cycle, and the resulting mapping relationship can be shown in FIG4. Among them, FIG4 shows three possible examples.

In Example 1, the outgoing time slots i, i+1, and i+2 of node U are all mapped to the sending time slot j of node V, that is, j_1, j_2, and j_3 in the above time slot mapping relationship table are actually j. In addition, time slots i+3 and i+4 are respectively mapped to the sending time slot j+1, that is, j_4 and j_5 in the above time slot mapping relationship table are actually j+1.

In Example 2, the time slots i and i+1 of node U are mapped to the sending time slot j of node V, that is, j_1 and j_2 in the above time slot mapping relationship table are actually j. In addition, the time slots i+2, i+3, and i+4 are mapped to the sending time slot j+1, that is, j_3, j_4, and j_5 in the above time slot mapping relationship table are actually j+1.

In Example 3, the time slot i of node U is mapped to the sending time slot j of node V, that is, j_1 in the above time slot mapping relationship table is actually j. The time slots i+1, i+2, and i+3 are all mapped to the sending time slot j+2, that is, j_2, j_3, and j_4 in the above time slot mapping relationship table are actually j+1, and the sending time slot j_5 mapped to the time slot i+4 is actually j+2.

Exemplarily, in this example, the time slot mapping relationship table may also be shown in Table 3, wherein Table 3 includes detection results corresponding to three possible examples respectively.

Table 3

In another possible implementation, the first node may determine the detection results of the M detection time slots based on the time when the detection messages sent in the M detection time slots arrive at the ingress port of the first node. In some embodiments, the ingress port and the egress port of the first node may use the same time slot length.

Exemplarily, the first node may specifically perform the following steps S21-S22 to determine the detection results of M detection time slots.

S21. The first node obtains the time when the detection messages sent in M detection time slots arrive at the ingress port of the first node.

Exemplarily, as shown in FIG5 , if all ports of node V (including the inbound port connecting node V to node U and the outbound port connecting node V to node W) use consistent time slot length and scheduling period, and the time is synchronized on all ports inside node V. At this time, the phase difference between the time slots of port 1 (link1) and port 2 (link2) in FIG5 is 0, and the status of the scheduling period of port link1 and port link2 is always consistent. Therefore, at any time, the number of the sending time slot in the scheduling period of port link1 and port link2 is the same. For example, based on the time system inside node V, at time T_100, the sending time slots of port link1 and port link2 are both time slot 1.

Thus, for a node whose ingress port and egress port use the same time slot length and scheduling period, when time slot resource reservation is required, the second node can send a detection message in M consecutive detection time slots, and then the ingress port connected to the first node and the second node can receive the detection message. At this time, since the ingress port and egress port of the first node can use the same time slot length and scheduling period, the ingress port of the first node does not need to actually forward the detection message to the egress port. The first node can further determine the detection results of the M detection time slots by obtaining the forwarding delay between the ingress port and the egress port.

S22. The first node determines detection results of the M detection time slots based on the time when the detection messages sent in the M detection time slots arrive at the ingress port of the first node and the forwarding delay between the ingress port and the egress port of the first node.

In some embodiments, the first node may determine the forwarding delay between the input port and the output port of the first node based on the historical forwarding information between the input port and the output port. Alternatively, a preset delay may be pre-stored in the first node, and the preset delay is greater than or equal to the actual forwarding delay. The first node may directly obtain the preset delay and use it as the forwarding delay between the input port and the output port of the first node to determine the detection results of the M detection time slots. It should be understood that the first node may also detect or obtain the forwarding delay between the input port and the output port in other possible ways, which are not listed one by one.

In one implementation, the first node may predict the time when the detection message reaches the egress port based on the time when the detection message reaches the ingress port of the first node and the forwarding delay, and further determine the detection results of the M detection time slots.

Exemplarily, as shown in FIG6, if the forwarding delay between the input port and the output port of the first node is T_fe, the first node can predict the time when the detection message reaches the output port based on the time when the detection message sent in M detection time slots arrives at the input port of the first node and the forwarding delay between the input port and the output port of the first node. For example, the message in the outgoing time slot i%Q of the output port of the node U in FIG6 arrives at the input port of the node V, that is, the port 1 (link1) in FIG6 at the time T_1, then it can be predicted that the time when the detection message arrives at the output port, that is, the port 2 (link2) in FIG6 is (T_1+T_fe). Furthermore, the first node can determine which sending time slot of the output port link2 it falls into, and the remaining duration of the sending time slot based on the time (T_1+T_fe). In this way, the detection result corresponding to the outgoing time slot i%M1 can be obtained.

In some embodiments, the first node may determine the sending time slot corresponding to the egress port of the first node at that moment based on the time when the detection message arrives at the ingress port of the first node, and then correct the sending time slot based on the forwarding delay, wherein the forwarding delay between the ingress port and the egress port of the first node is an integer multiple of the time slot length.

Exemplarily, the first node can first directly determine which sending time slot the detection message falls into based on its arrival time. For example, the arrival time of the first detection message (the detection message corresponding to the outgoing time slot i%M1) in Figure 6 is T_1, and this time T_1 falls into the sending time slot j_1'. Then, it is estimated that the first detection message falls into the sending time slot (j_1'+K)%P of the egress port link2, where P is the number of the first time slot. In this way, the detection result corresponding to the outgoing time slot i%Q can be obtained. Among them, the forwarding delay is K times the time slot length.

In addition, the detection results of the M detection time slots can refer to the relevant description in the above step S12, which will not be repeated here.

S102: The first node determines a target mapping relationship between an outgoing time slot of the second node and a transmitting time slot of the first node based on detection results of the M detection time slots.

In some embodiments, the first node may use M detection time slots as a basic time slot group, and based on the detection results corresponding to the basic time slot group and the correspondence between other outbound time slots of the second node and the basic time slot group, determine the mapping relationship between other outbound time slots and the sending time slots of the first node.

It should be noted that, in the process of reserving time slot resources, the time slot mapping relationship between the first node and the second node can be detected through a part of the outgoing time slots, and then the corresponding detection time slots between the other outgoing time slots of the second node and the basic time slot group are determined, and then the mapping relationship between the sending time slots of the first node is determined based on the detection results of the detection time slots. At this time, the outgoing time slots of the part of the second node that are detected can be called detection time slots, that is, the above-mentioned basic time slot group.

In some embodiments, as shown in FIG. 7 , S102 may be specifically implemented as the following steps S1021-S1023:

S1021. The first node determines a target detection time slot corresponding to the target outbound time slot from the M detection time slots, and obtains a detection result of the target detection time slot.

The target outgoing time slot is any time slot in the scheduling cycle of the second node.

In some embodiments, the first node may use M detection time slots as a basic time slot group, and then determine the target detection time slot based on the time slot correspondence between the target time slot group where the target outgoing time slot is located and the basic time slot group. Furthermore, when determining the target detection time slot, the detection result of the target detection time slot may be determined from the M detection results.

First, the first node can determine the number of the first time slot element in the target time slot group where the target outgoing time slot is located based on the number of the target outgoing time slot, the number of the first detection time slot in the basic time slot group, the second number of time slots, and the value of M. The second number of time slots is the number of time slots included in the scheduling cycle of the second node.

Exemplarily, the number of the first time slot element in the target time slot group where the target outgoing time slot is located is determined based on the following formula (1):

Wherein, W is the number of the first time slot element in the target time slot group where the target outgoing time slot is located; % is a modulo operation; Q is the number of the second time slot; I is the number of the first detection time slot in the basic time slot group; X is the number of the target outgoing time slot; / is a floating point number division operation; To remove the integer operation.

It should be noted that the multiple outbound time slots in the scheduling cycle of the second node can be divided into multiple time slot groups, wherein one time slot group includes M outbound time slots, that is, the target time slot group also includes M outbound time slots. In addition, the outbound time slots at the same position in each time slot group have a corresponding relationship, for example, the first outbound time slot in the target time slot group has a corresponding relationship with the first detection time slot in the basic time slot group. The target time slot group can be any time slot group in the scheduling cycle.

Furthermore, the first node can determine the position of the target outgoing time slot in the target time slot group based on the number of the target outgoing time slot and the number of the first time slot element in the target time slot group, and use the detection time slot at the same position in the basic time slot group as the target detection time slot.

Exemplarily, the position of the target outgoing time slot in the target time slot group can be determined based on the following formula (2):

O = (X - W + Q) % Q Formula (2)

Wherein, O is the position of the target outgoing time slot in the target time slot group.

S1022: The first node determines the number of time slot offsets based on the target outbound time slot, the first detection time slot among the M detection time slots, the value of M, and the value of N.

The number of time slot offsets is used to represent the number of time slots of the first node that exist within the time interval between the target outgoing time slot and the target detection time slot.

In some embodiments, the first node may first determine the number of time slot groups included in the time interval between the target outgoing time slot and the first detection time slot among the M detection time slots, and then determine the number of time slot offsets.

First, the first node may determine the number of time slot groups included in the time interval between the target outgoing time slot and the first detection time slot among the M detection time slots based on the number of the target outgoing time slot, the number of the first detection time slot among the M detection time slots, and the value of M.

Exemplarily, if the target outgoing time slot is numbered X, and the first detection time slot in the M detection time slots is numbered I, since a time slot group in the detection cycle of the second node includes M outgoing time slots, the number of time slot groups included in the time interval between the target outgoing time slot and the first detection time slot in the M detection time slots can be expressed as Taking the detection results shown in Table 3 as an example, for any time slot X of node U, the target time slot group it is in is the first time slot group from the base time slot group. The first time slot of the time slot group is numbered as The second time slot is numbered The time slot number of the 5th time slot is

Furthermore, the first node may determine the number of time slot offsets based on the number of time slot groups included in the time interval between the target outgoing time slot and the first detection time slot in the M detection time slots, and the value of N. The length of the N time slots in the scheduling cycle of the first node is equal to the length of the M time slots in the scheduling cycle of the second node, and N is a positive integer.

Exemplarily, the number of time slot offsets may be determined based on the following formula (3):

Wherein, E is the number of time slot offsets; I is the number of the first detection time slot among the M detection time slots; X is the number of the target outgoing time slot; / is the division operation of floating point numbers; To remove the integer operation.

In some embodiments, the value of N can be determined based on the first time slot length and the second time slot length. In one example, the value of N can be equal to the quotient of the least common multiple between the first time slot length and the second time slot length and the first time slot length. It should be understood that N represents the number of time slots in the transmission of the first node involved in the complete time slot mapping relationship between the first node and the first node that can be detected.

S1023: The first node determines a target mapping relationship based on the detection result of the target detection time slot, the number of time slot offsets, and the number of first time slots.

In some embodiments, the first node may use the number of the sending time slot indicated by the detection result of the target detection time slot, the number of time slot offsets, and the first time slot number as the first number. Then, the first number is modulo-operated based on the first time slot number to obtain the number of the target sending time slot, and the target mapping relationship is determined based on the number of the target outgoing time slot and the number of the target sending time slot.

The first number of time slots is the number of time slots measured by the first time slot length contained in the scheduling period of the first node.

Exemplarily, the target transmission time slot may be determined based on the following formula (4):

Wherein, Y is the number of the target sending time slot; Z is the number of the sending time slot indicated by the detection result of the target detection time slot; P is the number of the first time slot; is the number of time slot offsets; / is the floating point number division operation; is the rounding operation; % is the modulo operation.

In some embodiments, the first node may establish a mapping relationship between each outgoing time slot in the second node and the transmitting time slot of the first node based on the above-mentioned manner of determining the mapping relationship, so as to reserve time slot resources based on the mapping relationship.

S103: The first node reserves an outgoing time slot of the first node for a target message sent by the second node based on the target mapping relationship.

In some embodiments, the first node may determine the sending time slot mapped by the outgoing time slot of the second node for sending the target message based on the mapping relationship between the outgoing time slot of the second node and the sending time slot of the first node. Then, the outgoing time slot used by the first node to send the target message is determined from the time slot after the sending time slot mapped by the outgoing time slot of the second node for sending the target message.

It should be noted that the first node can use the determined target mapping relationship as a reference for selecting an outgoing time slot. When the second node is needed to send a target message, the first node's target sending time slot mapped to the target outgoing time slot of the second node for sending the target message is first determined based on the target mapping relationship. Furthermore, an outgoing time slot resource for the first node for sending the target message after the target sending time slot can be reserved. The outgoing time slot can be the next time slot after the sending time slot in the first node, or the time slot after the next time slot, etc. It can be determined based on possible preset conditions such as optional idle time slot resources when sending the target message and preset delay constraints.

Based on the above embodiment, in a mixed time slot length network, the mapping relationship between the outgoing time slot of the sending node of the adjacent node and the sending time slot of the receiving node can be determined, so that the determined mapping relationship will be used as a reference for selecting the outgoing time slot, and then time slot scheduling is performed in the mixed time slot length network, and time slot resources are reserved for the target message to be sent to meet the needs of deterministic services. In this way, a good foundation can also be provided for deploying a packet time slot scheduling mechanism in a cross-domain interconnected mixed time slot length network.

In some embodiments, as shown in FIG8 , the embodiment of the present application further provides a time slot resource reservation method, which is applied to the second node, and the method includes the following steps:

S201. The second node determines the number M of detection time slots used to send detection messages, where M is a positive integer.

In some implementations, the value of M is determined according to a first time slot length and a second time slot length, the first time slot length being the length of a time slot in a scheduling cycle of the first node, and the second time slot length being the length of a time slot in a scheduling cycle of the second node. Exemplarily, the value of M is equal to the quotient of the least common multiple between the first time slot length and the second time slot length and the second time slot length.

In addition, for a detailed description of M, please refer to the relevant description of step S101 above, which will not be repeated here.

S202. The second node sends a detection message to the first node in M consecutive detection time slots, so that the first node determines a target mapping relationship between a target outgoing time slot of the second node and a target sending time slot of the first node based on detection results of the M detection time slots.

The detection message corresponding to each detection time slot is used to determine the sending time slot of the first node corresponding to the detection time slot, and the target mapping relationship is used to instruct the first node to reserve the outgoing time slot of the first node for the target message sent by the second node based on the target mapping relationship.

In some embodiments, the detection message further includes at least one of the following: the number of second time slots, the length of the second time slot, and the value of M. The second time slot length is the length of the time slot in the scheduling cycle of the second node. The number of second time slots is the number of time slots included in the scheduling cycle of the second node.

In some embodiments, the detection message may be sent at the end of the M detection time slots, or may be sent at the beginning of the M detection time slots. Alternatively, the detection message may be sent at other time domain positions of the M detection time slots, and the time domain position may be a time domain position pre-agreed between the first node and the second node.

In addition, the detailed description of steps S201-S202 can also refer to the description of steps S101-S103 above, which will not be repeated here.

Based on the above embodiment, in a mixed time slot length network, the upstream node (i.e., the above second node) in the adjacent time slot can first send a detection message in the detection time slot to determine the mapping relationship between the detection time slot and the sending time slot of the downstream node, and then determine the mapping relationship corresponding to other outgoing time slots of the upstream node based on the mapping relationship corresponding to the detection time slot. In this way, time slot scheduling can be performed in the mixed time slot length network based on the determined mapping relationship, and time slot resources can be reserved for the target message to be sent to meet the needs of deterministic services.

The above mainly introduces the solution provided by the present application from the perspective of interaction between various nodes. It is understandable that each node, such as a device or equipment, includes a hardware structure and/or software module corresponding to each function in order to realize the above functions. It should be easily appreciated by those skilled in the art that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present invention can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present invention.

FIG9 is a schematic diagram showing the composition of a time slot resource reservation device provided in an embodiment of the present application, which can be applied to a first node. As shown in FIG9 , the time slot resource reservation device 90 includes a receiving module 901 and a processing module 902 .

In some embodiments, the receiving module 901 is used to obtain the detection results of M detection time slots by receiving the detection message sent by the second node in M consecutive detection time slots; wherein the detection result of each detection time slot is used to indicate the sending time slot of the first node mapped by the detection message sent in the detection time slot, and M is a positive integer. The processing module 902 is used to determine the target mapping relationship between the target outgoing time slot of the second node and the target sending time slot of the first node based on the detection results of the M detection time slots, and the processing module 902 is also used to reserve the outgoing time slot of the first node for the target message sent by the second node based on the target mapping relationship.

In some embodiments, the receiving module 901 is further used to obtain the time when the detection messages sent by the M detection time slots arrive at the egress port of the first node. The processing module 902 is further used to determine the detection results of the M detection time slots based on the time when the detection messages sent by the M detection time slots arrive at the egress port of the first node.

In some embodiments, the receiving module 901 is further used to obtain the time when the detection messages sent in the M detection time slots arrive at the ingress port of the first node. The processing module 902 is further used to determine the detection results of the M detection time slots based on the time when the detection messages sent in the M detection time slots arrive at the ingress port of the first node and the forwarding delay between the ingress port and the egress port of the first node.

In some embodiments, the processing module 902 is further used to: determine a target detection time slot corresponding to a target outbound time slot from the M detection time slots, and obtain a detection result of the target detection time slot; determine the number of time slot offsets based on the target outbound time slot, the first detection time slot among the M detection time slots, the value of M, and the value of N; wherein the number of time slot offsets is the number of time slots determined in the time interval between the target outbound time slot and the target detection time slot based on the first time slot length, the number of time slot offsets is an integer, and the value of N is equal to the quotient of the least common multiple between the first time slot length and the second time slot length and the first time slot length; determine a target mapping relationship based on the detection result of the target detection time slot, the number of time slot offsets, and the first number of time slots; the first number of time slots is the number of time slots measured in the first time slot length contained in the scheduling period of the first node, and the length of the scheduling period of the first node is equal to the length of the scheduling period of the second node.

In some embodiments, the processing module 902 is also used to: take M detection time slots as the basic time slot group, and determine the number of the first time slot element in the target time slot group where the target outgoing time slot is located based on the number of the target outgoing time slot, the number of the first detection time slot in the basic time slot group, the number of the second time slots and the value of M; wherein the second number of time slots is the number of time slots measured by the second time slot length included in the scheduling period of the second node; determine the position of the target outgoing time slot in the target time slot group based on the number of the target outgoing time slot and the number of the first time slot element in the target time slot group; and use the detection time slot at the position in the basic time slot group as the target detection time slot.

In some embodiments, the number of the first time slot element in the target time slot group where the target outgoing time slot is located is determined based on the following formula:

Wherein, W is the number of the first time slot element in the target time slot group where the target outgoing time slot is located; % is a modulo operation; Q is the number of the second time slot; I is the number of the first detection time slot in the basic time slot group; X is the number of the target outgoing time slot; / is a floating point number division operation; To remove the integer operation.

The position of the target outgoing time slot in the target time slot group is determined based on the following formula:

O＝(X-W+Q)％Q

Wherein, O is the position of the target outgoing time slot in the target time slot group.

In some embodiments, the processing module 902 is also used to: determine the number of time slot groups included in the time interval between the target outgoing time slot and the first detection time slot among the M detection time slots based on the number of the target outgoing time slot, the number of the first detection time slot among the M detection time slots, and the value of M; determine the number of time slot offsets based on the number of time slot groups and the value of N.

In some embodiments, the number of time slot offsets is determined based on the following formula:

Wherein, E is the number of time slot offsets; I is the number of the first detection time slot among the M detection time slots; X is the number of the target outgoing time slot; / is the division operation of floating point numbers; To remove the integer operation.

In some embodiments, the processing module 902 is also used to: take the sum of the number of the sending time slot indicated by the detection result of the target detection time slot, the number of time slot offsets, and the number of the first time slot as the first number; perform a modulo operation on the first number based on the first number of time slots to obtain the number of the target sending time slot; determine the target mapping relationship based on the number of the target outgoing time slot and the number of the target sending time slot.

In some embodiments, the target transmit mid-slot is determined based on the following formula:

Wherein, Y is the number of the target sending time slot; Z is the number of the sending time slot indicated by the detection result of the target detection time slot; P is the number of the first time slot; is the number of time slot offsets; / is the floating point number division operation; is the rounding operation; % is the modulo operation.

In some embodiments, the value of M is determined according to a first time slot length and a second time slot length, the first time slot length is the length of a time slot in a scheduling period of the first node, the second time slot length is the length of a time slot in a scheduling period of the second node, and the length of the scheduling period of the first node is equal to the length of the scheduling period of the second node.

In some embodiments, the value of M is equal to the quotient of the least common multiple between the first time slot length and the second time slot length and the second time slot length.

In some embodiments, the detection message includes the number of the outgoing time slot of the second node corresponding to the detection message.

In some embodiments, the detection message further includes at least one of the following items: the second number of time slots, the second time slot length, and the value of M, where the second number of time slots is the number of time slots in the scheduling cycle of the second node.

In some embodiments, the detection result is also used to indicate the remaining duration of the sending time slot of the first node corresponding to the detection message sent in the detection time slot.

In some embodiments, the processing module 902 is also used to: determine the sending time slot mapped by the outgoing time slot of the second node for sending the target message based on the mapping relationship between the outgoing time slot of the second node and the sending time slot of the first node; determine the outgoing time slot used by the first node to send the target message from the time slot after the sending time slot mapped by the outgoing time slot of the second node for sending the target message.

FIG10 is a schematic diagram showing the composition of another time slot resource reservation device provided in an embodiment of the present application, which can be applied to a second node. As shown in FIG10 , the time slot resource reservation device 100 includes a processing module 1001 and a sending module 1002 .

In some embodiments, the processing module 1001 is used to determine the number M of detection time slots used to send detection messages, where M is an integer greater than or equal to 1. The sending module 1002 is used to send detection messages to the first node in M consecutive detection time slots, so that the first node determines the target mapping relationship between the target outgoing time slot of the second node and the target sending time slot of the first node based on the detection results of the M detection time slots; wherein the detection message corresponding to each detection time slot is used to determine the sending time slot of the first node corresponding to the detection time slot, and the target mapping relationship is used to indicate that the first node reserves the outgoing time slot of the first node for the target message sent by the second node based on the target mapping relationship.

In some embodiments, the value of M is determined according to a first time slot length and a second time slot length, the first time slot length is the length of a time slot in a scheduling period of the first node, the second time slot length is the length of a time slot in a scheduling period of the second node, and the length of the scheduling period of the first node is equal to the length of the scheduling period of the second node.

In some embodiments, the value of M is equal to the quotient of the least common multiple between the first time slot length and the second time slot length and the second time slot length.

In some embodiments, the detection message includes the number of the detection time slot of the second node corresponding to the detection message.

In some embodiments, the detection message also includes at least one of the following items: the number of second time slots, the length of the second time slot and the value of M; wherein the second time slot length is the length of the time slot in the scheduling cycle of the second node; the number of second time slots is the number of time slots included in the scheduling cycle of the second node.

It should be noted that the modules in FIG9 or FIG10 may also be referred to as units, for example, the processing module may be referred to as a processing unit. In addition, in the embodiments shown in FIG9 or FIG10, the names of the modules may not be the names shown in the figure, for example, the receiving module or the sending module may also be referred to as a communication module.

If the various units in FIG. 9 or FIG. 10 are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the various embodiments of the present application. The storage medium for storing computer software products includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program codes.

In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, an embodiment of the present application provides a schematic diagram of the structure of a time slot resource reservation device. As shown in FIG11 , the time slot resource reservation device 1100 includes: a processor 1102, a communication interface 1103, and a bus 1104. Optionally, the time slot resource reservation device 1100 may also include a memory 1101.

The processor 1102 may be a device that implements or executes various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The processor 1102 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The processor 1102 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

The communication interface 1103 is used to connect with other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.

The memory 1101 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program codes in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

As a possible implementation, the memory 1101 may exist independently of the processor 1102, and the memory 1101 may be connected to the processor 1102 via a bus 1104 for storing instructions or program codes. When the processor 1102 calls and executes the instructions or program codes stored in the memory 1101, the time slot resource reservation method provided in the embodiment of the present application can be implemented.

In another possible implementation, the memory 1101 may also be integrated with the processor 1102 .

The bus 1104 may be an extended industry standard architecture (EISA) bus, etc. The bus 1104 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, FIG11 only uses one thick line, but does not mean that there is only one bus or one type of bus.

Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the equipment or device is divided into different functional modules to complete all or part of the functions described above.

The embodiment of the present application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be completed by computer instructions to instruct the relevant hardware, and the program can be stored in the above computer-readable storage medium. When the program is executed, it may include the processes of the above method embodiments. The computer-readable storage medium can be the memory or memory of any of the above embodiments. The above computer-readable storage medium can also be an external storage device of the above device or device, such as a plug-in hard disk, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. equipped on the above device or device. Further, the above computer-readable storage medium can also include both the internal storage unit of the above device or device and an external storage device. The above computer-readable storage medium is used to store the above computer program and other programs and data required by the above device or device. The above computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

An embodiment of the present application also provides a computer program product, which includes a computer program. When the computer program product is run on a computer, the computer is enabled to execute any one of the time slot resource reservation methods provided in the above embodiments.

Although the present application is described herein in conjunction with various embodiments, in the process of implementing the claimed application, those skilled in the art may understand and implement other changes to the disclosed embodiments by viewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "one" or "an" does not exclude multiple situations. A single processor or other unit can implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

Although the present application has been described in conjunction with specific features and embodiments thereof, it is obvious that various modifications and combinations may be made thereto without departing from the spirit and scope of the present application. Accordingly, this specification and the drawings are merely exemplary illustrations of the present application as defined by the appended claims, and are deemed to have covered any and all modifications, variations, combinations or equivalents within the scope of the present application. Obviously, those skilled in the art may make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims (21)

1. A time slot resource reservation method, characterized in that it is applied to a first node, and the method comprises: By receiving the detection message sent by the second node in M consecutive detection time slots, the detection results of the M detection time slots are obtained; wherein the detection result of each detection time slot is used to indicate the sending time slot of the first node mapped by the detection message sent in the detection time slot, and M is a positive integer; Determine, based on the detection results of the M detection time slots, a target mapping relationship between a target outgoing time slot of the second node and a target sending time slot of the first node; Based on the target mapping relationship, an outbound time slot of the first node is reserved for the target message sent by the second node. 2. The method according to claim 1, wherein the step of obtaining the detection results of the M detection time slots by receiving the detection messages sent by the second node in M consecutive detection time slots comprises: Obtaining the time when the detection messages sent by the M detection time slots arrive at the egress port of the first node; The detection results of the M detection time slots are determined based on the time when the detection messages sent in the M detection time slots arrive at the egress port of the first node. 3. The method according to claim 1, wherein the step of receiving the detection message sent by the second node in M consecutive detection time slots to obtain the detection results of the M detection time slots comprises: Obtaining the time when the detection messages sent by the M detection time slots arrive at the ingress port of the first node; The detection results of the M detection time slots are determined based on the time when the detection messages sent in the M detection time slots arrive at the ingress port of the first node and the forwarding delay between the ingress port and the egress port of the first node. 4. The method according to claim 1 is characterized in that the value of M is equal to the quotient of the least common multiple between the first time slot length and the second time slot length and the second time slot length, the first time slot length is the length of the time slot in the scheduling period of the first node, the second time slot length is the length of the time slot in the scheduling period of the second node, and the scheduling period of the first node is equal to the scheduling period of the second node. 5. The method according to claim 1, characterized in that the step of determining the target mapping relationship between the target outgoing time slot of the second node and the target sending time slot of the first node based on the detection results of the M detection time slots comprises: Determine a target detection time slot corresponding to the target outgoing time slot from the M detection time slots, and obtain a detection result of the target detection time slot; Based on the target outgoing time slot, the first detection time slot in the M detection time slots, the value of M and the value of N, determine the number of time slot offsets; wherein the number of time slot offsets is the number of time slots determined in the time interval between the target outgoing time slot and the target detection time slot based on the first time slot length, the number of time slot offsets is an integer, and the value of N is equal to the quotient of the least common multiple between the first time slot length and the second time slot length and the first time slot length; The target mapping relationship is determined based on the detection result of the target detection time slot, the number of time slot offsets and the first number of time slots; the first number of time slots is the number of time slots measured by the first time slot length included in the scheduling period of the first node. 6. The method according to claim 5, characterized in that the step of determining the target detection time slot corresponding to the target outbound time slot from the M detection time slots comprises: Taking the M detection time slots as the basic time slot group, based on the number of the target outgoing time slot, the number of the first detection time slot in the basic time slot group, the second number of time slots and the value of M, determine the number of the first time slot element in the target time slot group where the target outgoing time slot is located; wherein the second number of time slots is the number of time slots measured by the second time slot length contained in the scheduling period of the second node; Determine the position of the target outgoing time slot in the target time slot group based on the number of the target outgoing time slot and the number of the first time slot element in the target time slot group; The detection time slot at the position in the basic time slot group is used as the target detection time slot. 7. The method according to claim 6, characterized in that The number of the first time slot element in the target time slot group where the target outgoing time slot is located is determined based on the following formula: Wherein, W is the number of the first time slot element in the target time slot group where the target outgoing time slot is located; % is a modulo operation; Q is the number of the second time slot; I is the number of the first detection time slot in the basic time slot group; X is the number of the target outgoing time slot; / is a floating point number division operation; To remove the integer operation; The position of the target outgoing time slot in the target time slot group is determined based on the following formula: O＝(X-W+Q)％Q Wherein, O is the position of the target outgoing time slot in the target time slot group. 8. The method according to claim 6, characterized in that the determining the number of time slot offsets based on the target outgoing time slot, the first detection time slot of the M detection time slots, the value of M and the value of N comprises: Determine the number of time slot groups included in the time interval between the target outgoing time slot and the first detection time slot in the M detection time slots based on the number of the target outgoing time slot, the number of the first detection time slot in the M detection time slots, and the value of M; Based on the number of time slot groups and the value of N, the number of time slot offsets is determined. 9. The method according to claim 8, characterized in that the number of time slot offsets is determined based on the following formula: Wherein, E is the number of the time slot offsets; I is the number of the first detection time slot in the M detection time slots; X is the number of the target outgoing time slot; / is a floating point number division operation; To remove the integer operation. 10. The method according to claim 5, characterized in that the determining the target mapping relationship based on the detection result of the target detection time slot, the number of time slot offsets and the number of first time slots comprises: The sum of the number of the transmitting time slot indicated by the detection result of the target detection time slot, the number of time slot offsets, and the first number of time slots is used as the first number; Performing a modulo operation on the first number based on the number of the first time slots to obtain the number of the target sending time slot; The target mapping relationship is determined based on the number of the target outgoing time slot and the number of the target sending time slot. 11. The method according to claim 10, characterized in that the target transmission time slot is determined based on the following formula: Wherein, Y is the number of the target sending time slot; Z is the number of the sending time slot indicated by the detection result of the target detection time slot; P is the number of the first time slots; is the number of time slot offsets; / is the division operation of floating point numbers; is the rounding operation; % is the modulo operation. 12. The method according to claim 1, characterized in that the detection message includes the number of the outgoing time slot of the second node corresponding to the detection message. 13. The method according to claim 12 is characterized in that the detection message also includes at least one of the following items: a second number of time slots, a second time slot length, and a value of M, wherein the second time slot length is the length of a time slot in a scheduling cycle of the second node, and the second number of time slots is the number of time slots measured by the second time slot length contained in the scheduling cycle of the second node. 14. The method according to claim 1 is characterized in that the detection result is also used to indicate the remaining duration of the first node's sending time slot corresponding to the detection message sent in the detection time slot. 15. The method according to claim 1, characterized in that the reserving the outgoing time slot of the first node for the target message sent by the second node based on the mapping relationship between the target outgoing time slot of the second node and the target sending time slot of the first node comprises: Based on the transmitting time slot of the first node mapped to the outgoing time slot of the second node for sending the target message, the outgoing time slot used by the first node to send the target message is determined from the time slots after the transmitting time slot of the first node. 16. A time slot resource reservation method, characterized in that it is applied to a second node, comprising: Determine the number M of detection time slots used to send detection messages, where M is a positive integer; Send detection messages to the first node in M consecutive detection time slots, so that the first node determines the target mapping relationship between the target outgoing time slot of the second node and the target sending time slot of the first node based on the detection results of the M detection time slots; wherein the detection message corresponding to each of the detection time slots is used to determine the sending time slot of the first node corresponding to the detection time slot, and the target mapping relationship is used to instruct the first node to reserve the outgoing time slot of the first node for the target message sent by the second node. 17. The method according to claim 16, characterized in that the value of M is equal to the quotient of the least common multiple between the first time slot length and the second time slot length and the second time slot length, wherein the first time slot length is the length of the time slot in the scheduling period of the first node, the second time slot length is the length of the time slot in the scheduling period of the second node, and the length of the scheduling period of the first node is equal to the length of the scheduling period of the second node. 18. The method according to claim 17, wherein the detection message comprises a number of a detection time slot of the second node corresponding to the detection message. 19. The method according to claim 18 is characterized in that the detection message also includes at least one of the following items: the number of second time slots, the length of the second time slot and the value of M; wherein the number of second time slots is the number of time slots measured by the second time slot length contained in the scheduling period of the second node. 20. A communication device, comprising: a memory and a processor; the memory and the processor are coupled; the memory is used to store instructions executable by the processor; when the processor executes the instructions, it executes the method according to any one of claims 1 to 19. 21. A computer-readable storage medium, characterized in that computer instructions are stored on the computer-readable storage medium, and when the computer instructions are executed on a communication device, the communication device executes the method as claimed in any one of claims 1 to 19.