A method and device for scheduling network resources

Abstract

The present application discloses a method and device for scheduling network resources. The specific process of implementing scheduling includes: a first network node receives a message, the message includes network resources that need to be scheduled between multiple network nodes on a multi-hop path, and after the resources are scheduled between the first network node and the second network node, the message is sent to the second network node to trigger the scheduling of network resources between the second network node and the third network node, thereby realizing end-to-end resource scheduling through one message, and realizing end-to-end resource reservation on the multi-hop path.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method and device for scheduling network resources. Background Art

[0002] In the time slotted channel hopping (TSCH) mode, network resources can be divided into two dimensions using time slots and channels. The network resources formed as a unit are called cells. Cells can be determined based on time slot and channel displacement. For example, a cell can be a unit of network bandwidth.

[0003] The 6tisch working group of the Internet Engineering Task Force (IETF) designed the 6top (6TiSCH Operation Sublayer) adaptation layer for the TSCH mode. Two adjacent nodes implement cell addition (ADD), deletion (DELETE) and migration (RELOCATE) by calling the 6P transaction signaling in 6top. However, this method is only applicable to the negotiation and scheduling of network resources between two adjacent nodes within one hop, and cannot be implemented for resource reservation on multi-hop paths. Summary of the invention

[0004] The technical problem to be solved by the embodiments of the present application is to provide a method and device for scheduling network resources to solve the technical problem that resource reservation on a multi-hop path cannot be achieved.

[0005] In a first aspect, an embodiment of the present application provides a method for scheduling network resources, the method comprising: a first network node receives a message, the message comprising an identifier of the first network node, an identifier of a second network node, an identifier of a third network node, first resource information, and second resource information, the first resource information being network resources that need to be scheduled between the first network node and the second network node, and the second resource information being network resources that need to be scheduled between the second network node and the third network node; when the first network node determines that the message contains the identifier of the first network node, the first resource information is obtained, and network resources are scheduled with the second network node according to the first resource information; the first network node sends the message to the second network node, triggering the second network node to schedule network resources with the third network node according to the second resource information. The second network node is the next hop network node of the first network node, and the third network node is the next hop network node of the second network node.

[0006] Using the above method, the first network node receives a message including network resources that need to be scheduled between multiple network nodes on a multi-hop path. After the resources are scheduled between the first network node and the second network node, the message is sent to the second network node to trigger the scheduling of network resources between the second network node and the third network node, thereby realizing end-to-end resource scheduling through one message, and realizing end-to-end resource reservation on the multi-hop path.

[0007] In some possible implementations, the first network node sending a message to the second network node may include: after the first network node determines that the network resource scheduling between the first network node and the second network node is successful, adding a first indication identifier to the message, and sending the message with the first indication identifier added to the second network node, where the first indication identifier is used to indicate that the network resource scheduling between the first network node and the second network node is successful.

[0008] As an implementation manner, if the third network node is an egress node on the message forwarding path, the message may be sent to the third network node and then sent to the network management device by the third network node.

[0009] It can be understood that the first resource information is specifically used to indicate the alternative network resources that need to be scheduled between the first network node and the second network node, and the first indication identifier is also used to indicate the network resources successfully scheduled between the first network node and the second network node. The successfully scheduled network resources can be selected from the alternative network resources.

[0010] In some possible implementations, the network resource scheduling method may also include: after the first network node determines that the network resource scheduling between the first network node and the second network node has failed, adding a second indication identifier to the message, and sending the message with the second indication identifier added to the network management device, the second indication identifier is used to indicate the failure of network resource scheduling between the second network node and the second network node.

[0011] Among them, the message in the embodiment of the present application may be a destination advertisement object (DestinationAdvertisement Object, DAO) message.

[0012] As an example, the identifier of the first network node, the identifier of the second network node, the identifier of the third network node, the first resource information, and the second resource information are all carried in an Option field of the DAO message.

[0013] In specific implementation, the Option field includes a first target option Target Option field, a second Target Option field, a third Target Option field, a first scheduling reservation option Schedule Reservation Option field, and a second Schedule Reservation Option field, wherein the first Schedule Reservation Option field is located between the first Target Option field and the second Target Option field, and the second Schedule Reservation Option field is located between the second Target Option field and the third Target Option field; the first Target Option field carries an identifier of the first network node, the second Target Option field carries an identifier of the second network node, the third Target Option field carries an identifier of the third network node, the first Schedule Reservation Option field carries first resource information, and the second Schedule Reservation Option field carries second resource information.

[0014] In the second aspect, the embodiment of the present application further provides a network node, which is a first network node, and includes: a receiving unit, a scheduling unit, and a first sending unit. The receiving unit is used to receive a message, the message includes an identifier of the first network node, an identifier of the second network node, an identifier of the third network node, first resource information, and second resource information, the first resource information is the network resource that needs to be scheduled between the first network node and the second network node, and the second resource information is the network resource that needs to be scheduled between the second network node and the third network node; the scheduling unit is used to obtain the first resource information when the first network node determines that the message contains the identifier of the first network node, and schedule the network resource with the second network node according to the first resource information; the first sending unit is used to send a message to the second network node, triggering the second network node to schedule the network resource with the third network node according to the second resource information.

[0015] In some possible implementations, the above-mentioned first sending unit may include: an adding subunit, used to add a first indication identifier to a message after the first network node determines that the network resource scheduling between the first network node and the second network node is successful; a sending subunit, used to send the message with the first indication identifier added to the second network node, and the first indication identifier is used to indicate that the network resource scheduling between the first network node and the second network node is successful.

[0016] As an implementation manner, if the third network node is an egress node on the message forwarding path, the message is sent to the third network node and then sent to the network management device by the third network node.

[0017] Among them, the first resource information is specifically used to indicate the alternative network resources that need to be scheduled between the first network node and the second network node, and the first indication identifier is also used to indicate the network resources that are successfully scheduled between the first network node and the second network node. The successfully scheduled network resources are selected from the alternative network resources.

[0018] In a specific implementation, the network node may also include: a second sending unit, used to add a second indication identifier to a message after determining that the network resource scheduling between the first network node and the second network node has failed, and send the message with the second indication identifier added to the network management device, wherein the second indication identifier is used to indicate the failure of the network resource scheduling between the second network node and the second network node.

[0019] Among them, the message in the embodiment of the present application can be a destination announcement object DAO message.

[0020] In an example, the identifier of the first network node, the identifier of the second network node, the identifier of the third network node, the first resource information, and the second resource information are all carried in an Option field of the DAO message.

[0021] In specific implementation, the Option field includes a first target option Target Option field, a second Target Option field, a third Target Option field and a first scheduling reservation option Schedule Reservation Option field and a second Schedule Reservation Option field, wherein the first Schedule Reservation Option field is located between the first Target Option field and the second Target Option field, and the second Schedule Reservation Option field is located between the second Target Option field and the third Target Option field; the first Target Option field carries an identifier of the first network node, the second Target Option field carries an identifier of the second network node, the third Target Option field carries an identifier of the third network node, the first Schedule Reservation Option field carries first resource information, and the second Schedule Reservation Option field carries second resource information.

