WO2023078031A1 - Procédé et appareil d'envoi de messages - Google Patents

Procédé et appareil d'envoi de messages Download PDF

Info

Publication number
WO2023078031A1
WO2023078031A1 PCT/CN2022/124423 CN2022124423W WO2023078031A1 WO 2023078031 A1 WO2023078031 A1 WO 2023078031A1 CN 2022124423 W CN2022124423 W CN 2022124423W WO 2023078031 A1 WO2023078031 A1 WO 2023078031A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
message
policy
indication information
node
Prior art date
Application number
PCT/CN2022/124423
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 WO2023078031A1 publication Critical patent/WO2023078031A1/fr

Links

Images

Classifications

    • 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/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
    • 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/34—Source routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/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
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/06—Notations for structuring of protocol data, e.g. abstract syntax notation one [ASN.1]

Definitions

  • the present application relates to the technical field of network communication, and in particular to a message sending method and device.
  • SR Policy Segment Routing Policy
  • SR Policy is a tunnel diversion technology.
  • SR Policy contains at least one candidate path, each candidate path has a preference value (Preference), and the candidate path with the highest Preference is the main path.
  • Preference preference value
  • Segment List segment list
  • each segment list indicates an end-to-end path from source to destination.
  • Redundancy Policy a redundancy policy
  • the redundancy strategy refers to enabling packet replication and instantiating multiple ordered segment lists between the copy node and the merge node to guide the same flow through different paths in the SR domain.
  • the existence of candidate paths with the same Preference in the SR Policy indicates that the SR Policy is a redundant policy, and the number of candidate paths with the same Preference indicates the number of packet replications. Therefore, when the packet arrives at the replication node, the replication node needs to search the Preferences of all candidate paths in the SR Policy to determine whether the SR Policy is a redundancy policy and the number of copies of the packet.
  • the setting of Preference in the redundant policy defined above changes the semantics of Preference in SR Policy, and the process of determining SR Policy as a redundant policy is cumbersome and time-consuming.
  • the present application discloses a message sending method and device, which improves the copying rate of the message by the network node in the multi-sending and selective-receiving scenario, can quickly realize the copying and forwarding of the message, and improves the reliability of message forwarding.
  • the present application provides a method for sending a message, which is applied to a network node.
  • the method includes: obtaining instruction information and quantity information, the instruction information is used to instruct the network node to copy the message, and the quantity information corresponds to the copy message The number of texts; obtain the first message; copy the first message according to the instruction information to obtain multiple second messages, the number of multiple second messages corresponds to the quantity information; send multiple second messages, multiple second messages At least two second packets in the two packets encapsulate different forwarding path information.
  • the network node may be a head node or an intermediate node of the packet forwarding path.
  • the head node can be the ingress node (Ingress Node) in the SR or SRv6 network
  • the intermediate node can be a node other than the ingress node and the egress node (Egress Node) in the SR or SRv6 network.
  • a network node may also be referred to as a replication node.
  • a copying behavior is defined for the network nodes through the indication information, and the number of copied messages can be directly indicated through the quantity information, so that the network nodes can efficiently perform copying of the messages according to the indication information in the scenario of frequent message sending action and determine the number of copies of the message based on the quantity information.
  • the network nodes can also flexibly select the encapsulation path of the message, which realizes multiple sending of the message and improves the forwarding efficiency of the message.
  • the indication information and quantity information are included in the policy information.
  • the policy information carries indication information and quantity information, so that network nodes can quickly determine the frequent sending of messages, which is beneficial to improve the efficiency of message forwarding.
  • acquiring the indication information and the quantity information includes: receiving a notification message sent by the controller, the notification message including the above policy information; acquiring the indication information and the quantity information according to the notification message.
  • the indication information and quantity information can be directly sent to the network nodes through the controller, which can effectively reduce the operating pressure of the network nodes.
  • the indication information is included in the policy information, and the quantity information is included in the segment identifier of the network node.
  • the quantity information and the policy information are decoupled. In this way, if a forwarding path fails in the multi-send and selective-receiving scenario, the quantity information can be dynamically updated without updating the policy information, which can improve the selection efficiency of the forwarding path , improving the reliability of message forwarding.
  • the first message includes the segment identifier of the network node, and obtaining indication information and quantity information includes: receiving a notification message sent by the controller, the notification message including the above policy information; obtaining the indication information according to the notification message; Identifies the quantity information obtained.
  • the first message contains the segment identifier of the network node, indicating that this method is applicable to the network node as an intermediate node, and the network node can obtain the instruction information from the policy information issued by the controller, and obtain the instruction information from its own segment identifier. Get quantity information.
  • obtaining the indication information and the quantity information includes: receiving a notification message sent by the controller, the notification message including the above policy information; obtaining the indication information according to the notification message; obtaining the quantity information according to the segment identifier of the network node.
  • the network node when the network node is the head node, the network node can obtain the instruction information from the policy information issued by the controller, and obtain the quantity information from its own segment identifier, wherein the segment identifier containing the quantity information can be the network
  • the node is configured locally, or it may be sent by the controller to the network node, which is not specifically limited here.
  • the segment identifier is a binding segment identifier Binding SID.
  • the Binding SID can be an IPv6 address or an SR MPLS label in SRv6 technology.
  • the quantity information is included in the policy information, and the indication information is included in the segment identifier of the network node.
  • the first message includes the segment identifier of the network node, and obtaining indication information and quantity information includes: receiving a notification message sent by the controller, the notification message including the above policy information; obtaining quantity information according to the notification message; Identifies access to instructions.
  • the network node when the network node is an intermediate node, the network node can also obtain the quantity information from the policy information issued by the controller, and obtain the indication information from its own segment identification, wherein the segment identification containing the indication information can be
  • the network node is configured locally, or it may be sent to the network node by the controller, which is not specifically limited here.
  • segment identifier of the network node is an SID of type End.B6.Replication bound to the SRv6 traffic engineering policy.
  • the network node when the network node is an intermediate node, the network node can extend a Replication behavior to End.B6 (Endpoint Bound to an SRv6 TE Policy), that is, End.B6.Replication instructs the network node to perform a replication action, where , B6 indicates that it is applied to SRv6 TE Policy, and Replication indicates that the received message is copied.
  • End.B6 Endpoint Bound to an SRv6 TE Policy
  • Replication instructs the network node to perform a replication action, where , B6 indicates that it is applied to SRv6 TE Policy, and Replication indicates that the received message is copied.
  • the indication information and quantity information are included in the segment identifier of the network node, and the segment identifier is a SID of type End.B6.Replication.
  • setting the indication information and quantity information in the segment identifier of the network node can make the controller only need to unify the control strategy information without expanding protocols such as BGP or PCEP, which is conducive to improving the compatibility of the equipment.
  • the first message includes the segment identifier of the network node
  • obtaining the indication information and the quantity information includes: obtaining the quantity information and the indication information according to the segment identifier of the network node.
  • the network node when the network node is an intermediate node, the network node can also obtain indication information and quantity information from its own segment identifier. It can be seen from this that the quantity information and policy information are decoupled. When a forwarding path fails, it only needs to update the quantity information, which improves the redundancy protection capability of the network and improves the reliability of packet forwarding.
  • the policy information is segment routing policy SR policy or SRv6 policy.
  • the policy information may also be SR MPLS TE policy or SRv6 TE policy.
  • the method further includes: adding the same message sequence number to multiple second messages respectively.
  • each of the multiple second messages contains the same serial number, so that after receiving the second message, the merging node in the multi-send and selective-receive scenario can determine to keep the Or a second message saved, which is usually the first received message, so that the selective receipt of messages is realized.
  • the method further includes: respectively adding the same flow identifier in multiple second packets.
  • each of the multiple second messages contains the same flow identifier, so that the merging node in the multi-send and selective-receive scenario determines according to the flow identifier and sequence number after receiving the second message A second message to be reserved or saved, thereby realizing selective receipt of messages.
  • the notification message is a Border Gateway Protocol BGP message
  • the indication information and quantity information are carried in any of the following fields in the BGP message: Binding segment identification subtype-length-value Binding SID Sub-TLV field; or tunnel Encapsulation attribute Tunnel Encaps Attribute field.
  • the indication information and the quantity information when the indication information and the quantity information are included in the policy information, and the policy information is carried by the BGP message, the indication information and the quantity information can be carried in the BGP message in the form of a new identification field, a TLV field, etc. Binding SID Sub-TLV field or Tunnel Encaps Attribute field. It can be seen that the attributes of the policy information are extended by extending the BGP protocol.
  • the notification message is a BGP message
  • the indication information or quantity information is carried in any of the following fields in the BGP message: the binding segment identification subtype-length-value Binding SID Sub-TLV field; or the tunnel encapsulation attribute Tunnel Encaps Attribute field.
  • the indication information when only the indication information is included in the policy information, and the policy information is carried by the BGP message, the indication information can be carried in the Binding SID Sub in the BGP message in the form of a new identification field, a TLV field, etc. -TLV field or Tunnel Encaps Attribute field; when only the quantity information is included in the policy information, and the policy information is carried by the BGP message, the quantity information can be carried in the BGP message by adding an identification field, TLV field, etc. Binding SID Sub-TLV field or Tunnel Encaps Attribute field. It can be seen that the attributes of the policy information are extended by extending the BGP protocol.
  • the notification message is a path computation element communication protocol PCEP message
  • the indication information and quantity information are carried in any of the following fields in the PCEP message: Extended Association ID TLV field; traffic engineering path binding TE Path Binding TLV field; segment routing policy candidate path identifier SR Policy CPath TLV field; or new type-length-value TLV field of association information Association Information.
  • the indication information and quantity information when the indication information and quantity information are included in the policy information, and the policy information is carried by the PCEP message, the indication information and quantity information can be carried in the PCEP message in the form of a new identification field, TLV field, etc. Any one of the fields such as the Extended Association ID TLV field, TE Path Binding TLV field, etc. It can be seen that the attributes of the policy information are extended by extending the PCEP protocol.
  • the notification message is a PCEP message
  • the indication information or quantity information is carried in any of the following fields in the PCEP message: Extended Association ID TLV field; traffic engineering path binding TE Path Binding TLV field; segment routing Policy candidate path identification SR Policy CPath TLV field; or the newly added type-length-value TLV field of Association Information.
  • the indication information when only the indication information is included in the policy information, and the policy information is carried by the PCEP message, the indication information can be carried in the Extended Association ID in the PCEP message by adding an identification field, a TLV field, etc. Any one of the TLV field, TE Path Binding TLV field and other fields; when only the quantity information is included in the policy information, and the policy information is carried by the PCEP message, the quantity information can be added with the identification field and TLV field Any one of the fields such as the Extended Association ID TLV field and the TE Path Binding TLV field in the PCEP message. It can be seen that the attributes of the policy information are extended by extending the PCEP protocol.
  • the forwarding path information is a segment identification list SID List included in the policy information.
  • At least two of the multiple second packets encapsulate different forwarding path information, including: at least two of the multiple second packets encapsulate different SID Lists, and the SID The List corresponds to the SID List of one path among multiple candidate paths, and the multiple candidate paths are determined according to the preference value preference of each candidate path in the policy information.
  • the candidate path can be used as the selection unit, and M candidate paths can be selected from the policy information at a time, and for each candidate path in the M candidates, a SID List can be determined according to the weight of each SID List in the candidate path, Wherein, the SID List represents a forwarding path (or path for short).
  • the SID List can be flexibly selected for encapsulation of the second message, and the encapsulation rate of the second message can be improved.
  • the multiple candidate paths are determined in descending order according to the preference value preference of each candidate path.
  • the identifier of the first candidate path indicates that the first candidate path is selected.
  • the M candidate paths may be selected from policy information multiple times. Specifically, first select the candidate path 1 corresponding to the maximum preference from the policy information for the encapsulation of a second packet, and set the flag of the candidate path 1 to indicate that the candidate path 1 is selected; then the remaining flags from the policy information Select the candidate path 2 corresponding to the current maximum preference from the candidate paths that are not set to be used for the encapsulation of a second message, and set the flag of the candidate path 2 to indicate that the candidate path 2 is selected, ..., and so on until The number of candidate paths selected from policy information is M.
  • At least two of the multiple second packets encapsulate different forwarding path information, including: at least two of the multiple second packets encapsulate different SID Lists, and multiple The SID List encapsulated in each second message in each second message corresponds to the same candidate path in the policy information.
  • the SID List performs load sharing on multiple second packets based on its own weight.
  • the SID List encapsulated in each second message in multiple second messages can realize load sharing according to its own weight, which is conducive to improving the data processing capability of the network.
  • the indication information and the quantity information are locally configured by the network node, and the method further includes: sending a Border Gateway Protocol link state BGP-LS message to the controller, the BGP-LS message including the indication information and the quantity information, and the indication information and quantity information is carried in any of the following fields in the BGP-LS message: traffic engineering policy descriptor TE Policy Descriptors; or segment routing policy candidate path descriptor SR Policy Candidate Path Descriptor.
  • both the indication information and the quantity information may be included in the policy information, or the indication information is included in the policy information but the quantity information Included in the segment identifier, which is not specifically limited here.
  • the bearing mode of the indication information and the quantity information can be any of the following: (1) both the indication information and the quantity information can be included in the policy information; (2) the indication information can be included in the policy information But the quantity information is included in the segment identifier of the network node; (3) the instruction information is included in the segment identifier, and the quantity information is included in the policy information; (4) the instruction information and the quantity information are included in the segment identifier of the network node.
  • the indication information may be an H.Encap.Replication or H.Insert.Replication command to execute a copy action on the packet, and the quantity information may be carried in arguments of the Binding SID of the network node.
  • the segment identifier may be an End.B6.Replication type SID, and the quantity information may be carried in arguments of the End.B6.Replication type SID.
  • the indication information and quantity information can be carried in any one of the fields such as TE Policy Descriptors and SR Policy Candidate Path Descriptor in the BGP-LS message in the form of newly added identification field, TLV field, etc., thus, the network Nodes inform the controller of the representation of the redundancy policy via BGP-LS extensions.
  • the present application provides a device for sending a message, and the device may be a network device or a part of the network device.
  • the device is used to execute the method in the first aspect or any possible design of the first aspect.
  • the apparatus includes a unit for performing the method in the first aspect or any possible design of the first aspect.
  • the present application provides a device, which includes a processor and a memory, wherein the memory is used to store program instructions; the processor invokes the program instructions in the memory, so that the device executes the first aspect or the first aspect.
  • a device which includes a processor and a memory, wherein the memory is used to store program instructions; the processor invokes the program instructions in the memory, so that the device executes the first aspect or the first aspect.
  • the present application provides a computer-readable storage medium, including instructions.
  • the instructions When the instructions are executed by a computer, part or all of the operations of the method in the first aspect or any possible implementation of the first aspect are realized. .
  • the present application provides a computer program product
  • the computer program software product includes a program, and when the program is executed by a processor, all of the aforementioned first aspect or any possible embodiment of the first aspect can be realized. Some or all of the operations described above.
  • the computer program product may be a software installation package, and if the method provided by any possible design of the aforementioned first aspect needs to be used, the computer program product may be downloaded and executed on the device to realize The method in the first aspect or any possible embodiment of the first aspect.
  • the present application provides a system, including the device described in the second aspect and a controller, wherein the controller is configured to send the indication information and/or the quantity in the first aspect to the device described in the second aspect information, the device described in the second aspect is configured to perform part or all of the operations of the method in any possible implementation manner of the foregoing first aspect.
  • Fig. 1 is a schematic diagram of a segment routing strategy model
  • Fig. 2 is a schematic diagram of a redundancy process of a segment routing network
  • FIG. 3 is a schematic diagram of a system architecture provided by an embodiment of the present application.
  • FIG. 4 is a flow chart of a message sending method provided by an embodiment of the present application.
  • Fig. 5 is a schematic diagram of carrying indication information and quantity information provided by an embodiment of the present application.
  • FIG. 6A is a schematic diagram of carrying indication information and quantity information provided by an embodiment of the present application.
  • FIG. 6B is a schematic diagram of carrying another indication information and quantity information provided by the embodiment of the present application.
  • FIG. 6C is a schematic diagram of carrying another indication information and quantity information provided by the embodiment of the present application.
  • FIG. 7 is a schematic diagram of carrying another indication information and quantity information provided by the embodiment of the present application.
  • FIG. 8 is a schematic diagram of an application scenario provided by an embodiment of the present application.
  • FIG. 9 is a schematic diagram of another application scenario provided by the embodiment of the present application.
  • Fig. 10 is a schematic diagram of another application scenario provided by the embodiment of the present application.
  • FIG. 11 is a schematic diagram of a functional structure of a network device provided in this embodiment of the present application.
  • FIG. 12 is a schematic structural diagram of a network device provided in this embodiment of the present application.
  • Segment routing refers to dividing the network path into segments, and inserting segment information into the message at the path head node, and the intermediate nodes only need to forward according to the segment information carried in the message. These segments may be referred to as Segments and are identified by a Segment ID (SID).
  • the segment list (Segment List) can be obtained by orderly arranging the SIDs of the segments and network nodes at the head node, and the segment list can also be called a segment identification list (Segment ID List, SID List).
  • a segment list is used to indicate a forwarding path.
  • SR supports Multi-Protocol Label Switching (Multi-Protocol Label Switching, MPLS) and IPv6 two data planes, among them, the SR based on MPLS data plane is called SR-MPLS, and its SID is MPLS label (Label); SR is called SRv6, and its SID is an IPv6 address.
  • MPLS Multi-Protocol Label Switching
  • IPv6 IPv6 address
  • Segment routing policy is a new tunnel diversion technology developed on the basis of SR technology.
  • the path of SR Policy can be represented by a segment list, each segment list is used to indicate an end-to-end path from source to destination, and instructs devices in the network to follow the specified path to forward packets without following the internal gateway IGP calculation The shortest path to forward packets. See Figure 1.
  • Figure 1 is a schematic diagram of an SR Policy model.
  • the segment routing policy SR Policy is identified by three parts, which are the head-end binding segment ID (Binding Segment ID, also referred to as Binding SID or BSID) , color (Color) and endpoint (Endpoint), where the head-end BSID represents the SID of the originating node of the SR Policy, that is, the location where the SR Policy is generated or implemented; Color is used to distinguish multiple An SR Policy, Endpoint indicates the destination node of the SR Policy.
  • SR Policy has at least one candidate path (Candidate Path). Each candidate path is configured with a preference value (Preference) and a BSID that uniquely identifies the candidate path.
  • each candidate path contains at least one segment list (Segment List).
  • the segment list can also be called a segment identification list.
  • Each segment list can also be configured with a weight (Weight) for load sharing.
  • Each segment list contains at least one SID.
  • the SIDs in the segment list are the SIDs from each node on the forwarding path to the next hop.
  • the SR Policy in Figure 1 contains n candidate paths, which are candidate paths [1], ..., candidate paths [n].
  • candidate path [1] the preference value of candidate path [1] is preference value [1]
  • candidate path [1] contains m segment lists, which are respectively segment list [11], ..., segment list [1m] .
  • the weight of the segment list [11] is the weight [11]
  • the segment list [11] contains i segment identifiers.
  • Redundancy protection is one of the mechanisms to achieve business protection.
  • a redundancy strategy is proposed, that is, to enable data packet replication and instantiate multiple ordered segments between the copy node and the merge node list to direct the same flow through different paths in the SR domain.
  • FIG. 2 is a schematic diagram of a redundancy process of an SR network.
  • An SR domain is a collection of nodes or network devices participating in the SR protocol. Within an SR domain, nodes can perform ingress, transfer or egress procedures. In an SR network, the head node and end node are located outside the SR domain, while the path between them traverses the SR domain.
  • node 1 is a source node
  • node 8 is an end node
  • ingress node 2 , node 3 , node 4 , node 5 , node 6 and egress node 7 are located in the SR domain.
  • node 3 Take node 3 as the copy node and node 6 as the merge node in Figure 2 as an example to illustrate the forwarding process of SR network redundancy protection: after the ingress node 2 receives the message from node 1, it finds the path to the egress node 7 according to the local SR Policy And encapsulation section list; When message arrives duplicating node, i.e.
  • node 3 duplicates message and obtains multiple forwarding messages (for example, two forwarding messages, respectively message 1 and message 2) and respectively Encapsulate the segment list, wherein, the segment list of message 1 indicates that message 1 reaches egress node 7 via node 4 and node 6, and the segment list of message 2 indicates that message 2 reaches egress node 7 via node 5 and node 6, and every A forwarding message carries a flow identification (Flow Identification, FI) and a serial number (Serial Number, SN), and the flow identification and serial number can be used for message elimination by the merge node; message 1 and message 2 arrive through different forwarding paths
  • the merging node is node 6.
  • node 6 Assuming that node 6 receives message 1 first, it judges whether there is a flow identifier and serial number of a message in the stored data that are the same as those in message 1. If does not exist, then determine that message 1 is the first message received and store the flow identifier and sequence number of message 1, then node 6 forwards the first message (ie message 1) received to out of node 7, and eliminate redundant messages received subsequently, for example, node 6 subsequently receives message 2, and after comparison, it is determined that the stream identifier and sequence number of message 1 in the stored data are the same as those in message 2 The flow identifiers and sequence numbers of the two are the same, so packet 2 is discarded. In this way, when a certain forwarding path between the duplicating node and the merging node fails or loses packets, the business can continue to be transmitted through other forwarding paths, thereby realizing uninterrupted business.
  • the SR Policy is a redundant policy, and the number of candidate paths with the same preference in the redundant policy is used as the number of replicated packets at the replication node.
  • the SR Policy different candidate paths have different preferences, so the preference is used to determine the active candidate path.
  • Using the preference in the SR policy as a reference for the number of copied packets violates the semantics of the parameter preference in the SR Policy.
  • the above-mentioned judgment about whether the SR Policy is a redundant policy is complex and time-consuming, that is, it is necessary to compare whether the preferences of all candidate paths are the same and to count the number of candidate paths with the same preference.
  • the embodiment of the present application proposes a message sending method. Based on this method, the redundant policy and the number of copies of the message can be expressed concisely and efficiently without changing the mechanism of the SR Policy. The number of copies can flexibly select multiple forwarding paths for multiple sending of packets.
  • FIG. 3 is a schematic structural diagram of a communication system provided by an embodiment of the present application.
  • the communication system is used to realize the duplication of messages and the multiple sending of messages.
  • the communication system includes a controller and multiple nodes, wherein the controller can communicate with the multiple nodes, and any two nodes in the multiple nodes can communicate with each other. It should be noted that there are copy nodes and merge nodes in multiple nodes.
  • the controller may be a server deployed on the network side, or a component or chip in the server.
  • a node may be a network device such as a router or a switch, or may be a component used in a network device capable of performing the following method, such as a single board, a line card, or a chip.
  • multiple nodes include at least node A, node B, node C, node D and node E, wherein node A can be called the ingress node of the SR domain, and node B, node C and node D can be called the SR domain
  • the intermediate node of the domain, node E may be called the egress node of the SR domain.
  • the message sent by node A can reach node E through nodes B and C
  • the message sent by node A can reach node E through nodes B and node D.
  • the copying node may be node A or node B
  • the merging node may be node E, and there are multiple reachable paths between the copying node and the merging node.
  • this embodiment of the present application does not limit that node A can only be directly connected to node B, and in some possible embodiments, there may be at least one node between node A and node B.
  • the duplication node may acquire the indication information and quantity information locally or from the controller, and the duplication node duplicates the message according to the indication information to obtain multiple forwarded messages, the number of the multiple forwarded messages corresponds to the quantity information, At least two forwarding packets in the multiple forwarding packets encapsulate different forwarding paths, and send the multiple forwarding packets according to the respective forwarding paths encapsulated in the multiple forwarding packets, and after receiving the forwarding packets, the merge node Select the first received forwarding message to send.
  • the replication node if the replication node acquires the indication information and the quantity information locally, the replication node also needs to send the indication information and the quantity information to the controller.
  • FIG. 3 is only an exemplary architecture diagram, but does not limit the number of network elements included in the system shown in FIG. 3 .
  • FIG. 3 may also include other functional entities.
  • the method provided in the embodiment of the present application can be applied to the communication system shown in FIG. 3 , and of course the method provided in the embodiment of the present application can also be applied to other communication systems, which is not limited in the embodiment of the present application.
  • FIG. 4 is a flowchart of a method for sending a message provided in an embodiment of the present application.
  • the method can be applied to network nodes.
  • the method includes but is not limited to the following steps:
  • the indication information is used to instruct the network node to copy the message, and the quantity information corresponds to the number of copied messages.
  • the quantity information is 3, that is, three copies of a received message are copied, and the number of copied messages is 3.
  • the network node may be a head node or an intermediate node.
  • the head node can be the ingress node (Ingress Node) in the SR or SRv6 network
  • the intermediate node can be a node other than the ingress node and the egress node (Egress Node) in the SR or SRv6 network.
  • a network node may also be referred to as a replication node.
  • the above-mentioned message may be an Internet protocol version 4 (Internet protocol version4, IPv4) message or an Internet protocol version 6 (Internet protocol version 6, IPv6) message.
  • the above message may be an SRv6 message or an SR MPLS message, which is not specifically limited in this embodiment of the present application.
  • the indication information and the quantity information are included in the policy information.
  • the policy information may be SR Policy or SRv6 policy, which is not specifically limited in this embodiment of the present application.
  • acquiring the indication information and the quantity information may be: receiving a notification message sent by the controller, the notification message including the above policy information; acquiring the indication information and the quantity information according to the notification message.
  • the controller can extend the notification message through the border gateway protocol (Border Gateway Protocol, BGP).
  • BGP Border Gateway Protocol
  • the notification message is a BGP message, and the manner in which the indication information and quantity information are carried in the BGP message can be referred to for details.
  • Mode A1 and Mode A2 as follows:
  • Method A1 Subtype-length-value Binding SID Sub-TLV of the binding segment identifier carried in the BGP message
  • FIG. 5 exemplarily provides a schematic diagram of carrying indication information and quantity information in the Binding SID Sub-TLV, wherein the Binding SID Sub-TLV shown in FIG. 5 includes the following fields:
  • Length indicates the length of the Binding SID
  • Flags 1 byte, which contains a 1-bit S flag for encoding the "Specified-BSID-only” behavior; a 1-bit I flag for the "discard when invalid" behavior coding;
  • Binding SID indicates the BSID of the SR Policy. If the length is 2, the Binding SID is not carried; if the length is 6, the Binding SID is coded in 4 bytes; if the length is 18, the Binding SID contains 16 bytes of the SRv6 SID.
  • At least one identification field may be added in the flag bit Flags of the Binding SID Sub-TLV to carry the above-mentioned indication information and quantity information, for example, the first flag field is used to carry the indication information, and the second identification field Fields are used to carry quantity information.
  • the representation of the identification field may be in the form of a bitmap, or in the form of a binary value, which is not specifically limited in this application.
  • the newly added identification field may also exist independently of the Flags field in the Binding SID Sub-TLV.
  • the indication information and the quantity information may also be carried in different fields in the Binding SID Sub-TLV, for example, the indication information may be carried in the Flags field of the Binding SID Sub-TLV, and the quantity information may be carried in the Binding SID Sub-TLV's Binding SID field.
  • the indication information and quantity information may also be carried in the reserved bit field and/or the Type field in the Binding SID Sub-TLV.
  • a new TLV field can also be added in the Binding SID Sub-TLV, and an identification field can be set in the TLV field to carry the indication information and the quantity information.
  • the first identification field is used to carry indication information
  • the second identification field is used to carry quantity information.
  • the present application does not specifically limit the carrying manner of the identification field in the TLV field.
  • the first identification field may be carried in the T field
  • the second identification field may be carried in the V field, that is, the indication information is carried in the T field, and the quantity information is carried in the V field.
  • both the first identification field and the second identification field may be carried in the T field, that is, both the indication information and the quantity information may be carried in the T field.
  • both the first identification field and the second identification field may be carried in the V field, that is, both the indication information and the quantity information may be carried in the V field.
  • reserved bits may also be set in the T field to carry the above indication information and quantity information.
  • a redundancy attribute Redundancy Attribute can be newly defined in the segment routing policy encoding structure SR Policy Encoding Structure of the tunnel encapsulation attribute Tunnel Encaps Attribute field, and the Redundancy Attribute can carry indication information and quantity information in the form of a TLV field.
  • an identification field is set in the Redundancy Attribute, wherein the first identification field is used to carry indication information, and the second identification field is used to carry quantity information. This application does not specifically limit the manner in which the identification field is carried in the Redundancy Attribute TLV field.
  • the first identification field may be carried in the T field of the Redundancy Attribute TLV
  • the second identification field may be carried in the V field of the Redundancy Attribute TLV.
  • both the first identification field and the second identification field may be carried in the T field of the Redundancy Attribute TLV.
  • both the first identification field and the second identification field may be carried in the V field of the Redundancy Attribute TLV.
  • reserved bits can also be set in the T field of the Redundancy Attribute TLV to carry the above indication information and quantity information.
  • Indication information and quantity information can be encoded using SR Policy Encoding Structure in the Tunnel Encapsulation Attribute.
  • the following example provides an extended SR Policy Encoding Structure data format:
  • the Redundancy Attribute is added to the original SR Policy Encoding Structure to carry the above-mentioned indication information and quantity information.
  • the carrying method of the indication information and quantity information in the Redundancy Attribute please refer to the relevant description in the above-mentioned A2 method.
  • the controller can also extend the notification message through the Path Computation Element communication Protocol (Path Computation Element communication Protocol, PCEP).
  • PCEP Path Computation Element communication Protocol
  • the notification message is a PCEP message
  • the indication information and quantity information are included in the PCEP message.
  • (1) in FIG. 6A provides a schematic diagram of the format of an extended association identification TLV field.
  • the extended association identification TLV field includes the following fields:
  • Length The value is 8 or 20, depending on whether the IPv4 or IPv6 address is encoded in the Endpoint;
  • Color indicates the color value of SR Policy
  • Endpoint Can be an IPv4 or IPv6 address, and this value is part of the tuple ⁇ color, endpoint> that identifies the SR Policy for a given headend.
  • a flag bit field may be added to the Extended Association ID TLV field to carry quantity information and indication information.
  • the indication information and quantity information may be carried in a flag bit field.
  • the indication information and the quantity information may also be carried in different flag fields, that is, the indication information may also be carried in the first flag field, and the quantity information may be carried in the second flag field.
  • the type field in the Extended Association ID TLV field can also be used to carry indication information and quantity information.
  • multiple bits are newly added in the type field to carry indication information and quantity information.
  • a new bit can also be added in the type field to carry indication information, and an additional flag bit field can be added to the Extended Association ID TLV field to carry quantity information, which is not specifically limited in the embodiment of this application .
  • a TLV field can also be added in the Extended Association ID TLV field to carry indication information and quantity information.
  • indication information and quantity information are carried in the TLV field, please refer to the relevant TLV bearing indication information in the above method A1. and the description of the quantity information will not be repeated here.
  • Mode B2 Bind the TE Path Binding TLV field to the traffic engineering path carried in the PCEP message
  • TE Path Binding TLV is a general TLV, which is used to bear the binding label or SID of the traffic engineering path (that is, MPLS label or SRv6 SID).
  • FIG. 6B exemplarily provides a schematic diagram of carrying indication information and quantity information in the TE Path Binding TLV, wherein the TE Path Binding TLV shown in FIG. 6B includes the following fields:
  • Binding Type (Binding Type, BT): The value is 0, indicating that the binding value is a 20-bit MPLS label value; the value is 1, indicating that the binding value is a 32-bit MPLS label stack entry; the value is 2, Indicates that the binding value is an SRv6 SID with a 16-byte IPv6 address format; a value of 3 indicates that the binding value is a 24-byte field, which contains the SRv6 SID and its behavior and structure;
  • Flags 1 byte, including a 1-bit removal bit (Removal, R).
  • R When R is set, it requests the PCEP peer to remove the binding of the Label Switched Path (LSP). Fixed value; when R is not set, the PCEP peer indicates to add or reserve the binding value for the LSP;
  • Binding Value variable length field, when BT is 0, 20 bits represent the MPLS label; when BT is 1, 32 bits represent the MPLS label stack entry; when BT is 2, 128 bits represent the SRv6 SID ; When BT is 3, Binding Value also includes SRv6 Endpoint Behavior and SID Structure.
  • At least one identification field can be added in the flag bit Flags of the TE Path Binding TLV field to carry the above indication information and quantity information, for example, the first flag field is used to carry the indication information, and the second identification field is used for Bearer quantity information.
  • the newly added identification field may also exist independently of the Flags field in the TE Path Binding TLV.
  • the indication information and quantity information may also be carried in the type field or reserved bit field in the TE Path Binding TLV.
  • a TLV field can also be added in the TE Path Binding TLV field to carry indication information and quantity information.
  • indication information and quantity information are carried in the TLV field, please refer to the relevant TLV bearing indication information in the above method A1. and the description of the quantity information will not be repeated here.
  • the indication information and the quantity information may also be carried in different fields in the TE Path Binding TLV.
  • the indication information is carried in any one of the type field, the flag field and the newly added flag field of the TE Path Binding TLV field, and the quantity information is carried in the reserved bit field or the binding value field of the TE Path Binding TLV field , the embodiment of the present application does not specifically limit it.
  • Mode B3 The SRPolicy-Cpath-ID TLV field of the segment routing policy candidate path identifier carried in the PCEP message
  • FIG. 6C exemplarily provides a schematic diagram of carrying indication information and quantity information in the SRPolicy-Cpath-ID TLV, wherein the SRPolicy-Cpath-ID TLV shown in FIG. 6C includes the following fields:
  • Type The value is 57, used to indicate that the type is SRPolicy-Cpath-ID TLV;
  • Length the value is 28;
  • Protocol origin 8-bit representation, please refer to the relevant description of the protocol origin field in the above method A2;
  • Originator Autonomous System Number 4 bytes, as part of the identity of the originator;
  • Originator Address 128 bits, as part of the identity of the originator
  • Discriminator 32-bit representation, used to distinguish candidate paths.
  • the indication information and quantity information may be carried in a reserved bit field in the SRPolicy-Cpath-ID TLV.
  • an identification field may be added to the reserved bit field for carrying indication information and quantity information, for example, the first identification field is used for carrying indication information, and the second identification field is used for carrying quantity information.
  • the representation of the identification field may be a bitmap or a binary value, which is not specifically limited in this application.
  • the indication information and quantity information may also be carried in the type field in the SRPolicy-Cpath-ID TLV.
  • an identification field is added to the type field to carry indication information and quantity information, wherein the representation of the identification field may be a bitmap or a binary value, which is not specifically limited in this application.
  • different fields in the SRPolicy-Cpath-ID TLV may also be used to carry indication information and quantity information.
  • the indication information can be carried in the type field in the SRPolicy-Cpath-ID TLV
  • the quantity information can be carried in the reserved bit field in the SRPolicy-Cpath-ID TLV.
  • SRPolicy-Cpath-ID TLV it is also possible to add a TLV field or a new Flag field in the SRPolicy-Cpath-ID TLV to carry the indication information and the quantity information, which are not specifically limited here.
  • the way to carry the indication information and quantity information in the PCEP message may also be: add a new TLV field for carrying the indication information and quantity information, and the TLV field Association Information carried in the PCEP message.
  • the indication information is included in the policy information, and the quantity information is included in the segment identifier of the network node.
  • obtaining the indication information and quantity information may also include: receiving a notification message sent by the controller, the notification message including policy information; obtaining the indication information according to the notification message; obtaining the quantity information according to the segment identifier of the network node.
  • the segment identifier is a binding segment identifier Binding SID
  • the Binding SID may be an IPv6 address or an SR MPLS label. That is to say, the quantity information is decoupled from the policy information, only the indication information is included in the policy information, and the indication information is delivered by the controller, and the quantity information may be configured locally by the network node.
  • the manner in which the indication information is carried in the BGP message can refer to the description about the manner in which the indication information is carried in any one of the foregoing manners A1 to A2, which will not be repeated here.
  • the manner in which the indication information is carried in the PCEP message can refer to the description about the manner in which the indication information is carried in any one of the manners B1 to B3 above, and will not be repeated here.
  • the network node being a head node or a network node.
  • the message received by the network node includes the segment identifier of the network node.
  • the head node may acquire the indication information and the quantity information in any of the above methods A1-A2 and B1-B3.
  • the network node when the network node is an intermediate node, the network node can obtain indication information and quantity information in any of the above methods A1-A2 and B1-B3, etc., and the network node can also pass
  • the segment identifier carries indication information to realize the definition of the replication action of the network node.
  • the segment identifier may be a SID of type End.B6.Replication.
  • the intermediate node can extend a Replication behavior to End.B6 (Endpoint Bound to an SRv6 TE Policy), that is, End.B6.Replication instructs the network node to perform a replication action, where B6 means that it is applied to the SRv6 TE Policy, Replication means to replicate the received message.
  • End.B6 Endpoint Bound to an SRv6 TE Policy
  • the acquisition of instruction information and quantity information can refer to the following methods C1-Method C2:
  • Mode C1 The indication information is included in the segment identifier of the network node, and the quantity information is included in the policy information
  • obtaining the indication information and the quantity information may be: receiving a notification message sent by the controller, the notification message including policy information; obtaining the quantity information according to the notification message; obtaining the indication information according to the segment identifier of the network node. That is to say, instruction information is decoupled from policy information.
  • the manner in which the quantity information is carried in the BGP message can refer to any description of the manner in which the quantity information is carried in the above methods A1-A2, for example, the quantity information can be carried in the BGP message Binding SID in the Binding SID Sub-TLV.
  • the carrying manner of the quantity information in the PCEP message can refer to the description of any one of the above-mentioned manners B1-B3 about the carrying manner of the quantity information, for example, the quantity information can be carried in the PCEP message In the Binding Value of the TE Path Binding TLV.
  • the indication information carried in the segment identifier may be configured locally by the network node, or the controller may separately deliver the segment identifier containing the indication information to the network node through a BGP message or a PECP message. .
  • the indication information is included in the segment identifier of the network node, which may be: the segment identifier of the network node is associated with the Endpoint Behavior field of the BGP message, where the Endpoint Behavior field is located in the SRv6 Segment identifier endpoint behavior and structure subtype-degree-value SRv6 SID Endpoint Behavior and Structure Sub-TLV; or, the indication information is included in the segment identifier of the network node, which can be: the segment identifier of the network node and the Endpoint Behavior of the PCEP message Field association, where the Endpoint Behavior field is located in the SRv6 endpoint behavior and segment identification structure SRv6 Endpoint Behavior and SID Structure.
  • the network node may associate the segment identifier with the corresponding endpoint behavior through a relevant command line.
  • Mode C2 The indication information and quantity information are included in the segment identifier of the network node
  • obtaining the indication information and the quantity information may be: obtaining the quantity information and the quantity information according to the segment identifier of the network node.
  • the segment identifier containing indication information and quantity information in the segment identifier can be configured locally by the network node, or can be delivered to the network node by the controller alone. This embodiment of the present application does not make specific limited.
  • the SID of the End.B6.Replication type can be associated with the Endpoint Behavior field in the BGP message or the PECP message, and the quantity information is carried in the SID of the End.B6.Replication type, for example, the parameter field in the SID.
  • the indication information and the quantity information may be locally configured by the network node, and the indication information and the quantity information may be acquired from a local memory.
  • the indication information and the quantity information may be included in the policy information, or the indication information is included in the policy information but the quantity information is included in the segment identifier, which is not specifically limited here.
  • the bearing mode of the indication information and the quantity information can be any of the following: (1) both the indication information and the quantity information can be included in the policy information; (2) the indication information can be included in the policy information But the quantity information is included in the segment identifier of the network node; (3) the instruction information is included in the segment identifier, and the quantity information is included in the policy information; (4) the instruction information and the quantity information are included in the segment identifier of the network node.
  • the network node configures the indication information and quantity information locally, wherein the indication information can be an H.Encap.Replication or H.Insert.Replication instruction to perform a copy action on the message, and the quantity information can be bound in the network node Carried in the parameter arguments of the segment identifier Binding SID.
  • the indication information can be an H.Encap.Replication or H.Insert.Replication instruction to perform a copy action on the message
  • the quantity information can be bound in the network node Carried in the parameter arguments of the segment identifier Binding SID.
  • the network node may also identify local configuration indication information and quantity information through a segment.
  • the segment identifier may be a SID of the End.B6.Replication type
  • the quantity information may be carried in arguments of the SID of the End.B6.Replication type.
  • the network node if the indication information and/or quantity information are locally configured by the network node, the network node also needs to send the indication information and/or quantity information to the controller. Specifically, if both the indication information and the quantity information are configured locally, the network node needs to send the indication information and the quantity information to the controller; if only the indication information is configured locally, the network node sends the indication information to the controller, namely Yes; if only the quantity information is configured locally, it is enough for the network node to send the quantity information to the controller.
  • the network node can send indication information and/or quantity information to the controller through Border Gateway Protocol Link-state (BGP-LS), that is, the network node sends a BGP-LS message to the controller , the BGP-LS message contains indication information and/or quantity information, and the manner in which the indication information and/or quantity information is carried in the BGP-LS message can specifically refer to the following manners D1 and D2:
  • Border Gateway Protocol Link-state BGP-LS
  • Mode D1 TE Policy Descriptors carried in BGP-LS messages
  • the indication information and/or quantity information may be carried in TE Policy Descriptors of the BGP-LS message by adding a Flag bit or a TLV field, and the like.
  • a flag bit Flag can be added to the TE Policy Descriptors, and the flag bit can be used to carry indication information and/or quantity information.
  • the first group of bits in the flag bits is used to carry indication information
  • the second group of bits in the flag bits is used to carry quantity information.
  • the indication information and the quantity information may also be carried by two flag bits, and this embodiment of the present application does not limit the number of flag bits to be added.
  • a TLV field may also be added to TE Policy Descriptors, and an identification field is set in the TLV field to carry indication information and/or quantity information.
  • an identification field is set in the TLV field to carry indication information and/or quantity information.
  • Mode D2 Segment routing policy candidate path descriptor SR Policy Candidate Path Descriptor carried in BGP-LS message
  • the indication information and/or quantity information may be carried by using the existing Flags field or the newly added TLV field in the SR Policy Candidate Path Descriptor of the BGP-LS message.
  • FIG. 7 exemplarily provides a schematic diagram of carrying indication information and quantity information in the SR Policy Candidate Path Descriptor, wherein the SR Policy Candidate Path Descriptor shown in FIG. 7 includes the following fields:
  • Type The value is 554, which is used to indicate that the type is SR Policy Candidate Path Descriptor;
  • Protocol-origin a 1-byte field that identifies the protocol or component responsible for instantiating this path; a value of 1 indicates that the protocol origin is PCEP; a value of 2 indicates that the protocol origin is BGP SR Policy; value It is 3, which means local;
  • Flags 1-byte field, which contains a 1-bit E flag and a 1-bit O flag, where, when E is set, it indicates that the endpoint is encoded as an IPv6 address; when E is not set, it indicates The endpoint is encoded as an IPv4 address; when O is set, the code indicating the initiator address is an IPv6 address; when O is not set, the code indicating the initiator address is an IPv4 address;
  • Endpoint 4 or 16 bytes, containing the address of the endpoint of SR Policy
  • Policy Color 4 bytes, used to indicate the color value of SR Policy
  • Originator AS Number 4 bytes carrying the 4-byte ASN code of the originator
  • Originator Address 4 or 16 bytes, carrying the address of the originator
  • Discriminator 4 bytes, carrying the discriminator of the path.
  • At least one identification field may be added in the flag bit Flags of SR Policy Candidate Path Descriptor to indicate the above indication information and/or quantity information, for example, the first identification field is used to carry indication information, and the second identification field Used to carry quantity information.
  • the representation of the identification field may be a bitmap or a binary value, which is not specifically limited in this application.
  • the newly added identification field may also exist independently of the Flags field in the SR Policy Candidate Path Descriptor.
  • a TLV field may also be added in the SR Policy Candidate Path Descriptor to carry indication information and/or quantity information, where the placement method of the newly added TLV field in the SR Policy Candidate Path Descriptor is not specifically limited, for example , can be placed after the Discriminator field.
  • the placement method of the newly added TLV field in the SR Policy Candidate Path Descriptor is not specifically limited, for example , can be placed after the Discriminator field.
  • the description about the indication information and/or quantity information carried by the TLV field refer to the description about the indication information and the quantity information for the TLV bearer in the above method A1, and details are not repeated here.
  • the network node obtains the first packet, wherein the feature information of the first packet matches the policy information in S101 above.
  • the characteristic information of the first message includes but not limited to the Differentiated Service Code Point (DSCP) carried in the first message, the destination address of the first message or the DSCP carried in the first message.
  • DSCP Differentiated Service Code Point
  • the head node when the network node is a head node, after receiving the first message, the head node may determine the first message according to the destination address of the first message and/or the DSCP carried in the first message The packet matches the above policy information.
  • the first packet may be an IPv4 or IPv6 packet.
  • the policy information is SR Policy; when the first message is an IPv6 message, the policy information is SRv6 Policy.
  • the first message when the network node is an intermediate node, the first message contains the segment identifier of the network node, and after receiving the first message, the network node determines that the first message carries its own segment identifier, based on the The segment identifier is associated with the above policy information.
  • the first packet may be an SR MPLS packet or an SRv6 packet.
  • the policy information is SR Policy; when the first message is an SRv6 message, the policy information is SRv6 Policy.
  • S103 Copy the first packet according to the indication information to obtain multiple second packets, and the quantity of the multiple second packets corresponds to the quantity information.
  • the quantity of the multiple second packets corresponds to the quantity information, which may be: the quantity of the multiple second packets is the sum of the quantity indicated by the quantity information and 1.
  • the quantity indicated by the quantity information is N, where N is a positive integer greater than or equal to 2, after the network node performs the copy operation on the first message, the quantity of the second message obtained is N+1.
  • each of the multiple second packets includes a sequence number SN.
  • each of the multiple second packets further includes a flow identifier FI.
  • the flow identifiers of the second packets are the same and the sequence numbers of the second packets are the same.
  • the merging node determines the first received second message according to the sequence number (or sequence number and flow identifier) in the second message, and When the second message with the same sequence number (or the same sequence number and flow identifier) is subsequently received, it is discarded, thereby realizing the selective reception of messages.
  • the method of adding the flow identifier and the sequence number may be: before the first packet reaches the network node, the first packet itself carries the flow identifier and the sequence number, so the network node copies the first packet Afterwards, each of the obtained multiple second packets also includes a flow identifier and a sequence number.
  • the method of adding the flow identifier and the sequence number may also be: before the first packet reaches the network node, the first packet itself does not carry the flow identifier and the sequence number, so the network node receives the first packet After the text, first add the flow identifier and sequence number to the first packet, and then copy the first packet, so that each of the multiple second packets obtained by the network node contains the flow identifier and serial number.
  • the manner of adding the flow identifier and the sequence number may also be: respectively adding the sequence number and the flow identifier in multiple second packets, which is not specifically limited in this embodiment of the present application.
  • S104 Send the above multiple second packets, where at least two of the multiple second packets encapsulate different forwarding path information.
  • At least two second packets among the plurality of second packets encapsulate different forwarding paths, which may be: each second packet among the plurality of second packets encapsulates different forwarding paths. forwarding path.
  • the number of forwarding paths is greater than 2, and the number of forwarding paths may be less than or equal to the number of second packets.
  • the forwarding path information is the SID List contained in the policy information.
  • the encapsulation of the network node selecting the SID List for the second message to forward the path includes the following methods:
  • the first method use the candidate path in the policy information as the selection unit
  • At least two of the multiple second packets encapsulate different forwarding paths, including: at least two of the multiple second packets encapsulate different SID List, SID List corresponds to the SID List of a path among multiple candidate paths, and these multiple candidate paths are determined according to the preference value preference of each candidate path in the policy information.
  • the quantity indicated by the indication information is N (N is a positive integer greater than or equal to 2), and M candidate paths are selected from the policy information according to the indication information, where M is a positive integer greater than or equal to 2 and M is less than or equal to N.
  • N is a positive integer greater than or equal to 2
  • M is less than or equal to N.
  • M candidate paths are selected from the multiple SID Lists contained in each candidate path, so as to obtain M SID Lists.
  • the M candidate paths may be determined in descending order according to the preference of each candidate path in the policy information, or may be randomly selected, which is not specifically limited in this embodiment of the present application.
  • the SID List corresponding to each candidate path in the M candidate paths may be the SID List corresponding to the maximum weight in the candidate path, or may be randomly selected, which is not specifically limited in the embodiment of the present application.
  • an identifier can also be set for each candidate path in the policy information.
  • the flag for this candidate path is set.
  • the number indicated by the indication information is N (N is a positive integer greater than or equal to 2), then the number of the second message is N+1, and M candidate paths are selected from the policy information according to the indication information, including: for For the first second message, select the candidate path 1 with the largest preference from the policy information, and set the flag 1 to indicate that candidate path 1 is selected; for the second second message, select the remaining path 1 from the policy information Select the candidate path 2 with the largest preference among the unselected candidate paths, and set the flag bit 2 to indicate that the candidate path 2 is selected; ...; For the N+1th second message, the remaining unselected paths from the policy information Select the candidate path M with the largest preference among the selected candidate paths, and set the flag M to indicate that the candidate path M is selected.
  • the SID List corresponding to each candidate path among the selected M candidate paths may be the SID List corresponding to the maximum weight in the candidate path, or may be randomly selected, which is not specifically limited in this embodiment of the present application.
  • the second type use the SID List in the policy information as the selection unit
  • At least two of the multiple second packets encapsulate different forwarding paths, including: at least two of the multiple second packets encapsulate different SID List, the SID List encapsulated in each second message in multiple second messages corresponds to the same candidate path in the policy information.
  • the number indicated by the indication information is N (N is a positive integer greater than or equal to 2), assuming that M SID Lists need to be selected from the policy information according to the indication information, and each SID List represents a forwarding path.
  • a candidate path may be selected from the policy information first, and M SID Lists are selected from multiple SID Lists of the candidate path, where M is a positive integer greater than or equal to 2 and M is less than or equal to N.
  • the candidate path may be a candidate path corresponding to the maximum preference in the policy information or a candidate path randomly selected from the policy information.
  • the M SID Lists corresponding to the candidate path may be selected according to the weight of each SID List in the candidate path in descending order, or may be randomly selected, which is not specifically limited in this embodiment of the present application.
  • the SID List encapsulated in each second packet in the plurality of second packets may perform load sharing according to their respective weights.
  • the number of candidate paths included in the policy information is greater than or equal to the number of second packets, or the number of SID Lists included in a candidate path in the policy information is greater than or equal to the number of second packets.
  • the network node can select a SID List to replace the faulty one from other unselected candidate paths or other SID Lists of candidate paths in the policy information. SID List, which effectively solves the fault problem of multiple messages being sent and selected, and improves the reliability of message forwarding.
  • the quantity indicated by the quantity information is 2, then the quantity of the second message is 3, and the number of the second messages is 3 by taking the message 1, the message 2 and the message 3 as examples to illustrate that the network node sends the multiple The process of the second message:
  • the number of forwarding paths used to encapsulate the second message is equal to the number of the second message. For example, if packet 1 is encapsulated using path 1, packet 2 is encapsulated using path 2, and packet 3 is encapsulated using path 3, then the above process of sending multiple second packets is specifically: sending based on path 1 For packet 1, packet 2 is sent based on path 2, and packet 3 is sent based on path 3.
  • the number of forwarding paths used to encapsulate the second packet is smaller than the number of the second packet. For example, using path 1 to respectively encapsulate message 1 and message 2 and using path 2 to forward message 3, the above process of sending multiple second messages is specifically: sending message 1 and message 2 respectively based on path 1 Packet 2, send packet 3 based on path 2.
  • the redundancy policy is expressed by extending the policy attribute, that is, the BGP-LS/BGP/PCEP protocol is provided to extend the bearer indication information and quantity information, so that the network node can process the packet according to the indication information. Execute the copy action and determine the copy number of the message according to the quantity information.
  • the redundancy policy also provides a variety of encapsulation methods for selecting the SID List, so that network nodes can flexibly select the forwarding path for encapsulation of multiple messages, thereby realizing multiple sending of messages and improving the reliability of message forwarding.
  • FIG. 8 is a schematic diagram of an application scenario provided by an embodiment of the present application, and the above-mentioned network node is a head node, that is, the copy node is a head node.
  • the head node is node R, that is, the copy node is node R
  • the merge node is node M.
  • path 1 path 1
  • path 2 path 2
  • Node R receives the first message from the previous node, and can divert the first message to the corresponding policy information through the Color attribute or DSCP mode.
  • Node R obtains the above-mentioned indication information and quantity information, and according to the indication information and the number of copies Copying the first message to obtain a plurality of second messages, and sending the multiple second messages based on the respective forwarding paths encapsulated in the multiple second messages, the number and quantity information of the multiple second messages correspond.
  • the above indication information, quantity information, and policy information may be configured locally by the node R or sent to the node R by the controller, which is not specifically limited in this embodiment of the present application.
  • the carrying mode of the indication information and quantity information in the BGP message can refer to the above-mentioned embodiment Any one of the ways A1 and A2, which will not be repeated here.
  • the specific process of message forwarding in Figure 8 is as follows:
  • the controller sends the SRv6 Policy to node R.
  • the SRv6 Policy includes instruction information and quantity information.
  • the instruction information is used to instruct network nodes to copy packets, and the quantity information corresponds to the number of replicated packets.
  • the replication node R uses the Color attribute of the BGP route to iterate to the SRv6 Policy.
  • node R After receiving the first message, node R determines that the characteristic information of the first message matches the SRv6 Policy, obtains the indication information and quantity information from the SRv6 Policy, and copies the first message according to the indication information and quantity information , to obtain multiple second packets, for example, the multiple second packets include second packet 1 and second packet 2 .
  • the node R adds the flow identifier F1 and the sequence number SN to the first message, so the second message 1 also includes the flow identifier and the sequence number.
  • the second message 2 compared with the first message, the second message 2 newly inserts IPv6 header information, segment routing header SRH information, flow identifier and sequence number, wherein the SRH information includes the SID List of path2.
  • Node R after obtaining the second message 1 and the second message 2, sends the second message 1 based on the encapsulated path1 and sends the second message 2 based on the encapsulated path2.
  • the node R1 forwards the SRH information in the second message 1 to the node M hop by hop, and the node R2 forwards the SRH information in the second message 2 to the node M hop by hop.
  • node M will receive the first second message and forward it, and discard the rest of the messages. Multiple sending and selective receiving of messages.
  • FIG. 9 is a schematic diagram of another application scenario provided by the embodiment of the present application, and the above-mentioned network node is an intermediate node, that is, the copy node is an intermediate node.
  • the copy node is node R
  • the merge node is node M
  • there are two paths between the copy node and merge node M which are respectively path 1 and path 2, wherein, path 1 indicates the route to node M via node R1 Path, path 2 indicates the path to node M via node R2.
  • node I After node I receives the message, it can iterate to the corresponding policy information 1 according to the color or DSCP method, and based on the policy information 1, send the encapsulated message (which can be called the first message) to node R, and the node
  • R determines that the segment identifier carried by the first packet is the same as the local SID, it determines that the first packet matches the local policy information 2 and obtains the above indication information and quantity information, and performs the first packet according to the indication information and quantity information.
  • the multiple second packets are obtained by copying, and the multiple second packets are respectively sent on the forwarding paths that are respectively encapsulated.
  • policy information 1 may be locally configured by node I or issued by the controller, and the above instruction information, quantity information and policy information 2 may be locally configured by node R or issued by the controller , which is not specifically limited in this embodiment of the present application.
  • the quantity information is included in the policy information, and the policy information is sent by the controller to the replication node through the PCEP message, and the indication information is set by the replication node in the segment identifier.
  • the quantity information is in For the bearer manner in the PCEP message, reference may be made to the relevant descriptions in the foregoing embodiments.
  • the specific process of message forwarding in Figure 9 is as follows:
  • Node R locally configures a segment identifier to carry indication information, which is used to instruct node R to replicate the message, and the segment identifier may be a SID of type End.B6.Replication.
  • node R also receives SRv6 Policy1 issued by the controller, and SRv6 Policy1 contains quantity information, where the quantity information corresponds to the quantity of copied messages.
  • the controller can also issue end-to-end SRv6 Policy 2 to node I, and the path of SRv6 Policy 2 includes the segment identifier of node R.
  • the end-to-end SRv6 Policy2 may also be locally configured by node 1.
  • node I Configure a tunnel policy on node I to specify the tunnel SID list between node I and node E.
  • node I uses color or DSCP to direct the message to the SRv6 Policy 2, and encapsulates the flow identifier FI, serial number SN, SRH information and IPv6 header 1 for the message, where the SRH information is SRH[E ,M,R,I].
  • Node I forwards the encapsulated message (which may be referred to as the first message) to node R according to the SRH information.
  • Node R receives the first message from node I, and node R determines that the segment identifier carried by the first message is a local segment identifier, and performs a copy action on the first message based on the indication information carried by its own segment identifier , to obtain a plurality of second packets, wherein the quantity of the second packets corresponds to the quantity indicated by the quantity information in the SRv6 Policy1, and the plurality of second packets are encapsulated according to the SRv6 Policy1.
  • the plurality of second messages include second message 1 and second message 2 .
  • node R encapsulates the first packet in Encap mode to obtain the second packet, that is, applies SRv6 TE Policy by encapsulating the outer IPv6 header and SRH. Therefore, compared with the first message sent by node I, SRH[R1 End.X] and IPv6 header 2 are newly inserted in the second message 1, where node R1 is the node of path 1 between node R and node M Last jump. Correspondingly, compared with the first message, SRH[R2 End.X] and IPv6 header 3 are newly inserted in the second message 2, where node R2 is the last hop of path 2 between node R and node M .
  • the node R forwards the second message 1 to the node R1 according to the SRH[R1 End.X] in the second message 1, and the node R forwards the second message 1 according to the SRH[R2 End.X] in the second message 2 Text 2 is forwarded to node R2.
  • Node R1 receives the second message 1, and forwards it to node M according to the SRH[E, M, R, I] in the second message 1; node R2 receives the second message 2, and according to the second message SRH[E,M,R,I] in 2 is forwarded to node M.
  • the node E After receiving the second message sent by the node, the node E obtains the service data from the second message.
  • FIG. 10 is a schematic diagram of another application scenario provided by the embodiment of the present application.
  • the replication node R acquires indication information and quantity information from the local or the controller, wherein the indication information is used to instruct the replication node R to replicate the message, and the quantity information corresponds to the quantity of the replicated message.
  • the SRPolicy configured on the replication node R contains four forwarding paths, namely path 1 (path1), path 2 (path2), path 3 (path3) and path 4 (path4), and path1 indicates the path to the merge node M via node R1
  • path2 indicates the path to merge node M via node R2
  • path3 indicates the path to merge node M via node R3
  • path4 indicates the path to merge node M via node R4.
  • the replication node R obtains three second messages after executing the replication action, which are respectively message 1, message 2 and message 3, and the replication node R can obtain three second messages from the SRPolicy Select three forwarding paths for the encapsulation of the second message. For example, use path1 to encapsulate message 1, use path2 to encapsulate message 2, and use path path3 to encapsulate message 3, then copy node R forwards message 1 based on path1, and based on path2 Forward packet 2 and forward packet 3 based on path3.
  • the replication node R detects that path3 among the selected forwarding paths path1, path2, and path3 fails. Since the number of forwarding paths included in the SR Policy on the replication node R is greater than the number of the above-mentioned second messages, the replication node R R can select path4 to replace the faulty path3, that is, use path4 to encapsulate packet 3 and forward packet 3 based on path4. It can be seen from this that when a path failure occurs in a multi-sending and selective-receiving scenario, the replication node in the embodiment of the present application can flexibly select another forwarding path to replace, thereby improving the reliability of packet forwarding.
  • the replication node R detects that two of the three selected forwarding paths path1, path2, and path3 are faulty, and the number of remaining unselected forwarding paths in the SR Policy is 1, so it is impossible to select three forwarding paths The forwarding path is used for the encapsulation of the second message.
  • the replication node R can send an alarm message to the controller, and the controller can adjust the quantity indicated by the quantity information according to the alarm information and re-issue the SR Policy to the replication node R.
  • the Binding SID when the Binding SID carries quantity information, if the above failure occurs, only the Binding SID needs to be dynamically updated, and the controller does not need to re-issue the SR Policy, thereby realizing the decoupling of quantity information and policy information.
  • FIG. 11 is a schematic diagram of a functional structure of a network device provided by an embodiment of the present application.
  • the network device 30 includes an acquiring unit 310 , a copying unit 312 and a sending unit 314 .
  • the network device 30 may be implemented by hardware, software, or a combination of software and hardware.
  • the obtaining unit 310 is configured to obtain indication information and quantity information, wherein the indication information is used to instruct the network node to copy the message, and the quantity information corresponds to the quantity of the copied message; the obtaining unit 310 is also used to obtain the first report
  • the copying unit 312 is used to copy the first message according to the indication information to obtain multiple second messages, and the quantity of the multiple second messages corresponds to the quantity information; the sending unit 314 is used to send the multiple second messages packets, at least two second packets among the plurality of second packets encapsulate different forwarding path information.
  • Each functional module of the network device 30 may be used to implement the method described in the embodiment of FIG. 4 .
  • the obtaining unit 310 may be used to perform S101 and S102
  • the copying unit 312 may be used to perform S103
  • the sending unit 314 may be used to perform S104.
  • Each functional module of the network device 30 may also be used to implement the method described in the embodiment of FIG. 4 , and for the sake of brevity of the description, details are not repeated here.
  • the application also provides a network device.
  • the network device 40 includes: a processor 401 , a communication interface 402 , a memory 403 and a bus 404 .
  • the processor 401 , the memory 403 and the communication interface 402 communicate through a bus 404 .
  • the network device 40 may be a network device such as a router or a switch, or may be a component for the above network device capable of implementing the above method, such as a single board, a chip, a line card, and the like. It should be understood that the present application does not limit the number of processors and memories in the network device 40 .
  • the bus 404 may be a peripheral component interconnect standard (peripheral component interconnect, PCI) bus or an extended industry standard architecture (extended industry standard architecture, EISA) bus, etc.
  • the bus can be divided into address bus, data bus, control bus and so on. For ease of representation, only one line is used in FIG. 12 , but it does not mean that there is only one bus or one type of bus.
  • the bus 404 may include pathways for transferring information between various components of the network device 40 (eg, memory 403 , processor 401 , communication interface 402 ).
  • the processor 401 may include any one or more of processors such as a central processing unit (central processing unit, CPU), a microprocessor (micro processor, MP), or a digital signal processor (digital signal processor, DSP).
  • processors such as a central processing unit (central processing unit, CPU), a microprocessor (micro processor, MP), or a digital signal processor (digital signal processor, DSP).
  • the memory 403 is used to provide a storage space, in which data such as operating systems and computer programs can be stored.
  • Memory 403 can be random access memory (random access memory, RAM), erasable programmable read only memory (erasable programmable read only memory, EPROM), read-only memory (read-only memory, ROM), or portable read-only memory One or more combinations of memory (compact disc read memory, CD-ROM), etc.
  • the memory 403 may exist independently, or may be integrated inside the processor 401 .
  • Communication interface 402 may be used to provide information input or output to processor 401 .
  • the communication interface 402 can be used to receive data sent from the outside and/or send data to the outside, and can be a wired link interface such as an Ethernet cable, or a wireless link (such as Wi-Fi, Bluetooth, general wireless transmission, etc.) interface.
  • the communication interface 402 may further include a transmitter (such as a radio frequency transmitter, an antenna, etc.) or a receiver coupled with the interface.
  • the processor 401 in the network device 40 is configured to read the computer program stored in the memory 403 to execute the aforementioned method, such as the message sending method described in FIG. 4 .
  • the network device 40 can be one or more modules in the execution subject of the method shown in FIG. 4 , and the processor 401 can be used to read one or more computer programs stored in the memory 403 , which does the following:
  • the indication information is used to instruct the network node to copy the message, and the quantity information corresponds to the quantity of the copied message; and obtaining the first message;
  • the above-mentioned multiple second packets are sent by the sending unit 314, and at least two of the multiple second packets encapsulate different forwarding path information.
  • storage medium includes read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), programmable read-only memory (Programmable Read-only Memory, PROM), erasable programmable read-only memory ( Erasable Programmable Read Only Memory, EPROM), One-time Programmable Read-Only Memory (OTPROM), Electrically-Erasable Programmable Read-Only Memory, EEPROM, Compact Disc Read-Only Memory (CD-ROM) or other optical disk storage, magnetic disk storage, tape storage, or any other computer-readable medium that can be used to carry or store data.
  • Read-Only Memory Read-Only Memory
  • RAM Random Access Memory
  • PROM Programmable Read-only Memory
  • PROM Programmable Read-only Memory
  • EPROM Erasable Programmable Read Only Memory
  • OTPROM One-time Programmable Read-Only Memory
  • EEPROM Electrically-Erasable Programmable Read-Only Memory
  • CD-ROM Compact Disc Read-Only Memory
  • the essence of the technical solution of the present application or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of software products.
  • the computer program product is stored in a storage medium, including several instructions. So that a device (which may be a personal computer, a server, or a network device, a robot, a single-chip microcomputer, a chip, a robot, etc.) executes all or part of the steps of the methods described in the various embodiments of the present application.

