Time slot resource reservation method, communication device and storage medium

Abstract

The invention provides a time slot resource reservation method, communication equipment and a storage medium, and the method comprises the steps: obtaining a time slot relative relation corresponding to a first arrangement period length for an outgoing port and an incoming port between every two adjacent nodes in a target routing path, the first arrangement period length supported by each port and the time slot length, the forwarding time delay of each node is calculated; and reserving a time slot resource for each node in the target routing path according to a time slot relative relationship corresponding to a first arrangement period length for an exit port and an entrance port between every two adjacent nodes, the first arrangement period length and the time slot length supported by each port, and the forwarding delay of each node. Therefore, according to the embodiment of the invention, the processing complexity of time slot resource reservation can be effectively reduced, so that the processing efficiency of time slot resource reservation can be improved, and the waste of network resources is reduced.

Description

Technical Field

[0001] The embodiments of the present application relate to but are not limited to the field of communication technology, and in particular, to a time slot resource reservation method, communication equipment, and storage medium. Background Art

[0002] Time slot resources refer to time slots included in an orchestration period with a specific length. Each node in the network can be configured with multiple orchestration periods of different lengths, but the nodes need to communicate with each other based on the same orchestration period. In order to make the estimated value of the residence delay of the service flow on each node consistent with the budget value, appropriate outbound time slot resources are generally reserved on the egress port of each node.

[0003] In the related art, a scheme for allocating time slot resources is provided. For example, by directly detecting the time slot mapping relationship of a specific pair of egress ports between adjacent nodes in the network or detecting the phase difference between the scheduling cycles of the egress ports between adjacent nodes, the time slot mapping relationship of any other egress port pair between adjacent nodes is derived, and the corresponding time slot resources are reserved for the service flow on the egress ports of each node. However, for the above-mentioned detection methods of various time slot mapping relationships, the mapping relationship detected is mainly the mapping relationship between the outgoing time slot of the egress port of the upstream node and the sending time slot of the egress port of the current node. When the number of egress ports of the current node is large, in order to meet the forwarding of various service messages, it will result in the need to calculate a lot of time slot mapping relationships, which will not only make the processing process of time slot resource reservation cumbersome and complex, inefficient, but also waste unnecessary network resources. Summary of the invention

[0004] The embodiments of the present application provide a time slot resource reservation method, a communication device and a storage medium, which can effectively reduce the processing complexity of time slot resource reservation, thereby improving the processing efficiency of time slot resource reservation and reducing the waste of network resources.

[0005] In a first aspect, an embodiment of the present application provides a routing method, including:

[0006] Obtaining a relative relationship of time slots corresponding to a first scheduling cycle length for an egress port and an ingress port between every two adjacent nodes in a target routing path, the first scheduling cycle length and the time slot length supported by each port, and a forwarding delay of each node; reserving time slot resources for each node in the target routing path according to the relative relationship of time slots corresponding to a first scheduling cycle length for an egress port and an ingress port between every two adjacent nodes, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node.

[0007] In a second aspect, an embodiment of the present application further provides a communication device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned time slot resource reservation method when executing the computer program.

[0008] In a third aspect, an embodiment of the present application further provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute the above-mentioned time slot resource reservation method.

[0009] The embodiments of the present application include: the embodiments of the present application can reserve time slot resources for each node in the target routing path according to the relative relationship of time slots corresponding to the first scheduling cycle length of the egress port and the ingress port between each two adjacent nodes, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node after obtaining the relative relationship of time slots corresponding to the first scheduling cycle length of the egress port and the ingress port between each two adjacent nodes, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node. That is, the embodiments of the present application do not need to obtain the relative relationship of time slots of each pair of egress ports between adjacent nodes, but can reserve time slot resources for each node according to the relative relationship of time slots corresponding to the first scheduling cycle length of the egress port and the ingress port between each two adjacent nodes, so the amount of calculation of the relative relationship of time slots can be effectively reduced, the processing complexity of time slot resource reservation can be effectively reduced, thereby improving the processing efficiency of time slot resource reservation and reducing the waste of network resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 is a schematic diagram of a network topology for a time slot resource reservation method provided by an embodiment of the present application;

[0011] Figure 2 is a flowchart of a time slot resource reservation method provided by an embodiment of the present application;

[0012] Figure 3 It is a schematic diagram of the detection process of the time slot mapping relationship provided by an embodiment of the present application;

[0013] Figure 4 is a time slot mapping relationship calculation flow chart provided by an embodiment of the present application;

[0014] Figure 5 This is a schematic diagram of a detection process of an arrangement period phase difference provided by an embodiment of the present application;

[0015] Figure 6 is another time slot mapping relationship calculation flow chart provided by an embodiment of the present application;

[0016] Figure 7 yes Figure 4 A specific method flow chart of step S120;

[0017] Figure 8 is a schematic diagram of a network topology for calculating reserved time slot resources provided by an embodiment of the present application;

[0018] Fig. 9 is a flowchart of a time slot resource reservation method provided by another embodiment of the present application;

[0019] Fig.10 It is a schematic diagram of a sub-TLV structure carrying a time slot mapping relationship between an egress port and an ingress port between adjacent nodes provided by an embodiment of the present application;

[0020] Fig.11 It is a schematic diagram of another sub-TLV structure carrying a time slot mapping relationship between an egress port and an ingress port between adjacent nodes provided by an embodiment of the present application;

[0021] Fig.12 It is a schematic diagram of a sub-TLV structure carrying an arrangement period phase difference between an egress port and an ingress port between adjacent nodes provided by an embodiment of the present application;

[0022] Fig.13 It is a schematic diagram of another sub-TLV structure carrying the scheduling period phase difference between the egress port and the ingress port between adjacent nodes provided by an embodiment of the present application;

[0023] Fig.14 is a flowchart of a time slot resource reservation method provided by another embodiment of the present application;

[0024] Fig.15 is a flowchart of a time slot resource reservation method provided by another embodiment of the present application;

[0025] Fig.16 It is a schematic diagram of a sub-TLV structure carrying a forwarding delay provided by an embodiment of the present application;

[0026] Fig.17 It is a schematic diagram of a TLV structure carrying a time slot mapping relationship provided by an embodiment of the present application;

[0027] Fig.18 It is a schematic diagram of another TLV structure carrying a time slot mapping relationship provided by an embodiment of the present application;

[0028] Fig.19 is a schematic diagram of a TLV structure carrying an arrangement period phase difference provided by an embodiment of the present application;

[0029] Fig. 20is a schematic diagram of another TLV structure carrying an arrangement period phase difference provided by an embodiment of the present application;

[0030] Fig.21 is a schematic diagram of a TLV structure carrying an arrangement cycle length and a time slot length thereof provided by an embodiment of the present application;

[0031] Fig. 22 This is a schematic diagram of a TLV structure carrying forwarding delay provided by an embodiment of the present application. DETAILED DESCRIPTION

[0032] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0033] It should be noted that although a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than in the flowchart. The terms "first", "second", etc. in the specification and the above drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0034] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein are only for the purpose of describing the embodiments of this application and are not intended to limit this application.

[0035] First, some nouns involved in this application are analyzed:

[0036] Service Burst Interval: The traffic specification of a deterministic service flow generally follows a certain burst volume within a cyclic burst interval (i.e., service burst interval). For example, if a service flow generates 1000 bits of traffic every 1ms, then its corresponding service burst interval is 1ms.

[0037] Orchestration Period: The orchestration period adopted according to the needs of all deterministic services, which allocates time slot resources to services within the orchestration period, that is, which time slots in the orchestration period the services occupy and how many bits they occupy. The length of the orchestration period is the least common multiple of all service burst intervals, which is an integer multiple of the service burst interval. The entire network can be configured with multiple orchestration period instances of different lengths, and each node communicates based on the same orchestration period instance.

[0038] Scheduling Period: For a specific scheduling period instance, the cyclic period of the time division multiplexing scheduling mechanism actually implemented by the port forwarding hardware, including a fixed number of time slots. The scheduling period is less than or equal to the scheduling period, which is related to the hardware capabilities.

[0039] Timeslot: A scheduling cycle contains many timeslots of equal length. For example, a scheduling cycle is 1ms long, which contains 100 timeslots, and each timeslot is 10us long. For a scheduling cycle of the same length, different nodes can configure different timeslot lengths for the scheduling cycle instance and contain different numbers of timeslots accordingly.

[0040] Incoming Timeslot: For the head node of a specific path, when the message it receives from the source client side arrives at the UNI port (the port facing the user side), the corresponding timeslot at the UNI port after traffic adjustment is the incoming timeslot of the message; for an intermediate node in a specific path, the outgoing timeslot assigned by the upstream node when sending the message is the incoming timeslot of the message.

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

[0042] Ongoing Sending Timeslot: For the head node in the path, it continues to send the message received from the client side to the downstream node. When the message arrives at the egress port, the time slot in which the egress port is currently in the sending state is the ongoing sending timeslot; for the intermediate node in the path, it continues to send the message received from the upstream node to the downstream node. When the end of the inbound timeslot to which the message belongs reaches the egress port, the time slot in which the egress port is currently in the sending state is the ongoing sending timeslot. It should be noted that the ongoing sending timeslot is not an outbound timeslot.