[0022] The above is an introduction to the network node provided in the embodiment of the present application. For the specific implementation method, please refer to the description in the embodiment of the scheduling method of network resources provided in the first aspect above. The effect achieved is consistent with the above method embodiment and will not be repeated here.

[0023] In a third aspect, an embodiment of the present application further provides a network node, comprising at least one connected processor and memory, wherein the memory is used to store program code, and the processor is used to call the program code in the memory to execute the network resource scheduling method provided in the first aspect above.

[0024] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, comprising instructions, which, when executed on a computer, enables the computer to execute the method for scheduling network resources provided in the first aspect above.

[0025] In a fifth aspect, an embodiment of the present application further provides a computer program product comprising instructions, which, when executed on a computer, enables the computer to execute the method for scheduling network resources provided in the first aspect above. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the present application. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0027] Figure 1 A schematic diagram of a network system framework involved in an application scenario in an embodiment of the present application;

[0028] Figure 2 A flowchart of a method for scheduling network resources provided in an embodiment of the present application;

[0029] Figure 3 A schematic diagram of the format of a DAO message provided in an embodiment of the present application;

[0030] Figure 4 A schematic diagram of the format of a Schedule Reservation Option field provided in an embodiment of the present application;

[0031] Figure 5 A schematic diagram of the format of a Target Option field provided in an embodiment of the present application;

[0032] Figure 6 This is a schematic diagram of the process of 6P transaction signaling negotiation scheduling cell in an embodiment of the present application;

[0033] Figure 7 A schematic diagram of the format of a Reservation Confirmation Option field provided in an embodiment of the present application;

[0034] Figure 8 A schematic diagram of the format of a DAO-ACK message provided in an embodiment of the present application;

[0035] Fig. 9 A schematic diagram of the structure of a network node provided in an embodiment of the present application;

[0036] Fig.10 A schematic diagram of the structure of a network node provided in an embodiment of the present application. DETAILED DESCRIPTION

[0037] Generally, in order to efficiently and orderly send and receive messages between network nodes, it is necessary to configure network resources for each network node on the message sending and receiving path. As long as the network resources are scheduled reasonably, the network nodes can communicate using different channels in the same time slot without interfering with each other.

[0038] It can be understood that the 6tisch working group defines a scheduling equation (Scheduling Function) to schedule network resources in the TSCH mode. Specifically, it can dynamically schedule cells between two adjacent network nodes according to the number of reserved cells (SCHEDULED CELLS), the number of cells required by network traffic (REQUIRED CELLS), and the SFXTHRESH threshold between two adjacent network nodes. The number of actually used cells between adjacent network nodes is denoted as USEDCELLS. The over-provisioning parameter is denoted as OVER PROVISION. Among them, REQUIRED CELLS = USED CELLS + OVERPROVISION. Specifically, the cell scheduling strategy between two adjacent network nodes can be as follows: If REQUIRED CELLS < (SCHEDULED CELLS - SFXTHRESH), it means that the number of reserved cells is too large and cells need to be deleted, then one or more cells are deleted; if (SCHEDULED CELLS - SFXTHRESH) <= REQUIRED CELLS <= SCHEDULEDCELLS, it means that the number of reserved cells is appropriate and no increase or decrease is made; if SCHEDULED CELLS < REQUIRED CELLS, it means that the number of reserved cells is too small and cells need to be added, then one or more cells are added. After the above decisions are made, the two adjacent network nodes can directly configure cells by calling the 6P transaction signaling of the 6top adaptation layer.

[0039] However, in some application scenarios, it is required that the message must reach the destination from the source within a certain determined time. For example, in automatic control, the input signal must reach the controller within the closed-loop control cycle. Otherwise, it is very likely that the control will be in an unstable state. However, the method of configuring cells through independent negotiation scheduling between two adjacent network nodes (also called one hop) can only ensure the effective sending and receiving of messages between two adjacent network nodes within each hop. For a path including multiple hops, the sending and receiving times of the message at each network node on this path cannot be centrally scheduled and controlled. As a result, it may cause each network node on this path to be unable to send and receive messages according to the specified time, and it is difficult to ensure the message sending and receiving from the source to the destination on this path with deterministic delay. That is to say, the above scheme of independent negotiation scheduling between two adjacent nodes within one hop for cell configuration cannot be applied to the scheduling of cells on a path including multiple hops. Even if the complete path is decomposed into multiple independent single-hop processes for processing, it cannot ensure the centralized scheduling of cells from the source to the destination.

[0040] Based on this, in order to solve the above technical problems, the embodiment of the present application provides a method for scheduling network resources, by sending a message to each network node on the message forwarding path, initiating centralized scheduling of network resources on the message forwarding path, for each hop on the message forwarding path, the network node receiving the message can obtain the target resource scheduling information between itself and the next hop network node from the message, at this time, the network node can negotiate and schedule network resources with the next hop network node according to the obtained target resource scheduling information, when the negotiation and scheduling of the network resources of this hop is successful, the network node sends a message to the next hop network node; the next hop network node completes the negotiation and scheduling of the network resources of this hop according to the above method, and so on, until all nodes on the message forwarding path complete the negotiation and scheduling of network resources. The above message can be a DAO message. It can be seen that the network resource scheduling method provided in the embodiment of the present application, by uniformly sending messages (such as DAO messages) to each network node on the message forwarding path, enables the network resources that need to be scheduled between each pair of adjacent network nodes on the multi-hop path to be centrally scheduled, and overcomes the problem that the centralized scheduling control of network resources on the path including multiple hops cannot be met by performing independent network resource scheduling for each hop, thereby resulting in the inability to send and receive messages on the path according to the specified time, thereby ensuring that the message from the source to the destination on the multi-hop path can maintain a deterministic delay.

[0041] It is understandable that the routing protocol used in the embodiment of the present application is the IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) (RFC6550). The DAO message is defined in RPL. The DAO is a unicast message used by the child network node to send path information to the parent network node or edge gateway to build a downlink route. Based on this, in the embodiment of the present application, a DAO message (Scheduling DAO, S-DAO) about scheduling is sent in reverse from the parent network node or edge gateway, and is received by each child network node along the message forwarding path.

[0042] For example, one of the scenarios of the embodiments of the present application may be applied to Figure 1In the network topology of the TSCH mode shown in FIG. 1 , it can be understood that the network topology of the TSCH mode is a destination directed acyclic graph (DODAG), and the root network node of the DODAG can be a border router (BR). The BR can be connected to a local network management device, and the BR can also be connected to an external network and an external network management device through a router. The BRs can be connected to each other through a subnet backbone to expand the coverage of the network.

[0043] In specific implementation, the local network management device or the external network management device can maintain the network resource database and formulate a scheduling plan for network resources. After the edge gateway is networked, it can collect network information including the network resource scheduling plan. After the edge gateway receives the network resource scheduling plan, the edge gateway is responsible for sending the network resource scheduling plan to each sub-network node to realize the centralized management and scheduling of the network resources of the network topology.