Landscapes

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

Abstract

La présente demande concerne un procédé et un appareil d'envoi de messages. Le procédé comprend : la duplication, par un nœud de réseau, d'un premier message selon des informations d'indication acquises de façon à obtenir une pluralité de seconds messages, le nombre de messages de la pluralité de seconds messages correspondant à des informations de nombre qui sont acquises par le nœud de réseau ; et l'envoi, par le nœud de réseau, de la pluralité de seconds messages, au moins deux seconds messages parmi la pluralité de seconds messages étant encapsulés avec différentes informations de trajet d'expédition. Au moyen du procédé, un message est dupliqué selon des informations d'indication et des informations de nombre, de sorte que le taux de duplication du message par un nœud de réseau peut être amélioré dans un scénario d'envois multiples et réception sélective, et une duplication et une expédition rapides du message peuvent être réalisées.
PCT/CN2022/124423 2021-11-02 2022-10-10 Procédé et appareil d'envoi de messages WO2023078031A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111288608.5A CN116074395A (zh) 2021-11-02 2021-11-02 一种报文发送方法及装置
CN202111288608.5 2021-11-02

Publications (1)

Publication Number Publication Date
WO2023078031A1 true WO2023078031A1 (fr) 2023-05-11

Family

ID=86182479

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/124423 WO2023078031A1 (fr) 2021-11-02 2022-10-10 Procédé et appareil d'envoi de messages