[0043] The present application provides a time slot resource reservation method, a communication device and a storage medium. In the embodiment of the present application, the time slot resources can be reserved for each node in the target routing path according to the time slot relative relationship corresponding to the first scheduling cycle length of the egress port and the ingress port between each two adjacent nodes, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node, when the time slot relative relationship corresponding to the first scheduling cycle length of the egress port and the ingress port between each two adjacent nodes in the target routing path, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node are obtained. That is, the embodiment of the present application does not need to obtain the time slot relative relationship of each egress port pair between adjacent nodes, but can reserve time slot resources for each node according to the time slot relative relationship corresponding to the first scheduling cycle length of the egress port and the ingress port between each two adjacent nodes, so the amount of calculation of the time slot relative relationship can be effectively reduced, the processing complexity of the time slot resource reservation can be effectively reduced, thereby improving the processing efficiency of the time slot resource reservation, and reducing the waste of network resources.

[0044] The embodiments of the present application are further described below in conjunction with the accompanying drawings.

[0045] like Figure 1 As shown, Figure 1 FIG. 1 is a schematic diagram of a network topology for executing a time slot resource reservation method provided by an embodiment of the present application. Figure 1 In the example, the network topology includes six nodes, numbered from 110 to 160, and the connection between the nodes is as follows Figure 1 As shown, the first node 110, the second node 120, the third node 130, the fourth node 140, the fifth node 150 and the sixth node 160 can be network devices such as routers or switches, which can forward messages. In addition, the network topology can also include a network controller 200, such as a software defined network (SDN) controller, etc. Figure 1 As shown, the network controller 200 is bidirectionally connected to the first node 110 and can control the first node 110. It should be noted that the network controller 200 can be connected to each node in the network topology to control the connected node. In addition, the head node or network controller 200 in the network topology can obtain all data of each node and link in the network topology.

[0046] The first node 110, the second node 120, the third node 130, the fourth node 140, the fifth node 150, the sixth node 160 and the network controller 200 respectively include a memory and a processor, wherein the memory and the processor may be connected via a bus or other means.

[0047] The memory, as a non-transient computer-readable storage medium, can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory may optionally include a memory remotely disposed relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0048] The network topology and application scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of network topology and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are equally applicable to similar technical problems.

[0049] It can be understood by those skilled in the art that Figure 1 The various nodes and topological structures shown in the figure do not constitute a limitation on the embodiments of the present application, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently.

[0050] exist Figure 1 In the network topology shown, each node can call its stored time slot resource reservation program to execute the time slot resource reservation method; or, the network controller can call its stored time slot resource reservation program and cooperate with each node to execute the time slot resource reservation method.

[0051] Based on the above network topology and the structures of each node and network controller in the above network topology, various embodiments of the time slot resource reservation method of the present application are proposed.

[0052] like Figure 2 As shown, Figure 2 is a flowchart of a time slot resource reservation method provided by an embodiment of the present application. The time slot resource reservation method can be applied to Figure 1 Nodes or network controllers in the network topology shown, e.g. Figure 1 The first node 110 in the network topology is shown. The time slot resource reservation method includes but is not limited to step S110 and step S120.

[0053] Step S110: Obtain the relative relationship of time slots corresponding to the first scheduling cycle lengths for the egress port and the ingress port between every two adjacent nodes in the target routing path, the first scheduling cycle length and time slot length supported by each port, and the forwarding delay of each node.

[0054] In this step, in the mechanism of time slot scheduling, the relative relationship of time slots corresponding to the first scheduling cycle length of the egress port and the ingress port between each two adjacent nodes can be obtained through the detection protocol. The relative relationship of time slots may include a time slot mapping relationship or a scheduling cycle phase difference, wherein the time slot mapping relationship may be obtained through a single time slot detection message, and the time slot mapping relationship is generally perceived and maintained by the downstream node in the adjacent node when processing the detection message, and the scheduling cycle phase difference may be obtained through the scheduling cycle phase difference detection message. In addition, the ports of each node may be configured with different time slot lengths according to the same scheduling cycle to obtain corresponding time slots containing different numbers, and the time slots may be inbound time slots, outbound time slots, or sending in progress time slots, etc., which are not listed one by one here. The forwarding delay of each node refers to the maximum delay experienced by the message from the ingress port of this node to the egress port of this node, but does not include the queuing delay and link propagation delay of the message on the egress port of this node.

[0055] In addition, the ports of each node in the network can support the configuration of multiple scheduling cycle lengths and time slot lengths, but the nodes communicate with each other based on the scheduling cycle of the same length. Since the length of the scheduling cycle is determined according to the needs of the deterministic service, the first scheduling cycle in step S110 is only used to illustrate the message transmission between the nodes in this embodiment based on the scheduling cycle of the same length, and does not involve special designation of the first scheduling cycle.

[0056] A feasible implementation method is that there can be multiple nodes in the network. When there are multiple nodes in the network, each adjacent node is connected to each other to form multiple links. Each node has multiple output ports and input ports. The connection method between the output ports of adjacent nodes is not unique, but the connection method between the output ports and input ports of each adjacent node is unique, forming a 1:1 relative relationship between time slots.

[0057] In a feasible implementation method, there are multiple nodes and a network controller in the network, and the multiple nodes are interconnected in the network to form multiple links, and the network controller is connected to one of the nodes. Each link is a bidirectional link. It can be understood that the information in the link includes the scheduling cycle phase difference between adjacent nodes, the scheduling cycle length and time slot length supported by each port, and the forwarding delay of each node, etc., which are all flooded in the network through the network protocol.

[0058] Among them, the information in the link is obtained by the head node or the network controller. When the link information is flooded in the network, the head node can obtain the time slot mapping relationship or the scheduling cycle phase difference between adjacent nodes in the entire network, the scheduling cycle length supported by each port and its time slot length, as well as the node forwarding delay information and link propagation delay and other information through learning. It can also select a target node from multiple nodes and establish a connection with the network controller. For example, a node P is selected from the network to establish a BGP-LS session with the network controller. Then, node P learns the link information in the entire network through the process of link information flooding in the network, and then reports this link information to the network controller. At this point, the network controller can obtain the link information of the entire network. It can be understood that BGP-LS is a way to collect network topology, which is used to summarize the network topology information collected by the IGP protocol and send it to the upper-level network controller.

[0059] Step S120: reserving time slot resources for each node in the target routing path according to the relative relationship of time slots corresponding to the first scheduling cycle lengths for the egress port and the ingress port between each two adjacent nodes, the first scheduling cycle lengths and time slot lengths supported by each port, and the forwarding delay of each node.

[0060] In this step, the relative relationship of time slots corresponding to the first scheduling cycle lengths of the egress port and the ingress port may include a time slot mapping relationship or a scheduling cycle phase difference; reserving time slot resources for each node of the target routing path means reserving corresponding outbound time slot resources on the egress port for the service flow with the corresponding arrival time at the ingress node of the target routing path, and reserving corresponding outbound time slot resources on the egress port for the service flow with the corresponding inbound time slot at the intermediate node of the target routing path, so that the residence delay evaluation value of the service flow at each node can be consistent with the budget value.

[0061] In a feasible embodiment, when the relative relationship of time slots corresponding to the first scheduling cycle lengths for the egress port and the ingress port between two adjacent nodes is a time slot mapping relationship, the time slot mapping relationship corresponding to the first scheduling cycle lengths for the egress port and the egress port between each two adjacent nodes can be calculated based on the time slot mapping relationship, the first scheduling cycle lengths and time slot lengths supported by each port, and the forwarding delay of each node, and time slot resources are reserved for each node in the target routing path based on the time slot mapping relationship corresponding to the first scheduling cycle lengths for the egress port and the egress port between each two adjacent nodes and the forwarding delay of each node.

[0062] It should be noted that the time slot mapping relationship corresponding to the first scheduling cycle length of the egress port and the ingress port between two adjacent nodes includes the egress port information of the previous node, the first sending time slot of the egress port of the previous node, the ingress port information of the next node, the second sending time slot of the ingress port of the next node, and the remaining time from the moment when the end of the first sending time slot of the egress port of the previous node is mapped to the second sending time slot of the ingress port of the next node to the end moment of the second sending time slot of the ingress port of the next node, wherein the first sending time slot of the egress port of the previous node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the egress port of the previous node, and the second sending time slot of the ingress port of the next node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the ingress port of the next node.

[0063] In addition, the time slot mapping relationship corresponding to the egress port and the first scheduling cycle length of the egress port between two adjacent nodes includes the egress port information of the previous node, the third sending time slot of the egress port of the previous node, the egress port information of the next node, the fourth sending time slot of the egress port of the next node, and the remaining time from the moment when the end of the third sending time slot of the egress port of the previous node is mapped to the fourth sending time slot of the egress port of the next node to the end moment of the fourth sending time slot of the egress port of the next node, wherein the third sending time slot of the egress port of the previous node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the egress port of the previous node, and the fourth sending time slot of the egress port of the next node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the egress port of the next node.