[0044] As an example, Figure 1 Taking the network topology structure shown as an example, assuming that the DAO message received and sent by BR is for the message forwarding path: network node A→network node B→network node C, then the specific scheme may be: network node A receives the DAO message, obtains the target resource scheduling information 1 carried in the DAO message for indicating the cell that needs to be scheduled between network node A and the next hop network node (i.e., network node B), at this time, network node A negotiates the scheduling of the cell with network node B according to the target scheduling information 1 (for example, it may be negotiated through 6Ptransaction signaling and reply signaling); if the negotiated scheduling of the cell is successful, network node A sends the DAO message to network node B. Network node B receives the DAO message, obtains the target resource scheduling information 2 carried in the DAO message for indicating the cell that needs to be scheduled between network node B and the next hop network node (i.e., network node C), at this time, network node B negotiates the scheduling of the cell with network node C according to the target scheduling information 2; if the negotiated scheduling of the cell is successful, network node B sends the DAO message to network node C. Network node C receives the DAO message and learns that it is the egress node. At this point, the scheduling of network resources on the message forwarding path is completed.

[0045] Therefore, in the embodiment of the present application, a DAO message can be sent to each network node on the message forwarding path, so that the network resources that need to be scheduled between each pair of adjacent network nodes on the multi-hop path can be centrally scheduled, thereby enabling the reservation of network resources from the source end to the destination end on the multi-hop path, which is conducive to achieving deterministic delay of message forwarding. In the embodiment of the present application, a multi-hop path refers to a forwarding path that includes at least one intermediate node between the source node and the destination node of the forwarding path.

[0046] It can be understood that the above scenario is only an example scenario provided by the embodiment of the present application, and the embodiment of the present application is not limited to this scenario.

[0047] The specific implementation of the method for scheduling network resources in the embodiment of the present application is described in detail below with reference to the accompanying drawings through embodiments.

[0048] See also Figure 2 , Figure 2 A schematic diagram of a flow chart of a method for scheduling network resources in an embodiment of the present application is shown. The method may specifically include:

[0049] Step 201, a first network node receives a message, which includes an identifier of the first network node, an identifier of a second network node, an identifier of a third network node, first resource information, and second resource information, wherein the first resource information is a network resource that needs to be scheduled between the first network node and the second network node, and the second resource information is a network resource that needs to be scheduled between the second network node and the third network node.

[0050] It is understandable that the message received by the first network node may be a DAO message for scheduling. In order to make this embodiment more vivid, the DAO message is used as an example for explanation in this embodiment. The DAO message may be sent by a network management device (e.g., an edge gateway) and transmitted along a message forwarding path, which includes at least a first network node, a second network node, and a third network node.

[0051] It can be understood that the first network node can be any network node except the egress node in the message forwarding path, and in the message forwarding path, the next hop node of the first network node is the second network node, and the next hop node of the second network node is the third network node. That is, the message forwarding path can be: ... → first network node → second network node → third network node → ..., wherein the first network node can be either an ingress node (Ingress) or an intermediate node; the third network node can be either an egress node or an intermediate node.

[0052] In specific implementation, the local network management device or external network management device formulates and sends to the BR a centralized scheduling strategy for the network resources of this message forwarding path, and the BR encapsulates the centralized scheduling strategy in a DAO message, and sends the DAO message to each network node on the message forwarding path through the entry node along the message forwarding path, so that the network nodes can complete the configuration of network resources in sequence hop by hop. If some nodes before the message forwarding path are included between the BR and the entry node, then these nodes are only responsible for forwarding the DAO message to the entry node for this resource reservation, and do not perform the operations performed by the first network node and the second network node.

[0053] It should be noted that the above-mentioned BR sending the DAO message is only an exemplary description in this embodiment. In the embodiment of the present application, as long as the network management device can send DAO to realize centralized scheduling of network resources, it can send DAO messages to each network node on the message forwarding path.

[0054] It is understood that the format of the DAO message can be found, for example, Figure 3 As shown, the fields included and the values ​​and meanings of each field are explained as follows:

[0055] Type: used to indicate the type of the message. In this embodiment, Type = 155, indicating that the type of the message is a control message;

[0056] Code: used to indicate that the message is a DAO message; when Code = 0x04, it indicates that the message is an encrypted DAO message, and when Code = 0x84, it indicates that the message is an unencrypted DAO message. In actual applications, the Code can be assigned according to the Internet Assigned Numbers Authority (IANA) standard and can be any value except 0x00, 0x01, 0x02, 0x03, 0x80, 0x81, 0x82, 0x83, and 0x8A;

[0057] Checksum: used during encryption and calculated according to RFC4443 standard;

[0058] Security: Field used when DAO messages are encrypted;

[0059] RPL Instance ID: can be the ID of an 8-bit RPL instance. In the embodiment of the present application, this ID can be the ID of an edge gateway, which corresponds one-to-one with the edge gateway;

[0060] K: whether the DAO message requires ACK, which can be set to 1 in the embodiment of the present application;

[0061] D: Whether the DAO message contains the DODAG ID, which can be set to 0 in the embodiment of the present application;

[0062] DAO Sequence: sequence number. Each time the edge gateway sends a DAO message, the sequence number increases by 1. It is used to identify the correspondence between the DAO message and the reply message of the DAO message (that is, the DAO-ACK message). The DAO message and the corresponding DAO-ACK message use the same sequence number, so it can be identified which DAO message the DAO-ACK message is a reply message to.

[0063] Options: A sequence of options in a DAO message.

[0064] It is understandable that the Options field of the DAO message may include an information sequence, which includes resource scheduling information corresponding to each network node on the message forwarding path, which is used to indicate the network resources that need to be scheduled between each hop node and the next hop node of each hop node on the message forwarding path. For example: the information sequence may include first resource information and second resource information, wherein the first resource information may carry the network resources that need to be scheduled between the first network node and the second network node, and the second resource information may carry the network resources that need to be scheduled between the second network node and the third network node. In addition, the information sequence in the Options field of the DAO message may also include the identifiers of each network node on the message forwarding path, for example: it may include the identifier of the first network node, the identifier of the second network node, and the identifier of the third network node. For a detailed introduction, please refer to step 202.

[0065] Step 202: When the first network node determines that the message includes the identifier of the first network node, it obtains first resource information and schedules network resources with the second network node according to the first resource information.

[0066] It is understandable that the message received by the first network node includes the identifiers of each network node on the forwarding path and the network resources that need to be scheduled between two adjacent network nodes. Therefore, if the first network node finds its own identifier in the message, it means that the first network node is a node on the forwarding path.

[0067] The first network node searches for the first resource information based on the information sequence carried in the DAO message, wherein the information sequence is used to indicate the network resources that need to be scheduled between each hop node and the next hop node of each hop node on the message forwarding path, and the first resource information is used to indicate the network resources that need to be scheduled between the first network node and the second network node.

