EP3823395A1 - Procédé et dispositif de planification de ressources de réseau - Google Patents

Procédé et dispositif de planification de ressources de réseau Download PDF

Info

Publication number
EP3823395A1
EP3823395A1 EP19844396.2A EP19844396A EP3823395A1 EP 3823395 A1 EP3823395 A1 EP 3823395A1 EP 19844396 A EP19844396 A EP 19844396A EP 3823395 A1 EP3823395 A1 EP 3823395A1
Authority
EP
European Patent Office
Prior art keywords
network node
network
message
resource
identifier
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
EP19844396.2A
Other languages
German (de)
English (en)
Other versions
EP3823395A4 (fr
Inventor
Bing Liu
Mingui Zhang
Yuefeng WU
Huanqing HUANG
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of EP3823395A1 publication Critical patent/EP3823395A1/fr
Publication of EP3823395A4 publication Critical patent/EP3823395A4/fr
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/26—Resource reservation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows

Definitions

  • This application relates to the field of communications technologies, and in particular, to a network resource scheduling method and an apparatus.
  • a network resource may be divided in two dimensions: slot and channel, and one unit of formed network resource is referred to as a cell.
  • the cell may be determined based on the slot and a channel shift.
  • the cell may be one unit of network bandwidth.
  • the internet engineering task force (Internet Engineering Task Force, IETF) 6TiSCH working group designs a 6top (6TiSCH Operation Sublayer) adaptation layer for the TSCH mode.
  • 6top (6TiSCH Operation Sublayer) adaptation layer for the TSCH mode.
  • Two adjacent nodes invoke 6P transaction signaling at a 6top to add (ADD), delete (DELETE), or relocate (RELOCATE) a cell.
  • ADD add
  • DELETE delete
  • RELOCATE relocate
  • embodiments of this application provide a network resource scheduling method and an apparatus, to resolve a technical problem that resource reservation on a multi-hop path cannot be implemented.
  • an embodiment of this application provides a network resource scheduling method.
  • the method includes: receiving, by a first network node, 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; 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; when determining that the message includes the identifier of the first network node, obtaining, by the first network node, the first resource information, and performing network resource scheduling with the second network node based on the first resource information; and sending, by the first network node, the message to the second network node, to trigger the second network node to perform network resource scheduling with the third network node based on the second resource information.
  • the second network node is a next-hop network node of the first
  • the first network node receives the message, where the message includes a network resource that needs to be scheduled between a plurality of network nodes on a multi-hop path; and after resource scheduling is performed between the first network node and the second network node, sends the message to the second network node, to trigger network resource scheduling between the second network node and the third network node, so that end-to-end resource scheduling is implemented by using one message, and end-to-end resource reservation on the multi-hop path can be implemented.
  • the sending, by the first network node, the message to the second network node may include: after determining that network resource scheduling between the first network node and the second network node succeeds, adding, by the first network node, a first indication identifier to the message, and sending, to the second network node, the message to which the first indication identifier is added, where the first indication identifier is used to indicate that network resource scheduling between the first network node and the second network node succeeds.
  • the message may be sent to the third network node and then be sent by the third network node to a network management device.
  • the first resource information is specifically used to indicate a candidate network resource that needs to be scheduled between the first network node and the second network node
  • the first indication identifier is further used to indicate a network resource that is successfully scheduled between the first network node and the second network node
  • the successfully scheduled network resource may be selected from the candidate network resource.
  • the network resource scheduling method may further include: after determining that network resource scheduling between the first network node and the second network node fails, adding, by the first network node, a second indication identifier to the message, and sending, to the network management device, the message to which the second indication identifier is added, where the second indication identifier is used to indicate that network resource scheduling between the second network node and the second network node fails.
  • the message in this embodiment of this application may be a destination advertisement object (Destination Advertisement Object, DAO) message.
  • DAO Destination Advertisement Object
  • 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 option field in the DAO message.
  • the option field includes a first target option target option field, a second target option field, a third target option field, a first schedule reservation option schedule reservation option field, and 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
  • 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
  • the second schedule reservation option field carries the second resource information.
  • an embodiment of this application further provides a network node.
  • the network node is a first network node, and includes a receiving unit, a scheduling unit, and a first sending unit.
  • the receiving unit is configured to receive 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; 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 scheduling unit is configured to: when the first network node determines that the message includes the identifier of the first network node, obtain the first resource information, and perform network resource scheduling with the second network node based on the first resource information.
  • the first sending unit is configured to send the message to the second network node, to trigger the second network node to perform network resource scheduling with the third network node based on the second resource information.
  • the first sending unit may include: an adding subunit, configured to add a first indication identifier to the message after the first network node determines that network resource scheduling between the first network node and the second network node succeeds; and a sending subunit, configured to send, to the second network node, the message to which the first indication identifier is added, where the first indication identifier is used to indicate that network resource scheduling between the first network node and the second network node succeeds.
  • the message is sent to the third network node and then is sent by the third network node to a network management device.
  • the first resource information is specifically used to indicate a candidate network resource that needs to be scheduled between the first network node and the second network node, the first indication identifier is further used to indicate a network resource that is successfully scheduled between the first network node and the second network node, and the successfully scheduled network resource is selected from the candidate network resource.
  • the network node may further include: a second sending unit, configured to: after it is determined that network resource scheduling between the first network node and the second network node fails, add a second indication identifier to the message, and send, to the network management device, the message to which the second indication identifier is added, where the second indication identifier is used to indicate that network resource scheduling between the second network node and the second network node fails.
  • a second sending unit configured to: after it is determined that network resource scheduling between the first network node and the second network node fails, add a second indication identifier to the message, and send, to the network management device, the message to which the second indication identifier is added, where the second indication identifier is used to indicate that network resource scheduling between the second network node and the second network node fails.
  • the message in this embodiment of this application may be a destination advertisement object DAO message.
  • 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 option field in the DAO message.
  • the option field includes a first target option target option field, a second target option field, a third target option field, a first schedule reservation option schedule reservation option field, and 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
  • 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
  • the second schedule reservation option field carries the second resource information.
  • an embodiment of this application further provides a network node, including at least one connected processor and a memory.
  • the memory is configured to store program code
  • the processor is configured to invoke the program code in the memory to perform the network resource scheduling method according to the first aspect.
  • an embodiment of this application further provides a computer readable storage medium, including an instruction.
  • the instruction When the instruction is run on a computer, the computer is enabled to perform the network resource scheduling method according to the first aspect.
  • an embodiment of this application further provides a computer program product including an instruction.
  • the computer program product When the computer program product is run on a computer, the computer is enabled to perform the network resource scheduling method according to the first aspect.
  • a network resource needs to be configured for each network node on a packet receiving and sending path.
  • the network nodes may communicate with each other in a same slot by using different channels and do not interfere with each other, provided that the network resource is properly scheduled.
  • the 6TiSCH working group defines a scheduling function (Scheduling Function) to schedule a network resource in a TSCH mode.
  • a cell between two adjacent network nodes may be dynamically scheduled based on a quantity (SCHEDULED CELLS) of reserved cells between the two adjacent network nodes, a quantity (REQUIRED CELLS) of cells required by network traffic, and a threshold SFXTHRESH.
  • a quantity of cells actually used between adjacent network nodes is denoted as USED CELLS.
  • An overprovisioning parameter is denoted as OVER PROVISION.
  • REQUIRED CELLS USED CELLS + OVER PROVISION.
  • the two adjacent network nodes may directly invoke 6P transaction signaling at a 6top adaptation layer to configure the cell.
  • a packet is required to arrive at a destination end from a source end in a determined time.
  • an input signal needs to arrive at a controller in a closed-loop period of this control. Otherwise, the control may be in an unstable state.
  • a cell configuration manner in which independent negotiation and scheduling are performed between two adjacent network nodes also referred to as one hop
  • only effective receiving and sending of a packet between the two adjacent network nodes in each hop can be ensured.
  • receiving and sending times of the packet at each network node on the path cannot be centrally scheduled and controlled.
  • each network node on the path may not receive and send the packet at a specified time, and therefore it is difficult to ensure that receiving and sending of the packet from a source end to a destination end on the path are completed in a deterministic latency.
  • the solution in which independent negotiation and scheduling are performed between the two adjacent nodes in one hop and that is provided for cell configuration cannot be applicable to cell scheduling on the multi-hop path. Even if a complete path is divided into a plurality of independent single-hop processes for processing, centralized scheduling of the cell from the source end to the destination end cannot be ensured.
  • an embodiment of this application provides a network resource scheduling method.
  • a message is sent to each network node on a packet forwarding path, to initiate centralized scheduling of a network resource on the packet forwarding path.
  • a network node that receives the message may obtain target resource scheduling information between the network node and a next-hop network node from the message.
  • the network node may perform network resource negotiation and scheduling with the next-hop network node based on the obtained target resource scheduling information.
  • the network node After network resource negotiation and scheduling of the network node succeed, the network node sends the message to the next-hop network node, the next-hop network node completes the network resource negotiation and scheduling of the next-hop network node in the foregoing manner, and by analogy, until all nodes on the packet forwarding path complete the network resource negotiation and scheduling.
  • the message may be a DAO message.
  • the message (for example, the DAO message) is centrally delivered to each network node on the packet forwarding path, so that a network resource that needs to be scheduled between each pair of adjacent network nodes on a multi-hop path can be centrally scheduled, to resolve a problem that when independent network resource scheduling is performed by each hop network node, the network resource on the multi-hop path cannot be centrally scheduled and controlled, and consequently a packet cannot be received or sent on the path at a specified time, so that it can be ensured that a deterministic latency can be maintained for the packet from a source end to a destination end on the multi-hop path.
  • a routing protocol used in this embodiment of this application is the IPv6 routing protocol for low power and lossy networks (IPv6 Routing Protocol for Low-Power and Lossy Networks, RPL for short) (RFC6550).
  • the DAO message is defined in RPL.
  • the DAO message is a unicast message, and is used by a child network node to send path information to a parent network node or a border router, so as to construct a downlink route.
  • a reversely propagated scheduling DAO (Scheduling DAO, S-DAO for short) message sent from the parent network node or the border router is received by each child network node along the packet forwarding path.
  • the network topology structure in the TSCH mode is a destination-oriented directed acyclic graph (Destination Of Directed Acyclic Graph, DODAG for short), and a root network node in the DODAG may be the border router (Border Router, BR for short).
  • DODAG Destination Of Directed Acyclic Graph
  • BR Border Router
  • the BR may be connected to a local network management device, or the BR may connect an external network and an external network management device by using a router.
  • BRs may be connected to each other by using a subnet backbone (backbone), to expand a network coverage area.
  • backbone subnet backbone
  • the local network management device or the external network management device may maintain a network resource database, and formulate a network resource scheduling solution.
  • the border router may collect network information including the network resource scheduling solution.
  • the border router receives the network resource scheduling solution, the border router is responsible for delivering the network resource scheduling solution to each child network node, so as to implement centralized management and scheduling of network resources in the network topology structure.
  • the network topology structure shown in FIG. 1 is used as an example. Assuming that a packet forwarding path corresponding to a DAO message received and delivered by the BR is: a network node A -> a network node B -> a network node C, a specific solution may be as follows: The network node A receives the DAO message, and obtains target resource scheduling information 1 that is carried in the DAO message and that is used to indicate a cell that needs to be scheduled between the network node A and a next-hop network node (namely, the network node B). In this case, the network node A performs cell negotiation and scheduling (for example, may perform negotiation by using 6P transaction signaling and reply signaling) with the network node B based on the target resource scheduling information 1.
  • target resource scheduling information 1 for example, may perform negotiation by using 6P transaction signaling and reply signaling
  • the network node A sends the DAO message to the network node B.
  • the network node B receives the DAO message, and obtains target resource scheduling information 2 that is carried in the DAO message and that is used to indicate a cell that needs to be scheduled between the network node B and a next-hop network node (namely, the network node C). In this case, the network node B performs cell negotiation and scheduling with the network node C based on the target scheduling information 2. If cell negotiation and scheduling succeed, the network node B sends the DAO message to the network node C. The network node C receives the DAO message, and learns that the network node C is an egress node. In this case, network resource scheduling on the packet forwarding path is completed.
  • the DAO message may be delivered to each network node on the packet forwarding path, so that a network resource that needs to be scheduled between each pair of adjacent network nodes on a multi-hop path can be centrally scheduled, to reserve a network resource from a source end to a destination end on the multi-hop path, and help implement a deterministic latency of packet forwarding.
  • the multi-hop path is a forwarding path on which at least one intermediate node is included between a source node and a destination node on the forwarding path.
  • FIG. 2 is a schematic flowchart of a network resource scheduling method according to an embodiment of this application. The method may specifically include the following steps.
  • Step 201 A 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; 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 message received by the first network node may be a DAO message used for scheduling.
  • the DAO message is used as an example for description in this embodiment.
  • the DAO message may be sent by a network management device (for example, a border router) and transmitted along a packet forwarding path, and the packet forwarding path includes at least the first network node, the second network node, and the third network node.
  • the first network node may be any network node other than an egress (Egress) node on the packet forwarding path, and on the packet forwarding path, a next-hop node of the first network node is the second network node, and a next-hop node of the second network node is the third network node.
  • the packet forwarding path may be: ... -> the first network node -> the second network node -> the third network node -> ..., where the first network node may be an ingress (Ingress) node or an intermediate node, and the third network node may be the egress node or an intermediate node.
  • a local network management device or an external network management device formulates a centralized scheduling policy corresponding to the network resource on the packet forwarding path and sends the centralized scheduling policy to a BR, and the BR encapsulates the centralized scheduling policy into the DAO message, and delivers the DAO message to each network node on the packet forwarding path along the packet forwarding path by using the ingress node, so that hop-by-hop network nodes successively complete network resource configuration. If some nodes prior to the packet forwarding path are included between the BR and the ingress node, these nodes are responsible for only forwarding the DAO message to the ingress node for current resource reservation, and do not perform operations performed by the first network node and the second network node.
  • the BR delivers the DAO message is merely an example for description in this embodiment.
  • any network management device that can deliver a DAO to implement centralized scheduling of the network resource can deliver the DAO message to each network node on the packet forwarding path.
  • Options filed is an option sequence in the DAO message.
  • the options field in the DAO message may include an information sequence.
  • the information sequence includes resource scheduling information corresponding to each network node on the packet forwarding path, and is used to indicate a network resource that needs to be scheduled between each node and a next-hop node of each node on the packet forwarding path.
  • the information sequence may include the first resource information and the second resource information.
  • the first resource information may carry the network resource that needs to be scheduled between the first network node and the second network node
  • the second resource information may carry the network resource that needs to be scheduled between the second network node and the third network node.
  • the information sequence in the options field in the DAO message may further include an identifier of each network node on the packet forwarding path.
  • the information sequence may include the identifier of the first network node, the identifier of the second network node, and the identifier of the third network node.
  • Step 202 When determining that the message includes the identifier of the first network node, the first network node obtains the first resource information, and performs network resource scheduling with the second network node based on the first resource information.
  • the message received by the first network node includes the identifier of each network node on the forwarding path and a network resource that needs to be scheduled between two adjacent network nodes.
  • the first network node finds the identifier of the first network node from the message, it indicates that the first network node is a node on the forwarding path.
  • the first network node searches the information sequence carried in the DAO message for the first resource information.
  • the information sequence is used to indicate the network resource that needs to be scheduled between each node and the next-hop node of each node on the packet forwarding path
  • the first resource information is used to indicate the network resource that needs to be scheduled between the first network node and the second network node.
  • the information sequence may be carried in the options field in the DAO message, and each piece of resource information in the information sequence may be carried in a schedule reservation option schedule reservation option field in the options field.
  • a format of the schedule reservation option schedule reservation option field is shown in FIG. 4 . Fields included in the schedule reservation option field and values and meanings of the fields are described as follows:
  • all network nodes except the egress node on the packet forwarding path may find resource information corresponding to the network nodes from the information sequence in the DAO message, and when performing network resource scheduling, each network node needs to search a plurality of pieces of resource information in the DAO message for resource information uniquely corresponding to the network node.
  • the resource information is denoted as target resource information of the network node.
  • the options field in the DAO message may further include the identifier of each network node on the packet forwarding path, so that each network node on the packet forwarding path can find target resource information corresponding to the network node.
  • the identifier of each network node may be carried in a target option target option field in the options field in the DAO message.
  • a format of the target option target option field is shown in FIG. 5 . Fields included in the target option field and values and meanings of the fields are described as follows:
  • each network node may be enabled to find corresponding target resource information from the received DAO.
  • each network node may be enabled to determine a next-hop network node from the received DAO, to determine a target network node with which the network node needs to perform network resource negotiation and scheduling and to which the DAO is sent after negotiation and scheduling are completed.
  • the arrangement order of the resource information and the arrangement order of the identifiers of the network nodes that are in the DAO message may be specifically as follows:
  • the identifiers of the network nodes are arranged in an order of the network nodes on the packet forwarding path, and resource information used to indicate a network resource used to forward a packet between two adjacent network nodes is located between identifiers of the two adjacent network nodes.
  • the option field in the DAO message includes a target option target option field and a schedule reservation option schedule reservation option field.
  • One target option target option field carries an identifier of one network node on the packet path
  • one schedule reservation option schedule reservation option field carries resource information used to indicate a network resource that needs to be scheduled between one pair of adjacent network nodes.
  • the identifier of the first network node and the identifier of the second network node are arranged in an order of the first network node and the second network node on the packet 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.
  • the option field in the DAO message may include at least two target option target option fields and at least one schedule reservation option schedule reservation option field.
  • a first target option target option field carries the identifier of the first network node.
  • a second target option target option field carries the identifier of the second network node.
  • a target schedule reservation option schedule reservation option field carries the first resource information, and the target schedule reservation option schedule reservation option field is located between the first target option target option field and the second target option target option field.
  • the DAO may include ..., the first target option field, the target schedule reservation option field, the second target option field....
  • the option field in the message includes a first target option field, a second target option field, a third target option field, a first schedule reservation option field, and a second schedule reservation 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
  • the second schedule reservation option field carries the second resource information.
  • the DAO may include ..., 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....
  • a specific form of the DAO message is described by using the packet forwarding path (that is, the network node A -> the network node B -> the network node C) in FIG. 1 as an example.
  • An identifier of the network node A is carried in a target option target option A field
  • an identifier of the network node B is carried in a target option target option B field
  • an identifier of the network node C is carried in a target option target option C field
  • first resource information corresponding to the network node A is carried in a schedule reservation option schedule reservation option 1 field
  • second resource information corresponding to the network node B is carried in a schedule reservation option schedule reservation option 2 field.
  • the DAO message received by the network node on the packet forwarding path is shown in Table 1.
  • the target option target option A field, the schedule reservation option schedule reservation option 1 field, the target option target option B field, the schedule reservation option schedule reservation option 2 field, and the target option target option C field are included.
  • a possible specific implementation of step 202 may be as follows: The first network node searches the DAO message for a field that carries the identifier of the first network node, and obtains the first resource information of the first network node through parsing from a field next to the field that carries the identifier of the first network node. In addition, the first network node may further find, from the DAO message, a field next to the field that carries the first resource information of the first network node, and find an identifier of a next-hop network node (denoted as the second network node) of the first network node from the field, to determine the second network node.
  • the network node A may find the target option target option A field that carries the identifier of the network node A, and may obtain the first resource information corresponding to the network node A from a next schedule reservation option schedule reservation option 1 field of the field.
  • the network node A may further learn of the next-hop network node B (denoted as the second network node) from a next field of the field in which the first resource information is located, that is, determine that target resource scheduling information indicates a cell that needs to be scheduled between the network node A and a specific network node.
  • the first network node performs network resource negotiation and scheduling with the second network node based on the first resource information.
  • the first network node may perform network resource negotiation and scheduling with the second network node based on the obtained first resource information.
  • network resource scheduling may be implemented at the 6top adaptation layer.
  • two adjacent network nodes invoke 6P transaction signaling at the 6top adaptation layer to add (Add), delete (Delete), or relocate (Relocate) a network resource.
  • the negotiation procedure may specifically include: The first network node sends 6P transaction signaling to the second network node; and after receiving the 6P transaction signaling, the second network node generates 6P transaction reply signaling, and feeds back the 6P transaction reply signaling to the first network node, to complete network resource scheduling between the first network node and the second network node. For example, a network resource is added. As shown in FIG. 6 , the network node A initiates Add signaling in the 6P transaction signaling to the network node B, to implement scheduling of adding two network resources between the network node A and the network node B.
  • the network node A when the network node A receives no reply signaling to the Add signaling from the network node B within a preset time period, the network node A terminates this scheduling request. In another case, when the network node A receives reply signaling to the Add signaling from the network node B within a preset time period, the network node A and the network node B each receive/send a packet based on a configured network resource.
  • the Add signaling in the 6P transaction signaling may include Type, Code, a sequence number, NumCells, and a candidate cell list.
  • Type is used to indicate that a message is request signaling for initiating scheduling.
  • Code is used to indicate a specific operation of the scheduling, and the specific operation may include an add operation, a delete operation, or a relocate operation.
  • the sequence number (SeqNum) is used to determine a correspondence between a sent message and a reply message.
  • NumCells is used to indicate a quantity of network resources corresponding to the operation indicated in Code.
  • the candidate cell list (Cell List) is used to show a specific network resource that may be used as a candidate. Each network resource may be represented by using two-dimensional coordinates.
  • One dimension represents a slot of the network resource, and the other dimension represents a channel of the network resource.
  • (1, 2), (2, 2), and (3, 5) are three different network resource identifiers.
  • the 6P transaction reply signaling may include Type, Code, a sequence number, and a cell list.
  • Type (Type) is used to indicate that a message is reply signaling.
  • the sequence number (SeqNum) is used to determine a correspondence between a sent message and a reply message.
  • the cell list (Cell List) is used to show a network resource configured after scheduling is completed, and the network resource may include some or all network resources in a candidate network resource list.
  • a quantity of cells in the candidate cell list in the request signaling is greater than or equal to a quantity of cells in the cell list in the reply signaling.
  • all parameters in the 6P transaction signaling may be obtained from the DAO message.
  • the candidate cell list (Cell List) in the 6P transaction signaling may be obtained from the schedule reservation option field in the DAO message.
  • Code in the 6P transaction reply signaling is equal to 0, it indicates that negotiation and scheduling between the first network node and the second network node succeed, and a cell of a next-hop network node may be scheduled; or if Code in the 6P transaction reply signaling is equal to 1, it indicates that negotiation and scheduling between the first network node and the second network node fail, it is considered that the centralized scheduling between the network nodes on the packet forwarding path is terminated, and scheduling to be performed with a next network node is not performed.
  • Step 203 If network resource negotiation and scheduling succeed, the first network node sends the message to the second network node, to trigger the second network node to perform network resource scheduling with the third network node based on the second resource information.
  • the first network node sends the message to the second network node.
  • the second network node For an operation performed by the second network node after the second network node receives the message, refer to the step performed by the first network node after the first network node receives the message in step 202. Details are not described herein again.
  • the first network node may send the DAO message to the second network node adjacent to the first network node, so that the second network node performs network resource scheduling in the manner provided in this embodiment of this application.
  • the first network node may add a first indication identifier to the message, and send, to the second network node, the message to which the first indication identifier is added, to determine a successfully scheduled network resource.
  • the first indication identifier is used to indicate that network resource scheduling between the first network node and the second network node succeeds.
  • the first resource information in the DAO message may be replaced with target scheduling confirmation information, and the target scheduling confirmation information is denoted as the first indication identifier.
  • the target scheduling confirmation information is used to indicate that network resource scheduling between the first network node and the second network node succeeds, and the target scheduling confirmation information may include a list of successfully scheduled network resources. It may be understood that the successfully scheduled network resources are selected from candidate network resources.
  • the target scheduling confirmation information used as the first indication identifier may be correspondingly carried in a first reservation confirmation option reservation confirmation option field, and Code in the first reservation confirmation option reservation confirmation option field may be 0. This is used to indicate that the negotiation and scheduling result is "success".
  • a format of the reservation confirmation option reservation confirmation option field is shown in FIG. 7 . Fields included in the reservation confirmation option field and values and meanings of the fields are described as follows:
  • the first resource information obtained by the first network node in step 202 carries information used to indicate a to-be-scheduled candidate network resource, and after negotiation and scheduling succeed, the target scheduling confirmation information carries information used to indicate a successfully scheduled network resource.
  • the successfully scheduled network resource is selected from the to-be-scheduled candidate network resource, and may be some or all cells in the to-be-scheduled candidate network resource.
  • the information used to indicate the to-be-scheduled candidate network resource may be carried in a candidate cell list candidate cell list field in the schedule reservation option schedule reservation option field in the information sequence, and the information used to indicate the successfully scheduled network resource may be carried in Success Cell List Success Cell List in the first reservation confirmation option reservation confirmation option field in the DAO message.
  • the second network node may perform network resource scheduling with reference to the network resource scheduling solution that is provided in this embodiment of this application and that is performed by the first network node, and by analogy, until all the network nodes on the packet forwarding path successfully schedule the cell.
  • an egress node when an egress node receives the message (for example, the DAO message), it indicates that negotiation and scheduling performed by each hop network node on the packet forwarding path succeed, and a first indication identifier is correspondingly added to a network node other than the egress node on the packet forwarding path. For example, if all first resource information in the DAO message is replaced with scheduling confirmation information, the egress node on the packet forwarding path may encapsulate the scheduling confirmation information in the DAO message into a DAO-ACK message, and feed back the DAO-ACK message to a border router in a unicast manner.
  • the message for example, the DAO message
  • RPL Instance ID For Security, RPL Instance ID, D, Reserved, DAO Sequence, and Options, refer to FIG. 3 and descriptions of the DAO.
  • the first network node may add a second indication identifier to the message. For example, the first network node may replace the first resource information in the DAO message with target scheduling failure information, and encapsulate the target scheduling failure information into a DAO-NACK message and feed back the DAO-NACK message to the border router.
  • the target scheduling failure information used as the second indication identifier may be correspondingly carried in a second reservation confirmation option reservation confirmation option field in the DAO-NACK message, and Code in the second reservation confirmation option reservation confirmation option field may be 1. This is used to indicate that the negotiation and scheduling result is "failure”.
  • a format of the reservation confirmation option reservation confirmation option field refer to FIG. 7 and corresponding descriptions.
  • the first network node may replace the schedule reservation option schedule reservation option field that carries the target resource scheduling information with the second reservation confirmation option reservation confirmation option field that carries a coordinated scheduling failure identifier.
  • the first network node may encapsulate the second reservation confirmation option reservation confirmation option field that carries the target scheduling failure information into the DAO-NACK message, and feed back the DAO-NACK message to the border router in a unicast manner.
  • the DAO message or the like is sent to each network node on the packet forwarding path, to initiate centralized scheduling of the network resource on the packet forwarding path.
  • Each hop network node on the packet forwarding path may perform network resource negotiation and scheduling between the network node and a next-hop network node based on the corresponding first resource information in the DAO message, until network resource negotiation and scheduling on the packet forwarding path are completed.
  • the DAO message may be delivered to each network node on the packet forwarding path, so that a network resource that needs to be scheduled between each pair of adjacent network nodes on a multi-hop path can be centrally scheduled, to implement end-to-end resource scheduling on the multi-hop path.
  • 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 a same message, and may have a specific association relationship.
  • each network node can complete end-to-end packet forwarding in a "deterministic latency".
  • the network resource scheduling method provided in this embodiment of this application is applicable to centralized scheduling of the network resource that needs to be scheduled between each pair of adjacent network nodes on the multi-hop path.
  • the scheduling method there is no high requirement on a processing capability of the network node and stability of the network topology structure.
  • the network resource scheduling method provided in this embodiment of this application is very tailored to a requirement on the network resource scheduling solution in the network topology structure in the TSCH mode, and is a preferred solution that is applicable to centralized scheduling of the network resource between each pair of adjacent network nodes on the packet forwarding path in the network topology structure in the TSCH mode.
  • Instance 1 The packet forwarding path (that is, the network node A -> the network node B -> the network node C) in the scenario shown in FIG. 1 is used as an example.
  • a specific process of a method for centrally scheduling a network bandwidth resource, namely, a cell may include the following steps. First part: Cell scheduling is performed between the network node A and the network node B. S11: The BR sends the DAO message that carries the information sequence shown in Table 1 to the network node A. S12: The network node A finds, from the received DAO message, that an identifier of the network node A is carried in the 1 st target option target option A field.
  • S13 The network node A obtains, from the DAO message, a schedule reservation option schedule reservation option 1 field and a target option target option B field that are after the target option target option A field, obtains first resource information from the schedule reservation option schedule reservation option 1 field through parsing, and determines, from the target option target option B field, that a next-hop network node is the network node B.
  • S14 The network node A sends 6P transaction signaling to the network node B based on the first resource information.
  • S15 The network node B feeds back 6P transaction reply signaling, where the reply signaling indicates that negotiation and scheduling succeed.
  • S16 The network node A replaces the schedule reservation option schedule reservation option 1 field that is in the DAO message and that carries the first resource information with a reservation confirmation option reservation confirmation option 1 field that carries target scheduling confirmation information 1, where Code included in the reservation confirmation option reservation confirmation option 1 field is equal to 0. This indicates that the negotiation and scheduling result is "success" (Success), and a DAO message shown in Table 2 is formed.
  • Schedule reservation option 2 Target option C S17: The network node A sends the DAO message that carries the information sequence shown in Table 2 to the network node B. Second part: Cell scheduling is performed between the network node B and the network node C.
  • the border router receives the DAO-ACK message sent by the egress node, it is considered that the centralized cell scheduling on the packet forwarding path: the network node A -> the network node B -> the network node C is completed.
  • Instance 2 The packet forwarding path (that is, the network node A -> the network node B -> the network node C) in the scenario shown in FIG. 1 is still used as an example.
  • a specific process of a method for centrally scheduling a cell may include the following steps. First part: Cell scheduling is performed between the network node A and the network node B.
  • the border router After the border router receives the DAO-NACK message sent by an intermediate node, it may be considered that the centralized cell scheduling on the packet forwarding path: the network node A -> the network node B -> the network node C is completed.
  • the border router After the border router receives a response message (including the DAO-ACK message and the DAO-NACK message) that is to the DAO message and that is sent by the egress node or the intermediate node, it may be considered that centralized cell scheduling between the network nodes on the packet forwarding path is completed.
  • FIG. 9 is a schematic structural diagram of the network node.
  • the network node is a first network node, and includes:
  • the first sending unit 903 may include:
  • the message is sent to the third network node and then is sent by the third network node to a network management device.
  • the first resource information is specifically used to indicate a candidate network resource that needs to be scheduled between the first network node and the second network node, the first indication identifier is further used to indicate a network resource that is successfully scheduled between the first network node and the second network node, and the successfully scheduled network resource is selected from the candidate network resource.
  • the network node may further include: a second sending unit, configured to: after it is determined that network resource scheduling between the first network node and the second network node fails, add a second indication identifier to the message, and send, to the network management device, the message to which the second indication identifier is added, where the second indication identifier is used to indicate that network resource scheduling between the second network node and the second network node fails.
  • a second sending unit configured to: after it is determined that network resource scheduling between the first network node and the second network node fails, add a second indication identifier to the message, and send, to the network management device, the message to which the second indication identifier is added, where the second indication identifier is used to indicate that network resource scheduling between the second network node and the second network node fails.
  • the message in this embodiment of this application may be a destination advertisement object DAO message.
  • 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 option field in the DAO message.
  • the option field includes a first target option target option field, a second target option field, a third target option field, a first schedule reservation option schedule reservation option field, and 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
  • 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
  • the second schedule reservation option field carries the second resource information.
  • FIG. 10 is a schematic structural diagram of a network node according to an embodiment of this application.
  • the network node 1000 includes at least one connected processor 1001 and a memory 1002.
  • the memory 1002 is configured to store program code
  • the processor 1001 is configured to invoke the program code in the memory to perform the network resource scheduling method shown in FIG. 2 .
  • an embodiment of this application further provides a computer readable storage medium, including an instruction.
  • the instruction When the instruction is run on a computer, the computer is enabled to perform the network resource scheduling method corresponding to FIG. 2 .
  • an embodiment of this application further provides a computer program product including an instruction.
  • the computer program product When the computer program product is run on a computer, the computer is enabled to perform the network resource scheduling method corresponding to FIG. 2 .
  • the computer software product may be stored in a storage medium, for example, a read-only memory (English: read-only memory, ROM)/RAM, a magnetic disk, or an optical disc, and includes several instructions for instructing a computer device (which may be a personal computer, a server, or a network communications device such as a router) to perform the methods in the embodiments or some parts of the embodiments of this application.
  • a computer device which may be a personal computer, a server, or a network communications device such as a router
  • a network node embodiment is basically similar to a method embodiment, and therefore is described briefly.
  • the described network node embodiment is merely an example.
  • the modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical modules, and may be located in one position, or may be distributed on a plurality of network units. Some or all the modules may be selected based on an actual requirement to achieve the objectives of the solutions of the embodiments. A person of ordinary skill in the art may understand and implement the embodiments without creative efforts.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
EP19844396.2A 2018-08-02 2019-07-30 Procédé et dispositif de planification de ressources de réseau Pending EP3823395A4 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810872232.4A CN110798897B (zh) 2018-08-02 2018-08-02 一种网络资源的调度方法和装置
PCT/CN2019/098311 WO2020024926A1 (fr) 2018-08-02 2019-07-30 Procédé et dispositif de planification de ressources de réseau

Publications (2)

Publication Number Publication Date
EP3823395A1 true EP3823395A1 (fr) 2021-05-19
EP3823395A4 EP3823395A4 (fr) 2021-09-29

Family

ID=69231431

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19844396.2A Pending EP3823395A4 (fr) 2018-08-02 2019-07-30 Procédé et dispositif de planification de ressources de réseau

Country Status (6)

Country Link
US (1) US11452127B2 (fr)
EP (1) EP3823395A4 (fr)
JP (1) JP7128342B2 (fr)
KR (1) KR102665547B1 (fr)
CN (2) CN110798897B (fr)
WO (1) WO2020024926A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112995068B (zh) * 2019-12-12 2024-01-05 华为技术有限公司 数据传输方法、装置及系统
KR102498349B1 (ko) * 2020-11-05 2023-02-10 부산대학교 산학협력단 산업용 저전력 무선 네트워크의 역방향 슬롯 예약을 위한 장치 및 방법

Family Cites Families (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101179361B (zh) * 2006-11-08 2012-01-11 中兴通讯股份有限公司 增强混合自动重传请求指示信道的分配方法
CN101217499B (zh) * 2008-01-21 2010-12-01 中兴通讯股份有限公司 队列调度方法
JP5291951B2 (ja) * 2008-02-27 2013-09-18 京セラ株式会社 無線端末及び無線通信方法
WO2009157829A1 (fr) * 2008-06-25 2009-12-30 Telefonaktiebolaget Lm Ericsson (Publ) Réduction d’un signal parasite
US9100897B2 (en) * 2010-01-12 2015-08-04 Samsung Electronics Co., Ltd. System and method for efficient station identification
US20110228696A1 (en) * 2010-03-19 2011-09-22 Navneet Agarwal Dynamic directed acyclic graph (dag) topology reporting
US10098154B2 (en) * 2010-07-08 2018-10-09 Qualcomm Incorporated Method and apparatus for detection and resolution of resource collision in a peer-to-peer network
EP2676510A1 (fr) * 2011-02-15 2013-12-25 Telefonaktiebolaget L M Ericsson (PUBL) Premier noeud de réseau et deuxième noeud de réseau et procédés correspondants
CN102158966B (zh) * 2011-02-25 2014-04-02 北京交通大学 一种集中式时隙调度方法和系统
US8804561B2 (en) * 2011-05-03 2014-08-12 Telefonaktiebolaget Lm Ericsson (Publ) Physical cell identifier (PCI) adaptation to mitigate interference in heterogeneous cellular network
US10554560B2 (en) * 2014-07-21 2020-02-04 Cisco Technology, Inc. Predictive time allocation scheduling for computer networks
WO2016019291A1 (fr) * 2014-07-31 2016-02-04 Convida Wireless, Llc Gestion de ressources et de planification centralisée efficace dans des réseaux à saut de canal à synchronisation temporelle
US20160373972A1 (en) * 2015-01-30 2016-12-22 Telefonaktiebolaget Lm Ericsson (Publ) Network Nodes and Methods Therein for Handover for Dual Connectivity
WO2017030268A1 (fr) * 2015-08-17 2017-02-23 엘지전자(주) Procédé de transmission et de réception de paquets dans un système de communication sans fil, et appareil associé
US9883382B2 (en) * 2015-10-02 2018-01-30 Cisco Technology, Inc. Dynamically hashed MAC address for transmission in a network
WO2017118489A1 (fr) * 2016-01-08 2017-07-13 Telefonaktiebolaget Lm Ericsson (Publ) Nœuds d'accès radio, et procédés mis en œuvre dans ceux-ci
JP6757414B2 (ja) * 2016-02-01 2020-09-16 テレフオンアクチーボラゲット エルエム エリクソン（パブル） ＵＥのｅＤＲＸの下でのセル検証のための方法および装置
JP2017143466A (ja) * 2016-02-12 2017-08-17 富士通株式会社 無線マルチホップ通信システム，通信ノード，送信ノード，及び経路情報送信方法
WO2017171743A1 (fr) * 2016-03-30 2017-10-05 Ale Usa Inc. Nœud de réseau périphérique et procédé de configuration d'un service dans celui-ci
US10630410B2 (en) * 2016-05-13 2020-04-21 Telefonaktiebolaget Lm Ericsson (Publ) Network architecture, methods, and devices for a wireless communications network
US10849173B2 (en) * 2016-06-16 2020-11-24 Lg Electronics Inc. Method for transmitting/receiving data in wireless communication system and apparatus supporting same
US10320659B2 (en) * 2016-11-28 2019-06-11 Cisco Technology, Inc. Source routed deterministic packet in a deterministic data network
WO2018215046A1 (fr) * 2017-05-22 2018-11-29 Telefonaktiebolaget Lm Ericsson (Publ) Courtier de nuage en périphérie et procédé associé d'attribution de ressources de nuage en périphérie

Also Published As

Publication number Publication date
US20210153233A1 (en) 2021-05-20
KR102665547B1 (ko) 2024-05-10
CN110798897A (zh) 2020-02-14
JP2021532684A (ja) 2021-11-25
CN110798897B (zh) 2021-06-22
WO2020024926A1 (fr) 2020-02-06
CN113472693A (zh) 2021-10-01
JP7128342B2 (ja) 2022-08-30
EP3823395A4 (fr) 2021-09-29
US11452127B2 (en) 2022-09-20
KR20210036946A (ko) 2021-04-05

Similar Documents

Publication Publication Date Title
US20210329487A1 (en) Data transmission method and apparatus, and service switching method and apparatus
EP3461071B1 (fr) Procédé de contrôle de communication et élément de réseau associé
EP3531617B1 (fr) Procédé et appareil de transmission de messages, noeud et support de stockage informatique
EP2992727B1 (fr) Réutilisation d'un groupe de multidiffusion pour le transport multidiffusion d'un réseau cellulaire
US11452127B2 (en) Network resource scheduling method and apparatus
EP3627900B1 (fr) Procédé de commande de transfert de porteuse et passerelle du service
KR20210118170A (ko) 가상 네트워크 그룹의 멀티캐스트 그룹을 위한 멀티캐스트 방법, 장치, 기기 및 시스템
US10812946B2 (en) Reliable link layer multicast in a low power wide area network
CN114938709A (zh) Nr网络中用于侧链路通信的路径选择
WO2019204987A1 (fr) Procédé de transmission d'informations commandé par un nuage, robot, et système de robots en groupe
TW202002701A (zh) 數據按序遞交的方法、網路設備及終端設備
CN112866929A (zh) 一种处理方法、网络节点及存储介质
US8819778B2 (en) Method and system for switching station in centralized WLAN when WPI is performed by access controller
US11012345B2 (en) Data transmission method, device, and system
US9622146B2 (en) Transmitting apparatus, receiving apparatus, managing apparatus, and computer readable medium
WO2022033374A1 (fr) Procédé de connexion à un réseau dans un partage de réseau, dispositif électronique et support de stockage
US20120140629A1 (en) Routing method
KR102350842B1 (ko) 이동 통신 시스템, 방법 및 장치
WO2022222666A1 (fr) Procédé et appareil de communication
US10693794B2 (en) Service processing method, apparatus, and system
CN113348687B (zh) 无线通信中服务框架之间的通信
KR100929436B1 (ko) Ｍａｎｅｔ 식별자를 이용하는 애드혹 통신 방법, 애드혹단말 및 그 방법을 실행하는 프로그램이 기록된 기록매체
US9288068B2 (en) Method and apparatus for transmitting parameters to multicast agent in relayed multicast network
Salheddine et al. SCTP-MANET New Extension of SCTP Protocol for the Optimization of MANET Performances
CN115914082A (zh) 数据传输方法、系统、节点设备、转发设备及存储介质

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20210211

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

A4 Supplementary search report drawn up and despatched

Effective date: 20210830

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 28/02 20090101ALI20210824BHEP

Ipc: H04W 72/12 20090101AFI20210824BHEP

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 40/04 20090101ALI20230821BHEP

Ipc: H04W 28/02 20090101ALI20230821BHEP

Ipc: H04W 72/12 20090101AFI20230821BHEP

INTG Intention to grant announced

Effective date: 20230927

GRAJ Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTC Intention to grant announced (deleted)
INTG Intention to grant announced

Effective date: 20240214