EP3806406B1 - Verfahren und vorrichtung zur gewinnung von informationen über den weiterleitungspfad eines datenpakets in einer segmentleitweglenkung - Google Patents

Verfahren und vorrichtung zur gewinnung von informationen über den weiterleitungspfad eines datenpakets in einer segmentleitweglenkung Download PDF

Info

Publication number
EP3806406B1
EP3806406B1 EP19834260.2A EP19834260A EP3806406B1 EP 3806406 B1 EP3806406 B1 EP 3806406B1 EP 19834260 A EP19834260 A EP 19834260A EP 3806406 B1 EP3806406 B1 EP 3806406B1
Authority
EP
European Patent Office
Prior art keywords
node
path
data packet
list
information
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.)
Active
Application number
EP19834260.2A
Other languages
English (en)
French (fr)
Other versions
EP3806406A4 (de
EP3806406A1 (de
Inventor
Cheng Li
Stefano Previdi
Guoyi Chen
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 EP3806406A1 publication Critical patent/EP3806406A1/de
Publication of EP3806406A4 publication Critical patent/EP3806406A4/de
Application granted granted Critical
Publication of EP3806406B1 publication Critical patent/EP3806406B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/128—Shortest path evaluation for finding disjoint paths
    • H04L45/1287—Shortest path evaluation for finding disjoint paths with disjoint nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/34—Source routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/24—Multipath
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/04—Protocols for data compression, e.g. ROHC

Definitions

  • This application relates to the communications field, and more specifically, to a method and an apparatus for obtaining information about a forwarding path of a data packet in segment routing (segment routing, SR).
  • segment routing segment routing
  • SR is a source routing mechanism. If an SR tunnel is very long, for example, segment routing over IPv6 data plane (internet protocol version segment routing, SRv6), a length of an identifier (Identification, ID) list used to indicate a path through which a data packet passes is very long. An excessively long ID list reduces data packet transmission efficiency, and finally degrades performance of a communications network.
  • US 2014/269422 A1 discloses a method of generating segment routing segment lists wherein a node receives information identifying a path from a first node to a second one and segment identifiers encoding that path are generated and a packet is forwarded along the segment identifiers.
  • US 9 537 769 B2 discloses a method for opportunistic compression of routing segment identifiers including participating in routing of a first data packet through a first node in a network, and subsequently entering into an arrangement with an adjacent node in the network.
  • the first data packet includes a first plurality of routing segment identifiers, and additional data packets to be routed through the first node also include the first plurality of routing segment identifiers.
  • the taught method further includes participating in routing of at least one of the additional data packets using the compression identifier instead of the first plurality of routing segment identifiers.
  • This application provides a method and an apparatus for obtaining information about a forwarding path of a data packet in segment routing, to help reduce a length of an identifier list used to indicate a path through which the data packet passes, help improve data packet transmission efficiency, and finally improve performance of a communications network.
  • Further embodiments of the invention are defined by the dependent claims. Examples and aspects are present for aiding in understanding the background and advantages of the invention.
  • FIG. 1 is a schematic architectural diagram of a communications system to which a method and an apparatus in the embodiments of this application may be applied. It should be understood that FIG. 1 is merely an example. A quantity of nodes that may be included in the communications system to which the method and the apparatus in the embodiments of this application may be applied and a connection relationship between the nodes may not be limited thereto. The nodes may be connected in a wired manner or in a wireless manner.
  • a multiprotocol label switching (multiprotocol label switching, MPLS) data plane or an internet protocol (internet protocol, IP) version 6, IPv6 for short, may be applied to the communications system shown in FIG. 1 .
  • Any one of the nodes included in the communications system to which the method and the apparatus in the embodiments of this application may be applied for example, a node A, a node B, a node C, a node D, a node N, a node O, a node P, and a node Z may be a router, a switch, or any network device that can support SR.
  • a network controller may calculate a path through which a data packet needs to pass.
  • Path information of the path through which the data packet needs to pass may be indicated by using an IP address, a SID, or the like of a node on the path.
  • a forwarding path of a data packet may be referred to as a tunnel of the data packet.
  • a set including data packets may be referred to as a data flow.
  • SR there are mainly three types of SIDs in the SR: a prefix (prefix)-SID, a node (node)-SID, and an adjacency (adjacency)-SID.
  • the adjacency-SID (adj-SID) may be used to forward the data packet to a corresponding adjacent node through a specified link. Therefore, in a scenario in which the data packet needs to be forwarded according to a specified path in SR-TE, each SID in a SID list (list) is an adj-SID.
  • MPLS is used as an example.
  • a forwarding path of a data packet is A->B->C->O->P->Z
  • an adj-SID between the node A and the node B is 9101
  • an adj-SID between the node B and the node C is 9105
  • an adj-SID between the node C and the node O is 9107
  • an adj-SID between the node O and the node P is 9103
  • an adj-SID between the node P and the node Z is 9105
  • a SID list of the data packet may sequentially include ⁇ 9101, 9105, 9107, 9103, 9105 ⁇ .
  • the node A may send the data packet to the node B according to 9101 in the SID list, and the data packet includes a SID list ⁇ 9105, 9107, 9103, 9105 ⁇ .
  • the node B may send the data packet to the node C according to 9105 in the SID list ⁇ 9105, 9107, 9103, 9105 ⁇ , and the data packet includes a SID list ⁇ 9107, 9103, 9105 ⁇ .
  • the node C may send the data packet to the node O according to the SID list ⁇ 9107, 9103, 9105 ⁇ , and the data packet includes a SID list ⁇ 9103, 9105 ⁇ .
  • the node O may send the data packet to the node P according to the SID list ⁇ 9103, 9105 ⁇ , and the data packet includes a SID list ⁇ 9105 ⁇ .
  • the node P may send the data packet to the node Z according to the SID list ⁇ 9105 ⁇ .
  • That information about the forwarding path of the data packet is an adjacent SID list, that is, an identifier (or a label) of the forwarding path of the data packet is an adjacent SID is merely used as an example above to describe a process of forwarding the data packet according to the path information.
  • the information about the forwarding path of the data packet includes other path identifier, a data packet forwarding process is similar.
  • this application provides a new method for obtaining the information about the forwarding path of the data packet in SR.
  • FIG. 2 is a schematic flowchart of a method for obtaining information about a forwarding path of a data packet in SR being part of an embodiment of this application. It should be understood that FIG. 2 shows steps or operations of the communication method, but these steps or operations are merely examples. Other operations or variations of the operations in FIG. 2 may be further performed.
  • S201 Obtain initial information of a forwarding path of a data packet, where the initial information includes a plurality of path identifiers.
  • nodes included in a path through which the data packet needs to pass are calculated based on a constraint condition, and identifiers of these nodes (for example, an IP address of a node, or a SID or another identifier of a node) are used as path identifiers, to form the initial information of the forwarding path of the data packet.
  • the initial information including the identifiers of the nodes may indicate the forwarding path of the data packet.
  • nodes included in a path through which the data packet needs to pass are calculated based on a constraint condition, and an adj-SID between these nodes is used as a path identifier, to form the initial information of the forwarding path of the data packet.
  • the initial information including the adj-SID between these nodes may indicate the forwarding path of the data packet.
  • the nodes included in the path through which the data packet needs to pass are calculated based on the constraint condition such as a bandwidth requirement or a delay requirement.
  • the initial information may be an adj-ID list.
  • the path in FIG. 1 is used as an example, and the initial information may be ⁇ 9101, 9105, 9107, 9103, 9105 ⁇ .
  • the initial information may alternatively be an IP address (address) list.
  • IP address address
  • the path in FIG. 1 is used as an example, and the initial information may be ⁇ IP address A, IP address B, IP address C, IP address O, IP address P, IP address Z ⁇ .
  • the initial information may be an SRv6 SID list, and a SID in the list is an IPv6 address declared as the SID.
  • the path in FIG. 1 is used as an example, and the initial information may be ⁇ A::12, B::23, C::34, O::45, P::56, Z::67 ⁇ .
  • S202 Generate target information of the forwarding path of the data packet based on the initial information, where the target information includes one or more node segment identifiers, at least one node segment identifier in the target information corresponds to a plurality of path identifiers in the initial information, a first path indicated by a plurality of path identifiers in the initial information that correspond to a node segment identifier in the target information is a unique shortest path from a start node on the first path to an end node on the first path in the segment routing, and each node segment identifier that is in the target information and that corresponds to a plurality of path identifiers in the initial information is a node segment identifier of an end node on a path indicated by all the path identifiers corresponding to the node segment identifier.
  • a path indicated by the target information is the same as a path indicated by the initial information.
  • the node segment identifier is expressed as a label.
  • the node segment identifier is expressed as an IPv6 address declared as a SID.
  • the first path indicated by the plurality of path identifiers in the initial information when the first path indicated by the plurality of path identifiers in the initial information is the unique shortest path from the start node on the first path to the end node on the first path, the first path may be indicated by using a node-SID of the end node on the first path instead of the plurality of path identifiers; or when the first path indicated by the plurality of path identifiers in the initial information is not the unique shortest path from the start node on the first path to the end node on the first path, the first path may be indicated by using an adj-SID between the start node and the end node on the first path. In this case, the node-SID of the end node on the first path and/or the adj-SID between the start node and the end node on the first path form the target information.
  • an initial SID list of the data packet includes ⁇ 9101, 9105, 9107, 9103, 9105 ⁇
  • a path "A->B->C" jointly indicated by the first two SIDs that is, "9101” and "9105” is a unique shortest path from the node A to the node C
  • the first SID in a target SID list of the data packet may be a SID of the node C.
  • the fourth SID in a target SID list of the data packet may be a SID of the node Z.
  • the target information of the forwarding path of the data packet may be determined based on the initial information of the forwarding path of the data packet in a plurality of implementations.
  • FIG. 3 shows an implementation in which the target information of the forwarding path of the data packet is determined based on the initial information of the forwarding path of the data packet.
  • S301 Obtain a node list of the forwarding path of the data packet, use the first node in the node list as a start node, use the last node in the node list as an end node, obtain an empty list, and use the empty list as a temporary path information list.
  • S302 Determine whether the start node and the end node are a same node, and perform S308 if the start node and the end node are a same node, or perform S303 if the start node and the end node are not a same node.
  • S303 Determine whether the start node and the end node are adjacent nodes in the node list, and perform S304 if the start node and the end node are adjacent nodes in the node list, or perform S305 if the start node and the end node are not adjacent nodes in the node list.
  • S304 Record an adjacency segment identifier of a path from the start node to the end node in the target information, use the end node as a new start node, use the last node in the node list as a new end node, and re-perform S302.
  • S305 Determine whether a path indicated by all nodes arranged in sequence from the start node to the end node in the node list is a unique shortest path from the start node to the end node in the SR, and perform S306 if the path is the unique shortest path, or perform S307 if the path is not the unique shortest path.
  • the initial information is an adj-SID list used to indicate a path through which the data packet passes and the adj-SID list includes a plurality of adj-SIDs is used as an example below to describe a pseudocode implementation of generating the target information based on the initial information in this application. Executing the pseudocode may implement the method shown in FIG. 3 .
  • strict[] indicates the node list corresponding to the path identified by the initial information
  • loose[] indicates the temporary path information list
  • node indicates the start node
  • last indicates the end node
  • SPT(node, last) indicates to obtain a shortest path from the start node to the end node in the SR
  • adj_sid(node, last) indicates to obtain an adj-SID between node and last in the adj-SID list
  • loose.add(adj_sid(node, last)) indicates to add the adj-SID between node and last in the adj-SID list to loose
  • node_sid(node) indicates to obtain a node-SID of node.
  • the SR shown in FIG. 1 is used as an example.
  • the initial information of the forwarding path of the data packet includes ⁇ 9101, 9105, 9107, 9103, 9105 ⁇ .
  • the target information that may be obtained according to the method shown in FIG. 3 or the foregoing pseudocode may include ⁇ SID of the node C, 9107, SID of the node Z ⁇ .
  • FIG. 4 shows another implementation in which the target information of the forwarding path of the data packet is determined based on the initial information of the forwarding path of the data packet.
  • S401 Obtain a node list of the forwarding path of the data packet, use the first node in the node list as a start node, use the last node in the node list as an end node, obtain an empty list, and use the empty list as a temporary path information list.
  • S402 Determine whether the start node and the end node are a same node, and perform S406 if the start node and the end node are a same node, or perform S403 if the start node and the end node are not a same node.
  • S403 Determine whether a path indicated by all nodes arranged in sequence from the start node to the end node in the node list is a unique shortest path from the start node to the end node in the SR, and perform S404 if the path is the unique shortest path, or perform S405 if the path is not the unique shortest path.
  • S405 Use the first node before the end node in the node list as a new end node, and re-perform S402.
  • S406 Use the temporary path information list as the target information.
  • the initial information is an adj-SID list used to indicate a path through which the data packet passes and the adj-SID list includes a plurality of adj-SIDs is used as an example below to describe a pseudocode implementation of generating the target information based on the initial information in this application. Executing the pseudocode may implement the method shown in FIG. 4 .
  • strict[] indicates the node list corresponding to the path identified by the initial information
  • loose[] indicates the temporary path information list
  • node indicates the start node
  • last indicates the end node
  • SPT(node, last) indicates to obtain a shortest path from the start node to the end node in the SR
  • adj_sid(node, last) indicates to obtain an adj-SID between node and last in the adj-SID list
  • loose.add(adj_sid(node, last)) indicates to add the adj-SID between node and last in the adj-SID list to loose
  • node_sid(node) indicates to obtain a node-SID of node.
  • the SR shown in FIG. 1 is used as an example.
  • the initial information of the forwarding path of the data packet includes ⁇ 9101, 9105, 9107, 9103, 9105 ⁇ .
  • the target information that may be obtained according to the method shown in FIG. 4 or the foregoing pseudocode may include ⁇ SID of the node C, SID of the node O, SID of the node Z ⁇ .
  • the temporary path information list used in the methods shown in FIG. 3 and FIG. 4 is merely an example, and the temporary path information list may not be used to obtain the target information.
  • FIG. 5 shows an example not being part of the present invention in which the target information of the forwarding path of the data packet is determined based on the initial information of the forwarding path of the data packet.
  • S501 Obtain a node list corresponding to a path identified by the initial information, use the first node in the node list as a start node, use the first node after the start node in the node list as an end node, use an empty list as a temporary path information list, and use an empty node as a temporary end node.
  • S502 Determine whether the end node is the last node in the node list, and perform S510 if the end node is the last node in the node list, or perform S503 if the end node is not the last node in the node list.
  • S503 Determine whether a path indicated by all nodes arranged in sequence from the start node to the end node in the node list is a unique shortest path from the start node to the end node in the SR, and perform S504 if the path is the unique shortest path, or perform S505 if the path is not the unique shortest path.
  • S504 Use the end node as the temporary end node, use the first node after the end node in the node list as a new end node, and perform S502.
  • S505 Determine whether the temporary end node is empty, and perform S506 if the temporary end node is not empty, or perform S507 if the temporary end node is empty.
  • S506 Determine whether the temporary end node is an adjacent node of the start node, and perform S508 if the temporary end node is an adjacent node of the start node, or perform S509 if the temporary end node is not an adjacent node of the start node.
  • S507 Add an adjacency segment identifier used to indicate a path from the start node to the end node to the temporary path information list, use the end node as a new start node, use the first node after the end node in the node list as a new end node, and perform S502.
  • S508 Add an adjacency segment identifier used to indicate a path from the start node to the temporary end node to the temporary path information list, use the temporary end node as a new start node, set the temporary end node to be empty, and perform S502.
  • S509 Add a node segment identifier corresponding to the temporary end node to the temporary path information list, use the temporary end node as a new start node, set the temporary end node to be empty, and perform S502.
  • S510 Determine whether the start node is the penultimate node in the node list, and perform S511 if the start node is not the penultimate node in the node list, or perform S512 if the start node is the penultimate node in the node list.
  • S512 Add an adjacency segment identifier used to indicate a path from the start node to the end node to temporary path information, and perform S513.
  • the initial information is an adj-SID list used to indicate a path through which the data packet passes and the adj-SID list includes a plurality of adj-SIDs is used as an example below to describe a pseudocode implementation of generating the target information based on the initial information in this application. Executing the pseudocode may implement the method shown in FIG. 5 .
  • strict[] indicates the node list corresponding to the path identified by the initial information
  • loose[] indicates the temporary path information list
  • node indicates the start node
  • TEN indicates the temporary end node
  • next indicates the end node
  • adj_SID(node, next) indicates to obtain an adj-SID between node and next in an adj-SID list
  • loose.add(adj_SID(node, TENT)) indicates to add an adj-SID between node and TENT in the adj-SID list to loose
  • node_SID(TENT) indicates to obtain a node-SID of TENT
  • loose.add(node_SID(next)) indicates to add the node-SID of TENT to loose.
  • the SR shown in FIG. 1 is used as an example.
  • the initial information of the forwarding path of the data packet includes ⁇ 9101, 9105, 9107, 9103, 9105 ⁇ .
  • the target information that may be obtained according to the method shown in FIG. 5 or the foregoing pseudocode may include ⁇ SID of the node C, 9107, SID of the node Z ⁇ .
  • FIG. 6 shows another example not being part of the invention in which the target information of the forwarding path of the data packet is determined based on the initial information of the forwarding path of the data packet.
  • S601 Obtain a node list corresponding to a path identified by the initial information, use the first node in the node list as a start node, use the first node after the start node in the node list as an end node, use an empty list as a temporary path information list, and use an empty node as a temporary end node.
  • S602 Determine whether the end node is the last node in the node list, and perform S608 if the end node is the last node in the node list, or perform S603 if the end node is not the last node in the node list.
  • S603 Determine whether a path indicated by all nodes arranged in sequence from the start node to the end node in the node list is a unique shortest path from the start node to the end node in the SR, and perform S604 if the path is the unique shortest path, or perform S605 if the path is not the unique shortest path.
  • S604 Use the end node as the temporary end node, use the first node after the end node in the node list as a new end node, and perform S602.
  • S605 Determine whether the temporary end node is empty, and perform S606 if the temporary end node is not empty, or perform S607 if the temporary end node is empty.
  • S606 Add a node segment identifier corresponding to the temporary end node to the temporary path information list, use the temporary end node as a new start node, set the temporary end node to be empty, and perform S602.
  • S607 Add an adjacency segment identifier used to indicate a path from the start node to the end node to the temporary path information list, use the end node as a new start node, use the first node after the end node in the node list as a new end node, and perform S602.
  • S608 Determine whether the start node is the penultimate node in the node list, and perform S609 if the start node is not the penultimate node in the node list, or perform S610 if the start node is the penultimate node in the node list.
  • S610 Add an adjacency segment identifier used to indicate a path from the start node to the end node to temporary path information, and perform S611.
  • S611 Use the temporary path information list as the target information.
  • the initial information is an adj-SID list used to indicate a path through which the data packet passes and the adj-SID list includes a plurality of adj-SIDs is used as an example below to describe a pseudocode implementation of generating the target information based on the initial information in this application. Executing the pseudocode may implement the method shown in FIG. 6 .
  • strict[] indicates the node list corresponding to the path identified by the initial information
  • loose[] indicates the temporary path information list
  • node indicates the start node
  • TEN indicates the temporary end node
  • next indicates the end node
  • adj_SID(node, next) indicates to obtain an adj-SID between node and next in an adj-SID list
  • loose.add(adj_SID(node, TENT)) indicates to add an adj-SID between node and TENT in the adj-SID list to loose
  • node_SID(TENT) indicates to obtain a node-SID of TENT
  • loose.add(node_SID(next)) indicates to add the node-SID of TENT to loose.
  • the SR shown in FIG. 1 is used as an example.
  • the initial information of the forwarding path of the data packet includes ⁇ 9101, 9105, 9107, 9103, 9105 ⁇ .
  • the target information that may be obtained according to the method shown in FIG. 6 or the foregoing pseudocode may include ⁇ SID of the node C, SID of the node O, SID of the node Z ⁇ .
  • the temporary path information list and/or the temporary end node used in the methods shown in FIG. 5 and FIG. 6 is merely an example, and the temporary path information list and/or the temporary end node may not be used to obtain the target information.
  • the methods in FIG. 2 to FIG. 6 may be performed by an ingress node of the path through which the data packet passes, or may be performed by a controller in a network. According to embodiments the method illustrated in FIG. 3 and FIG.4 are performed by an ingress node of the path through which the data packet passes.
  • th method further includes: sending, by the ingress node, the data packet based on the target information, where the data packet includes the target information. If the methods in FIG. 2 to FIG. 6 are performed by the controller of the path through which the data packet passes, the method may further include: sending, by the controller, the target information to the ingress node of the path through which the data packet passes, and sending, by the ingress node, the data packet based on the target information, where the data packet includes the target information.
  • the controller may be a path computation client (PCE), or another server running this algorithm.
  • That "A->B->C->O->P->Z" shown in FIG. 1 is used as the forwarding path of the data packet and the method shown in FIG. 3 are used as an example below to describe a procedure of sending the data packet based on the target information obtained according to the method in this application. It can be learned from the procedure that when the data packet is forwarded based on the target information obtained according to the method in this application, a length of information about a forwarding path of the data packet between nodes can be reduced, to improve communication efficiency.
  • the target information may be ⁇ node-SID of C, adj-SIDs of C to O, node-SID of Z ⁇ . Assuming that a node-SID of C is 1003, and a node-SID of Z is 1008, the target information is ⁇ 1003, 9107, 1008 ⁇ .
  • the node A may search a forwarding table on the node A based on the node-SID of C, learn that a next hop is the node B, and send a data packet to the node B.
  • the data packet carries path information, and the path information is ⁇ node ID of C, adj-IDs of C to O, node ID of Z ⁇ .
  • the node B queries a forwarding table on the node B, learns that a next hop is the node C, and sends a data packet to the node C.
  • the data packet carries path information.
  • the path information may be ⁇ node ID of C, adj-IDs of C to O, node ID of Z ⁇ , or may be ⁇ adj-IDs of C to O, node ID of Z ⁇ .
  • the node C After receiving the data packet from the node B, the node C queries a forwarding table on the node C based on "adj-IDs of C to O", finds that a next hop is the node O, and sends a data packet to the node O.
  • the data packet includes path information, and the path information is ⁇ node ID of Z ⁇ .
  • the node O After receiving the data packet from the node B, the node O queries a forwarding table on the node O, determines that a next hop is the node P, and sends a data packet to the node P.
  • the data packet includes path information, and the path information is ⁇ node ID of Z ⁇ .
  • the node P After receiving the data packet from the node O, the node P queries a forwarding table on the node P, determines that a next hop is the node Z, and sends a data packet to the node Z.
  • the initial information is the SRv6 SID list, and the SIDs in the list are IPv6 addresses declared as the SIDs.
  • the target information may be ⁇ node ID of C, adj-IDs of C to O, node ID of Z ⁇ .
  • the target information may be ⁇ C::1, C::34, Z::1 ⁇ .
  • the node A sends a data packet to the node B based on C::1.
  • the data packet includes path information, and the path information includes ⁇ C::1, C::34, Z::1 ⁇ .
  • a subsequent forwarding procedure complies with the SRv6 forwarding procedure. For simplicity, details are not described herein again.
  • corresponding node-SIDs in the target information can be used to indicate all path identifiers in the initial information that correspond to the unique shortest path, so that a quantity of path identifiers in the target information can be reduced to a maximum extent, that is, a length of the target information can be reduced.
  • a maximum length of the target information that can be accepted may be determined based on a requirement, and then the target information is determined based on the maximum length.
  • the maximum length of the target information that can be accepted may be determined based on a maximum insertion capability of the controller or the ingress node in terms of a path identifier (or referred to as a label).
  • path identifiers in the initial information may be replaced with corresponding node-SIDs in the target information, and the quantity of path identifiers in the target information has been less than or equal to the maximum insertion capability of the controller or the ingress node, whether a path identifier in the initial information still needs to be indicated by using a corresponding node-SID may not need to be further detected.
  • FIG. 7 is schematic block diagram of an apparatus 700 for obtaining information about a forwarding path of a data packet according to an embodiment of this application. It should be understood that the apparatus 700 is merely an example.
  • the apparatus in this embodiment of this application may further include another module or unit, or include a module with a function similar to that of each module in FIG. 7 , or does not necessarily include all modules in FIG. 7 .
  • An obtaining module 710 is configured to obtain initial information of the forwarding path of the data packet.
  • the initial information includes a plurality of path identifiers.
  • a generation module 720 is configured to generate target information of the forwarding path of the data packet based on the initial information, where the target path information includes one or more node segment identifiers, at least one node segment identifier in the target information corresponds to a plurality of path identifiers in the initial information, a first path indicated by a plurality of path identifiers in the initial information that correspond to a node segment identifier in the target information is a unique shortest path from a start node on the first path to an end node on the first path in the segment routing, and each node segment identifier that is in the target information and that corresponds to a plurality of path identifiers in the initial information is a node segment identifier of an end node on a path indicated by all the path identifiers corresponding to the node segment identifier.
  • step 1 Obtain a node list of the forwarding path of the data packet, use the i th node in the node list as a start node, use the j th node in the node list as an end node, where a value of i is 1, and a value of j is a length value of the node list, and perform step 2;
  • step 2 Determine whether the start node and the end node are a same node, and end the procedure if the start node and the end node are a same node, or perform step 3 if the start node and the end node are not a same node;
  • step 3 Determine whether a path indicated by all nodes arranged in sequence from the start node to the end node in the node list is a unique shortest path from the start node to the end node in the segment routing, and perform step 4 if the path is the unique shortest path, or perform step 5 if the path is not the unique shortest path
  • the apparatus 700 is an ingress node of the forwarding path of the data packet.
  • the apparatus 700 further includes a sending module 730, configured to send the data packet based on the target information.
  • the data packet includes the target information.
  • the apparatus 700 is a controller of the segment routing.
  • the apparatus 700 further includes a sending module 730, configured to send the target information to an ingress node on the forwarding path of the data packet.
  • the apparatus 700 may be configured to perform the steps of the methods described in FIG. 3 to FIG. 64. For brevity, details are not described herein again.
  • FIG. 8 is a schematic structural diagram of an apparatus for obtaining information about a forwarding path of a data packet wherein a method according to an embodiment of this application can be implemented. It should be understood that an apparatus 800 shown in FIG. 8 is merely an example. The apparatus may further include another module or unit, or include a module with a function similar to that of each module in FIG. 8 .
  • the apparatus 800 may include one or more processors 810, one or more memories 820, a receiver 830, and a transmitter 840.
  • the receiver 830 and the transmitter 840 may be integrated into a transceiver.
  • the memory 820 is configured to store program code executed by the processor 810.
  • the memory 820 may be integrated into the processor 810, or the processor 810 is coupled to one or more memories 820, and is configured to invoke an instruction in the memory 820.
  • the processor 810 may be configured to implement an operation or a step that can be implemented by the obtaining module 710 and the generation module 720 in FIG. 7
  • the transmitter 840 may be configured to implement an operation or a step that can be implemented by the sending module 730 in FIG. 7 .
  • the disclosed system, apparatus, and method may be implemented in other manners.
  • the described apparatus embodiment is merely an example.
  • division into units is merely logical function division and may be other division in actual implementation.
  • a plurality of units or components may be combined or integrated into another system, or some features may be ignored or not performed.
  • the displayed or discussed mutual couplings or direct couplings or communication connections may be implemented by using some interfaces.
  • the indirect couplings or communication connections between the apparatuses or units may be implemented in electronic, mechanical, or other forms.
  • the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on a plurality of network units. Some or all of the units may be selected based on actual requirements to achieve the objectives of the solutions of the embodiments.
  • function units in the embodiments of this application may be integrated into one processing unit, or each of the units may exist alone physically, or two or more units are integrated into one unit.
  • the processor may be a central processing unit (central processing unit, CPU), or may further be another general purpose processor, a digital signal processor (digital signal processor, DSP), an application-specific integrated circuit (application specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA), or another programmable logical device, discrete gate or transistor logical device, discrete hardware component, or the like.
  • the general purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like.
  • the functions When the functions are implemented in the form of a software function unit and sold or used as an independent product, the functions may be stored in a computer-readable storage medium. Based on such an understanding, the technical solutions of this application essentially, or the part contributing to the prior art, or some of the technical solutions may be implemented in a form of a software product.
  • the computer software product is stored in a storage medium, and includes several instructions for instructing a computer device (which may be a personal computer, a server, or a network device) to perform all or some of the steps of the methods described in the embodiments of this application.
  • the foregoing storage medium includes: any medium that can store program code, such as a USB flash drive, a removable hard disk, a read-only memory (read-only memory, ROM), a random access memory (random access memory, RAM), a magnetic disk, or an optical disc.
  • program code such as a USB flash drive, a removable hard disk, a read-only memory (read-only memory, ROM), a random access memory (random access memory, RAM), a magnetic disk, or an optical disc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Claims (6)

  1. Verfahren zur Erlangung von Informationen über einen Weiterleitungspfad eines Datenpakets bei einer Segmentleitweglenkung, wobei das Verfahren von einem Eingangsknoten auf dem Weiterleitungspfad des Datenpakets durchgeführt wird und umfasst:
    Erlangen (S201) von Erstinformationen des Weiterleitungspfads des Datenpakets, wobei die Erstinformationen eine Mehrzahl von Pfadkennungen umfassen;
    Erzeugen (S202) von Zielinformationen des Weiterleitungspfads des Datenpakets basierend auf den Erstinformationen, wobei die Zielinformationen eine oder mehrere Knotensegmentkennungen umfassen, mindestens eine Knotensegmentkennung in den Zielinformationen einer Mehrzahl von Pfadkennungen in den Erstinformationen entspricht, ein erster Pfad, der durch eine Mehrzahl von Pfadkennungen in den Erstinformationen angezeigt wird, die einer Knotensegmentkennung in den Zielinformationen entsprechen, ein eindeutiger kürzester Pfad von einem Anfangsknoten auf dem ersten Pfad zu einem Endknoten auf dem ersten Pfad bei der Segmentleitweglenkung ist und jede Knotensegmentkennung, die in den Zielinformationen ist und die einer Mehrzahl von Pfadkennungen in den Erstinformationen entspricht, eine Knotensegmentkennung eines Endknotens auf einem Pfad ist, der durch alle Pfadkennungen angezeigt wird, die der Knotensegmentkennung entsprechen; und
    Senden des Datenpakets basierend auf den Zielinformationen, wobei das Datenpaket die Zielinformationen umfasst; und
    dadurch gekennzeichnet, dass
    das Erzeugen der Zielinformationen des Weiterleitungspfads des Datenpakets basierend auf den Erstinformationen umfasst:
    Schritt 1: Erlangen (S301, S302) einer Knotenliste des Weiterleitungspfads des Datenpakets, Verwenden des i-ten Knotens in der Knotenliste als einen Anfangsknoten, Verwenden des j-ten Knotens in der Knotenliste als einen Endknoten, wobei ein Wert von i 1 ist und ein Wert von j ein Längenwert der Knotenliste ist, und Ausführen von Schritt 2;
    Schritt 2: Bestimmen (S302, S402), ob der Anfangsknoten und der Endknoten ein gleicher Knoten sind, und Beenden der Prozedur, wenn der Anfangsknoten und der Endknoten ein gleicher Knoten sind, und Ausführen von Schritt 3, wenn der Anfangsknoten und der Endknoten nicht ein gleicher Knoten sind;
    Schritt 3: Bestimmen (S305, S403), ob ein Pfad, der durch alle Knoten angezeigt wird, die in Reihenfolge vom Anfangsknoten zum Endknoten in der Knotenliste angeordnet sind, ein eindeutiger kürzester Knoten vom Anfangsknoten zum Endknoten bei der Segmentleitweglenkung ist, und Ausführen von Schritt 4, wenn der Pfad der eindeutige kürzeste Pfad ist, und Ausführen von Schritt 5, wenn der Pfad nicht der eindeutige kürzeste Pfad ist;
    Schritt 4: Aufzeichnen einer Knotensegmentkennung des Endknotens in den Zielinformationen, Aktualisieren des Wertes von i, so dass er gleich dem Wert von j ist, Aktualisieren des Wertes von j, so dass er gleich dem Längenwert der Knotenliste ist, Verwenden des i-ten Knotens in der Knotenliste als den Anfangsknoten, Verwenden des j-ten Knotens in der Knotenliste als den Endknoten und neuerliches Ausführen von Schritt 2; und
    Schritt 5: Aktualisieren des Wertes von j auf j - 1, Verwenden des j-ten Knotens in der Knotenliste als den Endknoten und neuerliches Ausführen von Schritt 2.
  2. Verfahren nach Anspruch 1, wobei es sich bei den Erstinformationen um eine Adjazenzsegmentkennungsliste handelt und die Pfadkennung in den Erstinformationen eine Adjazenzsegmentkennung ist.
  3. Verfahren nach einem der Ansprüche 1 bis 2, wobei das Verfahren ferner umfasst:
    Empfangen der Zielinformationen über den Weiterleitungspfad des Datenpakets von einer Steuerung.
  4. Vorrichtung (700) zum Erlangen von Informationen über einen Weiterleitungspfad eines Datenpakets bei einer Segmentleitweglenkung, umfassend:
    ein Erlangungsmodul (710), das zum Erlangen von Erstinformationen des Weiterleitungspfads des Datenpakets konfiguriert ist, wobei die Erstinformationen eine Mehrzahl von Pfadkennungen umfassen; und
    eine Erzeugungsmodul (720), das zum Erzeugen von Zielinformationen des Weiterleitungspfads des Datenpakets basierend auf den Erstinformationen konfiguriert ist, wobei die Zielpfadinformationen eine oder mehrere Knotensegmentkennungen umfassen, mindestens eine Knotensegmentkennung in den Zielinformationen einer Mehrzahl von Pfadkennungen in den Erstinformationen entspricht, ein erster Pfad, der durch eine Mehrzahl von Pfadkennungen in den Erstinformationen angezeigt wird, die einer Knotensegmentkennung in den Zielinformationen entsprechen, ein eindeutiger kürzester Weg von einem Anfangsknoten auf dem ersten Pfad zu einem Endknoten auf dem ersten Pfad bei der Segmentleitweglenkung ist und jede Knotensegmentkennung, die in den Zielinformationen ist und die einer Mehrzahl von Pfadkennungen in den Erstinformationen entspricht, eine Knotensegmentkennung eines Endknotens auf einem Pfad ist, der durch alle Pfadkennungen angezeigt wird, die der Knotensegmentkennung entsprechen; und
    dadurch gekennzeichnet, dass
    das Erzeugungsmodul (720) konfiguiert ist, die Zielinformationen des Weiterleitungspfads des Datenpakets basierend auf den Erstinformationen zu erzeugen, indem es die folgenden Schritte ausführt:
    Schritt 1: Erlangen einer Knotenliste des Weiterleitungspfads des Datenpakets, Verwenden des i-ten Knotens in der Knotenliste als einen Anfangsknoten, Verwenden des j-ten Knotens in der Knotenliste als einen Endknoten, wobei ein Wert von i 1 ist und ein Wert von j ein Längenwert der Knotenliste ist, und Ausführen von Schritt 2;
    Schritt 2: Bestimmen, ob der Anfangsknoten und der Endknoten ein gleicher Knoten sind, und Beenden der Prozedur, wenn der Anfangsknoten und der Endknoten ein gleicher Knoten sind, und Ausführen von Schritt 3, wenn der Anfangsknoten und der Endknoten nicht ein gleicher Knoten sind;
    Schritt 3: Bestimmen, ob ein Pfad, der durch alle Knoten angezeigt wird, die in Reihenfolge vom Anfangsknoten zum Endknoten in der Knotenliste angeordnet sind, ein eindeutiger kürzester Knoten vom Anfangsknoten zum Endknoten bei der Segmentleitweglenkung ist, und Ausführen von Schritt 4, wenn der Pfad der eindeutige kürzeste Pfad ist, und Ausführen von Schritt 5, wenn der Pfad nicht der eindeutige kürzeste Pfad ist;
    Schritt 4: Aufzeichnen einer Knotensegmentkennung des Endknotens in den Zielinformationen, Aktualisieren des Wertes von i, so dass er gleich dem Wert von j ist, Aktualisieren des Wertes von j, so dass er gleich dem Längenwert der Knotenliste ist, Verwenden des i-ten Knotens in der Knotenliste als den Anfangsknoten, Verwenden des j-ten Knotens in der Knotenliste als den Endknoten und neuerliches Ausführen von Schritt 2; und
    Schritt 5: Aktualisieren des Wertes von j auf j - 1, Verwenden des j-ten Knotens in der Knotenliste als den Endknoten und neuerliches Ausführen von Schritt 2.
  5. Vorrichtung (700) nach Anspruch 4, wobei es sich bei den Erstinformationen um eine Adjazenzsegmentkennungsliste handelt und die Pfadkennung in den Erstinformationen eine Adjazenzsegmentkennung ist.
  6. Vorrichtung (700) nach einem der Ansprüche 4 bis 5, wobei die Vorrichtung ein Eingangsknoten auf dem Weiterleitungspfad des Datenpakets ist; und
    die Vorrichtung ferner ein Sendemodul umfasst, das zum Senden des Datenpakets basierend auf den Zielinformationen konfiguriert ist, wobei das Datenpaket die Zielinformationen umfasst; oder
    wobei die Vorrichtung eine Steuerung der Segmentleitweglenkung ist; und
    die Vorrichtung ferner ein Sendemodul umfasst, das zum Senden der Zielinformationen an einen Eingangsknoten auf dem Weiterleitungspfad des Datenpakets konfiguriert ist.
EP19834260.2A 2018-07-09 2019-06-23 Verfahren und vorrichtung zur gewinnung von informationen über den weiterleitungspfad eines datenpakets in einer segmentleitweglenkung Active EP3806406B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810744644.XA CN110708243B (zh) 2018-07-09 2018-07-09 段路由中获取数据包的转发路径的信息的方法和装置
PCT/CN2019/092446 WO2020010999A1 (zh) 2018-07-09 2019-06-23 段路由中获取数据包的转发路径的信息的方法和装置

Publications (3)

Publication Number Publication Date
EP3806406A1 EP3806406A1 (de) 2021-04-14
EP3806406A4 EP3806406A4 (de) 2021-07-21
EP3806406B1 true EP3806406B1 (de) 2024-01-24

Family

ID=69142263

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19834260.2A Active EP3806406B1 (de) 2018-07-09 2019-06-23 Verfahren und vorrichtung zur gewinnung von informationen über den weiterleitungspfad eines datenpakets in einer segmentleitweglenkung

Country Status (4)

Country Link
US (1) US11677657B2 (de)
EP (1) EP3806406B1 (de)
CN (1) CN110708243B (de)
WO (1) WO2020010999A1 (de)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110971433B (zh) * 2018-09-29 2022-02-22 华为技术有限公司 获取SRv6隧道信息的方法、设备和系统
CN113141339A (zh) * 2020-01-20 2021-07-20 华为技术有限公司 一种sr报文传输方法、装置及系统
CN113315702A (zh) * 2020-02-26 2021-08-27 华为技术有限公司 一种传输节点标识的方法、设备及系统
CN113382452B (zh) * 2020-03-09 2023-04-07 中国移动通信有限公司研究院 路径建立方法、数据传输方法、装置、网络节点及存储介质
CN113438160B (zh) * 2020-03-23 2024-05-31 中兴通讯股份有限公司 路由方法、路由装置及计算机可读存储介质
CN115865769A (zh) * 2021-09-23 2023-03-28 华为技术有限公司 报文处理方法、网络设备及系统
CN114363236B (zh) * 2021-12-20 2023-10-20 鹏城实验室 一种基于显式路径的流量控制方法及相关设备

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9537769B2 (en) * 2013-03-15 2017-01-03 Cisco Technology, Inc. Opportunistic compression of routing segment identifier stacks
US9537718B2 (en) * 2013-03-15 2017-01-03 Cisco Technology, Inc. Segment routing over label distribution protocol
US9325609B2 (en) 2013-08-23 2016-04-26 Futurewei Technologies, Inc. Segmented source routing in a network
US9369387B2 (en) * 2013-10-24 2016-06-14 Cisco Technology, Inc. Segment routing based wide area network orchestration in a network environment
CN105282028A (zh) * 2014-06-05 2016-01-27 中兴通讯股份有限公司 一种报文传输方法、节点及路径管理服务器
US9807001B2 (en) * 2014-07-17 2017-10-31 Cisco Technology, Inc. Segment routing using a remote forwarding adjacency identifier
US10757012B2 (en) * 2014-12-23 2020-08-25 Telefonaktiebolaget Lm Ericsson (Publ) Path computation in a segment routing network
CN105871721B (zh) * 2015-01-19 2020-05-05 中兴通讯股份有限公司 一种段路由处理方法、处理装置及发送装置
EP3459214B1 (de) * 2016-05-20 2020-07-08 Telefonaktiebolaget LM Ericsson (PUBL) Verfahren und vorrichtung für segmentrouting und rsvp-te-routing in transport-sdn-netzwerken
CN108156077B (zh) * 2016-12-02 2021-11-12 中兴通讯股份有限公司 一种基于IPv6数据平面的分段路由转发方法及装置
US10326688B2 (en) * 2017-05-25 2019-06-18 Nokia Of America Corporation Method and apparatus for instantiating a path with the minimum number of segments
US10742599B2 (en) * 2017-06-30 2020-08-11 Juniper Networks, Inc. Conflict resolution in segment routing
CN109218189B (zh) * 2017-07-03 2022-04-29 中兴通讯股份有限公司 跨域的路径的标识信息的确定方法、装置及存储介质

Also Published As

Publication number Publication date
EP3806406A4 (de) 2021-07-21
CN110708243B (zh) 2021-08-13
EP3806406A1 (de) 2021-04-14
US11677657B2 (en) 2023-06-13
CN110708243A (zh) 2020-01-17
WO2020010999A1 (zh) 2020-01-16
US20210135979A1 (en) 2021-05-06

Similar Documents

Publication Publication Date Title
EP3806406B1 (de) Verfahren und vorrichtung zur gewinnung von informationen über den weiterleitungspfad eines datenpakets in einer segmentleitweglenkung
US9680745B2 (en) Multi-domain source routed forwarding based on collaborating network controllers
US6968393B1 (en) Method and apparatus for an attribute oriented routing update
JP5956006B2 (ja) ネットワークにおけるメッセージおよび計算オーバーヘッドの軽減
JP5648737B2 (ja) 通信装置および通信方法
JP6989621B2 (ja) パケット伝送方法、エッジデバイス及び機械可読記憶媒体
JP6085263B2 (ja) 中継ノード及び経路制御方法
US11140098B2 (en) Load balancing on multi-chip network switch without full bi-section bandwidth
EP3338416B1 (de) Reduzierung der überflutung von verbindungszustandsänderungen in netzwerken
EP3442178B1 (de) Routensuchverfahren und vorrichtung
EP3886384B1 (de) Verfahren zur aktualisierung einer route in einem netzwerk, netzwerkvorrichtungen und system
US20220224631A1 (en) Routing Control Method and Apparatus
CN108028801B (zh) 一种基于sdn的arp实现方法及装置
JP2016082479A (ja) 通信装置、通信方法およびプログラム
US20150288595A1 (en) Control apparatus, communication system, control information creation method, and program
US20170111260A1 (en) Trill isis-based route calculation method and device
US7764692B1 (en) Bypass of routing protocol filtering in a multi-subnet network
CN112995053A (zh) 发送报文的方法及装置
US20220150167A1 (en) Bier packet processing method, network device, and system
CN108965122B (zh) 路由选路方法、设备及计算机可读存储介质
JP6822032B2 (ja) 処理決定装置、処理決定方法、及び、処理決定プログラム
JP2010154130A (ja) 経路確認装置、経路確認システム、経路確認方法およびそのプログラム
JP2010206736A (ja) ネットワークシステム、その通信方法、ルータ、およびプログラム
EP3163812A1 (de) Verfahren und vorrichtung zur schichtüberkreuzenden wegherstellung
JP6581062B2 (ja) 通信装置、システム、方法およびプログラム

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

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: 20210108

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

AX Request for extension of the european patent

Extension state: BA ME

A4 Supplementary search report drawn up and despatched

Effective date: 20210621

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/721 20130101AFI20210615BHEP

Ipc: H04L 12/715 20130101ALI20210615BHEP

Ipc: H04L 12/723 20130101ALI20210615BHEP

Ipc: H04L 29/06 20060101ALI20210615BHEP

Ipc: H04L 12/751 20130101ALI20210615BHEP

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20220810

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602019045737

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012721000

Ipc: H04L0045120000

Ref country code: DE

Ipc: H04L0045120000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 69/04 20220101ALI20230728BHEP

Ipc: H04L 45/00 20220101ALI20230728BHEP

Ipc: H04L 45/50 20220101ALI20230728BHEP

Ipc: H04L 45/02 20220101ALI20230728BHEP

Ipc: H04L 45/12 20220101AFI20230728BHEP

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

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20230907

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

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

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602019045737

Country of ref document: DE

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20240124

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240124