[0064] In yet another embodiment, when the acquired relative relationship of time slots corresponding to the first scheduling cycle lengths for the egress port and the ingress port between two adjacent nodes is a scheduling cycle phase difference, a time slot mapping relationship corresponding to the first scheduling cycle lengths for the egress port and the egress port between every two adjacent nodes may be calculated based on the scheduling cycle phase difference, the first scheduling cycle lengths and time slot lengths supported by each port, and the forwarding delay of each node, and time slot resources may be reserved for each node in the target routing path based on the time slot mapping relationship corresponding to the first scheduling cycle lengths for the egress port and the egress port between every two adjacent nodes and the forwarding delay of each node.

[0065] It should be noted that the scheduling cycle phase difference corresponding to the first scheduling cycle length of the egress port and the ingress port between two adjacent nodes includes the egress port information of the previous node, the ingress port information of the next node, and the remaining time from the moment when the end of the scheduling cycle of the egress port of the previous node is mapped to the scheduling cycle of the ingress port of the next node to the end moment of the scheduling cycle of the ingress port of the next node, wherein the scheduling cycle of the egress port of the previous node refers to the scheduling cycle of the egress port of the previous node with the first scheduling cycle length, and the scheduling cycle of the ingress port of the next node refers to the scheduling cycle of the ingress port of the next node with the first scheduling cycle length.

[0066] In addition, the scheduling cycle phase difference corresponding to the first scheduling cycle length of the egress port and the egress port between two adjacent nodes includes the egress port information of the previous node, the third sending time slot of the egress port of the previous node, the egress port information of the next node, the fourth sending time slot of the egress port of the next node, and the remaining time from the moment when the end of the third sending time slot of the egress port of the previous node is mapped to the fourth sending time slot of the egress port of the next node to the end moment of the fourth sending time slot of the egress port of the next node, wherein the third sending time slot of the egress port of the previous node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the egress port of the previous node, and the fourth sending time slot of the egress port of the next node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the egress port of the next node.

[0067] In an embodiment of the present application, when the relative relationship of time slots corresponding to the first scheduling cycle length for the egress port and the ingress port between each two adjacent nodes in the target routing path, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node are obtained, time slot resources can be reserved for each node in the target routing path according to the relative relationship of time slots corresponding to the first scheduling cycle length for the egress port and the ingress port between each two adjacent nodes, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node. That is, in an embodiment of the present application, it is not necessary to obtain the relative relationship of time slots of each pair of egress ports between adjacent nodes, but time slot resources can be reserved for each node according to the relative relationship of time slots corresponding to the first scheduling cycle length for the egress port and the ingress port between each two adjacent nodes. Therefore, the amount of calculation of the relative relationship of time slots can be effectively reduced, and the processing complexity of time slot resource reservation can be effectively reduced, thereby improving the processing efficiency of time slot resource reservation and reducing the waste of network resources.

[0068] The mapping relationship detected by the prior art is mainly the mapping relationship between the outgoing time slot of the egress port of the upstream node and the sending time slot of the egress port of the current node. When the number of egress ports of the current node is large, it will lead to many time slot mapping relationships, which makes the notification overhead in the network very large. The embodiment of the present application adopts an optimized detection method to only detect the relative relationship between the time slots of the egress port of the upstream node and the ingress port of the current node, and then gives a derivation method to obtain the time slot mapping relationship between the egress port of the upstream node and any egress port of the current node.

[0069] Reference Figure 3As shown in FIG. 1 , through a single time slot detection message, the mapping relationship between the time slot i of the output port port-1 of the upstream node U and the time slot j' of the input port port2 of the current node V between adjacent nodes in the network can be obtained, that is, when the end of the time slot i of port-1 reaches the port-2 of the node V after the link delay, it is in the time slot j' of port-2, and there is still T_ij' time left before the end of the time slot j, and the time slot mapping relationship between the node U and the node V is recorded as<U.port-1i:V.port-2j',T_ij'> The time slot mapping relationship is generally perceived and maintained by node V when processing the detection message, and is announced by node V in the network. In addition, node U may also obtain this time slot mapping relationship from node V through a detection message (for example, an ACK message), and then node U announces it in the network.

[0070] Refer to Figure 4 As shown, based on Figure 3 In the time slot detection process shown, when the relative relationship of the time slots corresponding to the first arrangement cycle lengths of the egress port and the ingress port is a time slot mapping relationship, the step S120 may include but is not limited to step S210, step S220, step S230 and step S240.

[0071] Step S210: Calculate the offset value between the time when the end of the third sending time slot of the egress port of the previous node arrives at the egress port of the next node and the start time of the scheduling cycle with the first scheduling cycle length of the egress port of the next node according to the first sending time slot and the third sending time slot of the egress port of the previous node, the second sending time slot of the ingress port of the next node, the remaining time from the time when the end of the first sending time slot of the egress port of the previous node is mapped to the second sending time slot of the ingress port of the next node to the end time of the second sending time slot of the ingress port of the next node, the first scheduling cycle length, the time slot length of the egress port of the previous node, the time slot length of the ingress port of the next node, and the forwarding delay of the next node.

[0072] In this step, the mapping of the end of the first sending time slot of the previous node's egress port to the second sending time slot of the next node's ingress port requires a link delay. The link delay refers to the time it takes for a message or packet to be transmitted from one end of a network node to the other end. The link delay may include node processing delay, queuing delay, sending delay, propagation delay, etc.

[0073] In a feasible embodiment, the calculation process of the offset value may include the following steps: first, multiply the value obtained by adding 1 to the second transmission time slot by the time slot length of the next node input port to obtain a first data value, then multiply the value of the third transmission time slot minus the first transmission time slot by the time slot length of the previous node output port to obtain a second data value, then obtain the third data value by combining the first data value, the second data value, the remaining time, the first scheduling cycle length and the forwarding delay, and obtain the third data value by performing a modulo operation on the third data value and the first scheduling cycle length to obtain the offset value.

[0074] Step S220: Calculate the fourth sending time slot of the next node egress port according to the offset value and the time slot length.

[0075] In this step, the time slot length refers to the time slot length of the egress port of the next node.

[0076] In this embodiment, the fourth sending time slot of the next node egress port may be obtained by dividing the offset value by the time slot length of the next node egress port and performing integer operation.

[0077] Step S230: Calculate the remaining time from the moment when the end of the third transmission time slot of the previous node egress port is mapped to the fourth transmission time slot of the next node egress port to the end of the fourth transmission time slot of the next node egress port according to the fourth transmission time slot of the next node egress port, the offset value and the time slot length.

[0078] In this embodiment, the calculation process of the remaining time may include the following steps: first, multiply the value obtained by adding 1 to the fourth transmission time slot of the subsequent node egress port by the time slot length of the subsequent node egress port to obtain a fourth data value, and then subtract the offset value from the fourth data value to obtain the remaining time from the moment when the end of the third transmission time slot of the previous node egress port is mapped to the fourth transmission time slot of the subsequent node egress port to the end moment of the fourth transmission time slot of the subsequent node egress port.

[0079] Step S240: Based on the previous node egress port information and the third sending time slot of the previous node egress port, the next node egress port information and the fourth sending time slot of the next node egress port, and the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the next node egress port to the end moment of the fourth sending time slot of the next node egress port, obtain the time slot mapping relationship between the egress ports and the egress ports between every two adjacent nodes.

[0080] In this embodiment, two adjacent nodes can exchange information based on the same length of scheduling cycles. In addition, the forwarding delay within the node refers to the maximum time it takes for a message to travel from the input port to the output port of the node. It should be noted that the forwarding delay within the node does not include the queuing delay of the message at the output port of the node and the propagation delay of the network link.

[0081] In yet another embodiment, referring to Figure 5 As shown in the figure, through the scheduling cycle phase difference detection message, the phase difference between the scheduling cycle of the upstream node U's outgoing port port-1 and the scheduling cycle of the ingoing port port2 of the current node V can be obtained. That is, when the end of the scheduling cycle of port-1 reaches port-2 of node V after the link delay, it is in the current scheduling cycle of port-2, and there is still P_uv time left before the end of the current scheduling cycle. And this phase difference is recorded as<U.port-1:V.port-2,P_uv> , which is generally perceived and maintained by node V when processing the detection message, and announced by node V in the network. In addition, the upstream node U may also obtain this phase difference from node V through the detection message (for example, ACK message), and then announced by node U in the network.

[0082] Refer to Figure 6 As shown, based on Figure 5 In the arrangement cycle phase difference detection process shown, when the relative relationship between the time slots corresponding to the first arrangement cycle lengths of the egress port and the ingress port is the arrangement cycle phase difference, the step S120 may include but is not limited to steps S310, S320, S330 and S340.

[0083] Step S310: Calculate the offset value between the end of the third sending time slot of the previous node egress port and the start time of the scheduling cycle with the first scheduling cycle length of the egress port of the next node when the end of the third sending time slot of the previous node egress port arrives at the egress port of the next node according to the third sending time slot of the previous node egress port, the remaining time from the moment when the scheduling cycle end of the previous node egress port is mapped to the scheduling cycle of the ingress port of the next node to the end time of the scheduling cycle of the ingress port of the next node, the time slot length of the previous node egress port, the time slot length of the egress port of the next node, the first scheduling cycle length and the forwarding delay of the next node.

