WO2022188488A1 - Procédé et appareil d'établissement de chemin, nœud et support de stockage lisible par ordinateur - Google Patents

Procédé et appareil d'établissement de chemin, nœud et support de stockage lisible par ordinateur Download PDF

Info

Publication number
WO2022188488A1
WO2022188488A1 PCT/CN2021/136141 CN2021136141W WO2022188488A1 WO 2022188488 A1 WO2022188488 A1 WO 2022188488A1 CN 2021136141 W CN2021136141 W CN 2021136141W WO 2022188488 A1 WO2022188488 A1 WO 2022188488A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
algorithm
node
algorithm information
target prefix
Prior art date
Application number
PCT/CN2021/136141
Other languages
English (en)
Chinese (zh)
Inventor
彭少富
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2022188488A1 publication Critical patent/WO2022188488A1/fr

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
    • 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
    • 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

Definitions

  • the embodiments of the present application relate to, but are not limited to, the field of communications technologies, and in particular, relate to a path establishment method and device, node, and computer-readable storage medium thereof.
  • IGP Flex-algo proposes a constraint-based computing network that allows network elements in the IGP (Interior Gateway Protocol) domain
  • IGP Interior Gateway Protocol
  • Prefix SID prefix segment identifier
  • SRv6 Segment Routing IPv6
  • segment routing is applied to the MPLS forwarding plane
  • SR-MPLS Segment Routing MPLS
  • segment routing is applied to the MPLS forwarding plane
  • the Locator of the IPv6 Forwarding Plane guides packets along constraint-based paths.
  • the embodiments of the present application provide a method for establishing a path, an apparatus, a node, and a computer-readable storage medium thereof.
  • an embodiment of the present application provides a method for establishing a path, which is applied to a first border node of a first IGP domain, where the first border node is connected to a second border node of a second IGP domain, and the method includes: : obtain routing information from the first IGP domain, where the routing information includes first algorithm information and first target prefix information corresponding to the first algorithm information; send a first BGP packet to the The second border node advertises the routing information, so that the second border node establishes a connection between the first target prefix and the first target prefix according to the first algorithm information and the first target prefix information in the routing information.
  • the shortest forwarding path corresponding to the algorithm information.
  • an embodiment of the present application further provides a path establishment device, including: a memory, a processor, and a computer program stored in the memory and running on the processor, and the processor implements the computer program when the processor executes the computer program.
  • a path establishment device including: a memory, a processor, and a computer program stored in the memory and running on the processor, and the processor implements the computer program when the processor executes the computer program.
  • an embodiment of the present application further provides a node, including the device for establishing a path as described in the second aspect above.
  • an embodiment of the present application further provides a computer-readable storage medium storing computer-executable instructions, where the computer-executable instructions are used to execute the above path establishment method.
  • FIG. 1 is a schematic diagram of a network topology for executing a path establishment method provided by an embodiment of the present application
  • FIG. 2 is a flowchart of a path establishment method provided by an embodiment of the present application.
  • FIG. 3 is a schematic diagram of a field structure of a newly added algorithm extension field provided by an embodiment of the present application.
  • FIG. 4 is a flowchart of a path establishment method provided by another embodiment of the present application.
  • FIG. 5 is a flowchart of a path establishment method provided by another embodiment of the present application.
  • FIG. 6 is a flowchart of a path establishment method provided by another embodiment of the present application.
  • FIG. 7 is a flowchart of a path establishment method provided by another embodiment of the present application.
  • FIG. 8 is a flowchart of a path establishment method provided by another embodiment of the present application.
  • FIG. 9 is a schematic diagram of a path establishment apparatus provided by an embodiment of the present application.
  • FIG. 10 is a schematic diagram of a node provided by an embodiment of the present application.
  • the present application provides a path establishment method, a device, a node, and a computer-readable storage medium.
  • the first boundary node of the first IGP domain obtains information including first algorithm information and a first algorithm corresponding to the first algorithm information.
  • the first algorithm information and the first target prefix information are advertised to the second border node of the second IGP domain through the first BGP message, so that the The first target prefix information corresponding to the first algorithm information can be advertised in a second IGP domain different from the first IGP domain, so that the second border node can establish a The shortest forwarding path corresponding to the first algorithm information to the first target prefix in the first IGP domain, thereby realizing the establishment of a cross-domain algorithm-based shortest forwarding path, and filling up the algorithm-related cross-domain forwarding path in the related technical solution.
  • the technical blank of path creation is thereby realizing the establishment of a cross-domain algorithm-based shortest forwarding path, and filling up the algorithm-related cross-domain forwarding path in the related
  • FIG. 1 is a schematic diagram of a network topology for executing a path establishment method provided by an embodiment of the present application.
  • the network topology includes a first node 110 , a second node 120 , a third node 130 , a fourth node 140 , a fifth node 150 , a sixth node 160 , a seventh node 170 and an eighth node 180 .
  • the first node 110, the second node 120, the third node 130, and the fourth node 140 all belong to the first IGP domain
  • the fifth node 150, the sixth node 160, the seventh node 170, and the eighth node 180 all belong to the first IGP domain.
  • the fourth node 140 is the first border node in the first IGP domain
  • the fifth node 150 is the second border node in the second IGP domain
  • a connection is established between the fourth node 140 and the fifth node 150
  • Border Gateway Protocol (BGP) neighbor relationship There is a Border Gateway Protocol (BGP) neighbor relationship.
  • BGP Border Gateway Protocol
  • the second node 120 is connected to the fourth node 140
  • the fifth node 150 is connected to the seventh node 170
  • the first node 110, the second node 120, the third node 130 and the fourth node 140 are connected end to end
  • the fifth node 150 , the sixth node 160 , the seventh node 170 and the eighth node 180 are connected end to end.
  • the first node 110, the second node 120 and the fourth node 140 belong to the first flexible algorithm plane, and the second node 120, the third node 130 and the fourth node 140 belong to the second flexible algorithm plane ;
  • the fifth node 150, the sixth node 160 and the seventh node 170 belong to the third flexible algorithm plane, and the fifth node 150, the seventh node 170 and the eighth node 180 belong to the fourth flexible algorithm plane, wherein the first flexible algorithm plane and the third flexible algorithm plane may have the same algorithm information, as shown in Figure 1, the first flexible algorithm plane and the third flexible algorithm plane are both Flex-algo 128; and the second flexible algorithm plane
  • the algorithm plane and the fourth flexible algorithm plane may also have the same algorithm information. As shown in FIG. 1 , the second flexible algorithm plane and the fourth flexible algorithm plane are both Flex-algo 129.
  • the first node 110 , the second node 120 , the third node 130 , the fourth node 140 , the fifth node 150 , the sixth node 160 , the seventh node 170 and the eighth node 180 may all be network devices such as routers or switches. Forward the message.
  • the fourth node 140 and the fifth node 150 can send BGP packets to each other, so that the target prefix information from the first IGP domain can be advertised to the second node through BGP packets.
  • IGP domain so that nodes in the second IGP domain can establish the shortest forwarding path to the first IGP domain according to the target prefix information, or enable the target prefix information from the second IGP domain to be advertised to the first IGP domain through BGP packets.
  • an IGP domain so that nodes in the first IGP domain can establish the shortest forwarding path to the second IGP domain according to the target prefix information.
  • the network topology and application scenarios described in the embodiments of the present application are for the purpose of illustrating the technical solutions of the embodiments of the present application more clearly, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application.
  • the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.
  • topology shown in FIG. 1 does not constitute a limitation on the embodiments of the present application, and may include more or less components than shown, or combine some components, or different components layout.
  • FIG. 2 is a flowchart of a path establishment method provided by an embodiment of the present application.
  • the path establishment method may be applied to a first border node of a first IGP domain, for example, the first border node in the network topology shown in FIG. 1 .
  • the path establishment method includes, but is not limited to, steps S101 and S102.
  • Step S101 Obtain routing information from a first IGP domain, where the routing information includes first algorithm information and first target prefix information corresponding to the first algorithm information.
  • the first algorithm information is the algorithm information defined in IGP Flex-algo.
  • the first algorithm information is used to distinguish virtual topologies created by IGP Flex-algo. Virtual topologies with the same algorithm information can be classified as the same. A virtual topology, and different virtual topologies have different algorithm information.
  • the routing information obtained from the first IGP domain may be obtained in different implementations, which are not specifically limited in this embodiment.
  • the routing information from the first IGP domain may be routing information sent by other nodes in the first IGP domain, such as routing information sent by the first node 110 , the second node 120 or the third node 130 in FIG. 1 .
  • It can also be the local route (such as loopback route) of the first border node or the routing information (such as aggregated route) generated according to the local strategy, such as the local route (such as loopback route) of the fourth node 140 in FIG. 1 or according to the local strategy Generated routing information (eg, aggregated routes).
  • Step S102 Advertise the routing information to the second border node through the first BGP message, so that the second border node establishes a connection between the first target prefix and the first algorithm according to the first algorithm information and the first target prefix information in the routing information.
  • the first border node when the first border node obtains routing information from the first IGP domain, and the routing information includes the first algorithm information and the first target prefix information corresponding to the first algorithm information, then the first border The node may construct a first BGP packet according to the first algorithm information and the first target prefix information in the routing information, and then advertise the routing information to the second border node through the first BGP packet, that is, through the first BGP packet.
  • the first algorithm information and the first target prefix information are notified to the second border node, so that after receiving the first BGP packet, the second border node can, according to the first algorithm information carried in the first BGP packet and the first target prefix information, to establish the shortest forwarding path corresponding to the first algorithm information to the first target prefix.
  • the first target prefix information is the route reachability information of the first target prefix. Since the first target prefix information comes from the first IGP domain, that is, the first target prefix guided by the first target prefix information belongs to The first IGP domain, therefore, this embodiment can establish a cross-domain shortest forwarding path corresponding to the first algorithm information from the second IGP domain to the first IGP domain, that is, it can realize the establishment of a cross-domain algorithm-based shortest forwarding path , so that the technical gap created by the algorithm-related cross-domain path in the related technical solutions can be filled.
  • the first BGP packet is set with an algorithm extension field, and the algorithm extension field in the first BGP packet carries the first algorithm information.
  • the algorithm extension field in the first BGP packet is described below with a specific example.
  • an extended community attribute (that is, an algorithm extension field) can be added in the first BGP message, and the newly added algorithm extension field is defined as Algorithm Extended Community, which is used in the notification
  • the first BGP packet carries the first algorithm information.
  • the structure of the newly added algorithm extension field is shown in Figure 3.
  • the newly added algorithm extension field includes the following field structure:
  • Type Occupies 1 byte. When the value is 0x03, it indicates that the extended field of this algorithm is a transferable extended community attribute.
  • Sub-Type occupies 1 byte, indicating that the extension field of this algorithm is Algorithm Extended Community.
  • Flags occupies 1 byte, the meaning is to be determined, and the corresponding flag bits can be extended and defined according to the actual usage.
  • Algorithm occupies 1 byte, indicating the corresponding algorithm information. Among them, when the value is 0, it indicates that the constraint condition corresponding to the algorithm information is the Shortest Path First algorithm based on link metric; when the value is 1, it indicates the constraint corresponding to the algorithm information.
  • the condition is the Strict Shortest Path First algorithm based on link metric; when the value is 128 to 255, it indicates that the algorithm information is customized flexible algorithm information.
  • Reserved occupies 4 bytes, the meaning is to be determined, and the corresponding content can be expanded and defined according to the actual usage.
  • the first border node of the first IGP domain obtains the route including the first algorithm information and the first target prefix information corresponding to the first algorithm information information
  • the first algorithm information and the first target prefix information can be advertised to the second border node of the second IGP domain through the first BGP message, so that the information from the first IGP domain corresponds to the first algorithm information
  • the information of the first target prefix can be advertised to a second IGP domain different from the first IGP domain, so that the second border node of the second IGP domain can, according to the first algorithm information and the first target prefix information, establish to The shortest forwarding path of the first target prefix in the first IGP domain, and the shortest forwarding path corresponds to the first algorithm information. Therefore, the present embodiment can realize the establishment of the shortest forwarding path based on the cross-domain algorithm, so as to fill the technical gap in the creation of the cross-domain path related to the algorithm in the related technical solution.
  • the path establishment method may further include, but is not limited to, steps S103 and S104.
  • Step S103 Acquire a second BGP packet sent by the second border node, where the second BGP packet carries second algorithm information and second target prefix information corresponding to the second algorithm information.
  • the second algorithm information is the algorithm information defined in IGP Flex-algo.
  • the second algorithm information is used to distinguish virtual topologies created by IGP Flex-algo. Virtual topologies with the same algorithm information can be classified as the same. A virtual topology, and different virtual topologies have different algorithm information.
  • the second border node since a BGP neighbor relationship is established between the first border node of the first IGP domain and the second border node of the second IGP domain, when the second border node advertises to the outside world, it carries the second algorithm information and is related to the second border node.
  • the second BGP packet of the second target prefix information corresponding to the second algorithm information is the second BGP packet
  • the first border node can obtain the second BGP packet, so that the second BGP packet can be obtained in the subsequent steps according to the second BGP packet carried in the second BGP packet.
  • the algorithm information and the second target prefix information perform related path creation processing.
  • the second algorithm information and the second target prefix information carried in the second BGP packet may be local routing information from the second border node, or may be other nodes in the second IGP domain.
  • the routing information is not specifically limited in this embodiment.
  • the second algorithm information and the second target prefix information carried in the second BGP packet may be local routing information (such as loopback routes or aggregated routes) from the fifth node 150 in FIG. Routing information of the sixth node 160, the seventh node 170 or the eighth node 180 in 1.
  • Step S104 according to the second algorithm information and the second target prefix information, establish the shortest forwarding path corresponding to the second algorithm information to the second target prefix.
  • the first border node when the first border node obtains the second BGP packet sent by the second border node, and the second BGP packet carries the second algorithm information and the second target corresponding to the second algorithm information prefix information, the first border node can establish the shortest forwarding path corresponding to the second algorithm information to the second target prefix according to the second algorithm information and the second target prefix information in the second BGP packet.
  • the second target prefix information is the route reachability information of the second target prefix. Since the second target prefix information comes from the second IGP domain, that is, the second target prefix guided by the second target prefix information belongs to The second IGP domain, therefore, this embodiment can establish a cross-domain shortest forwarding path corresponding to the second algorithm information from the first IGP domain to the second IGP domain, that is, the establishment of a cross-domain algorithm-based shortest forwarding path can be realized , so that the technical gap created by the algorithm-related cross-domain path in the related technical solutions can be filled.
  • an algorithm extension field is set in the second BGP packet, and the algorithm extension field in the second BGP packet carries the second algorithm information.
  • an extended community attribute ie, an algorithm extension field
  • an extended community attribute ie, an algorithm extension field
  • an algorithm extension field may be added to the second BGP message, so as to carry the second algorithm information when advertising the second BGP message.
  • the specific structure and specific meaning of the newly added algorithm extension field in the second BGP message are the same as the specific structure and specific meaning of the newly added algorithm extension field in the first BGP message as shown in FIG. 3 .
  • the meanings are the same.
  • the specific structure and specific meaning of the new algorithm extension field in the second BGP message please refer to the algorithm extension added in the first BGP message in the embodiment shown in FIG. 3 .
  • the specific structure and specific meaning of the fields are explained here, which will not be repeated here.
  • the path establishment method may further include, but is not limited to, steps S105 and S106.
  • Step S105 constructing a first IGP packet, where the first IGP packet carries the second algorithm information and the second target prefix information.
  • step S103 of the embodiment shown in FIG. 4 the second BGP packet sent by the second border node is obtained, and the second BGP packet carries the second algorithm information and is related to the second BGP packet.
  • the second target prefix information corresponding to the second algorithm information therefore, the first border node can construct a first IGP packet based on the second algorithm information and the second target prefix information, so that the first IGP packet carries the second target prefix information.
  • the algorithm information and the second target prefix information so that subsequent steps can flood the second algorithm information and the second target prefix information in the first IGP domain through the first IGP message.
  • the first IGP message may have different implementations, which are not specifically limited in this embodiment.
  • the first IGP message may be an ISIS (Intermediate System to Intermediate System Protocol) message, or may be an OSPF (Open Shortest Path First, Open Shortest Path First) message, such as an IPv4-based network OSPFv2 packets or OSPFv3 packets based on IPv6 networks.
  • ISIS Intermediate System to Intermediate System Protocol
  • OSPF Open Shortest Path First, Open Shortest Path First
  • IPv4-based network OSPFv2 packets IPv4-based network OSPFv2 packets or OSPFv3 packets based on IPv6 networks.
  • Step S106 flood the second algorithm information and the second target prefix information in the first IGP domain through the first IGP message, so that other nodes in the first IGP domain establish The shortest forwarding path corresponding to the second algorithm information to the second target prefix.
  • the first border node can flood the first IGP packet in the first IGP domain , that is, the purpose of flooding the second algorithm information and the second target prefix information is achieved by flooding the first IGP packet. Since the second algorithm information and the second target prefix information can be flooded in the first IGP domain, other nodes in the first IGP domain can obtain the second algorithm information and the second target prefix information.
  • the first Any node in an IGP domain can use the second algorithm information and the second target prefix information to establish the shortest forwarding path corresponding to the second algorithm information to the second target prefix according to its local policy, so as to realize The establishment of a cross-domain algorithm-based shortest forwarding path fills the technical gap of the algorithm-related cross-domain path creation in the related technical solutions.
  • the path establishment method may further include, but is not limited to, step S107 , step S108 and step S109 .
  • steps S107 to S109 in this embodiment and steps S105 to S106 in the above-mentioned embodiment as shown in FIG. 5 are mutually parallel technical solutions.
  • Step S107 Obtain third algorithm information mapped from the second algorithm information.
  • the first border node when the flexible algorithm planes to which the first border node and the second border node belong have different algorithm information, in order to realize the establishment of a cross-domain shortest forwarding path based on the algorithm information, the first border node is configured as follows: After acquiring the second BGP packet that is sent by the second border node and carries the second algorithm information and the second target prefix information in step S103 of the embodiment shown in FIG. 4 , the first border node can send the second algorithm information A mapping process is performed to obtain third algorithm information formed by mapping the second algorithm information, so that a mapping relationship between two flexible algorithm planes can be formed.
  • mapping relationship between the second algorithm information and the third algorithm information is not specifically limited in this embodiment.
  • This domain, the algorithm information of this domain>” such a mapping relationship.
  • Step S108 constructing a second IGP packet, where the second IGP packet carries the third algorithm information and the second target prefix information.
  • the first boundary node can be based on the third algorithm information and
  • the second target prefix information constructs a second IGP packet, so that the second IGP packet carries the third algorithm information and the second target prefix information, so that subsequent steps can pass the second IGP domain in the first IGP domain.
  • the IGP message floods the third algorithm information and the second target prefix information.
  • the second IGP message may have different implementations, which are not specifically limited in this embodiment.
  • the second IGP message may be an ISIS message, an OSPF message, or an OSPFv3 message supporting IPv6.
  • Step S109 flood the third algorithm information and the second target prefix information in the first IGP domain through the second IGP message, so that other nodes in the first IGP domain establish The shortest forwarding path corresponding to the third algorithm information to the second target prefix.
  • the first border node can flood the second IGP packet in the first IGP domain , that is, the purpose of flooding the third algorithm information and the second target prefix information is achieved by flooding the second IGP packet. Since the third algorithm information and the second target prefix information can be flooded in the first IGP domain, other nodes in the first IGP domain can obtain the third algorithm information and the second target prefix information. Therefore, the third algorithm information and the second target prefix information can be obtained. Any node in an IGP domain can use the third algorithm information and the second target prefix information to establish the shortest forwarding path corresponding to the third algorithm information to the second target prefix according to its local policy.
  • the third algorithm information is formed by mapping the second algorithm information. Therefore, the shortest forwarding path to the second target prefix established by the nodes in the first IGP domain using the third algorithm information and the second target prefix information can be connected with the second target prefix. Algorithm information corresponds. In the first border node, the path corresponding to the third algorithm information and the path corresponding to the second algorithm information can be spliced together, thereby realizing the establishment of a cross-domain algorithm-based shortest forwarding path, filling the relevant technical solutions. The technical gap created by algorithm-related cross-domain paths in .
  • the path establishment method may further include, but is not limited to, steps S110 and S111.
  • steps S110 to S111 in this embodiment are the same as steps S105 to S106 in the above embodiment shown in FIG. 5 and steps S107 to S109 in the above embodiment shown in FIG. 6 .
  • steps S110 to S111 in this embodiment are the same as steps S105 to S106 in the above embodiment shown in FIG. 5 and steps S107 to S109 in the above embodiment shown in FIG. 6 .
  • steps S110 to S111 in this embodiment are the same as steps S105 to S106 in the above embodiment shown in FIG. 5 and steps S107 to S109 in the above embodiment shown in FIG. 6 .
  • Step S110 constructing a third BGP packet, where the third BGP packet carries the second algorithm information and the second target prefix information.
  • step S103 of the embodiment shown in FIG. 4 the second BGP packet sent by the second border node is obtained, and the second BGP packet carries the second algorithm information and is related to the second BGP packet.
  • the second target prefix information corresponds to the second algorithm information. Therefore, the first border node can construct a third BGP packet based on the second algorithm information and the second target prefix information, so that the third BGP packet carries the second target prefix. algorithm information and the second target prefix information, so that subsequent steps can advertise the third BGP message to other border nodes in the first IGP domain to advertise the second algorithm information and the second target prefix information.
  • an extended community attribute ie, an algorithm extension field
  • an extended community attribute ie, an algorithm extension field
  • an algorithm extension field may be added to the third BGP message to carry the second algorithm information when advertising the third BGP message.
  • the specific structure and specific meaning of the newly added algorithm extension field in the third BGP message are the same as the specific structure and specific meaning of the newly added algorithm extension field in the first BGP message as shown in FIG. 3 .
  • the meanings are the same.
  • the specific structure and specific meaning of the new algorithm extension field in the third BGP message refer to the algorithm extension added in the first BGP message in the embodiment shown in FIG. 3 .
  • the specific structure and specific meaning of the fields are explained here, which will not be repeated here.
  • step S111 the second algorithm information and the second target prefix information are notified to other border nodes in the first IGP domain through a third BGP message, so that other border nodes in the first IGP domain are based on the second algorithm information and the second target prefix information.
  • Prefix information establishing the shortest forwarding path corresponding to the second algorithm information to the second target prefix.
  • the first border node can send the third BGP message to the first IGP domain through the third BGP message.
  • Other border nodes advertise the second algorithm information and the second target prefix information.
  • other border nodes in the first IGP domain receive the third BGP packet, they can use the second algorithm information and the second algorithm information according to their local policies.
  • the second target prefix information establishes the shortest forwarding path corresponding to the second algorithm information to the second target prefix, thereby realizing the establishment of the shortest forwarding path based on the cross-domain algorithm and filling the algorithm-related aspects in the related technical solutions. The technical gap created by the cross-domain path.
  • the first border node when constructing the third BGP packet, may set the content of the next hop field in the third BGP packet as the address of the first border node.
  • the third BGP message advertised by the first border node After receiving the third BGP message advertised by the first border node, other border nodes of the other The forwarding table entry of the two target prefixes, and the forwarding table entry will iterate to the outer forwarding path corresponding to the second algorithm information whose next hop is the first border node, so as to realize the forwarding from the first IGP domain.
  • the path establishment method may further include, but is not limited to, step S112 , step S113 and step S114 .
  • steps S112 to S114 in this embodiment are the same as steps S105 to S106 in the above embodiment shown in FIG. 5
  • steps S110 to S111 in the embodiment shown in FIG. 7 are all parallel technical solutions.
  • Step S112 Obtain fourth algorithm information mapped from the second algorithm information.
  • the first border node when the flexible algorithm planes to which the first border node and the second border node belong have different algorithm information, in order to realize the establishment of a cross-domain shortest forwarding path based on the algorithm information, the first border node is configured as follows: After acquiring the second BGP packet that is sent by the second border node and carries the second algorithm information and the second target prefix information in step S103 of the embodiment shown in FIG. 4 , the first border node can send the second algorithm information A mapping process is performed to obtain fourth algorithm information formed by mapping the second algorithm information, so that a mapping relationship between two flexible algorithm planes can be formed.
  • mapping relationship between the second algorithm information and the fourth algorithm information is not specifically limited in this embodiment.
  • This domain, the algorithm information of this domain>” such a mapping relationship.
  • Step S113 constructing a fourth BGP packet, where the fourth BGP packet carries the fourth algorithm information and the second target prefix information.
  • the first boundary node can be based on the fourth algorithm information and
  • the second target prefix information constructs a fourth BGP packet, so that the fourth BGP packet carries the fourth algorithm information and the second target prefix information, so that subsequent steps can send information to other border nodes in the first IGP domain
  • the fourth BGP message is advertised to advertise the fourth algorithm information and the second target prefix information.
  • an extended community attribute ie, an algorithm extension field
  • an algorithm extension field may be added to the fourth BGP message, so as to carry the fourth algorithm information when advertising the fourth BGP message.
  • the specific structure and specific meaning of the newly added algorithm extension field in the fourth BGP message are the same as the specific structure and specific meaning of the newly added algorithm extension field in the first BGP message as shown in FIG. 3 .
  • the meanings are the same.
  • the specific structure and specific meaning of the new algorithm extension field in the fourth BGP message please refer to the algorithm extension added in the first BGP message in the embodiment shown in FIG. 3 .
  • the specific structure and specific meaning of the fields are explained here, which will not be repeated here.
  • step S114 the fourth algorithm information and the second target prefix information are notified to other border nodes in the first IGP domain through the fourth BGP message, so that other border nodes in the first IGP domain are based on the fourth algorithm information and the second target prefix information.
  • Prefix information establishing the shortest forwarding path corresponding to the fourth algorithm information to the second target prefix.
  • the first border node can send the information to the first BGP packet to the user in the first IGP domain through the fourth BGP packet.
  • Other border nodes advertise the fourth algorithm information and the second target prefix information.
  • other border nodes in the first IGP domain receive the fourth BGP message, they can use the fourth algorithm information and the second target prefix according to their local policies.
  • the second target prefix information establishes the shortest forwarding path corresponding to the fourth algorithm information to the second target prefix, and since the fourth algorithm information is formed by the mapping of the second algorithm information, therefore, in the first IGP domain
  • the shortest forwarding path to the second target prefix established by other border nodes using the fourth algorithm information and the second target prefix information can correspond to the second algorithm information.
  • the path corresponding to the fourth algorithm information and the path corresponding to the second algorithm information can be spliced together, thereby realizing the establishment of the shortest cross-domain forwarding path based on the algorithm, and filling the relevant technical solutions.
  • the first border node may set the content of the next hop field in the fourth BGP packet as the address of the first border node.
  • the first border node After receiving the fourth BGP message advertised by the first border node, other border nodes of the other The forwarding entry of the two target prefixes, and the forwarding entry will iterate to the outer forwarding path corresponding to the fourth algorithm information whose next hop is the first border node, so as to realize the forwarding from the first IGP domain.
  • the network is a pure IP network
  • a first IGP domain and a second IGP domain are deployed in the network
  • the first IGP domain includes a first node 110 , a second node 120 , a second IGP domain
  • the second IGP domain includes a fifth node 150, a sixth node 160, a seventh node 170 and an eighth node 180
  • the second node 120 and the fourth node 140 are both the first IGP domain
  • the fifth node 150 and the seventh node 170 are the boundary nodes of the second IGP domain.
  • a first flexible algorithm plane, a second flexible algorithm plane, a third flexible algorithm plane, and a fourth flexible algorithm plane are deployed in the network, wherein the first flexible algorithm plane and the third flexible algorithm plane are both Flex-algo 128, and the third flexible algorithm plane is Both the second flexible algorithm plane and the fourth flexible algorithm plane are Flex-algo 129, that is, the Flex-algo 128 plane in the first IGP domain and the Flex-algo 128 plane in the second IGP domain constitute an end-to-end cross-domain
  • the Flex-algo 128 plane, the Flex-algo 129 plane in the first IGP domain and the Flex-algo 129 plane in the second IGP domain constitute an end-to-end cross-domain Flex-algo 129 plane.
  • the first node 110, the second node 120 and the fourth node 140 belong to the Flex-algo 128 plane in the first IGP domain
  • the fifth node 150, the sixth node 160 and the seventh node 170 belong to the Flex-algo 128 plane in the second IGP domain
  • Flex-algo 128 plane, second node 120, third node 130 and fourth node 140 belong to Flex-algo 129 plane in the first IGP domain
  • fifth node 150, seventh node 170 and eighth node 180 belong to Flex-algo 129 plane in the second IGP domain.
  • BGP neighbor relationships are established respectively to advertise that prefixes related to the public network are available. information.
  • the seventh node 170 is configured with two loopback routes, which are denoted as loopback-E1 and loopback-E2 respectively, and these two loopback routes belong to the Flex-algo 128 plane and the Flex-algo 129 plane respectively, then in the fifth A route to loopback-E1 will be generated on node 150 , sixth node 160 and seventh node 170 , and a route to loopback-E2 will be generated on fifth node 150 , seventh node 170 and eighth node 180 .
  • the fifth The node 150 can announce the Prefix loopback-E1 and the Prefix loopback-E2 to the fourth node 140 through a BGP message.
  • the Prefix loopback-E1 and the Prefix loopback-E2 are announced, the communication with the Flex-algo 128 plane will be lost.
  • the fourth node 140 does not know which Flex-algo plane in the first IGP domain to import loopback-E1 or loopback-E2 into.
  • the fifth node 150 announces the Prefix loopback-E1 to the fourth node 140 through a BGP packet, it carries the algorithm information corresponding to the Flex-algo 128 plane, and announces the Prefix loopback to the fourth node 140 When -E2, it carries the algorithm information corresponding to the Flex-algo 129 plane.
  • the fourth node 140 can directly import the Prefix loopback-E1 carried in the BGP packet and corresponding to the Flex-algo 128 plane into the first IGP domain In the Flex-algo 128 plane, that is, when the fourth node 140 continues to announce the Prefix loopback-E1 to the first node 110 and the third node 130, it will directly carry the algorithm information corresponding to the Flex-algo 128 plane, so that the Prefix loopback-E1 only Effective in the Flex-algo 128 plane in the first IGP domain.
  • the fourth node 140 also announces the Prefix loopback-E2 and the algorithm information corresponding to the Flex-algo 129 plane to the first node 110 and the third node 130, so that the Prefix loopback-E2 is only in the Flex in the first IGP domain -algo Effective in 129 planes.
  • the first node 110 and the third node 130 After the first node 110 and the third node 130 receive the information advertised by the fourth node 140, the first node 110 and the third node 130 will continue to notify the second node 120 of the Prefix loopback- corresponding to the Flex-algo 128 plane. E1 and Prefix loopback-E2 corresponding to the Flex-algo 129 plane. Finally, on the second node 120, the shortest path forwarding table corresponding to the Flex-algo 128 plane to the Prefix loopback-E1 and the shortest path forwarding table corresponding to the Flex-algo 129 plane to the Prefix loopback-E2 will be generated item, so as to realize the end-to-end algorithm-based shortest cross-domain forwarding path.
  • the network topology in this example is similar to the network topology in Example 1 above, except that in the network topology of this example, the first flexible algorithm plane is Flex-algo 228, and the second flexible algorithm plane is Flex-algo 229.
  • the fourth node 140 imports the Prefix loopback-E1 carried in the BGP packet and corresponding to the Flex-algo 128 plane to the fourth node 140.
  • the fourth node 140 will first map the algorithm information corresponding to the Flex-algo 128 plane to the algorithm information corresponding to the Flex-algo 228 plane, and then map the algorithm information corresponding to the Flex-algo 228 plane to the first node 110 and the third node.
  • the network topology in this example is similar to the network topology in Example 1 above, except that the network in this example is an SRv6 network.
  • the fifth node 150 When the fifth node 150 announces the Prefix LOC-E1 to the fourth node 140 through a BGP message, it carries the algorithm information corresponding to the Flex-algo 128 plane, and when it announces the Prefix LOC-E2 to the fourth node 140, it carries the algorithm information corresponding to the Flex-algo 128 plane. Algorithm information corresponding to the algo 129 plane.
  • the fourth node 140 imports the Prefix LOC-E1 carried in the BGP message and corresponding to the Flex-algo 128 plane into the Flex-algo 128 of the first IGP domain.
  • the algo 128 plane that is, when the fourth node 140 continues to announce the Prefix LOC-E1 to the first node 110 and the third node 130, it will directly carry the algorithm information corresponding to the Flex-algo 128 plane, so that the Prefix LOC-E1 is only in the first node 110 and the third node 130. Effective in the Flex-algo 128 plane in an IGP domain.
  • the fourth node 140 will also announce the Prefix LOC-E2 and the algorithm information corresponding to the Flex-algo 129 plane to the first node 110 and the third node 130, so that the Prefix LOC-E2 is only in the Flex in the first IGP domain -algo Effective in 129 planes.
  • the first node 110 and the third node 130 After the first node 110 and the third node 130 receive the information advertised by the fourth node 140, the first node 110 and the third node 130 will continue to notify the second node 120 of the Prefix LOC- corresponding to the Flex-algo 128 plane E1 and Prefix LOC-E2 corresponding to the Flex-algo 129 plane. Finally, a shortest path forwarding table corresponding to the Flex-algo 128 plane to Prefix LOC-E1 and a shortest path forwarding table corresponding to the Flex-algo 129 plane to Prefix LOC-E2 will be generated on the second node 120 item, so as to realize the end-to-end algorithm-based shortest cross-domain forwarding path.
  • the network topology in this example is similar to the network topology in Example 1 above, the only difference is that the network in this example is an SR-MPLS network.
  • Prefix-SID-E1 Assume that two Prefix-SIDs are configured on the seventh node 170, which are denoted as SID-E1 and SID-E2 respectively. These two Prefix-SIDs belong to the Flex-algo 128 plane and the Flex-algo 129 plane respectively.
  • the loopback route (loopback-E) of node 170 is flooded within the second IGP domain. Then the MPLS label forwarding path to Prefix-SID SID-E1 will be generated on the fifth node 150, the sixth node 160 and the seventh node 170, and the fifth node 150, the seventh node 170 and the eighth node 180 An MPLS label forwarding path to Prefix-SID SID-E2 will be generated.
  • the fifth node 150 announces the Prefix loopback-E and its Prefix-SID SID-E1 to the fourth node 140 through a BGP message, it carries the algorithm information corresponding to the Flex-algo 128 plane, and announces the Prefix loopback-E to the fourth node 140.
  • E and its Prefix-SID SID-E2 carry the algorithm information corresponding to the Flex-algo 129 plane.
  • the fourth node 140 imports the Prefix-SID SID-E1 carried in the BGP packet and corresponding to the Flex-algo 128 plane into the first IGP domain In the Flex-algo 128 plane, that is, when the fourth node 140 continues to announce the Prefix loopback-E and its Prefix-SID SID-E1 to the first node 110 and the third node 130, it will directly carry the algorithm corresponding to the Flex-algo 128 plane information, so that the Flex-algo 128 plane in the first IGP domain establishes the MPLS label forwarding entry to the Prefix-SID SID-E1.
  • the fourth node 140 also directly carries the algorithm information corresponding to the Flex-algo 129 plane when it announces the Prefix loopback-E and its Prefix-SID SID-E2 to the first node 110 and the third node 130, so that the The Flex-algo 129 plane in an IGP domain establishes an MPLS label forwarding entry to Prefix-SID SID-E2.
  • the first node 110 and the third node 130 After the first node 110 and the third node 130 receive the information advertised by the fourth node 140, the first node 110 and the third node 130 will continue to notify the second node 120 of Prefix loopback-E and its Prefix-SID SID- E1, and carry the algorithm information corresponding to the Flex-algo 128 plane in the announcement, and announce the Prefix loopback-E and its Prefix-SID SID-E2 to the second node 120, and carry the corresponding Flex-algo 129 plane in the announcement algorithm information.
  • an MPLS label forwarding entry corresponding to the Flex-algo 128 plane to the Prefix-SID SID-E1 and a corresponding Flex-algo 129 plane to the Prefix-SID SID-E2 will be generated on the second node 120 MPLS label forwarding entry, so as to achieve end-to-end algorithm-based cross-domain shortest forwarding path.
  • the network topology in this example is similar to the network topology in the above-mentioned example 4, the difference is that: after the fourth node 140 receives the BGP packet from the fifth node 150, the fourth node 140 does not carry the BGP packet with the Flex -
  • the Prefix-SID SID-E1 corresponding to the algo 128 plane is imported into the Flex-algo 128 plane of the first IGP domain, and the Prefix-SID SID-E1 corresponding to the Flex-algo 128 plane is advertised through a new BGP message to the second node 120 .
  • the fourth node 140 When the fourth node 140 receives the BGP packet from the fifth node 150, the fourth node 140 first obtains the Prefix-SID SID-E1 carried in the BGP packet and corresponds to the Flex-algo 128 plane, and then constructs a structure carrying the BGP packet.
  • Prefix-SID is a new BGP message of SID-E1, and in the new BGP message, the content of the next hop field is set to the address information of the fourth node 140 itself, and then the new BGP message is sent to the
  • the second node 120 advertises the Prefix-SID SID-E1 corresponding to the Flex-algo 128 plane.
  • the second node 120 After the second node 120 obtains the new BGP packet from the fourth node 140 through the BGP neighbor relationship, the second node 120 generates an MPLS label forwarding entry to Prefix-SID SID-E1, and the MPLS label forwards The published item will continue to iterate to the outer forwarding path corresponding to the Flex-algo 128 plane whose next hop is the fourth node 140; in addition, the second node 120 will also generate an MPLS label forwarding to Prefix-SID SID-E2. and the MPLS label forwarding entry will continue to iterate to the outer forwarding path corresponding to the Flex-algo 129 plane whose next hop is the fourth node 140.
  • an MPLS label forwarding entry corresponding to the Flex-algo 128 plane to the Prefix-SID SID-E1 and a corresponding Flex-algo 129 plane to the Prefix-SID SID-E2 will be generated on the second node 120 MPLS label forwarding entry, so as to achieve end-to-end algorithm-based cross-domain shortest forwarding path.
  • an embodiment of the present application further provides a path establishment apparatus 200 , the path establishment apparatus 200 includes: a memory 201 , a processor 202 , and the path establishment apparatus 200 is stored in the memory 201 and can run on the processor 202 . computer program.
  • the processor 202 and the memory 201 may be connected by a bus or other means.
  • the memory 201 can be used to store non-transitory software programs and non-transitory computer-executable programs. Additionally, memory 201 may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory 201 may include memory located remotely from processor 202, which may be connected to processor 202 through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
  • the path establishment apparatus 200 in this embodiment may be applied to, for example, the fourth node 140 or the fifth node 150 in the embodiment shown in FIG. 1 , and the path establishment apparatus 200 in this embodiment can constitute FIG. 1 A part of the network topology in the illustrated embodiment, these embodiments all belong to the same inventive concept, therefore, these embodiments have the same implementation principle and technical effect, and will not be described in detail here.
  • the non-transitory software programs and instructions required to implement the path establishment method of the above embodiment are stored in the memory, and when executed by the processor, execute the path establishment method in the above embodiment, for example, execute the above-described method in FIG. 2 .
  • an embodiment of the present application further provides a node, and the node 300 includes the path establishing apparatus 200 in the embodiment shown in FIG. 9 .
  • the node 300 in this embodiment includes the path establishing apparatus 200 in the embodiment shown in FIG. 9 , and can be applied as the fourth node 140 or the fifth node 150 in the embodiment shown in FIG. 1 .
  • the node 300 in this embodiment can form a part of the network topology in the embodiment shown in FIG. 1 , and these embodiments all belong to the same inventive concept, so these embodiments have the same implementation principle and technical effect, which will not be repeated here. Details.
  • an embodiment of the present application also provides a computer-readable storage medium, where the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are executed by a processor or controller, for example, by the above-mentioned Executed by a processor in the device embodiment, the above-mentioned processor can execute the path establishment method in the above-mentioned embodiment, for example, execute the above-described method steps S101 to S102 in FIG. 2 and method steps S103 to S104 in FIG. 4 . , the method steps S105 to S106 in FIG. 5 , the method steps S107 to S109 in FIG. 6 , the method steps S110 to S111 in FIG. 7 , and the method steps S112 to S114 in FIG. 8 .
  • the embodiments of the present application include: acquiring routing information from a first IGP domain, where the routing information includes first algorithm information and first target prefix information corresponding to the first algorithm information;
  • the node advertises the routing information, so that the second border node establishes the shortest forwarding path corresponding to the first algorithm information to the first target prefix according to the first algorithm information and the first target prefix information in the routing information.
  • the first BGP advertises the first algorithm information and the first target prefix information to the second border node of the second IGP domain, so that the first target prefix information corresponding to the first algorithm information from the first IGP domain can be advertised into a second IGP domain different from the first IGP domain, so that the second border node can establish the shortest forwarding path to the first target prefix in the first IGP domain according to the first algorithm information and the first target prefix information , and the shortest forwarding path corresponds to the first algorithm information. Therefore, the solutions provided by the embodiments of the present application can realize the establishment of the shortest forwarding path based on the cross-domain algorithm, thereby filling the technical gap of the algorithm-related cross-domain path creation in the related solution technology.
  • Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cartridges, magnetic tape, magnetic disk storage or other magnetic storage devices, or may Any other medium used to store desired information and which can be accessed by a computer.
  • communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and can include any information delivery media, as is well known to those of ordinary skill in the art .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un procédé et un appareil d'établissement de chemin, un nœud et un support de stockage lisible par ordinateur. Le procédé d'établissement de chemin comprend : l'acquisition d'informations de routage d'un premier domaine IGP, les informations de routage comprenant des premières informations d'algorithme et des premières informations de préfixe cible correspondant aux premières informations d'algorithme (S101) ; et la notification, à un second nœud de frontière, des informations de routage au moyen d'un premier message BGP de sorte que le second nœud de frontière établit, selon les premières informations d'algorithme et les premières informations de préfixe cible dans les informations de routage, le chemin de transfert le plus court vers un premier préfixe cible, ledit chemin correspondant aux premières informations d'algorithme (S102).