Country Status (2)

Country Link
CN (1) CN116074395A (fr)
WO (1) WO2023078031A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140365586A1 (en) * 2013-06-07 2014-12-11 George Vincent Friborg, JR. Systems and methods for retargeting text message alerts
CN107547293A (zh) * 2016-06-29 2018-01-05 新华三技术有限公司 一种流路径探测方法和装置
CN108055211A (zh) * 2017-12-22 2018-05-18 盛科网络（苏州）有限公司 一种组播复制的方法、设备和存储介质
CN113114566A (zh) * 2017-09-25 2021-07-13 华为技术有限公司 一种报文转发的方法及网络设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140365586A1 (en) * 2013-06-07 2014-12-11 George Vincent Friborg, JR. Systems and methods for retargeting text message alerts
CN107547293A (zh) * 2016-06-29 2018-01-05 新华三技术有限公司 一种流路径探测方法和装置
CN113114566A (zh) * 2017-09-25 2021-07-13 华为技术有限公司 一种报文转发的方法及网络设备
CN108055211A (zh) * 2017-12-22 2018-05-18 盛科网络（苏州）有限公司 一种组播复制的方法、设备和存储介质

Also Published As

Publication number Publication date
CN116074395A (zh) 2023-05-05

Similar Documents

Publication Publication Date Title
EP3678338B1 (fr) Procédé d'acheminement de messages et dispositif de réseau
US10050859B2 (en) Apparatus for processing network packet using service function chaining and method for controlling the same
JP7403635B2 (ja) Ｓｒネットワークでパケットを転送するための方法、装置、及びシステム
WO2021088433A1 (fr) Procédé, dispositif et système de traitement de message
WO2021082575A1 (fr) Procédé d'acheminement de paquets, appareil, support de stockage et système
JP7092813B2 (ja) パケット伝送方法及び装置
CN111147372B (zh) 下行报文发送、转发方法和装置
US11356372B2 (en) Data traffic processing method, device, and system
WO2018090210A1 (fr) Procédé de transmission de paquet de service, et appareil de nœud
CN107018072B (zh) 一种数据帧发送方法和接入设备
WO2023078031A1 (fr) Procédé et appareil d'envoi de messages
JP5907252B2 (ja) 通信装置、通信方法、及び通信プログラム
JP2006511115A (ja) パケット交換方式ネットワークにおけるリターンパス導出
WO2022135321A1 (fr) Procédé, dispositif et système de transmission de paquets
WO2024001701A1 (fr) Procédé, appareil et système de traitement de données
WO2024083219A1 (fr) Procédé et appareil de traitement de message, et dispositif et support de stockage
WO2015127600A1 (fr) Procédé de dérivation et de rapport, commutateur, dispositif de commande et système
WO2023226859A1 (fr) Procédé et appareil de traitement de politique de routage par segment
WO2022242775A1 (fr) Procédé et système de traitement de paquets, et dispositif de réseau
WO2024067084A1 (fr) Procédé de détection de défaut de chemin et appareil associé
WO2024104007A1 (fr) Procédé et appareil de transmission de paquets, support de stockage et dispositif électronique
WO2023078144A1 (fr) Procédé, appareil et système de traitement de message
US8817638B2 (en) Method and system for network communications utilizing shared scalable resources
WO2019223435A1 (fr) Procédé de commutation rapide de multidiffusion, dispositif, appareil, et support de stockage
CN116962545A (zh) 一种基于srv6网络的数据切片传输系统及方法

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

Country of ref document: EP

Kind code of ref document: A1