[0084] In a feasible embodiment, the calculation process of the offset value may include the following steps: first, multiplying the data obtained by adding 1 to the third transmission time slot of the previous node egress port by the time slot length of the previous node egress port to obtain a fifth data value, then combining the fifth data, the first scheduling cycle length, the remaining time and the forwarding delay of the next node to obtain a sixth data value, and performing a modulo operation on the sixth data value and the first scheduling cycle length to obtain the offset value.

[0085] Step S320: Calculate the fourth sending time slot of the next node egress port according to the offset value and the time slot length.

[0086] In this step, the time slot length refers to the time slot length of the egress port of the next node.

[0087] In this embodiment, the offset value is divided by the time slot length of the next node egress port and then an integer operation is performed to obtain the fourth sending time slot of the next node egress port.

[0088] Step S330: Calculate the remaining time from the moment when the end of the third transmission time slot of the previous node egress port is mapped to the fourth transmission time slot of the next node egress port to the end of the fourth transmission time slot of the next node egress port according to the fourth transmission time slot of the next node egress port, the offset value and the time slot length.

[0089] In this embodiment, the calculation process of the remaining time may include the following steps: first, multiply the value obtained by adding 1 to the fourth transmission time slot of the subsequent node egress port by the time slot length of the subsequent node egress port to obtain a sixth data value, and then subtract the offset value from the sixth data value to obtain the remaining time from the moment when the end of the third transmission time slot of the previous node egress port is mapped to the fourth transmission time slot of the subsequent node egress port to the end moment of the fourth transmission time slot of the subsequent node egress port.

[0090] Step S340: According to the previous node egress port information, the third sending time slot of the previous node egress port, the next node egress port information, the fourth sending time slot of the next node egress port, and the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the next node egress port to the end moment of the fourth sending time slot of the next node egress port, obtain the time slot mapping relationship between the egress ports and the egress ports between every two adjacent nodes.

[0091] It should be noted that the time slot mapping relationship corresponding to the first scheduling cycle length of the output port and the output port between each two adjacent nodes can be calculated by a path calculation engine, for example, it can be calculated by a path calculation engine deployed in the head node of the target routing path, or by a path calculation engine deployed in a network controller, and used as a reference for path calculation and resource reservation.

[0092] In the above embodiment, the relative relationship of time slots corresponding to the first scheduling cycle lengths of the egress ports and the egress ports between every two adjacent nodes is obtained by calculating the relative relationship of time slots corresponding to the first scheduling cycle lengths of the egress ports and the ingress ports between every two adjacent nodes, which effectively reduces the amount of data for directly calculating the time slot mapping relationship corresponding to the first scheduling cycle lengths of the egress ports and the egress ports between every two adjacent nodes, and improves the efficiency of time slot resource reservation.

[0093] Reference Figure 7, further explanation is given to "reserving time slot resources for each port in the target routing path according to the time slot mapping relationship between the egress ports and the egress ports between each two adjacent nodes, and the forwarding delay of each node" in step S120. "Reserving time slot resources for each port in the target routing path according to the time slot mapping relationship between the egress ports and the egress ports between each two adjacent nodes, and the forwarding delay of each node" in step S120 may include but is not limited to step S410 and step S420.

[0094] Step S410: Obtain the node residence delay budget value of each node.

[0095] In this step, the delay budget is the expected end-to-end delay when the data packet is transmitted along the target path, which is the demand put forward by the business flow to the network.

[0096] In this embodiment, before obtaining the node residence delay budget value of each node in the network, the network controller or the path head node needs to preset the target routing path and the expected end-to-end delay of the message transmission, and then deduct the sum of the propagation delays of all links contained in the target path to obtain the residence delay budget of all nodes in the target path, and then divide the residence delay budget of all nodes equally to each node, and finally obtain the node residence delay budget value of each node.

[0097] Step S420: reserve time slot resources for each node in the target routing path according to the node residence delay budget value of each node, the forwarding delay of each node, the fourth sending time slot of the next node egress port, and the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the next node egress port to the end moment of the fourth sending time slot of the next node egress port.

[0098] In this step, the previous node and the next node are descriptions of adjacent nodes in the network, and the calculation methods involved in the node residence delay budget value of each node, the forwarding delay of each node, the fourth sending time slot of the next node egress port, and the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the next node egress port to the end moment of the fourth sending time slot of the next node egress port are described accordingly in the aforementioned steps S210-S240 and steps S310-S340, and will not be repeated here.

[0099] In order to more clearly illustrate the process of reserving time slot resources for each node in the target routing path, a specific example is used as follows:

[0100] Refer to Figure 8The network topology shown in the figure, this embodiment describes the specific process of the network controller reserving time slot resources in the network for a deterministic service flow, the network includes six nodes and a network controller, wherein a BGP-LS session is established between the selected node S and the network controller to notify the network controller of the link state data of the network, wherein each link is a bidirectional link. In addition, Figure 6 Port-1 to port-11 shown correspond to the egress and ingress ports of the network node.<S.port-1:A.port-3,23> It represents the phase difference between the scheduling cycles of the egress port port-1 of the node S and the egress port port-3 of the node A, that is, when the end of the scheduling cycle of the egress port port-1 of the node S reaches the egress port port-3 of the node A after the link delay, it is in the current scheduling cycle of port-3, and the remaining time to the end of the current scheduling cycle is 23us. The above example is for illustration, and the representation content of the same structure in the subsequent description is similar. Figure 6 The inbound and outbound ports of each node are fully labeled and will not be repeated here.

[0101] Assume that the propagation delay of all links is 10us, and the ports of all nodes in the network use the same scheduling cycle length of 100us and the same time slot length of 10us, that is, the scheduling cycle contains 10 time slots, numbered 0 to 9. In addition, assume that the fixed forwarding delay in each node is 5us.

[0102] Then, the phase difference of the scheduling cycle between adjacent nodes in the network is obtained through the detection protocol. Assuming that the direction from node S to node A is detected, the corresponding phase difference of the scheduling cycle is<S.port-1:A.port-3,23> ; From node B to node C, the phase difference of the corresponding scheduling cycle is<B.port-6:C.port-9,71> ; From node C to node B, the phase difference of the corresponding scheduling cycle is<C.port-9:B.port-6,89> Due to space limitations, the figure does not show the arrangement period phase difference of each link in all directions.

[0103] Then, the orchestration cycle phase difference between adjacent nodes in the network, the orchestration cycle length and time slot length supported by each port, and the forwarding delay of each node are all flooded in the network through the IGP protocol. Node S will learn this information of the entire network and then report it to the network controller through BGP-LS.

[0104] Assume that the controller or head node S needs to calculate a candidate path path_SD via SACED, and the expected end-to-end delay is 200us. After deducting the sum of the propagation delays of all links contained in the path, the total node residence delay budget is 160us. On average, each node will share 32us of the node residence delay budget.

[0105] Assume that the network controller reserves corresponding time slot resources in time slot 0 on port-1 of node S.

[0106] Then, according to the phase difference between the scheduling cycles of node S and node A<S.port-1:A.port-3,23> , it is calculated that the time slot 0 of the egress port port-1 of node S will be mapped to the time slot 9 of the egress port of node A, and the remaining time of time slot 9 is 8.

[0107] Finally, based on the intra-node residence delay budget of 32us for each node, the fixed forwarding delay of 5us in each node, and the remaining time of 8, it is calculated that only time slot 1 needs to be reserved on the egress port of node A to obtain a residence delay evaluation value of node A that is close to the budget value.

[0108] It should be noted that the specific example given in this embodiment is only to make step S320 more understandable, and does not limit the specific data and other information of the embodiment.

[0109] Reference Fig. 9 In one embodiment of the present application, before executing step S120, the time slot resource reservation method may also include but is not limited to step S510, step S520 and step S530.

[0110] Step S510: Obtain a relative relationship of time slots corresponding to the first scheduling cycle lengths for the egress port and the ingress port between the current node and the next node.

[0111] In this step, the relative relationship of time slots for the egress port and the ingress port between the present node and the next node may be the relative relationship of time slots for the egress port and the ingress port between any two adjacent nodes based on the IGP protocol. The IGP protocol may be an Intermediate System to Intermediate System (ISIS) protocol, or an Open Shortest Path First (OSPF) protocol, or an Open Shortest Path First Version 3 (OSPFv3) protocol supporting IPv6, etc., which is not specifically limited here.

[0112] Step S520: Generate a first notification message including a relative relationship of time slots corresponding to a first scheduling cycle length for an egress port and an ingress port between the current node and the next node.

