WO2021155759A1 - Procédé et dispositif de traitement d'un identifiant de segment - Google Patents

Procédé et dispositif de traitement d'un identifiant de segment Download PDF

Info

Publication number
WO2021155759A1
WO2021155759A1 PCT/CN2021/074184 CN2021074184W WO2021155759A1 WO 2021155759 A1 WO2021155759 A1 WO 2021155759A1 CN 2021074184 W CN2021074184 W CN 2021074184W WO 2021155759 A1 WO2021155759 A1 WO 2021155759A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
network
information
nodes
identification
Prior art date
Application number
PCT/CN2021/074184
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 WO2021155759A1 publication Critical patent/WO2021155759A1/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/34—Source routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • 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/02—Topology update or discovery
    • H04L45/06—Deflection routing, e.g. hot-potato 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/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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/54—Organization of routing tables
    • 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/74—Address processing for routing
    • H04L45/741—Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6
    • 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/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering

Definitions

  • the embodiments of the present disclosure relate to the field of communication technology, and in particular to a method and device for processing segment identification.
  • Segment Routing is a source routing technology, based on the software-defined network (Software Defined Network, SDN) concept, constitutes a path-oriented network architecture to support the multi-level programmable requirements of the future network, and can meet the first Five mobile communication technology (5th generation, 5G) connection requirements in the application scenarios of ultra-large connections and slicing.
  • SDN Software Defined Network
  • SR-Multi-Protocol Label Switching is an SR solution based on the current mainstream MPLS forwarding plane.
  • SRv6 is an SR solution based on the Internet Protocol Version 6 (Internet Protocol Version 6, IPv6) extension.
  • SR-MPLS follows the MPLS forwarding mechanism, naturally evolves, and has been widely used in transmission networks. SRv6 further enhances network programmability and supports network and business programmability.
  • the current Internet Engineering Task Force (IETF) draft draft-ietf-6man-segment-routing-header-26 defines the segment routing header (Segment Routing Header, SRH) of the IPv6 extension header, which is used It is forwarded on the data plane of SRv6, where each segment ID (Segment ID, SID) in the segment list (Segment List) contains 128 bits, including location identification (locator), function (function), variable (arguments) and other parts , See Figure 1.
  • IETF Internet Engineering Task Force
  • Location identification An identification assigned to a network node in the network, which can be used to route and forward data packets. Locator has two important attributes, routing and aggregation. In SRv6SID, the Locator is a variable-length part, which is used to adapt to networks of different sizes.
  • Function value an identity (ID) value assigned by the device to the local forwarding instruction. This value can be used to express the forwarding action required by the device, which is equivalent to the operation code of the computer instruction.
  • ID an identity
  • SRv6 network programming different forwarding behaviors are expressed by different function ID values. To a certain extent, the function ID is similar to the MPLS label, and is used to identify a virtual private network (Virtual Private Network, VPN) forwarding instance, etc.
  • Args variables: The parameters needed when the forwarding instruction is executed. These parameters may include streams, services or any other related variable information.
  • IPv6 technology has become the main technology of the new generation of networks.
  • the long-term consideration of SRv6 based on IPv6 is the evolution trend of future networks.
  • Research on the mechanism of SRv6 technology is a hot spot in the industry.
  • the operator's network requires a higher number of SR label layers.
  • the traffic of the base station needs to pass through the metropolitan area network and the IP backbone network.
  • the access ring has 8-10 nodes
  • the aggregation ring has 4-8 nodes
  • the core ring has 4-8 nodes.
  • traffic still needs to pass through multiple router nodes.
  • SLA high-reliability service-level agreement
  • operator networks need to be able to specify explicit paths, and end-to-end SR tunnels will have 10 hops or more. Therefore, at present, most domestic and foreign operators deploying MPLS-SR require support for SID labels of more than 8 layers.
  • the SRv6 solution is based on SRH, and its SID length is 128 bits.
  • 128Byte overhead is brought to the message.
  • the overhead brought by SRv6 exceeds 1/3, and the bandwidth utilization rate drops below 67%.
  • the overhead of SR-MPLS is only 32Byte, and the bandwidth utilization rate is still 89%.
  • Figure 2 The comparative analysis of the carrying efficiency of SRv6 and SR-MPLS when the number of SIDs is from 1 to 10 is shown in Figure 2 (only a simple comparison of the overhead of SRH and SR-MPLS SID).
  • the increase in overhead caused a reduction in network utilization, and on the other hand, it brought greater support for deep message deep load balancing, in-band telemetry (In-Band Telemetry), and network service header (NSH). challenge.
  • in-band Telemetry In-Band Telemetry
  • NSH network service header
  • SRv6 deployment will inevitably coexist with the SR-MPLS network. Due to the difference in network utilization, it may cause the problem of unbalanced network boundary interfaces, resulting in waste of investment.
  • the SR-MPLS network is connected to the SRv6 network domain, consider the 100G link, 256byte packets, and the 8-layer SID. Due to the large difference in link utilization, one 100GE link in the SR-MPLS domain is in the SRv6 domain. It may require two 100GE links to match.
  • SRv6 needs to insert a field of more than 128Byte length in the network chip in the message, which is equivalent to the 32-layer MPLS-SR label depth, which exceeds the capacity of the deployed network chip. If loopback is used inside the chip. The solution will greatly reduce network performance and introduce higher delay and jitter.
  • supporting SRv6 requires further expansion of the internal processing bus bandwidth, which is a key factor in chip cost and power consumption.
  • SRv6 requires the network chip to read the complete SRH at the intermediate node, and then extract the segment to be processed according to the position indicated by the pointer and forward it. Compared with MPLS-SR, only the outermost label needs to be read, and the complexity introduced further increases the processing delay of the network chip.
  • the SRv6 message overhead in related technologies is relatively large, which increases the complexity of the network chip and is difficult to smoothly upgrade. As a result, it is difficult to quickly deploy SRv6 to the operator's network.
  • An objective of the embodiments of the present disclosure is to provide a method and device for processing segment identification, so as to solve the problem of high SRv6 message overhead in related technologies.
  • an embodiment of the present disclosure provides a method for processing segment identification, which is applied to a first node, and includes:
  • first information in the network identification of the first node and second information of the first node where the first information includes: the difference between the network identification of the first node and the network identifications of other nodes in the network Part, the second information includes the value of the function of the first node;
  • the combination of the first information and the second information is used to indicate the USID of the first node.
  • the sending the first information and the second information to other nodes in the network includes:
  • the first information and the second information are sent to other nodes in the network through a control protocol.
  • the method further includes:
  • the obtaining the common part of the network identification of each node in the network includes:
  • the acquisition method includes one or more of the following:
  • the controller delivers uniformly to all nodes in the network
  • the method further includes:
  • the third information includes the difference between the network identifier of the second node and the network identifiers of other nodes in the network, and the fourth information includes the value of the function of the second node.
  • the method further includes:
  • Segment list includes: one or more USIDs, and the USID includes: the third information and the fourth information of the second node;
  • the segment list is encapsulated in the generic segment routing header Generic SRH of the message.
  • the method further includes:
  • the message is sent to the second node.
  • the method further includes:
  • the message is performed according to the value of the function in the USID currently pointed to by the Segment list in the message handle.
  • embodiments of the present disclosure also provide a network node, where the node is a first node and includes:
  • the first acquiring module is configured to acquire the first information in the network identification of the first node and the second information of the first node, and the first information includes: the network identification of the first node and the network identification The difference part of the network identifiers of other nodes, where the second information includes the value of the function of the first node;
  • the first sending module is configured to send the first information and the second information to other nodes in the network, wherein the combination of the first information and the second information is used to indicate the USID of the first node .
  • embodiments of the present disclosure also provide a network node, where the node is a first node and includes: a transceiver and a processor;
  • the processor is configured to obtain first information in the network identifier of the first node and second information of the first node, where the first information includes: the network identifier of the first node and the network identifier The difference part of the network identifiers of other nodes, where the second information includes the value of the function of the first node;
  • the transceiver is configured to send the first information and the second information to other nodes in the network, wherein the combination of the first information and the second information is used to indicate the USID of the first node .
  • the embodiments of the present disclosure also provide a communication device, including: a processor, a memory, and a program stored on the memory and capable of running on the processor.
  • a communication device including: a processor, a memory, and a program stored on the memory and capable of running on the processor.
  • the implementation includes the steps of the method for processing segment identification as described in the first aspect.
  • embodiments of the present disclosure also provide a computer-readable storage medium having a computer program stored on the computer-readable storage medium. Steps of the processing method for segment identification.
  • the USID of a node in the network includes the difference between the network ID of the node and the network ID of other nodes and the value of the function of the node.
  • the difference part uses the part of the network ID, which is unnecessary.
  • the mapping can be combined with the general part of the network identification of each node in the network to form the network identification of the node, which effectively reduces the number of bits occupied by the segment identification of each node in the message, improves the efficiency of chip data forwarding, and reduces the amount of information transmitted and stored.
  • Figure 1 is a schematic diagram of SRv6 SID
  • Figure 2 is a schematic diagram of comparative analysis of SR carrying efficiency with different SID numbers when the payload length is 256B;
  • FIG. 3 is a flowchart of a method for processing segment identification in an embodiment of the disclosure
  • FIG. 4 is a schematic diagram of four 32-bit USIDs in an embodiment of the disclosure.
  • FIG. 5 is a schematic diagram of mapping between Generic Prefix and CL in USID and Locator in SID in related technologies in an embodiment of the disclosure
  • FIG. 6 is a schematic diagram of Endpoint function types in an embodiment of the disclosure.
  • FIG. 7 is a schematic diagram of VPN traffic forwarding based on SRv6 USID TE in an embodiment of the disclosure
  • Fig. 8 is a schematic diagram of CL information of nodes A-E in Fig. 7;
  • FIG. 9 is a schematic diagram of the USID of node B in FIG. 7;
  • 10 and 11 are schematic diagrams of the USID of node E in FIG. 7;
  • Fig. 12 is a schematic diagram of the USID list in the Segment List in Fig. 7;
  • FIG. 13 to FIG. 15 are schematic diagrams of messages of each node in FIG. 7;
  • FIG. 16 is one of the schematic diagrams of a network node in an embodiment of the disclosure.
  • FIG. 17 is the second schematic diagram of a network node in an embodiment of the disclosure.
  • FIG. 18 is a schematic diagram of a communication device in an embodiment of the disclosure.
  • words such as “exemplary” or “for example” are used as examples, illustrations, or illustrations. Any embodiment or design solution described as “exemplary” or “for example” in the embodiments of the present disclosure should not be construed as being more preferable or advantageous than other embodiments or design solutions. To be precise, words such as “exemplary” or “for example” are used to present related concepts in a specific manner.
  • the technology described in this article is not limited to the fifth-generation mobile communication (5th-generation, 5G) system and subsequent evolution communication systems, and is not limited to the LTE/LTE evolution (LTE-Advanced, LTE-A) system, and can also be used for various A kind of wireless communication system, such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (Frequency Division Multiple Access, FDMA), Orthogonal Frequency Division Multiple Access (Orthogonal Frequency Division Multiple Access, OFDMA), Single-carrier Frequency-Division Multiple Access (SC-FDMA) and other systems.
  • CDMA Code Division Multiple Access
  • TDMA Time Division Multiple Access
  • FDMA Frequency Division Multiple Access
  • OFDMA Orthogonal Frequency Division Multiple Access
  • SC-FDMA Single-carrier Frequency-Division Multiple Access
  • the terms “system” and “network” are often used interchangeably.
  • the CDMA system can implement radio technologies such as CDMA2000 and Universal Terrestrial Radio Access (UTRA).
  • UTRA includes Wideband Code Division Multiple Access (WCDMA) and other CDMA variants.
  • the TDMA system can implement radio technologies such as the Global System for Mobile Communication (GSM).
  • OFDMA system can realize such as Ultra Mobile Broadband (UMB), Evolved UTRA ((Evolution-UTRA, E-UTRA)), IEEE 802.11 ((Wi-Fi)), IEEE 802.16 ((WiMAX)), IEEE 802.20, Flash-OFDM and other radio technologies.
  • UMB Ultra Mobile Broadband
  • Evolved UTRA (Evolution-UTRA, E-UTRA)
  • IEEE 802.11 (Wi-Fi)
  • IEEE 802.16 (WiMAX)
  • IEEE 802.20 Flash-OFDM and other radio technologies.
  • UMB Ultra Mobile Broadband
  • Evolved UTRA (Evolution-U
  • LTE and more advanced LTE are new UMTS versions that use E-UTRA.
  • UTRA, E-UTRA, UMTS, LTE, LTE-A, and GSM are described in documents from an organization named "3rd Generation Partnership Project” (3GPP).
  • CDMA2000 and UMB are described in documents from an organization named “3rd Generation Partnership Project 2" (3GPP2).
  • the techniques described in this article can be used for the systems and radio technologies mentioned above, as well as other systems and radio technologies.
  • an embodiment of the present disclosure provides a method for segment identification processing.
  • the execution subject of the method may be a first node.
  • the first node may be an ingress node (ingress node), an intermediate node, or an intermediate node in the network.
  • the egress node (egress node), the method includes: step 301 and step 302.
  • Step 301 Acquire first information in the network identifier of the first node and second information of the first node, where the first information includes: the network identifier of the first node and the network of other nodes in the network In the identified difference part, the second information includes the value of the function of the first node;
  • the above function is used to identify the programming ability of the node, and different values of the function correspond to different business behaviors.
  • the first information is included in the network identification (for example, Node SID) of the first node, which is equivalent to extracting the network identification of the first node and the network identifications of other nodes from the network identification of the first node
  • the difference part (different part) of the first node can be understood as compressing the network identifier of the first node.
  • the network identifier is expressed as Locator
  • the first information can be expressed as compressed location identifier (Compressed Locator, CL), that is The CL is used as a fragment of the Locator and sent to other nodes in the network, so that other nodes can obtain the network identification of the first node according to the combination of the difference part and the common part of the network identification defined by the network.
  • the nodes in the network include: node A, node B, node C, node D, and node E, and the network identifier is the Node SID of the node.
  • the Node SID of node A is: AA::11::/116 (INTA2)
  • Node SID of Node B is: AA::12::/116(INTB3)
  • Node SID of Node C is: AA::13::/116(INTC3)
  • Node SID of Node D is: AA ::14::/116(INTD3)
  • the Node SID of node E is: AA::15::/116(INTE2)
  • the differences of the Node SIDs of the above nodes are as follows: 11, 12, 13, 14 and 15 , It can be understood that the first information of node A is: 11, the first information of node B is 12, the first information of node C is 13, the first information of node D is 14, and the first information of node D is 15.
  • Step 302 Send the first information and the second information to other nodes in the network.
  • control protocol includes, but is not limited to, internal routing protocol (IGP) and border gateway protocol (BGP) And other agreements.
  • IGP internal routing protocol
  • BGP border gateway protocol
  • the combination of the first information and the second information of the first node is used to represent the USID of the first node.
  • Unified SID a unified segment identifier, that is, the USID of the first node includes: the difference part of the network identification of the first node (equivalent to CL) and the value of the function of the first node, for example, the basic length of the USID It can be 32 bits, among which the default length of CL is 20 bits and the default length of function is 12 bits.
  • the method may further include: obtaining a common part of the network identification of each node in the network, and the common part is used to combine with the first information to obtain the information of the first node Network ID.
  • the general part of the network identification of each node in the network is obtained by the following obtaining method
  • the acquisition method includes one or more of the following:
  • the controller delivers uniformly to all nodes in the network
  • nodes in the network may also obtain the common part in other ways, and it is not limited to the four ways mentioned above.
  • the above-mentioned common part indicates the same part of the network identification of each node. It can be understood that the network identification of the node can be obtained by combining the difference part of the network identification of the node and the common part of the network identification of the node.
  • the common part of the network identifier of each node of the network can be expressed as a generic prefix (Generic Prefix), where the CL and Generic Prefix of the first node are combined to obtain the Locator.
  • Generic Prefix the generic prefix
  • the length of Locator+function is 128 bits
  • the default length of CL is 20 bits
  • the default length of function is 12 bits. If the length of the generic prefix is less than 96 bits, it needs to be filled with 0 between the generic prefix and CL.
  • the network identifier Take the IPv6 address (or Node SID) of the node as the network identifier as an example.
  • the common part of the network identifier of each node in the network can be: AA::/96, combined with the description of the above example, according to the first node One information (11) and the general part (AA::/96) can be combined (or called splicing) to obtain the network identification of the first node (Locator): AA::11::/116, processing of other nodes in the network The way is similar.
  • the method further includes: receiving the third information and the fourth information of the second node from one or more second nodes (equivalent to other nodes in the network); the third The information includes the difference between the network identifier of the second node and the network identifiers of other nodes in the network, and the fourth information includes the value of the function of the second node.
  • the third information is included in the network identification of the second node, which is equivalent to extracting the difference between it and other nodes from the network identification of the second node, that is, performing the network identification of the second node.
  • the third information of the second node is equivalent to the CL of the second node. It is understandable that the first node can obtain the network identification of the second node according to the combination of the CL of the second node and the common part of the network identification of each node in the network.
  • a certain node in the network can obtain the USID of other nodes (including the values of CL and function), as well as the common part of each network node in the network, so that the node can be spliced based on the CL and the common part to get other nodes' Locator.
  • the method further includes: generating a segment list (Segment list), where the Segment list includes: one or more USIDs, and the USID includes: third information of the second node and the second node.
  • Segment list includes: one or more USIDs
  • USID includes: third information of the second node and the second node.
  • the foregoing message may be an IPv6 message, but of course it is not limited to this.
  • the method further includes:
  • the segment list determine the third information and fourth information of the second node, the second node is the next node of the first node; according to the third information of the second node and the network
  • the general part of the network identification of each node generates the network identification of the second node; according to the network identification of the second node and the fourth information of the second node, the purpose of generating the Generic SRH of the message Address; according to the destination address, the message is sent to the second node.
  • the method further includes:
  • the message For example, IPv6 packets
  • the USID node can complete the service processing of the specified function according to the value of the function.
  • the first node refers to the difference part of the network identification of the next node in the Segment list in the message, and the common part of the network identification of the next node obtained by the first node.
  • the USID of a node in the network includes the difference between the network ID of the node and the network ID of other nodes and the value of the function of the node.
  • the difference part uses the part of the network ID and does not need to be mapped. It can be combined with the general part to become the network identification of the node, effectively reducing the number of bits occupied by the segment identification of each node in the message, improving the efficiency of chip data forwarding, and reducing the amount of information transmitted and stored by the protocol.
  • the basic length of the USID can be 32 bits, which effectively compresses the space occupied by the SID, and inherits the Locator and function structure of the standard SID.
  • the SRv6 SID in the relevant standards, among which:
  • Next Header Identifies the type of packet header immediately following SRH.
  • Hdr Ext len The length of the SRH header. Mainly refers to the length occupied from Segment List[0] to Segment List[n].
  • Routing Type Identifies the routing header type, SRH Type is 4.
  • Segment Left The number of intermediate nodes that should still be visited before reaching the destination node.
  • Last Entry Include the index of the last element of the segment list in the segment list.
  • Flags Some flags of the data packet.
  • Segment List[n] A list of segments. The list of segments is coded from the last segment of the path.
  • Optional TLV Variable length TLV part.
  • Generic Prefix is defined in the same network.
  • Compressed Locator (CL) of USID is the difference between network nodes and has a relationship with native SRv6 SID Locator.
  • 20bit CL is the lower part of Locator Address fragments are directly spliced with Generic Prefix to form a 128-bit Locator. Since the default length of the CL part of the USID is only 20 bits, if the length of the Generic Prefix is less than 96 bits, the position between the Generic Prefix and the CL is filled with 0.
  • the functions in the USID can all inherit the definition of draft-ietf-spring-srv6-network-programming-07Section 4, but of course it is not limited to this.
  • CL is used as a Locator segment and Generic Prefix to be spliced together to form a native SRv6Locator, for example, refer to FIG. 5.
  • the low-order address fragments of different nodes in the network can be represented by CL, and transmitted to other nodes in the network through control protocols such as IGP/BGP. All nodes in the network can obtain the Locator difference information of other nodes and compare it with The known Generic Prefix can be directly spliced to form a complete Locator. Since the basic length of the USID is 32 bits, the length of CL is 20 bits by default. If the length of the Generic Prefix is less than 96 bits, it needs to be filled with 0 between the Generic Prefix and CL.
  • CL is expressed in the form of addresses and can be combined into an IPv6 address without mapping, which improves the efficiency of chip data forwarding and reduces the amount of information transmitted and stored by the protocol.
  • the node deploying SRv6 USID in the network only needs to extract the difference part CL of the Locator in its own native SRv6 SID, and transmit it to other nodes in the network through the control protocol such as IGP/BGP, so that all nodes in the network can be based on the CL and the existing The well-known Generic Prefix is combined into a complete Locator.
  • the network node deploying SRv6 USID will also assign the function value to the function type, and transmit the Endpoint function type and the corresponding END USID to other nodes in the network through control protocols such as IGP/BGP.
  • the value of Function is different from the value of CL. It is only identifiable to service endpoints (usually ingress and egress nodes of the network), and is only used for transmission to other intermediate nodes.
  • the ingress node of the network uses SRv6 USID for encapsulation, it queries the corresponding function value according to the CL issued by the egress node and the END USID transmitted by IGP/BGP, and forms a USID according to the aforementioned CL:function combination. If you specify a set of nodes passing by, extract the Generic Prefix for each node IPv6 address in the set, and extract the remaining part according to the location of the CL address fragment to form a USID, and fill in the function field with 0.
  • the Generic Prefix will be extracted from the IPv6 address of the starting node of each link in the set, and the remaining part will be extracted as the CL of each USID according to the location of the address fragment of the CL, and the END transmitted according to the IGP will be extracted at the same time.
  • the USID queries the value of the corresponding link function, and forms a USID according to the aforementioned CL:function combination.
  • the ingress node of the network forms the USID list from back to front in the order of the route, and encapsulates it into the Segment List of the IPv6 SRH header of the message, that is, the USID of the egress node is the first in the list, and the first on the specified path
  • the USID of a node or link is the last in the list, and the USID currently pointed to is the last USID, which is exactly the same as the native SRv6 method.
  • the current CL pointing to the USID is directly spliced.
  • the Generic Prefix obtained according to the configuration or controller issued forms the destination address Locator part of the IPv6 header. If the Generic Prefix is less than 96 bits, 0 is added before the CL and the lowest 12 bits of the IPv6 destination address Fill the function value of the USID to form a complete IPv6 destination address.
  • each node checks whether the IPv6 destination address is its own. If it is not, it can be forwarded according to the IPv6 routing table. If it is, the USID currently pointed to by the IPv6 SRH header Segment List needs to be checked. Processing, that is, perform corresponding service processing according to the value of function, such as searching for specified link forwarding, searching for routing table forwarding corresponding to VRF, and so on.
  • the USID in the Segment List points to one USID forward, and the new USID CL and Generic Prefix are spliced to form a new Locator for the IPv6 destination address, and the new USID function value is filled in the lowest 12 bits of the IPv6 destination address to form a new IPv6 header The complete destination address.
  • the message continues to be forwarded, and the above process is repeated until the service processing of the first USID in the Segment List, that is, the USID of the egress node is completed.
  • USID uses a basic length of 32bit
  • CL uses a default length of 20bit
  • function uses a default length of 12bit.
  • Generic Prefix uses AA::/96
  • SRv6 Locator length in Node SID is 116bit (96bit+20bit)
  • END function uses the smallest set END.X/END.DT4/END.DT6,
  • a and E deploy L3VPN IPv4 and IPv6, based on SRv6 USID TE VPN traffic forwarding.
  • the CL information generated by the node AE is shown in Figure 9. It is used to identify the difference part of the SRv6 Node SID of each node.
  • SubTLV flooding can also be extended to node A through IGP (including but not limited to ISIS6, OSPFv3) protocol.
  • IGP including but not limited to ISIS6, OSPFv3 protocol.
  • the END.DT4 USID and END.DT6 USID of node E can be passed to BGP VPN peer A through BGP (including but not limited to VPNv4, VPNv6, EVPN address family, etc.) protocol extended attributes, and the corresponding VPN can be obtained by cross-matching each VPN through RT The value of function in the USID.
  • BGP including but not limited to VPNv4, VPNv6, EVPN address family, etc.
  • the INTE3 of node E is the loopback interface, which can be used as the address for establishing BGP VPN peer with node A.
  • 2, USID2 12
  • 2 pointed to by SL. According to function 2, it is the BC link, and the message is forwarded according to the BC link.
  • Node C checks that the IPv6 destination address AA::15::2 is not itself, and queries the IPv6 routing table of this node to continue forwarding to node E;
  • an embodiment of the present disclosure also provides a network node, where the network node is a first node, and the first node 1600 includes:
  • the first obtaining module 1601 is configured to obtain first information and second information in the network identification of the first node, where the first information includes: the network identification of the first node and the network identification of other nodes in the network In the difference part of, the second information includes the value of the function of the first node;
  • the first sending module 1602 is configured to send the first information and the second information to other nodes in the network;
  • the combination of the first information and the second information is used to indicate the USID of the first node.
  • the first sending module 1602 is further configured to send the first information and the second information of the first node to other nodes in the network through a control protocol.
  • the first node 1600 further includes:
  • the second obtaining module is used to obtain the common part of the network identification of each node in the network, and the common part is used to combine with the first information to obtain the network identification of the first node.
  • the second obtaining module is further configured to obtain the common part of the network identification of each node in the network by the following obtaining method;
  • the acquisition method includes one or more of the following:
  • the controller delivers uniformly to all nodes in the network
  • nodes in the network may also obtain the common part in other ways, and it is not limited to the four ways mentioned above.
  • the first node 1600 further includes:
  • the first receiving module is configured to receive third information and fourth information of the second node from one or more second nodes, where the third information includes: the network identifier of the second node and other nodes in the network The difference part of the network identifier, the fourth information includes the value of the function of the second node.
  • the first node 1600 further includes:
  • the first generating module is configured to generate a segment list, where the segment list includes: one or more USIDs, and the USID includes: third information and the fourth information of the second node;
  • the encapsulation module is used to encapsulate the segment list into the Generic SRH of the message.
  • the first node 1600 further includes:
  • a determining module configured to determine the value of the third information and function of the second node according to the segment list, and the second node is the next node of the first node;
  • the second generating module is configured to generate the network identifier of the second node according to the third information of the second node and the common part of the network identifier of each node in the network;
  • the third generation module is configured to generate the destination address in the Generic SRH of the message according to the network identifier of the second node and the fourth information;
  • the second sending module is configured to send the message to the second node according to the destination address.
  • the first node 1600 further includes:
  • the second receiving module is used to receive messages
  • the processing module is configured to, if the destination address in the Generic SRH of the message matches the network identification of the first node, perform a correction according to the value of the function in the USID currently pointed to by the Segment list in the message The message is processed.
  • the node provided in the embodiment of the present disclosure can execute the method embodiment shown in FIG. 3 above, and its implementation principles and technical effects are similar, and details are not described herein again in this embodiment.
  • an embodiment of the present disclosure also provides a network node, where the network node is a first node, and the first node 1700 includes: a transceiver 1701 and a processor 1702;
  • the processor 1702 is configured to obtain first information and the second information in the network identifier of the first node, where the first information includes: the network identifier of the first node and the information of other nodes in the network.
  • the difference part of the network identifier, the second information includes the value of the function of the first node;
  • the transceiver 1701 is configured to send the first information and the second information to other nodes in the network;
  • the combination of the first information and the second information is used to indicate the USID of the first node.
  • the transceiver 1701 is further configured to send the first information and the second information to other nodes in the network through a control protocol.
  • the processor 1702 is further configured to: obtain a common part of the network identification of each node in the network, and the common part is used to combine with the first information to obtain the network identification of the first node.
  • the processor 1702 is further configured to: obtain the general part of the network identification of each node in the network by the following obtaining method;
  • the acquisition method includes one or more of the following:
  • the controller delivers uniformly to all nodes in the network
  • nodes in the network may also obtain the common part in other ways, and it is not limited to the four ways mentioned above.
  • the transceiver 1701 is further configured to: receive the third information and the fourth information of the second node from one or more second nodes; the third information includes: the second node The difference between the network identifier of and the network identifiers of other nodes in the network, and the fourth information includes the value of the function of the second node.
  • the processor 1702 is further configured to generate a segment list, the segment list including: one or more USIDs, and the USID includes: the third information and the fourth information of the second node;
  • the processor 1702 is further configured to: encapsulate the Segment list into the Generic SRH of the message.
  • the processor 1702 is further configured to: determine third information and fourth information of the second node according to the segment list, and the second node is the next node of the first node; Generate the network identity of the second node according to the third information of the second node and the common part of the network identity of each node in the network; according to the network identity of the second node and the function of the second node Value, the destination address in the Generic SRH that generated the message;
  • the transceiver 1701 is further configured to send the message to the second node according to the destination address.
  • the transceiver 1701 is also used to: receive messages;
  • the processor 1702 is further configured to: if the destination address in the Generic SRH of the message matches the network identification of the first node, according to the value of the function in the USID currently pointed to by the Segment list in the message , To process the message.
  • the node provided in the embodiment of the present disclosure can execute the method embodiment shown in FIG. 3 above, and its implementation principles and technical effects are similar, and details are not described herein again in this embodiment.
  • FIG. 18 is a structural diagram of a communication device applied in an embodiment of the present disclosure.
  • the communication device 1800 includes: a processor 1801, a transceiver 1802, a memory 1803, and a bus interface, where:
  • the communication device 1800 further includes: a computer program stored in the memory 1803 and capable of running on the processor 1801. The computer program is executed by the processor 1801 to implement the steps in the embodiment shown in FIG. 3 .
  • the bus architecture may include any number of interconnected buses and bridges. Specifically, one or more processors represented by the processor 1801 and various circuits of the memory represented by the memory 1803 are linked together.
  • the bus architecture can also link various other circuits such as peripheral devices, voltage regulators, power management circuits, etc., which are all known in the art, and therefore, no further descriptions are provided herein.
  • the bus interface provides the interface.
  • the transceiver 1802 may be a plurality of elements, including a transmitter and a receiver, and provide a unit for communicating with various other devices on the transmission medium.
  • the processor 1801 is responsible for managing the bus architecture and general processing, and the memory 1803 can store data used by the processor 1801 when performing operations.
  • the communication device provided in the embodiment of the present disclosure can execute the method embodiment shown in FIG. 3, and its implementation principles and technical effects are similar, and details are not described in this embodiment here.
  • the steps of the method or algorithm described in conjunction with the disclosure of the present disclosure may be implemented in a hardware manner, or may be implemented in a manner of executing software instructions on a processor.
  • the software instructions can be composed of corresponding software modules, and the software modules can be stored in RAM, flash memory, ROM, EPROM, EEPROM, registers, hard disks, mobile hard disks, read-only optical disks, or any other form of storage medium known in the art.
  • An exemplary storage medium is coupled to the processor, so that the processor can read information from the storage medium and write information to the storage medium.
  • the storage medium may also be an integral part of the processor.
  • the processor and storage medium can be carried in an ASIC.
  • the ASIC can be carried in the core network interface device.
  • the processor and the storage medium may also exist as discrete components in the core network interface device.
  • the functions described in the present disclosure can be implemented by hardware, software, firmware, or any combination thereof.
  • these functions can be stored in a computer-readable medium or transmitted as one or more instructions or codes on the computer-readable medium.
  • the computer-readable medium includes a computer storage medium and a communication medium, where the communication medium includes any medium that facilitates the transfer of a computer program from one place to another.
  • the storage medium may be any available medium that can be accessed by a general-purpose or special-purpose computer.
  • the embodiments of the present disclosure can be provided as a method, a system, or a computer program product. Therefore, the embodiments of the present disclosure may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the embodiments of the present disclosure may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device.
  • the device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.
  • These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so that the computer or other programmable equipment is executed
  • the instructions provide steps for implementing the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.
  • the division of the above modules is only a division of logical functions, and may be fully or partially integrated into a physical entity in actual implementation, or may be physically separated.
  • these modules can all be implemented in the form of software called by processing elements; they can also be implemented in the form of hardware; some modules can be implemented in the form of calling software by processing elements, and some of the modules can be implemented in the form of hardware.
  • the determining module may be a separately established processing element, or it may be integrated in a certain chip of the above-mentioned device for implementation.
  • it may also be stored in the memory of the above-mentioned device in the form of program code, which is determined by a certain processing element of the above-mentioned device.
  • each step of the above method or each of the above modules can be completed by an integrated logic circuit of hardware in the processor element or instructions in the form of software.
  • each module, unit, sub-unit or sub-module may be one or more integrated circuits configured to implement the above method, for example: one or more application specific integrated circuits (ASIC), or one or Multiple microprocessors (digital signal processor, DSP), or one or more field programmable gate arrays (Field Programmable Gate Array, FPGA), etc.
  • ASIC application specific integrated circuit
  • DSP digital signal processor
  • FPGA Field Programmable Gate Array
  • the processing element may be a general-purpose processor, such as a central processing unit (CPU) or other processors that can call program codes.
  • these modules can be integrated together and implemented in the form of a system-on-a-chip (SOC).
  • SOC system-on-a-chip

Landscapes

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

Abstract

Les modes de réalisation de la présente divulgation concernent un procédé et un dispositif de traitement d'un identifiant de segment. Le procédé comprend les étapes consistant à : obtenir des premières informations dans un identifiant de réseau d'un premier nœud et des secondes informations du premier nœud, les premières informations contenant une partie d'une différence entre l'identifiant de réseau du premier nœud et des identifiants de réseau d'autres nœuds dans un réseau et les secondes informations contenant une valeur d'une fonction du premier nœud ; et envoyer les premières et secondes informations aux autres nœuds dans le réseau, une combinaison des premières et secondes informations étant utilisée pour représenter un USID du premier nœud.
PCT/CN2021/074184 2020-02-07 2021-01-28 Procédé et dispositif de traitement d'un identifiant de segment WO2021155759A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010082901.5A CN113259238B (zh) 2020-02-07 2020-02-07 分段标识的处理方法及设备
CN202010082901.5 2020-02-07

Publications (1)

Publication Number Publication Date
WO2021155759A1 true WO2021155759A1 (fr) 2021-08-12

Family

ID=77199640

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/074184 WO2021155759A1 (fr) 2020-02-07 2021-01-28 Procédé et dispositif de traitement d'un identifiant de segment

Country Status (2)

Country Link
CN (1) CN113259238B (fr)
WO (1) WO2021155759A1 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114124781A (zh) * 2021-11-23 2022-03-01 中国联合网络通信集团有限公司 SRv6中报文的转发方法、系统、电子设备及存储介质
CN114900756A (zh) * 2022-05-10 2022-08-12 中国联合网络通信集团有限公司 数据传输方法及装置、计算机可读存储介质
CN114900457A (zh) * 2022-05-20 2022-08-12 中电信数智科技有限公司 一种减少SRv6报文头部长度的方法和系统
CN115801656A (zh) * 2022-11-01 2023-03-14 中国电信股份有限公司 基于加解密的SRv6路径认证方法、节点、系统、设备及介质
WO2023134631A1 (fr) * 2022-01-13 2023-07-20 大唐移动通信设备有限公司 Procédé et appareil de traitement de paquet de données, et dispositif réseau
CN117596206A (zh) * 2024-01-19 2024-02-23 明阳产业技术研究院(沈阳)有限公司 SRv6 SID动态压缩编排方法、系统、交换装置、介质及设备

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113691451B (zh) * 2021-09-22 2022-08-19 新华三技术有限公司 一种段标识确定方法及装置
CN114448881B (zh) * 2022-02-25 2023-06-09 烽火通信科技股份有限公司 一种跨sr mpls与srv6域互操作通信的方法和系统
CN115766552B (zh) * 2022-11-04 2024-05-31 西安电子科技大学 基于SRv6与INT的网络测量方法和装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105075194A (zh) * 2013-03-11 2015-11-18 思科技术公司 有索引的段id
CN108259341A (zh) * 2017-12-06 2018-07-06 新华三技术有限公司 一种前缀标签分配方法和sdn控制器
CN109688057A (zh) * 2018-12-13 2019-04-26 Ut斯达康通讯有限公司 基于ipv6的段路由网络的报文转发方法及装置
CN110611616A (zh) * 2019-09-18 2019-12-24 下一代互联网重大应用技术（北京）工程研究中心有限公司 一种基于Radius服务器的流量调度方法、系统、设备和介质
CN111628995A (zh) * 2020-05-26 2020-09-04 新华三信息安全技术有限公司 基于SRv6的SID压缩方法、装置、设备及存储介质

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9049233B2 (en) * 2012-10-05 2015-06-02 Cisco Technology, Inc. MPLS segment-routing
CN109218189B (zh) * 2017-07-03 2022-04-29 中兴通讯股份有限公司 跨域的路径的标识信息的确定方法、装置及存储介质
US10469367B2 (en) * 2017-10-04 2019-11-05 Cisco Technology, Inc. Segment routing network processing of packets including operations signaling and processing of packets in manners providing processing and/or memory efficiencies
CN109981457B (zh) * 2017-12-27 2021-09-07 华为技术有限公司 一种报文处理的方法、网络节点和系统
US10516610B2 (en) * 2018-03-15 2019-12-24 Cisco Technology, Inc. Segment routing packet policies and functions providing processing signaling and packet forwarding efficiencies in a network
CN114124806B (zh) * 2018-05-25 2022-11-25 华为技术有限公司 一种生成路由的方法和设备
CN110557329A (zh) * 2018-05-30 2019-12-10 中兴通讯股份有限公司 一种报文转发的方法、装置和节点
CN109067652A (zh) * 2018-09-25 2018-12-21 盛科网络（苏州）有限公司 一种IPv6分段路由中节约段标识开销的方法及装置
CN110266594B (zh) * 2019-06-28 2021-07-30 Ut斯达康通讯有限公司 跨网络切片的分段路由转发方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105075194A (zh) * 2013-03-11 2015-11-18 思科技术公司 有索引的段id
CN108259341A (zh) * 2017-12-06 2018-07-06 新华三技术有限公司 一种前缀标签分配方法和sdn控制器
CN109688057A (zh) * 2018-12-13 2019-04-26 Ut斯达康通讯有限公司 基于ipv6的段路由网络的报文转发方法及装置
CN110611616A (zh) * 2019-09-18 2019-12-24 下一代互联网重大应用技术（北京）工程研究中心有限公司 一种基于Radius服务器的流量调度方法、系统、设备和介质
CN111628995A (zh) * 2020-05-26 2020-09-04 新华三信息安全技术有限公司 基于SRv6的SID压缩方法、装置、设备及存储介质

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
C. FILSFILS, ED. P. CAMARILLO, ED. CISCO SYSTEMS, INC. D. CAI ALIBABA D. VOYER BELL CANADA I. MEILIK BROADCOM K. PATEL ARRCUS, INC: "Network Programming extension: SRv6 uSID instruction; draft-filsfils-spring-net-pgm-extension-srv6-usid-07.txt", NETWORK PROGRAMMING EXTENSION: SRV6 USID INSTRUCTION; DRAFT-FILSFILS-SPRING-NET-PGM-EXTENSION-SRV6-USID-07.TXT; INTERNET-DRAFT: SPRING, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 , no. 07, 19 May 2020 (2020-05-19), Internet Society (ISOC) 4, rue des Falaises CH- 1205 Geneva, Switzerland, pages 1 - 21, XP015139644 *

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114124781A (zh) * 2021-11-23 2022-03-01 中国联合网络通信集团有限公司 SRv6中报文的转发方法、系统、电子设备及存储介质
WO2023134631A1 (fr) * 2022-01-13 2023-07-20 大唐移动通信设备有限公司 Procédé et appareil de traitement de paquet de données, et dispositif réseau
CN114900756A (zh) * 2022-05-10 2022-08-12 中国联合网络通信集团有限公司 数据传输方法及装置、计算机可读存储介质
CN114900756B (zh) * 2022-05-10 2024-04-09 中国联合网络通信集团有限公司 数据传输方法及装置、计算机可读存储介质
CN114900457A (zh) * 2022-05-20 2022-08-12 中电信数智科技有限公司 一种减少SRv6报文头部长度的方法和系统
CN114900457B (zh) * 2022-05-20 2024-04-16 中电信数智科技有限公司 一种减少SRv6报文头部长度的方法和系统
CN115801656A (zh) * 2022-11-01 2023-03-14 中国电信股份有限公司 基于加解密的SRv6路径认证方法、节点、系统、设备及介质
CN115801656B (zh) * 2022-11-01 2024-05-14 中国电信股份有限公司 基于加解密的SRv6路径认证方法、节点、系统、设备及介质
CN117596206A (zh) * 2024-01-19 2024-02-23 明阳产业技术研究院(沈阳)有限公司 SRv6 SID动态压缩编排方法、系统、交换装置、介质及设备
CN117596206B (zh) * 2024-01-19 2024-03-26 明阳产业技术研究院(沈阳)有限公司 SRv6 SID动态压缩编排方法、系统、交换装置、介质及设备

Also Published As

Publication number Publication date
CN113259238A (zh) 2021-08-13
CN113259238B (zh) 2022-10-21

Similar Documents

Publication Publication Date Title
WO2021155759A1 (fr) Procédé et dispositif de traitement d'un identifiant de segment
US10757231B2 (en) Providing network efficiencies in forwarding packets among provider networks and applying segment routing policies
US11533254B2 (en) Packet processing method, related device, and computer storage medium
US10158568B2 (en) Method and apparatus for service function forwarding in a service domain
EP3713162A1 (fr) Procédé et appareil de traitement de route, et appareil et procédé de transmission de données
US20160323193A1 (en) Service Routing Method, Device, and System
WO2021151381A1 (fr) Procédé de traitement d'id de segment, et appareil
CN112953831A (zh) 一种报文转发方法及装置
WO2021213507A1 (fr) Procédé et dispositif de traitement de paquet de données
WO2018126692A1 (fr) Procédé et appareil destinés à commander la transmission de données
WO2021043232A1 (fr) Procédé par lequel des exigences de performance de réseau hôte peuvent être programmées, dispositif et système
US20240073128A1 (en) Message encapsulation and de-encapsulation method and device, storage medium, and electronic device
WO2022007550A1 (fr) Procédé d'équilibrage de charge, appareil, dispositif réseau et système
Tulumello et al. Pushing services to the edge using a stateful programmable dataplane
CN113194033B (zh) 基于sdn段路由组网的报文转发方法、装置及存储介质
CN114205291B (zh) 数据包的传输方法及装置
WO2023116355A1 (fr) Procédé et appareil de communication, dispositifs et support d'enregistrement associés
WO2022143597A1 (fr) Procédé de détermination de chemin de transfert de chaîne de services et appareil de communication
WO2022105625A1 (fr) Procédé et appareil de réacheminement de paquets, dispositif de communication et support de stockage lisible
WO2023246118A1 (fr) Procédé et appareil de transfert de message, support de stockage et appareil électronique
EP4246917A1 (fr) Procédé de transmission de message, procédé d'acquisition de correspondance, et appareil et système
WO2023078144A1 (fr) Procédé, appareil et système de traitement de message
CN114006846B (zh) IPv6数据包的传输方法及装置
WO2023088145A1 (fr) Procédé, appareil et dispositif de traitement de paquets
EP4191908A1 (fr) Procédé d'envoi d'un message à multidiffusion, et procédé et appareil pour acquérir une entrée de table de transfert

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21750954

Country of ref document: EP

Kind code of ref document: A1