[0068] In specific implementation, the information sequence may be carried in the Options field of the DAO message, and each resource information in the information sequence may be carried in the Schedule Reservation Option field of the Options field. The format of the Schedule Reservation Option field is as follows: Figure 4 As shown, the fields included and the values ​​and meanings of each field are explained as follows:

[0069] Command ID: used to indicate the scheduling operation corresponding to each network node. The specific values ​​can be: 1, 2 and 3. When the Command ID = 1, it means that the scheduling operation to be executed is to add (Add) the cell of the network node; when the Command ID = 2, it means that the scheduling operation to be executed is to delete (Delete) the cell of the network node; when the Command ID = 3, it means that the scheduling operation to be executed is to relocate (Relocate) the cell of the network node;

[0070] Slot Frame ID: used to identify the slot frame used when performing a 6P transaction, that is, used to indicate the timing of the negotiation schedule;

[0071] Cell Options: used to identify the cell type to be scheduled. The specific values ​​can be: TX, RX, SHARED, etc. When Cell Options = TX, it means that the cell that sends messages needs to be scheduled; when Cell Options = RX, it means that the cell that receives messages needs to be scheduled; when Cell Options = SHARED, it means that the cell that can both send and receive messages needs to be scheduled;

[0072] Num Cells: used to indicate the number of cells that need to be added / deleted / migrated;

[0073] Candidate Cell List: refers to the candidate cell list, where the number of cells in the candidate cell list is greater than or equal to the number of cells in Num Cells;

[0074] Relocate Cell List: Relocate cell list, which exists only when the Command ID indicates that the scheduling operation is to relocate cells. The number of cells in the relocate cell list is equal to Num Cells.

[0075] It is understandable that, except for the egress node, all network nodes on the message forwarding path can find the corresponding resource information in the information sequence of the DAO message, and when scheduling network resources for each network node, it is necessary to find the resource information that uniquely corresponds to it from the multiple resource information in the DAO message, and record it as the target resource information of the network node. In order to allow each network node on the message forwarding path to find the target resource information corresponding to itself, the Options field of the DAO message can also include: the identifier of each network node on the message forwarding path.

[0076] In specific implementation, the identifier of each network node may be carried in the target option field of the Options field of the DAO message. The format of the target option field is as follows: Figure 5 As shown, the fields included and the values ​​and meanings of each field are explained as follows:

[0077] Type: an identifier indicating that the field is a target option field; in this embodiment, Type can be 5;

[0078] Option Length: used to indicate the length of the target option Target Option field;

[0079] Prefix length: used to indicate the length of the IPv6 prefix; in the embodiment of the present application, it can be 128, indicating the length of a 128-bit IPv6 address;

[0080] Target Prefix: In the embodiment of the present application, it is the 128-bit IPv6 address of the network node, which is used to use the IPv6 address as the identifier of the network node.

[0081] In the specific implementation, the arrangement order of each resource information and the identifier of each network node in the DAO message received on each network node on the message forwarding path needs to take into account two conditions: first, each network node can find the corresponding target resource information from the received DAO; second, each network node can determine the next-hop network node from the received DAO, thereby determining the network resources that need to be negotiated and scheduled and the target network node to send the DAO after the negotiation and scheduling are completed.

[0082] In some possible implementations, the arrangement order of each resource information and the identifier of each network node in the DAO message may specifically be: the identifiers of each network node are arranged according to the order of each network node on the message forwarding path, and the resource information for indicating the network resources used for forwarding messages between two adjacent network nodes is located between the identifiers of the two adjacent network nodes. For example, it may be: the Option field of the DAO message includes a target option Target Option field and a scheduling reservation option Schedule Reservation Option field, wherein a target option TargetOption field carries the identifier of a network node on the message path, and a scheduling reservation option ScheduleReservation Option field carries the resource information for indicating the network resources that need to be scheduled between a pair of adjacent network nodes.

[0083] Then, for the first network node and the second network node adjacent to each other on the message forwarding path, in the DAO message, the identifier of the first network node and the identifier of the second network node are arranged in the order of the first network node and the second network node on the message forwarding path, and the first resource information found by the first network node is located between the identifier of the first network node and the identifier of the second network node. For example, the Option field of the DAO message may include at least two target option Target Option fields and at least one scheduling reservation option Schedule Reservation Option field, wherein the first target option Target Option field carries the identifier of the first network node, the second target option Target Option field carries the identifier of the second network node, the target scheduling reservation option Schedule Reservation Option field carries the first resource information, and the target scheduling scheduling reservation option Schedule Reservation Option field is located between the first target option Target Option field and the second target option Target Option field, then the DAO may be: ..., the first Target Option field, the target Schedule Reservation Option field, the second Target Option field, ....

[0084] In this way, for the first network node, the second network node and the third network node adjacent to each other on the message forwarding path, the Option field in the message includes the first Target Option field, the second Target Option field, the third Target Option field and the first Schedule Reservation Option field, and the second Schedule Reservation Option field, wherein the first Target Option field carries the identifier of the first network node, the second Target Option field carries the identifier of the second network node, the third Target Option field carries the identifier of the third network node, the first Schedule Reservation Option field carries the first resource information, and the second Schedule Reservation Option field carries the second resource information; then, the DAO can be:..., the first Target Option field, the first Schedule Reservation Option field, the second Target Option field, the second Schedule Reservation Option field, the third Target Option field,...

[0085] For example, Figure 1 Taking the message forwarding path in (i.e., network node A→network node B→network node C) as an example, the specific form of the DAO message is explained. Among them, the identifier of network node A is carried in the target option Target Option A field, the identifier of network node B is carried in the target option Target Option B field, the identifier of network node C is carried in the target option Target Option C field, the first resource information corresponding to network node A is carried in the scheduling reservation option Schedule Reservation Option 1 field, and the second resource information corresponding to network node B is carried in the scheduling reservation option Schedule Reservation Option 2 field. Then, the DAO message received by the network node on the message forwarding path is shown in Table 1 below, specifically: target option Target Option A field, scheduling reservation option Schedule Reservation Option 1 field, target option Target Option B field, scheduling reservation option Schedule Reservation Option 2 field, target option Target Option C field.

[0086] Table 1 Information sequence in DAO message

[0087]

[0088] At this time, after the first network node receives the DAO message, a possible specific implementation of step 202 may be: the first network node searches the DAO message for a field carrying the first network node identifier, and parses the first resource information of the first network node from a field after the first network node identifier field. In addition, the first network node may also search the DAO message for a field after the field carrying the first resource information of the first network node, and search the field for the identifier of the next-hop network node of the first network node (referred to as the second network node) to further determine the second network node.

[0089] For example, assuming that network node A is the first network node, then when network node A receives the DAO message shown in Table 1, it can find the target option Target Option A field carrying the identifier of network node A, and obtain the first resource information corresponding to network node A from the next scheduling reservation option Schedule Reservation Option 1 field of the field. Moreover, network node A can also learn the next-hop network node B (referred to as the second network node) from the next field of the field where the first resource information is located, that is, determine which network node the target resource scheduling information is for the cell that needs to be scheduled between itself and.

[0090] The first network node negotiates and schedules network resources with the second network node according to the first resource information.