[0113] In this step, the time slot relative relationship may be a time slot mapping relationship corresponding to the first scheduling cycle length for the egress port and the ingress port between the current node and the next node, or may be a scheduling cycle phase difference corresponding to the first scheduling cycle length for the egress port and the ingress port between the current node and the next node. The first notification information may be generated by the current node or by the next node, that is, both the upstream node and the downstream node between adjacent nodes may generate the first notification information. Since the time slot relative relationship is generally perceived and maintained by the next node when processing the detection message, if the notification information is generated by the current node, the time slot relative relationship transmitted by the next node needs to be obtained first.

[0114] In one embodiment, the ISIS protocol set of the IGP protocol can be extended to add corresponding Sub-TLVs 22 / 23 / 25 / 141 / 222 / 223 defined in the existing ISIS protocol set (refer to RFC5305, RFC5311, RFC5316, RFC5120) for announcing adjacency relationships, and encapsulate the relative relationship between the time slots of the egress port and the ingress port between the current node and the next node to generate a first notification message.

[0115] In one embodiment, when generating a first notification message including a time slot mapping relationship between an egress port and an ingress port between the current node and the next node, in order to more clearly illustrate the generation process of the first notification message, a specific example is given below using steps S521-S522.

[0116] Step S521: Generate a first time slot mapping Sub-TLV including a time slot mapping relationship corresponding to a first scheduling cycle length for an egress port and an ingress port between the current node and the next node.

[0117] In one example, when the first timeslot mapping Sub-TLV is generated by the node, a new Sub-TLV can be added to TLVs 22 / 23 / 25 / 141 / 222 / 223 and named Timeslot Mapping Sub-TLV to carry the timeslot mapping relationship between the egress port and the ingress port between adjacent nodes, as shown in FIG. Fig.10 , Fig.10 The structure of the newly added TimeslotMapping Sub-TLV is given as an example. In this sub-TLV structure, the explanations of the main fields are as follows:

[0118] Type: occupies 1 byte and is used to indicate that this sub-TLV is Timeslot Mapping Sub-TLV;

[0119] Length: 1 byte, used to indicate the length of this sub-TLV excluding the Type field and the Length field;

[0120] Local Timeslot ID: occupies 2 bytes and is used to indicate a timeslot in the scheduling cycle of the egress port of this node.

[0121] Remote Timeslot ID: occupies 2 bytes and is used to indicate a timeslot in the scheduling cycle of the ingress port of the neighboring node.

[0122] Local-to-remote Remaining Time: occupies 2 bytes and indicates the remaining time from the end of the time slot of the neighboring node to which the time slot of the local node is mapped, in us.

[0123] Orchestration Period Length (OPL): occupies 4 bytes and is used to indicate the length of the orchestration period in us.

[0124] In another example, when the first timeslot mapping Sub-TLV is generated by the next node, a new Sub-TLV can be added to TLVs22 / 23 / 25 / 141 / 222 / 223 and named Reverse Timeslot Mapping Sub-TLV to carry the timeslot mapping relationship between the egress port and the ingress port between adjacent nodes, see Fig.11 , Fig.11 The structure of the newly added Reverse Timeslot Mapping Sub-TLV is given as an example. In this sub-TLV structure, the explanations of the main fields are as follows:

[0125] Type: occupies 1 byte and is used to indicate that this sub-TLV is the Reverse Timeslot Mapping Sub-TLV.

[0126] Length: 1 byte, used to indicate the length of this sub-TLV excluding the Type field and the Length field;

[0127] Remote Timeslot ID: occupies 2 bytes and is used to indicate a timeslot in the scheduling cycle of the egress port of the neighboring node.

[0128] Local Timeslot ID: occupies 2 bytes and is used to indicate a timeslot in the scheduling cycle of the ingress port of this node.

[0129] Remote-to-local Remaining Time: 2 bytes, indicating the remaining time from the end of the time slot of the neighboring node to which the time slot of this node is mapped, in us.

[0130] Orchestration Period Length (OPL): occupies 4 bytes and is used to indicate the length of the orchestration period in us.

[0131] Step S522: Generate a first notification message according to the first time slot mapping Sub-TLV.

[0132] In this step, according to the encapsulation format of the first time slot mapping Sub-TLV, after giving corresponding field placeholder bytes, the content is re-encapsulated to generate a first notification message.

[0133] In another embodiment, when a first notification message including the scheduling period phase difference between the current node and the next node for the egress port and the ingress port is generated, similarly, the first notification message can be generated by the current node or by the next node, which is described below with specific examples using steps S523-S524.

[0134] Step S523: Generate a first scheduled cycle phase difference Sub-TLV including a scheduled cycle phase difference corresponding to a first scheduled cycle length for an egress port and an ingress port between the current node and the next node.

[0135] In one example, when the first orchestration period phase difference Sub-TLV is generated by the node, a new Sub-TLV can be added to TLVs22 / 23 / 25 / 141 / 222 / 223 and named Orchestration Period Phase DifferenceSub-TLV to carry the orchestration period phase difference between the egress port and the ingress port between adjacent nodes. Fig.12 , Fig.12 The structure of the newly added Orchestration Period Phase Difference Sub-TLV is given as an example. In this sub-TLV structure, the main fields are explained as follows:

[0136] Type: occupies 1 byte and is used to indicate that this TLV is the Orchestration Period Phase DifferenceSub-TLV.

[0137] Length: 1 byte, used to indicate the length of the sub-TLV excluding the Type field and the Length field.

[0138] Local-to-remote OP Phase-Diff: occupies 4 bytes and is used to indicate the phase difference between the orchestration period of the egress port of the local node and the orchestration period of the ingress port of the neighboring node, in microseconds.

[0139] Orchestration Period Length (OPL): occupies 4 bytes and is used to indicate the length of the orchestration period in us.

[0140] In another example, when the first orchestration period phase difference Sub-TLV is generated by the next node, a new Sub-TLV can be added to TLVs22 / 23 / 25 / 141 / 222 / 223 and named Reverse Orchestration Period PhaseDifference Sub-TLV to carry the orchestration period phase difference between the egress port and the ingress port between adjacent nodes. Fig.13 , Fig.13 The structure of the newly added Reverse Orchestration Period Phase DifferenceSub-TLV is given as an example. In this sub-TLV structure, the explanations of the main fields are as follows:

[0141] Type: occupies 1 byte and is used to indicate that this TLV is the Reverse Orchestration Period PhaseDifference Sub-TLV.

[0142] Length: 1 byte, used to indicate the length of the sub-TLV excluding the Type field and the Length field.

[0143] Remote-local OP Phase-Diff: occupies 4 bytes and is used to indicate the phase difference between the scheduling period of the neighbor node's egress port and the scheduling period of the local node's ingress port, in microseconds.

[0144] Orchestration Period Length (OPL): occupies 4 bytes and is used to indicate the length of the orchestration period in us.

[0145] Step S524: Generate a first notification message according to the first arranged periodic phase difference Sub-TLV.

[0146] In this step, according to the encapsulation format of the first arranged periodic phase difference Sub-TLV, after giving corresponding field placeholder bytes, the content is re-encapsulated to generate a first notification message.

[0147] It should be noted that, because the attribute between the current node and the neighboring node is announced in the IGP protocol, it generally refers to the unidirectional attribute from the current node to the neighboring node, and the time slot mapping relationship or scheduling period phase difference mentioned in this application refers to the unidirectional attribute from the current node to the next node. Therefore, when the first announcement information is generated by this node, the next node needs to first inform this node of the detection result of the relative relationship of the time slots through a message of the detection protocol (such as an ACK message).

[0148] Furthermore, when there are multiple parallel links between this node and the next node, each link may have a different time slot mapping relationship. According to the prior art, it is necessary to additionally include Sub-TLVs (such as port addresses defined in RFC5305 and RFC6119, or port identifiers defined in RFC5307) in TLVs 22 / 23 / 25 / 141 / 222 / 223 to distinguish links.

[0149] In addition, the naming of the newly added Sub-TLV is not limited in this embodiment. Although the embodiment of the present application describes the extension of the IS-IS protocol, it does not mean that this is the only method. Similarly, the OSPFv2 or OSPFv3 protocol can be extended to announce the time slot mapping relationship or arrange the periodic phase difference, which will not be repeated here.

[0150] Step S530: flooding the first notification message in the network.

[0151] In this step, flooding refers to the behavior of each node in the network notifying link state data to all neighbor nodes through the IGP protocol.

[0152] In this embodiment, there can be multiple nodes in the network. When there are multiple nodes in the network, each adjacent node is connected to each other to form multiple links, where each link is a bidirectional link. The relative relationship between the time slots of adjacent nodes in the link, the orchestration cycle length supported by each port and its time slot length, and the forwarding delay of each node are all flooded in the network through the IGP protocol.

[0153] In one embodiment, when a node in the network receives a first notification message that is not sent to it, the first notification message is forwarded to all links connected to the node. Of course, the first notification message cannot be sent to the node it just left. Through the analysis and forwarding of all nodes in the network, the first notification message is flooded in the network. It can be understood that when the communication traffic of the network is very small, the transmission delay of the first notification message can be minimized.