PCT/CN2021/136141 2021-03-09 2021-12-07 Procédé et appareil d'établissement de chemin, nœud et support de stockage lisible par ordinateur WO2022188488A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110255472.1A CN115051945A (zh) 2021-03-09 2021-03-09 路径建立方法及其装置、节点、计算机可读存储介质
CN202110255472.1 2021-03-09

Publications (1)

Publication Number Publication Date
WO2022188488A1 true WO2022188488A1 (fr) 2022-09-15

Family

ID=83156792

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/136141 WO2022188488A1 (fr) 2021-03-09 2021-12-07 Procédé et appareil d'établissement de chemin, nœud et support de stockage lisible par ordinateur

Country Status (2)

Country Link
CN (1) CN115051945A (fr)
WO (1) WO2022188488A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108833283A (zh) * 2018-06-27 2018-11-16 中国人民解放军国防科技大学 一种软件定义的跨域多路径路由规划方法
CN111490937A (zh) * 2019-01-28 2020-08-04 华为技术有限公司 一种建立跨域转发路径的方法、装置及系统
WO2020187308A1 (fr) * 2019-03-20 2020-09-24 Huawei Technologies Co., Ltd. Procédé de routage optimal dans un réseau igp srmpl inter-zone, nœuds et système associés

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108833283A (zh) * 2018-06-27 2018-11-16 中国人民解放军国防科技大学 一种软件定义的跨域多路径路由规划方法
CN111490937A (zh) * 2019-01-28 2020-08-04 华为技术有限公司 一种建立跨域转发路径的方法、装置及系统
WO2020187308A1 (fr) * 2019-03-20 2020-09-24 Huawei Technologies Co., Ltd. Procédé de routage optimal dans un réseau igp srmpl inter-zone, nœuds et système associés