[0091] It can be understood that, based on the first resource information obtained, the first network node can negotiate and schedule network resources with its second network node. According to the 6top adaptation layer designed by the 6tisch working group of the Internet Engineering Task Force (IETF) for the TSCH mode, the scheduling of network resources can be implemented by the 6top adaptation layer. In specific implementation, two adjacent network nodes implement the addition (Add), deletion (Delete) and migration (Relocate) of network resources by calling the 6Ptransaction signaling in the 6top adaptation layer.

[0092] The negotiation scheduling process can be found in Figure 6The negotiation process shown may specifically include: the first network node sends a 6P transaction signaling to the second network node; after receiving the 6P transaction signaling, the second network node generates a 6P transaction reply signaling, and feeds the 6P transaction reply signaling back to the first network node, completing the network resource scheduling between the first network node and the second network node. Taking the increase of network resources as an example, Figure 6 As shown, network node A initiates the Add signaling in the 6P transaction signaling to network node B to implement the scheduling of adding two network resources between network node A and network node B. In one case, when network node A does not receive the reply signaling of network node B to the Add signaling within the preset time, network node A will terminate the scheduling request; in another case, when network node A receives the reply signaling of network node B to the Add signaling within the preset time, network node A and network node B will send and receive messages according to the configured network resources.

[0093] Among them, the Add signaling in the 6P transaction signaling may include: Type (Type) is used to indicate the message type, which is a request signaling for initiating scheduling; Code (Code) is used to indicate the specific operation of this scheduling, which may include Add, Delete and Relocate; Sequence number (SeqNum) is used to determine the correspondence between the sent message and the reply message; NumCells is used to indicate the number of network resources corresponding to the operation indicated in the Code; the alternative cell list (Cell List) is used to show the specific network resources that can be used as alternatives. Each network resource can be represented by a two-dimensional coordinate, one dimension represents the time slot of the network resource, and the other dimension represents the channel of the network resource. For example, (1,2), (2,2) and (3,5) are three different network resource identifiers. Similarly, the reply signaling of a 6P transaction may include: Type, which is used to indicate the message type, which is a reply signaling; Code, which is used to indicate the result of the scheduling operation, which may include success or failure. When Code = 0, it indicates that the network resource scheduling is successful; otherwise, when Code = 1, it indicates that the network resource scheduling fails; Sequence number (SeqNum) is used to determine the correspondence between the sent message and the reply message; Cell list (Cell List) is used to show the configured network resources after the scheduling is completed, which may include part or all of the network resources in the alternative network resource list, that is, the number of cells in the alternative cell list of the request signaling must be greater than or equal to the number of cells in the cell list of the reply signaling.

[0094] It should be noted that, during the negotiation and scheduling process, all parameters in the 6P transaction signaling can be obtained from the DAO message. For example, the candidate cell list (Cell List) in the 6P transaction signaling can be obtained from the Schedule Reservation Option field of the DAO message.

[0095] It can be understood that if Code=0 in the reply signaling of the 6P transaction, it means that the negotiation scheduling between the first network node and the second network node is successful, and the cell scheduling of the next-hop network node can be performed; otherwise, if Code=1 in the reply signaling of the 6P transaction, it means that the negotiation scheduling between the first network node and the second network node has failed, and the centralized scheduling of the network nodes on the message forwarding path is deemed to be terminated, and the subsequent network nodes will not be scheduled.

[0096] Step 203: If the negotiation and scheduling of the network resources is successful, the first network node sends the message to the second network node, triggering the second network node to schedule the network resources with the third network node according to the second resource information.

[0097] It can be understood that if the negotiation scheduling between the first network node and the second network node is successful, then the first network node sends the message to the second network node, and the operation performed by the second network node after receiving the message can refer to the steps performed by the first network node after receiving the message in step 202, which will not be repeated here.

[0098] As a possible implementation method, if the first network node receives a reply signaling of the 6Ptransaction fed back by the second network node, indicating that the negotiated scheduling of network resources between the first network node and the second network node is successful, then the first network node can send a DAO message to the second network node adjacent to it, so that the second network node can schedule network resources in accordance with the method provided in the embodiment of the present application.

[0099] In a specific implementation, after the negotiation and scheduling of the network resources between the first network node and the second network node is successful, the first network node may add a first indication identifier to a message in order to clarify the network resources that are successfully scheduled, and send the message with the first indication identifier added to the second network node. The first indication identifier is used to indicate that the scheduling of the network resources between the first network node and the second network node is successful.

[0100] As an example, after the negotiation scheduling is successful, the first resource information in the DAO message can be replaced with target scheduling confirmation information, which is recorded as the first indication identifier, wherein the target scheduling confirmation information is used to indicate that the network resources between the first network node and the second network node have been successfully scheduled, and the target scheduling confirmation information can include a list of successfully scheduled network resources. It can be understood that the successfully scheduled network resources are selected from the alternative network resources.

[0101] It can be understood that if the first resource information is carried in the ScheduleReservation Option field in the information sequence, then the target scheduling confirmation information as the first indication identifier can be correspondingly carried in the first reservation confirmation option Reservation Confirmation Option field, and the Code in the first reservation confirmation option Reservation Confirmation Option field can be 0, indicating that the negotiation scheduling result is successful. The format of the reservation confirmation option Reservation Confirmation Option field is as follows: Figure 7 As shown, the fields included and the values ​​and meanings of each field are explained as follows:

[0102] Code: used to indicate the code returned by the 6P transaction, indicating success / failure. When Code=0, the target scheduling confirmation information can be carried in the first reservation confirmation option field, indicating that the 6P transaction negotiation scheduling is successful; otherwise, when Code=1, it means that the 6P transaction negotiation scheduling fails, and the target scheduling failure information can be carried in the second reservation confirmation option field;

[0103] Success Cell List: A list of cells that represent successful scheduling negotiations.

[0104] For the first network node, the first resource information obtained according to step 202 carries information for indicating the scheduling candidate network resources, and after the negotiation scheduling succeeds, the target scheduling confirmation information carries information for indicating the scheduling successfully network resources, and the scheduling successfully network resources are selected from the scheduling candidate network resources, and can be part or all of the cells in the scheduling candidate network resources. As an example, the scheduling candidate network resources information can be carried in the candidate cell list Candidate Cell List field in the scheduling reservation option Schedule Reservation Option field of the information sequence, and the scheduling successfully network resources information can be carried in the success cell list Success CellList in the first reservation confirmation option Reservation Confirmation Option field of the DAO message.

[0105] In specific implementation, after receiving the DAO message, the second network node may refer to the first network node to schedule network resources according to the network resource scheduling scheme provided in the embodiment of the present application, and so on, until all network nodes on the message forwarding path successfully schedule the cell.

[0106] As an example, when the egress node receives the message (for example, a DAO message), it indicates that each hop on the message forwarding path has successfully negotiated scheduling, and other network nodes on the message forwarding path except the egress node have correspondingly added a first indication identifier, for example: all first resource information in the DAO message is replaced with scheduling confirmation information, then the egress node on the message forwarding path can encapsulate the scheduling confirmation information in the DAO message in a DAO-ACK message, and feed it back to the edge gateway via unicast.