[0154] After the router forms a complete adjacency state with at least one neighbor router, it will build a flood list for each neighbor in the complete adjacency state. Then, after each LSA is sent, it will build a retransmission list for each neighbor and put the LSA just sent into the retransmission list. If the reply information of this neighbor is not received within 5 seconds (RxmtInterval), it will be retransmitted once. Regardless of the network type, the retransmitted link state update data packet is always sent in unicast form.

[0155] Reference Fig.14 In one embodiment of the present application, before executing step S110, step S110 may include but is not limited to step S610, step S620 and step S630.

[0156] Step S610: Obtain a relative relationship of time slots corresponding to the first scheduling cycle length for an egress port and an ingress port between a previous node and the current node.

[0157] In this step, the relative relationship of the time slots may be a time slot mapping relationship corresponding to the first scheduling cycle length for the egress port and the ingress port between the previous node and the current node, or may be a scheduling cycle phase difference corresponding to the first scheduling cycle length for the egress port and the ingress port between the previous node and the current node.

[0158] Step S620: Generate a second notification message including a relative relationship of time slots corresponding to the first scheduling cycle length for the egress port and the ingress port between the previous node and the current node.

[0159] In this step, the process of generating the second notification information is as follows: generating a first time slot mapping Sub-TLV including a time slot mapping relationship corresponding to a first scheduling cycle length for an egress port and an ingress port between a previous node and the current node, and generating a second notification message according to the first time slot mapping Sub-TLV; or generating a first scheduling cycle phase difference Sub-TLV including a scheduling cycle phase difference corresponding to a first scheduling cycle length for an egress port and an ingress port between a previous node and the current node, and generating a second notification message according to the first scheduling cycle phase difference Sub-TLV.

[0160] Step S630: flooding the second notification message in the network.

[0161] In this embodiment, the content is similar to the aforementioned step S530 and will not be repeated here.

[0162] Reference Fig.15In one embodiment of the present application, before executing step S110, step S110 may include but is not limited to step S710, step S720 and step S730.

[0163] Step S710: Obtain the forwarding delay of this node.

[0164] In this step, forwarding delay usually refers to the time it takes for a data packet to reach an intermediate node from the source node in the network and then be forwarded from the intermediate node to the target node. Usually, forwarding delay includes two parts of delay time, namely, intermediate node cache delay and transmission delay. However, the forwarding delay of this node in this step only refers to the forwarding delay within this node, that is, the maximum delay experienced by the message from the ingress port of this node to the egress port of this node, and does not include the queuing delay of the message at the egress port of this node and the link propagation delay.

[0165] In one embodiment, after receiving a data packet, node A will first detect the data packet, such as decapsulating and analyzing the header, searching the routing table, routing policy, etc., to determine which link the data packet will be subsequently directed to. In this process, the processing time spent by node A is related to the length of the data packet, bandwidth, etc. Generally speaking, the forwarding delay of node A is usually on the order of microseconds or lower.

[0166] Step S720: Generate a third notification message including the forwarding delay of the current node.

[0167] In this step, the third notification information is generated according to the forwarding delay of the node. The network protocol set can be extended to re-encapsulate the forwarding delay of each node using a newly added network protocol, and then the forwarding delay of each node is notified to the network.

[0168] In a feasible embodiment, since the existing ISIS protocol suite (refer to RFC7981) has defined TLV 242 for notifying node capabilities, the IS-IS protocol is extended to support forwarding delay through the node. The specific steps are as follows:

[0169] Step S721: Generate a forwarding delay Sub-TLV including the forwarding delay of the current node.

[0170] In this step, a forwarding delay Sub-TLV is added to TLV 242 and named Intra-nodeForwarding Delay Sub-TLV, which is used to carry the forwarding delay within this node in units of us. Fig.16 , Fig.16 The structure of the newly added Intra-node Forwarding Delay Sub-TLV is given as an example. In this sub-TLV structure, the explanations of the main fields are as follows:

[0171] Type: occupies 1 byte and is used to indicate that this sub-TLV is the Intra-node Forwarding Delay Sub-TLV.

[0172] Length: 1 byte, used to indicate the length of this sub-TLV excluding the Type field and the Length field;

[0173] Intra-node Forwarding Delay: occupies 3 bytes and is used to indicate the forwarding delay (F) within this node, in us.

[0174] Step S722: Generate a third notification message according to the forwarding delay Sub-TLV.

[0175] In this step, according to the encapsulation format of the Intra-node Forwarding Delay Sub-TLV, a field is named Intra-node Forwarding Delay to indicate the forwarding delay within the node, in units of us.

[0176] In addition, this embodiment does not limit the extended network protocol. Similarly, the forwarding delay within the node can be notified to the network by extending protocols such as OSPFv2 or OSPFv3.

[0177] Step S730: flooding the third notification message in the network.

[0178] In this step, the content is similar to the aforementioned step S530 and will not be repeated here.

[0179] This embodiment generates a third notification message including the forwarding delay of the node and floods the information in the network, so that the network controller or the path head node can successfully calculate the time slot resource reservation of each node according to the forwarding delay, the time slot of the downstream node mapped to any time slot of the egress port of the upstream node between adjacent nodes in the path, the scheduling cycle length supported by each port of each node, and the time slot length within the scheduling cycle.

[0180] In addition, the method for reserving time slot resources provided in the embodiment of the present application can be applied to a network controller, and the network controller can be connected to any node in the network to receive the fourth notification message sent by the target node.

[0181] Among them, the fourth announcement message includes at least: a time slot mapping TLV for a time slot mapping relationship between an egress port and an ingress port between two adjacent nodes, a scheduling cycle phase difference TLV for a scheduling cycle phase difference between an egress port and an ingress port between two adjacent nodes, a scheduling capability TLV for a first scheduling cycle length and a time slot length, and a forwarding delay TLV for a forwarding delay.

[0182] It can be understood that when the calculation of the deterministic forwarding path based on time slot resource reservation is performed by the network controller, the network controller needs to collect the fourth notification message from the network.

[0183] In one embodiment, a target node among multiple nodes of a routing path is connected to a network controller, and a BGP-LS session is established between the two. The fourth announcement message is uploaded by the target node to the network controller through the BGP-LS protocol (see RFC7752), thereby the network controller obtains the fourth announcement message. Among them, BGP-LS mainly defines an NLRI type (i.e., link-state NLRI, which is further subdivided into node NLRI, link NLRI, prefix NLRI) and a BGP pathattribute (i.e., BGP-LS attribute, which further includes various node attributes, link attributes, prefix attributes, which are respectively announced with node NLRI, link NLRI, prefix NLRI).

[0184] In one embodiment, a BGP-LS session is established between a designated node A and a network controller in an IGP domain, and the node A notifies the network controller of link state data learned from the IGP domain.

[0185] In order to more clearly illustrate the process of the network controller connecting to the target node A in the network and receiving the fourth notification message sent by the target node A, which involves the extension of the BGP-LS protocol, a specific example is used to illustrate it below.

[0186] It should be noted that the target node A may be an upstream node or a downstream node between two adjacent nodes in the path. The BGP-LS protocol is extended to collect the time slot mapping relationship or the scheduling cycle phase difference of each node port in the IGP domain.

[0187] In one example, when the target node A is an upstream node and collects the timeslot mapping relationship of each node port in the IGP domain, a link attribute, namely, Timeslot Mapping TLV, can be added to the BGP-LS attribute to indicate the timeslot mapping relationship. Fig.17 , Fig.17 The structure of the newly added Timeslot Mapping TLV is given as an example. In this TLV structure, the explanations of the main fields are as follows:

[0188] Type: occupies 2 bytes and is used to indicate that this TLV is a Timeslot Mapping TLV.

[0189] Length: occupies 2 bytes and is used to indicate the length of this TLV excluding the Type field and the Length field.

[0190] Local Timeslot ID: occupies 2 bytes and is used to indicate a timeslot in the scheduling cycle of the egress port of this node.

[0191] Remote Timeslot ID: occupies 2 bytes and is used to indicate a timeslot in the scheduling cycle of the ingress port of the neighboring node.

[0192] Local-to-remote Remaining Time: occupies 2 bytes and indicates the remaining time from the end of the time slot of the neighboring node to which the time slot of the local node is mapped, in us.

[0193] Orchestration Period Length (OPL): occupies 4 bytes and is used to indicate the length of the orchestration period in us.

[0194] In another example, when the target node A is a downstream node and collects the timeslot mapping relationship of each node port in the IGP domain, a link attribute, namely, Reverse TimeslotMapping TLV, can be added to the BGP-LS attribute to indicate the timeslot mapping relationship. Fig.18 , Fig.18 The structure of the newly added ReverseTimeslot Mapping TLV is given as an example. In this TLV structure, the explanations of the main fields are as follows:

[0195] Type: occupies 2 bytes and is used to indicate that this TLV is a Timeslot Mapping TLV.

[0196] Length: occupies 2 bytes and is used to indicate the length of this TLV excluding the Type field and the Length field.

[0197] Remote Timeslot ID: occupies 2 bytes and is used to indicate a timeslot in the scheduling cycle of the egress port of the neighboring node.

[0198] Local Timeslot ID: occupies 2 bytes and is used to indicate a timeslot in the scheduling cycle of the ingress port of this node.