Also Published As

Publication number Publication date
CN115051945A (zh) 2022-09-13

Similar Documents

Publication Publication Date Title
CN106572023B (zh) 一种实现比特位索引显示复制的方法及比特位转发路由器
US8589573B2 (en) Technique for preventing routing loops by disseminating BGP attribute information in an OSPF-configured network
US8989048B2 (en) Node system ID change in link state protocol network
WO2018188464A1 (fr) Procédés et dispositifs de réalisation d'ioam, et support de stockage
US7483387B2 (en) Hierarchical label distribution for inter-area summarization of edge-device addresses
CN107968750B (zh) 报文传输方法、装置及节点
US11909596B2 (en) Connections and accesses for hierarchical path computation element (PCE)
EP3148131B1 (fr) Procédé et appareil de libération d'informations d'adresse
EP2869512A1 (fr) Filtrage de zone dynamique pour des protocoles de routage à état de lien
US20060164975A1 (en) Loop prevention technique for MPLS using two labels
US11671352B2 (en) Message sending method, binding relationship advertising method, apparatus, and storage medium
US11240063B2 (en) Methods, nodes and computer readable media for tunnel establishment per slice
CN113285876B (zh) 路由方法、路由装置及计算机可读存储介质
CN113228572A (zh) 用于分段路由（sr）代理段标识（sid）的内部网关协议（igp）
WO2022127586A1 (fr) Procédé de traitement de messages, nœud et support de stockage lisible par ordinateur
WO2018177273A1 (fr) Procédé et appareil de traitement sur la base d'informations de bier
WO2020244304A1 (fr) Procédé permettant d'envoyer des informations d'acheminement, procédé et appareil permettant d'acheminer une sélection
WO2022188488A1 (fr) Procédé et appareil d'établissement de chemin, nœud et support de stockage lisible par ordinateur
WO2021189993A1 (fr) Procédé de routage, appareil de routage et support de stockage lisible par ordinateur
WO2022088967A1 (fr) Procédé et appareil de détermination de saut suivant
WO2022042610A1 (fr) Procédé de traitement d'informations, dispositif de commande de réseau, nœud et support de stockage lisible par ordinateur
WO2023016550A1 (fr) Procédé d'envoi d'itinéraire et dispositif
CN113438160B (zh) 路由方法、路由装置及计算机可读存储介质
WO2022267057A1 (fr) Procédé d'annonce de routeur et dispositif électronique
WO2023098703A1 (fr) Procédé de notification de trajet, procédé de génération de combinaison d'algorithmes de topologie, procédé de calcul de trajet, procédé de transmission de données, dispositif électronique, et support de stockage lisible par ordinateur

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21929950

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 06.02.2024)