[0107] It is understood that the format of the DAO-ACK message is as follows Figure 8 As shown, the fields included and the values ​​and meanings of each field are explained as follows:

[0108] Type: used to indicate the type of message. In this embodiment, Type = 155, indicating that the type of the message is a control message;

[0109] Code: used to indicate that the message is a DAO-ACK message. When Code = 0x05, it indicates that the message is an unencrypted DAO-ACK message. When Code = 0x85, it indicates that the message is an encrypted S-DAO-ACK message.

[0110] Security, RPL Instance ID, D, Reserved, DAO Sequence, Options can be found in Figure 3 And an explanation of DAO.

[0111] As another possible implementation method, if the first network node receives a reply signaling of a 6Ptransaction fed back by the second network node, indicating that the negotiation scheduling of network resources between the first network node and the second network node has failed, then the first network node may add a second indication identifier to the message, for example: the first resource information in the DAO message may be replaced with the target scheduling failure information, and the target scheduling failure information may be encapsulated in a DAO-NACK message and fed back to the edge gateway.

[0112] It can be understood that if the first resource information is carried in the ScheduleReservation Option field of the DAO message, then the target scheduling failure information as the second indication identifier can be correspondingly carried in the second reservation confirmation option Reservation Confirmation Option field of the DAO-NACK message, and the Code in the second reservation confirmation option Reservation Confirmation Option field can be 1, which is used to indicate that the negotiation scheduling result is a failure. The format of the reservation confirmation option Reservation Confirmation Option field can be as follows: Figure 7 and corresponding explanations.

[0113] In specific implementation, when the first network node receives a DAO-NACK message indicating a failure in the negotiation scheduling, the second reservation confirmation option Reservation Confirmation Option field carrying the coordination scheduling failure identifier can be used to replace the scheduling reservation option Schedule Reservation Option field carrying the target resource scheduling information. At this time, the first network node can encapsulate the second reservation confirmation option Reservation Confirmation Option field carrying the target scheduling failure information in the DAO-NACK message and feed it back to the edge gateway via unicast. Among them, the format and related explanation of the DAO-NACK message refer to the above-mentioned format of the DAO-ACK message and its related explanation, which will not be repeated here.

[0114] It can be seen that the method for scheduling network resources provided by the embodiment of the present application initiates centralized scheduling of network resources on the message forwarding path by sending, for example, a DAO message to each network node on the message forwarding path. For each hop on the message forwarding path, the network resources between the hop and the next hop network node can be negotiated and scheduled according to the first resource information corresponding to the DAO message, until the negotiated scheduling of network resources on the message forwarding path is completed. In this way, by sending DAO messages to each network node on the message forwarding path, the network resources that need to be scheduled between each pair of adjacent network nodes on the multi-hop path can be centrally scheduled, thereby realizing end-to-end resource scheduling on the multi-hop path.

[0115] It should be noted that in some application scenarios of message forwarding, it is necessary to ensure that the time for forwarding the message from the source end to the destination end meets the deterministic delay condition, that is, the message must reach the destination end before a certain time. In the network resource scheduling method provided in the embodiment of the present application, the first resource information between the first network node and the second network node and the second resource information between the second network node and the third network node are centrally configured in the same message, and there may be a specific association relationship. In this way, if the timing of network resources between each network node can be strictly controlled, it can be ensured that each network node on the message forwarding path uses the scheduled network resources to forward the message with a fixed delay, thereby ensuring that after scheduling using the network resource scheduling method provided in the embodiment of the present application, each network node can complete the end-to-end forwarding of the message within the "deterministic delay".

[0116] In addition, the network resource scheduling method provided in the embodiment of the present application is not only suitable for centralized scheduling of network resources that need to be scheduled between each pair of adjacent network nodes on a multi-hop path; and the scheduling method does not have too high requirements on the processing capabilities of the network nodes and the stability of the network topology structure. Since the network nodes in the network topology structure under the TSCH mode do not have strong processing capabilities and do not have a stable network topology structure, the network resource scheduling method provided in the embodiment of the present application is very close to the network topology structure under the TSCH mode. The demand for network resource scheduling schemes is a preferred scheme for centralized scheduling of network resources between each pair of adjacent network nodes on the message forwarding path in the network topology structure under the TSCH mode.

[0117] After introducing the scheduling method of network resources provided by the embodiment of the present application, two examples will be used below to clearly and completely illustrate the application of the embodiment of the present application in two scenarios: successful scheduling and failed scheduling.

[0118] Example 1: Figure 1Taking the message forwarding path in the scenario shown (ie, network node A→network node B→network node C) as an example, the specific process of the centralized scheduling method of the network bandwidth resource cell may include:

[0119] Part 1: Scheduling of cells between network nodes A and B:

[0120] S11, BR sends a DAO message carrying the information sequence shown in Table 1 to network node A;

[0121] S12, the network node A finds the identifier of the network node A carried in the first target option Target Option A field from the received DAO message;

[0122] S13, network node A obtains the Schedule Reservation Option 1 field and the Target Option B field after the Target Option A field from the DAO message, and parses the first resource information from the Schedule Reservation Option 1 field; and determines from the Target Option B field that the next hop network node is network node B;

[0123] S14, network node A sends 6P transaction signaling to network node B according to the first resource information;

[0124] S15, the network node B feeds back a reply signaling of the 6P transaction, and the reply signaling indicates that the negotiation scheduling is successful;

[0125] S16, network node A replaces the ScheduleReservation Option 1 field carrying the first resource information in the DAO message with the ReservationConfirmation Option 1 field carrying the target scheduling confirmation information 1, wherein the Reservation Confirmation Option 1 field includes Code=0, indicating that the negotiation scheduling result is successful (Success), forming a DAO message as shown in Table 2 below;

[0126] Table 2 Information sequence in DAO message

[0127]

[0128] S17, network node A sends a DAO message carrying the information sequence shown in Table 2 to network node B.

[0129] The second part is the scheduling of cells between network nodes B and C:

[0130] S21, the network node B finds the target option Target Option B field carrying the network node B identifier from the DAO message received from the network node A;

[0131] S22, the network node B obtains the Schedule Reservation Option 2 field and the Target Option C field after the Target Option B field from the S-DAO message, and parses the second resource information from the Schedule Reservation Option 2 field; and determines from the Target Option C field that the next hop network node is the network node C;

[0132] S23, the network node B sends a 6P transaction signaling to the network node C according to the second resource information;

[0133] S24, the network node C feeds back a reply signaling of the 6P transaction, and the reply signaling indicates that the negotiation scheduling is successful;

[0134] S25, the network node B replaces the ScheduleReservation Option 2 field carrying the second resource information in the S-DAO message with the ReservationConfirmation Option 2 field carrying the target scheduling confirmation information 2, wherein the Reservation Confirmation Option 2 field includes Code=0, indicating that the negotiation scheduling result is successful (Success), forming a DAO message as shown in Table 3 below;