[0199] Remote-to-local Remaining Time: 2 bytes, indicating the remaining time from the end of the time slot of the neighboring node to which the time slot of this node is mapped, in us.

[0200] Orchestration Period Length (OPL): occupies 4 bytes and is used to indicate the length of the orchestration period in us.

[0201] In another example, when the target node A is an upstream node and collects the orchestration period phase difference of each node port in the IGP domain, a link attribute, namely, OrchestrationPeriod Difference TLV, can be added to the BGP-LS attribute to indicate the orchestration period phase difference. Fig.19 , Fig.19 The structure of the newly added Orchestration Period Difference TLV is given as an example. In this TLV structure, the explanations of the main fields are as follows:

[0202] Type: occupies 2 bytes and is used to indicate that this TLV is the Orchestration Period Difference TLV.

[0203] Length: occupies 2 bytes and is used to indicate the length of this TLV excluding the Type field and the Length field.

[0204] Local-to-remote OP Phase-Diff: occupies 4 bytes and is used to indicate the phase difference between the orchestration period of the egress port of the local node and the orchestration period of the ingress port of the neighboring node, in microseconds.

[0205] Orchestration Period Length (OPL): occupies 4 bytes and is used to indicate the length of the orchestration period in us.

[0206] In another example, when the target node A is a downstream node and collects the orchestration period phase difference of each node port in the IGP domain, a link attribute, namely, ReverseOrchestration Period Difference TLV, can be added to the BGP-LS attribute to indicate the orchestration period phase difference. Fig. 20 , Fig. 20 The structure of the newly added Reverse Orchestration Period Difference TLV is given as an example. In this TLV structure, the explanations of the main fields are as follows:

[0207] Type: occupies 2 bytes and is used to indicate that this TLV is the Orchestration Period Difference TLV.

[0208] Length: occupies 2 bytes and is used to indicate the length of this TLV excluding the Type field and the Length field.

[0209] Remote-local OP Phase-Diff: occupies 4 bytes and is used to indicate the phase difference between the scheduling period of the neighbor node's egress port and the scheduling period of the local node's ingress port, in microseconds.

[0210] Orchestration Period Length (OPL): occupies 4 bytes and is used to indicate the length of the orchestration period in us.

[0211] In this step, it can be understood that since BGP-LS needs to import the link state data in the entire IGP domain, the newly added linkattribute and the field placeholder bytes in the encapsulation structure will be slightly larger, which is not exactly the same as the placeholder bytes described in the above-mentioned extension of the IGP protocol.

[0212] In addition, the BGP-LS protocol needs to be extended to collect the scheduling cycle length and time slot length supported by each node port in the IGP domain. By adding a link attribute in the BGP-LS attribute, namely TQF SchedulingCapability TLV, it is used to indicate the scheduling cycle length and time slot length supported by the port. Fig.21 , Fig.21 The structure of the newly added TQF Scheduling Capability TLV is given as an example. In this TLV structure, the explanations of the main fields are as follows:

[0213] Type: occupies 2 bytes and is used to indicate that this TLV is the TQF Scheduling Capability TLV.

[0214] Length: occupies 2 bytes and is used to indicate the length of this TLV excluding the Type field and the Length field.

[0215] Orchestration Period Length: used to indicate the orchestration period length supported by the port, in us.

[0216] Scheduling Period Length: It is used to indicate the scheduling period length actually created on the forwarding hardware of the port, in us.

[0217] Timeslot Length: used to indicate the length of each timeslot contained in the scheduling cycle, in us.

[0218] It should be noted that a port can support multiple scheduling cycle lengths, and separate TQFScheduling Capability TLVs should be announced for each. In addition, the scheduling cycle is generally less than or equal to the scheduling cycle, which is related to the hardware capabilities.

[0219] In addition, it is necessary to extend the BGP-LS protocol to collect the maximum forwarding delay of each node in the IGP domain. By adding a node attribute in the BGP-LS attribute, the Intra-node Forwarding Delay TLV, it indicates the maximum forwarding delay within the node in units of us. Fig. 22 , Fig. 22 The structure of the newly added Intra-nodeForwarding Delay TLV is given as an example. In this TLV structure, the explanations of the main fields are as follows:

[0220] Type: occupies 2 bytes and is used to indicate that this TLV is the TQF Scheduling Capability TLV.

[0221] Length: occupies 2 bytes and is used to indicate the length of this TLV excluding the Type field and the Length field.

[0222] Intra-node Forwarding Delay: occupies 3 bytes and is used to indicate the forwarding delay within this node, in us.

[0223] In this embodiment, by extending the BGP-LS protocol, the target node A reports the link state data learned from the IGP domain, the link state data at least including the fourth notification message mentioned above, to the network controller, so that the network controller can calculate the path that meets the service delay requirements based on the received time slot mapping relationship or scheduling cycle phase difference between adjacent nodes in the network, the scheduling cycle length supported by the node and its time slot length, and the forwarding delay information of the node, and of course, the link propagation delay, and reserve time slot resources along the path.

[0224] It should be noted that, in specific applications, the above-mentioned extension of BGP-LS is not limited to importing link status data from the IGP domain and reporting it to the controller, but can also import data from nodes or links that do not belong to the IGP domain. For example, the inter-domain link connecting two ASs (autonomous systems) also has the time slot mapping and scheduling cycle phase difference information described in this patent, and can be imported into BGP-LS and reported to the controller.

[0225] In addition, an embodiment of the present application further provides a communication device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is stored in a computer-readable storage medium, and the processor of the computer device reads the computer program or computer instructions from the computer-readable storage medium, and the processor executes the computer program or computer instructions, so that the computer device executes the time slot resource reservation method in the above embodiment, for example, executing the above described Figure 2 Steps S110 to S120 of the method, Figure 4 Steps S210 to S240 of the method, Figure 6 Steps S310 to S340 of the method, Figure 7 Method steps S410 to S420, etc.

[0226] In addition, an embodiment of the present application further provides a computer-readable storage medium, which stores computer-executable instructions, and the computer-executable instructions are executed by a processor or a controller, for example, by a processor in the above-mentioned device embodiment, so that the above-mentioned processor can execute the time slot resource reservation method in the above-mentioned embodiment, for example, execute the above-mentioned Figure 2 Steps S110 to S120 of the method, Figure 4 Steps S210 to S240 of the method, Figure 6 Steps S310 to S340 of the method, Figure 7 Method steps S410 to S420, etc.

[0227] It will be appreciated by those skilled in the art that all or some of the steps and systems in the disclosed method above may be implemented as software, firmware, hardware and appropriate combinations thereof. Some physical components or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor or a microprocessor, or may be implemented as hardware, or may be implemented as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or a non-transitory medium) and a communication medium (or a temporary medium). As known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that may be used to store desired information and may be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

Claims

1. A time slot resource reservation method, comprising: Obtaining a relative relationship of time slots corresponding to a first scheduling cycle length for an egress port and an ingress port between each two adjacent nodes in a target routing path, the first scheduling cycle length and time slot length supported by each port, and a forwarding delay of each node; Time slot resources are reserved for each node in the target routing path according to a relative relationship between time slots corresponding to a first scheduling cycle length for an egress port and an ingress port between each two adjacent nodes, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node.

2. The method according to claim 1, characterized in that The relative relationship of time slots includes a time slot mapping relationship or an arrangement cycle phase difference; The reserving time slot resources for each node in the target routing path according to the relative relationship of time slots corresponding to the first scheduling cycle length for the egress port and the ingress port between each two adjacent nodes, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node, includes one of the following: According to the time slot mapping relationship corresponding to the first scheduling cycle length for the egress port and the ingress port between each two adjacent nodes, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node, a time slot mapping relationship corresponding to the first scheduling cycle length for the egress port and the egress port between each two adjacent nodes is calculated, and according to the time slot mapping relationship corresponding to the first scheduling cycle length for the egress port and the egress port between each two adjacent nodes, and the forwarding delay of each node, a time slot resource is reserved for each node in the target routing path; A time slot mapping relationship corresponding to the first scheduling cycle length for the egress port and the egress port between each two adjacent nodes is calculated according to the scheduling cycle phase difference corresponding to the first scheduling cycle length for the egress port and the ingress port between each two adjacent nodes, the first scheduling cycle length and the time slot length supported by each port, and the forwarding delay of each node, and a time slot resource is reserved for each node in the target routing path according to the time slot mapping relationship corresponding to the first scheduling cycle length for the egress port and the egress port between each two adjacent nodes and the forwarding delay of each node.

3. The method according to claim 2, characterized in that When the time slot relative relationship includes a time slot mapping relationship: The time slot mapping relationship corresponding to the first scheduling cycle length of the egress port and the ingress port includes the egress port information of the previous node, the first sending time slot of the egress port of the previous node, the ingress port information of the next node, the second sending time slot of the ingress port of the next node, and the remaining time from the moment when the end of the first sending time slot of the egress port of the previous node is mapped to the second sending time slot of the ingress port of the next node to the end moment of the second sending time slot of the ingress port of the next node; the first sending time slot of the egress port of the previous node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the egress port of the previous node; the second sending time slot of the ingress port of the next node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the ingress port of the next node; The time slot mapping relationship corresponding to the first scheduling cycle length of the egress port and the egress port includes the previous node egress port information, the third sending time slot of the previous node egress port, the next node egress port information, the fourth sending time slot of the next node egress port, and the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the next node egress port to the end moment of the fourth sending time slot of the next node egress port; the third sending time slot of the previous node egress port refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the previous node egress port; the fourth sending time slot of the next node egress port refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the next node egress port.