[0135] S26, network node B sends a DAO message carrying the information sequence shown in Table 3 to network node C.

[0136] Part 3: Operations performed by network node C:

[0137] S31, the network node C finds the identifier of the network node C carried in the last target option Target Option C field from the received DAO message, and determines that the network node itself is an egress node;

[0138] S32, the network node C encapsulates the scheduling confirmation information in the DAO message in a DAO-ACK message, and feeds it back to the edge gateway via unicast.

[0139] Table 3 Information sequence in DAO message

[0140]

[0141] It can be understood that when the edge gateway receives the DAO-ACK message sent by the egress node, it is considered that the centralized cell scheduling of the message forwarding path: network node A→network node B→network node C is completed.

[0142] Example 2, still with Figure 1 Taking the message forwarding path in the scenario shown (i.e., network node A→network node B→network node C) as an example, the specific process of the centralized scheduling method of the cell may include:

[0143] Part 1: Scheduling of cells between network nodes A and B:

[0144] S11', BR sends a DAO message carrying the information sequence shown in Table 1 to network node A;

[0145] S12', the network node A finds the identifier of the network node A carried in the first target option Target Option A field from the received S-DAO message;

[0146] S13', network node A obtains the Schedule Reservation Option 1 field and the Target Option B field after the Target Option A field from the S-DAO message, and parses the first resource information from the Schedule Reservation Option 1 field; and determines from the Target Option B field that the next hop network node is network node B;

[0147] S14', network node A sends 6P transaction signaling to network node B according to the first resource information;

[0148] S15', the network node B feeds back a reply signaling of the 6P transaction, and the reply signaling indicates that the negotiation scheduling is successful;

[0149] S16', network node A replaces the ScheduleReservation Option 1 field carrying the first resource information in the DAO message with the ReservationConfirmation Option 1 field carrying the target scheduling confirmation information 1, wherein the Reservation Confirmation Option 1 field includes Code=0, indicating that the negotiation scheduling result is successful (Success), forming a DAO message as shown in Table 2 above;

[0150] S17', network node A sends a DAO message carrying the option sequence field shown in Table 2 to network node B.

[0151] The second part is the scheduling of cells between network nodes B and C:

[0152] S21', the network node B finds the target option Target Option B field carrying the network node B identifier from the DAO message received from the network node A;

[0153] S22', network node B obtains the Schedule Reservation Option 2 field and the Target Option C field after the Target Option B field from the DAO message, and parses the second resource information from the Schedule Reservation Option 2 field; and determines from the Target Option C field that the next hop network node is network node C;

[0154] S23', the network node B sends a 6P transaction signaling to the network node C according to the second resource information;

[0155] S24', the network node C feeds back a reply signaling of the 6P transaction, and the reply signaling indicates that the negotiation scheduling fails;

[0156] S25', the network node B replaces the ScheduleReservation Option 2 field carrying the second resource information in the DAO message with the ReservationConfirmation Option 3 field carrying the target scheduling failure information 2, wherein the Reservation Confirmation Option 2 field includes Code=1, indicating that the negotiation scheduling result is successful (Failure), forming a DAO message as shown in Table 4 below;

[0157] Table 4 DAO option sequence

[0158]

[0159] S26', the network node B encapsulates the target scheduling failure information in the DAO message at this time into a DAO-NACK message, and feeds it back to the edge gateway in a unicast manner.

[0160] It can be understood that when the edge gateway receives the DAO-NACK message sent by the intermediate node, it can be regarded that the centralized cell scheduling of the message forwarding path: network node A→network node B→network node C is completed.

[0161] Therefore, when the edge gateway receives a response message (including a DAO-ACK message and a DAO-NACK message) to the DAO message sent by the egress node or the intermediate node, it can be considered that the centralized scheduling of the cells of each network node on the message forwarding path is completed.

[0162] In addition, the present application embodiment also provides a network node, such as Fig. 9 FIG. 1 is a schematic diagram of the structure of the network node, wherein the network node is a first network node, including:

[0163] A receiving unit 901 is configured to receive a message, the message including an identifier of a first network node, an identifier of a second network node, an identifier of a third network node, first resource information, and second resource information, the first resource information being a network resource that needs to be scheduled between the first network node and the second network node, and the second resource information being a network resource that needs to be scheduled between the second network node and the third network node;

[0164] The scheduling unit 902 is configured to obtain first resource information when the first network node determines that the message includes the identifier of the first network node, and schedule network resources with the second network node according to the first resource information;

[0165] The first sending unit 903 is configured to send a message to the second network node to trigger the second network node to schedule network resources with the third network node according to the second resource information.

[0166] In some possible implementations, the first sending unit 903 may include:

[0167] An adding subunit, configured to add a first indication identifier to a message after the first network node determines that the network resource scheduling between the first network node and the second network node is successful;

[0168] The sending subunit is used to send a message to which a first indication identifier is added to the second network node, where the first indication identifier is used to indicate that the network resource scheduling between the first network node and the second network node is successful.

[0169] As an implementation manner, if the third network node is an egress node on the message forwarding path, the message is sent to the third network node and then sent to the network management device by the third network node.

[0170] Among them, the first resource information is specifically used to indicate the alternative network resources that need to be scheduled between the first network node and the second network node, and the first indication identifier is also used to indicate the network resources that are successfully scheduled between the first network node and the second network node. The successfully scheduled network resources are selected from the alternative network resources.

[0171] In a specific implementation, the network node may also include: a second sending unit, used to add a second indication identifier to a message after determining that the network resource scheduling between the first network node and the second network node has failed, and send the message with the second indication identifier added to the network management device, wherein the second indication identifier is used to indicate the failure of the network resource scheduling between the second network node and the second network node.

[0172] Among them, the message in the embodiment of the present application can be a destination announcement object DAO message.

[0173] In an example, the identifier of the first network node, the identifier of the second network node, the identifier of the third network node, the first resource information, and the second resource information are all carried in an Option field of the DAO message.

[0174] In specific implementation, the Option field includes a first target option Target Option field, a second Target Option field, a third Target Option field and a first scheduling reservation option Schedule Reservation Option field and a second Schedule Reservation Option field, wherein the first Schedule Reservation Option field is located between the first Target Option field and the second Target Option field, and the second Schedule Reservation Option field is located between the second Target Option field and the third Target Option field; the first Target Option field carries an identifier of the first network node, the second Target Option field carries an identifier of the second network node, the third Target Option field carries an identifier of the third network node, the first Schedule Reservation Option field carries first resource information, and the second Schedule Reservation Option field carries second resource information.

[0175] The above is an introduction to the network node provided in the embodiment of the present application. For specific implementation methods, please refer to the above Figure 2 The description in the corresponding network resource scheduling method embodiment achieves the same effect as the above method embodiment, which will not be repeated here.

[0176] Also, see Fig.10 , shows a schematic diagram of the structure of a network node in an embodiment of the present application, wherein the network node 1000 includes at least one connected processor 1001 and memory 1002, wherein the memory 1002 is used to store program code, and the processor 1001 is used to call the program code in the memory to execute the above Figure 2 The scheduling method of network resources shown.

[0177] In addition, the embodiment of the present application also provides a computer-readable storage medium, including instructions, which, when executed on a computer, enables the computer to execute the above Figure 2 The corresponding network resource scheduling method.

[0178] In addition, the present application also provides a computer program product including instructions, which, when executed on a computer, enables the computer to execute the above Figure 2 The corresponding network resource scheduling method.

[0179] The "first" in the names of "first network node" and "first resource information" mentioned in the embodiments of the present application is only used as a name identifier and does not mean the first in order. The same rule applies to "second" and so on.

[0180] Through the description of the above implementation methods, it can be known that those skilled in the art can clearly understand that all or part of the steps in the above-mentioned embodiment method can be implemented by means of software plus a general hardware platform. Based on such an understanding, the technical solution of the present application can be embodied in the form of a software product, which can be stored in a storage medium, such as a read-only memory (ROM) / RAM, a magnetic disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network communication device such as a router) to execute the methods described in each embodiment of the present application or some parts of the embodiments.

[0181] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can refer to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the network node embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can refer to the partial description of the method embodiment. The network node embodiment described above is only schematic, in which the modules described as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical modules, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative work.

[0182] The above description is merely an exemplary embodiment of the present application and is not intended to limit the protection scope of the present application.

Claims

1. A method for scheduling network resources, characterized in that: The method is applied to a network topology in a time slot frequency hopping TSCH mode, and the method comprises: The first network node receives a message, where the message includes an identifier of the first network node, an identifier of a second network node, an identifier of a third network node, first resource information, and second resource information, where the first resource information is a network resource that needs to be scheduled between the first network node and the second network node, and the second resource information is a network resource that needs to be scheduled between the second network node and the third network node; The first network node obtains the first resource information, and schedules network resources with the second network node according to the first resource information; The first network node sends the message to the second network node, triggering the second network node to schedule network resources with the third network node according to the second resource information.

2. The method according to claim 1, characterized in that The first network node sending the message to the second network node includes: After the first network node determines that the network resource scheduling between the first network node and the second network node is successful, a first indication identifier is added to the message, and the message with the first indication identifier added is sent to the second network node, where the first indication identifier is used to indicate that the network resource scheduling between the first network node and the second network node is successful.

3. The method according to claim 1 or 2, characterized in that: If the third network node is an egress node on the message forwarding path, the message is sent to the third network node and then sent to the network management device by the third network node.

4. The method according to claim 2, characterized in that: The first resource information is specifically used to indicate the alternative network resources that need to be scheduled between the first network node and the second network node. The first indication identifier is also used to indicate the network resources that are successfully scheduled between the first network node and the second network node. The successfully scheduled network resources are selected from the alternative network resources.

5. The method according to claim 1, 2 or 4, characterized in that: Also includes: After the first network node determines that the network resource scheduling between the first network node and the second network node has failed, a second indication identifier is added to the message, and the message with the second indication identifier added is sent to the network management device, where the second indication identifier is used to indicate the failure of network resource scheduling between the second network node and the second network node.

6. The method according to claim 1, 2 or 4, characterized in that: The message is a Destination Advertisement Object (DAO) message.

7. The method according to claim 6, characterized in that The identifier of the first network node, the identifier of the second network node, the identifier of the third network node, the first resource information, and the second resource information are all carried in an Option field of the DAO message.

8. The method according to claim 7, characterized in that The Option field includes a first target option TargetOption field, a second Target Option field, a third Target Option field, and a first scheduling reservation option Schedule Reservation Option field, a second Schedule Reservation Option field. The first Schedule Reservation Option field is located between the first Target Option field and the second Target Option field, and the second Schedule Reservation Option field is located between the second Target Option field and the third Target Option field; The first Target Option field carries the identifier of the first network node, the second Target Option field carries the identifier of the second network node, the third Target Option field carries the identifier of the third network node, the first Schedule Reservation Option field carries the first resource information, and the second Schedule Reservation Option field carries the second resource information.

9. A network node, characterized in that: In a network topology applied to a time slot frequency hopping TSCH mode, the network node is a first network node, including: a receiving unit, configured to receive a message, the message including an identifier of the first network node, an identifier of the second network node, an identifier of a third network node, first resource information, and second resource information, the first resource information being network resources that need to be scheduled between the first network node and the second network node, and the second resource information being network resources that need to be scheduled between the second network node and the third network node; a scheduling unit, configured to obtain the first resource information, and schedule network resources with the second network node according to the first resource information; The first sending unit is used to send the message to the second network node, triggering the second network node to schedule network resources with the third network node according to the second resource information.

10. The network node according to claim 9, characterized in that: The first sending unit includes: an adding subunit, configured to add a first indication identifier to the message after determining that the network resource scheduling between the first network node and the second network node is successful; The sending subunit is used to send the message with the first indication identifier added to the second network node, where the first indication identifier is used to indicate that the network resource scheduling between the first network node and the second network node is successful.

11. The network node according to claim 9 or 10, characterized in that: If the third network node is an egress node on the message forwarding path, the message is sent to the third network node and then sent to the network management device by the third network node.

12. The network node according to claim 10, characterized in that: The first resource information is specifically used to indicate the alternative network resources that need to be scheduled between the first network node and the second network node. The first indication identifier is also used to indicate the network resources that are successfully scheduled between the first network node and the second network node. The successfully scheduled network resources are selected from the alternative network resources.

13. The network node according to claim 9, 10 or 12, characterized in that: Also includes: A second sending unit is used to add a second indication identifier to the message after determining that the network resource scheduling between the first network node and the second network node has failed, and send the message with the second indication identifier added to the network management device, wherein the second indication identifier is used to indicate the failure of network resource scheduling between the second network node and the second network node.

14. The network node according to claim 9, 10 or 12, characterized in that: The message is a Destination Advertisement Object (DAO) message.

15. The network node according to claim 14, wherein the identifier of the first network node, the identifier of the second network node, the identifier of the third network node, the first resource information and the second resource information are all carried in an option field of the DAO message.

16. The network node according to claim 15, characterized in that: The Option field includes a first target option Target Option field, a second Target Option field, a third Target Option field, and a first scheduling reservation option Schedule Reservation Option field, a second Schedule Reservation Option field, The first Schedule Reservation Option field is located between the first Target Option field and the second Target Option field, and the second Schedule Reservation Option field is located between the second Target Option field and the third Target Option field; The first Target Option field carries the identifier of the first network node, the second Target Option field carries the identifier of the second network node, the third Target Option field carries the identifier of the third network node, the first Schedule Reservation Option field carries the first resource information, and the second Schedule Reservation Option field carries the second resource information.

17. A network node, characterized in that: The method comprises at least one connected processor and memory, wherein the memory is used to store program code, and the processor is used to call the program code in the memory to execute the method according to any one of claims 1 to 8.

18. A computer-readable medium comprising instructions, which, when executed by a computer, causes the computer to perform the method according to any one of claims 1 to 8.

Images