4. The method according to claim 3, characterized in that The step of calculating the time slot mapping relationship corresponding to the first scheduling cycle length between the egress port and the ingress port between each two adjacent nodes according to the time slot mapping relationship corresponding to the first scheduling cycle length between the egress port and the ingress port between each two adjacent nodes comprises: For each two adjacent nodes, the offset value between the time when the end of the third sending time slot of the egress port of the previous node arrives at the egress port of the next node and the start time of the scheduling cycle with the first scheduling cycle length of the egress port of the next node is calculated according to the first sending time slot of the egress port of the previous node, the third sending time slot of the egress port of the previous node, the second sending time slot of the ingress port of the next node, the remaining time from the time when the end of the first sending time slot of the egress port of the previous node is mapped to the second sending time slot of the ingress port of the next node to the end time of the second sending time slot of the ingress port of the next node, the first scheduling cycle length and the time slot length, and the forwarding delay; Calculate the fourth sending time slot of the subsequent node egress port according to the offset value and the time slot length; According to the fourth sending time slot of the next node egress port, the offset value and the time slot length, calculate the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the next node egress port to the end moment of the fourth sending time slot of the next node egress port; According to the previous node egress port information, the third sending time slot of the previous node egress port, the next node egress port information, the fourth sending time slot of the next node egress port, and the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the next node egress port to the end moment of the fourth sending time slot of the next node egress port, the time slot mapping relationship between the egress port and the egress port between each two adjacent nodes is obtained.

5. The method according to claim 2, characterized in that: When the relative relationship of the time slots includes the phase difference of the arrangement period: The orchestration cycle phase difference corresponding to the first orchestration cycle length of the egress port and the ingress port includes the egress port information of the previous node, the ingress port information of the next node, and the remaining time from the moment when the end of the orchestration cycle of the egress port of the previous node is mapped to the orchestration cycle of the ingress port of the next node to the end moment of the orchestration cycle of the ingress port of the next node; the orchestration cycle of the egress port of the previous node refers to the orchestration cycle of the egress port of the previous node with the first orchestration cycle length; the orchestration cycle of the ingress port of the next node refers to the orchestration cycle of the ingress port of the next node with the first orchestration cycle length; The time slot mapping relationship between the egress port and the egress port includes the egress port information of the previous node, the third sending time slot of the egress port of the previous node, the egress port information of the next node, the fourth sending time slot of the egress port of the next node, and the remaining time from the moment when the end of the third sending time slot of the egress port of the previous node is mapped to the fourth sending time slot of the egress port of the next node to the end moment of the fourth sending time slot of the egress port of the next node; the third sending time slot of the egress port of the previous node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the egress port of the previous node; the fourth sending time slot of the egress port of the next node refers to the sending time slot in the scheduling cycle with the first scheduling cycle length of the egress port of the next node.

6. The method according to claim 5, characterized in that The step of calculating the time slot mapping relationship between the egress port and the egress port between each two adjacent nodes according to the scheduling cycle phase difference between the egress port and the ingress port between each two adjacent nodes includes: For each two adjacent nodes, the offset value between the time when the end of the third sending time slot of the egress port of the previous node arrives at the egress port of the next node and the start time of the scheduling cycle with the first scheduling cycle length of the egress port of the next node is calculated according to the third sending time slot of the egress port of the previous node, the remaining time from the time when the end of the scheduling cycle of the egress port of the previous node is mapped to the scheduling cycle of the ingress port of the next node to the end time of the scheduling cycle of the ingress port of the next node, the time slot length, the first scheduling cycle length and the forwarding delay; Calculate the fourth sending time slot of the subsequent node egress port according to the offset value and the time slot length; According to the fourth sending time slot of the next node egress port, the offset value and the time slot length, calculate the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the next node egress port to the end moment of the fourth sending time slot of the next node egress port; According to the previous node egress port information, the third sending time slot of the previous node egress port, the next node egress port information, the fourth sending time slot of the next node egress port, and the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the next node egress port to the end moment of the fourth sending time slot of the next node egress port, the time slot mapping relationship between the egress port and the egress port between each two adjacent nodes is obtained.

7. The method according to claim 3 or 5, characterized in that: The reserving time slot resources for each port in the target routing path according to the time slot mapping relationship between the egress ports and the egress ports between each two adjacent nodes and the forwarding delay of each node includes: Obtain the node residence delay budget value of each node; Time slot resources are reserved for each node in the target routing path based on the node residence delay budget value of each node, the forwarding delay of each node, the fourth sending time slot of the subsequent node egress port, and the remaining time from the moment when the end of the third sending time slot of the previous node egress port is mapped to the fourth sending time slot of the subsequent node egress port to the end moment of the fourth sending time slot of the subsequent node egress port.

8. The method according to claim 1, characterized in that The method further comprises: Obtaining a relative relationship of time slots corresponding to first arrangement cycle lengths for an egress port and an ingress port between the current node and the next node; Generate a first notification message including a relative relationship of time slots corresponding to a first scheduling cycle length for an egress port and an ingress port between the current node and a next node; The first notification message is flooded on the network.

9. The method according to claim 8, characterized in that The relative relationship of time slots corresponding to the first scheduling cycle lengths of the egress port and the ingress port between the current node and the next node includes a time slot mapping relationship corresponding to the first scheduling cycle lengths of the egress port and the ingress port between the current node and the next node, or a scheduling cycle phase difference corresponding to the first scheduling cycle lengths of the egress port and the ingress port between the current node and the next node; The generating of the first notification message including the relative relationship of time slots corresponding to the first arrangement cycle length of the egress port and the ingress port between the current node and the next node includes one of the following: Generate a first time slot mapping Sub-TLV including a time slot mapping relationship corresponding to a first arrangement cycle length of an egress port and an ingress port between the current node and a next node, and generate a first notification message according to the first time slot mapping Sub-TLV; Generate a first scheduled cycle phase difference Sub-TLV including a scheduled cycle phase difference corresponding to a first scheduled cycle length for an egress port and an ingress port between the current node and the next node, and generate a first notification message according to the first scheduled cycle phase difference Sub-TLV.

10. The method according to claim 1, characterized in that The method further comprises: Obtaining a relative relationship between a previous node and the current node in time slots corresponding to a first scheduling cycle length for an egress port and an ingress port; Generate a second notification message including a relative relationship of time slots corresponding to the first arrangement cycle length for the egress port and the ingress port between the previous node and the current node; The second notification message is flooded on the network.

11. The method according to claim 10, characterized in that The relative relationship of time slots corresponding to the first scheduling cycle length for the egress port and the ingress port between the previous node and the current node includes a time slot mapping relationship corresponding to the first scheduling cycle length for the egress port and the ingress port between the previous node and the current node, or a scheduling cycle phase difference corresponding to the first scheduling cycle length for the egress port and the ingress port between the previous node and the current node; The generating of the second notification message including the relative relationship of the time slots corresponding to the first arrangement cycle length of the egress port and the ingress port between the previous node and the current node comprises one of the following: Generate a second time slot mapping Sub-TLV including a time slot mapping relationship corresponding to a first arrangement cycle length for an egress port and an ingress port between a previous node and the current node, and generate a second notification message according to the second time slot mapping Sub-TLV; A second scheduled cycle phase difference Sub-TLV is generated, including a scheduled cycle phase difference corresponding to the first scheduled cycle length for the egress port and the ingress port between the previous node and the current node, and a second notification message is generated according to the second scheduled cycle phase difference Sub-TLV.

12. The method according to claim 1, characterized in that The method further comprises: Get the forwarding delay of this node; generating a third notification message including a forwarding delay of the node; The third notification message is flooded on the network.

13. The method according to claim 12, characterized in that The generating of the third notification message including the forwarding delay of the node includes: Generate a forwarding delay Sub-TLV including the forwarding delay of the local node; A third notification message is generated according to the forwarding delay Sub-TLV.

14. The method according to claim 1, characterized in that The method is applied to a network controller, and the method further comprises: Receive a fourth notification message sent by the target node, wherein the fourth notification message includes at least one of the following: A time slot mapping TLV including a time slot mapping relationship between an egress port and an ingress port between two adjacent nodes; An orchestration cycle phase difference TLV including an orchestration cycle phase difference between an egress port and an ingress port of two adjacent nodes; a scheduling capability TLV including the first scheduling cycle length and the time slot length; A forwarding delay TLV including the forwarding delay.

15. A communication device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the time slot resource reservation method as described in any one of claims 1 to 14 when executing the computer program.

16. A computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute the time slot resource reservation method according to any one of claims 1 to 14.

Images