WO2023114351A1 - Multidiffusion à routage rapide de segment pour ipv6 - Google Patents

Multidiffusion à routage rapide de segment pour ipv6 Download PDF

Info

Publication number
WO2023114351A1
WO2023114351A1 PCT/US2022/052931 US2022052931W WO2023114351A1 WO 2023114351 A1 WO2023114351 A1 WO 2023114351A1 US 2022052931 W US2022052931 W US 2022052931W WO 2023114351 A1 WO2023114351 A1 WO 2023114351A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
sids
bits
sid
multicast
Prior art date
Application number
PCT/US2022/052931
Other languages
English (en)
Inventor
Huaimo Chen
Original Assignee
Futurewei Technologies, Inc.
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 Futurewei Technologies, Inc. filed Critical Futurewei Technologies, Inc.
Publication of WO2023114351A1 publication Critical patent/WO2023114351A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint 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]

Definitions

  • the present disclosure is generally related to the field of network communication and, in particular, to multicast segment routing (SR) over the Internet Protocol version six (IPv6) data plane (SRv6).
  • SR multicast segment routing
  • IPv6 Internet Protocol version six
  • SRv6 is a next-generation internet protocol (IP) bearer protocol that combines SR and IPv6. Utilizing existing IPv6 forwarding technology, SRv6 implements network programming through flexible IPv6 extension headers.
  • IP internet protocol
  • SRv6 reduces the number of required protocol types, offers great extensibility and programmability, and meets the diversified requirements of more new services. SRv6 also provides high reliability and offers exciting cloud service application potential.
  • Multicast is group communication where data transmission is addressed to a group of destination computers simultaneously.
  • Multicast can be one-to-many or many-to-many distribution.
  • the one-to-many configuration is known as point-to-multipoint (P2MP).
  • SRv6 and multicast techniques may be used together to generate a SR P2MP path through a network multicast SR domain.
  • the SR P2MP path is encoded into a packet header.
  • the packet header includes a plurality of multicast segment identifiers (SIDs).
  • SR Segment Routing
  • P2MP SR Point to Multipoint
  • SRv6 segment routing version 6
  • a first aspect relates to a method implemented by an ingress node in a segment routing (SR) multicast domain along a point-to-multipoint (P2MP) path, comprising receiving a packet from a multicast source, duplicating the packet for each of sub-trees of the P2MP path from the ingress node to a plurality of egress nodes, encapsulating a duplicated packet with a segment routing header (SRH) for the sub-tree, and sending duplicated packet to a next hop node along the sub-tree.
  • SR segment routing
  • P2MP point-to-multipoint
  • another implementation further comprises setting a source address (SA) of the packet to an address of the ingress node, a setting a destination address (DA) of the packet to a multicast segment identifier (SID) of the next hop node. node.
  • SA source address
  • DA destination address
  • SID multicast segment identifier
  • the SRH comprises a multicast segment identifier (SID) for each next hop node (NNH) along the sub-tree and a SID for each node of a sub-tree under a (NNH).
  • SID multicast segment identifier
  • each SID comprises a common prefix of multicast node SIDs in a block of B bits, a globally unique node identifier (ID) of N bits, and arguments, wherein the B bits plus the N bits plus the arguments comprises 128 bits.
  • each SID comprises a multicast adjacency SID locator comprising a common prefix of B bits for multicast adjacent SIDs and a specific identifier of a node, a link sequence number of L bits corresponding to the node, and arguments, wherein the specific identifier is a globally unique identifier (ID) of N bits, and wherein the B bits plus the N bits plus the L bits plus the arguments comprises 128 bits.
  • ID globally unique identifier
  • B may be a 32- bit open shortest path first (OSPF) protocol router ID.
  • OSPF open shortest path first
  • the arguments comprise a number of branches (No-Branches) and a number of SIDs (No-SIDs), and the NoBranches in a SID for a node on a sub-tree of a SR P2MP path has a value indicating the number of branches from the node along the sub-tree, and the No-SIDs in the SID has a value indicating the number of the SIDs encoding the sub-trees under the node and the SIDs following.
  • a second aspect relates to a method implemented by a transit node in a segment routing (SR) multicast domain along a point-to-multipoint (P2MP) path, comprising receiving a packet having a segment routing header (SRH) with a segment identifier (SID) list of next hops and subtrees coupled with the transit node, and a destination address (DA), wherein the DA comprises a number of next hop branches (No-Branches) coupled with the transit node, a number of the SIDs (no-SIDs) encoding sub-trees under the transit node the SIDs following, and duplicating the packet once for each next hop node of the transit node along the P2MP path, setting the DA of each duplicate packet to a respective SID of the next hop node, setting segments left (SL) in SRH to NoSIDs in DA, and sending the duplicated packets to the DA.
  • SRH segment routing header
  • SID segment identifier
  • DA destination
  • each SID comprises a common prefix of multicast node SIDs in a block of B bits, a globally unique node identifier (ID) of N bits, and arguments, wherein the B bits plus the N bits plus the arguments comprise 128 bits.
  • each SID comprises a multicast adjacency SID locator comprising a common prefix of B bits for multicast adjacent SIDs and a specific identifier of a node, a link sequence number L corresponding to the node, and arguments, wherein the specific identifier is a globally unique identifier (ID) of N bits, and wherein the B bits plus the N bits plus the L bits plus the arguments comprise 128 bits.
  • ID globally unique identifier
  • B may be a 32- bit open shortest path first (OSPF) protocol router ID.
  • OSPF open shortest path first
  • the arguments comprise the number of branches (No-Branches) and the number of SIDs (No-SIDs), wherein the No-Branches in a SID for a node on a sub-tree of a SR P2MP path along a path tree of the SR multicast domain to a destination address (DA).
  • a third aspect relates to a ingress node in a segment routing (SR) multicast domain along a point-to-multipoint (P2MP) path, comprising a memory storing instructions and a processor coupled to the memory, wherein the processor is configured to execute the instructions to cause the ingress node to receive a packet from a multicast source and duplicate the packet for each of sub-trees of the P2MP path from the ingress node to a plurality of egress nodes, encapsulate the duplicated packet with a segment routing header (SRH) for the sub-tree, and send the duplicated packet to a next hop node along the sub-tree.
  • SR segment routing header
  • the processor is further configured to cause the ingress node to set a source address (SA) of the packet to an address of the ingress node, and set a destination address (DA) of the packet to a SID of the next hop node.
  • SA source address
  • DA destination address
  • the segment routing header comprises a multicast segment identifier (SID) for each next hop node (NNH) of the next hop node along the sub-tree, and a SID for each node of a sub-tree under a next hop node.
  • SID segment identifier
  • each SID comprises a common prefix of multicast node SIDs in a block of B bits, a globally unique node identifier (ID) of N bits, and arguments, wherein the B bits plus the N bits plus the arguments comprise 128 bits.
  • each SID comprises a multicast adjacency SID locator comprising a common prefix of B bits for multicast adjacent SIDs and a specific identifier of a node, a link sequence number of L bits corresponding to the node, and arguments, wherein the specific identifier is a globally unique identifier of N bits, and wherein the B bits plus the N bits plus the L bits plus the arguments comprise 128 bits.
  • B is a 32-bit open shortest path first (OSPF) protocol router ID.
  • OSPF open shortest path first
  • the arguments comprise the number of branches (no-Branches) and the number of SIDs (No-SIDs), wherein the No-branches in a SID for a node on a sub-tree of a SR P2MP path has a value indicating the number of branches from the node along the sub-tree, and the No-SIDs in the SID has a value indicating the number of the SIDs encoding the sub-trees under the node and the SIDs following.
  • a fourth aspect relates to a transit node in a segment routing (SR) multicast domain along a point-to-multipoint (P2MP) path, comprising a memory storing instructions and a processor coupled to the memory.
  • the processor is configured to execute the instructions to cause the transit node to receive a packet having a segment routing header (SRH) with a segment identifier (SID) list of next hops and sub-trees coupled with the transit node, and a destination address (DA), wherein the DA comprises a number of branches (No-Branches) coupled with the transit node, a number of SIDs encoding sub-trees under the transit node, and the SIDs following.
  • SSH segment routing header
  • SID segment identifier
  • DA destination address
  • the instructions further cause the processor to duplicate the packet once for each next hop node of the transit node along the P2MP path, set the DA of each duplicate packet to a respective SID of the next hop node, set segment left (SL) in SRH to No-SIDs in the DA, and send the duplicated packets to the DA.
  • each SID comprises a common prefix of multicast node SIDs in a block of B bits, a globally unique node identifier (ID) of N bits, and arguments, wherein the B bits plus the N bits plus the arguments comprise 128 bits.
  • each SID comprises a multicast adjacency SID locator comprising a common prefix of B bits for multicast adjacent SIDs and a specific location of a node, a link sequence number of L bits corresponding to the node, and arguments, wherein the specific identifier is a globally unique identifier (ID) of N bits, and wherein the B bits plus the N bits plus the L bits plus the arguments comprise 128 bits.
  • ID globally unique identifier
  • B is a 32-bit open shortest path first (OSPF) protocol router ID.
  • OSPF open shortest path first
  • the arguments comprise the number of branches (no-Branches) and the number of SIDs (No-SIDs), wherein the No-Branches in a SID for a node on a sub-tree of a SR P2MP path has a value indicating the number of branches from the node along the sub-tree, and the No-SIDs in the SID has a value indicating the number of the SIDs encoding the sub-trees under the node and the SIDs following.
  • a fifth aspect relates to a ingress node in a segment routing (SR) multicast domain along a point-to-multipoint (P2MP) path, comprising means for receiving a packet from a multicast source, means for duplicating the packet for each of sub-trees of a SR P2MP path from the ingress node to a plurality of egress nodes, means for encapsulating a duplicated packet with a segment routing header (SRH) for the sub-tree, and means for sending the duplicated packet to a next hop node along the sub-tree.
  • SR segment routing
  • a sixth aspect relates to a transit node in a segment routing (SR) multicast domain along a point-to-multipoint (P2MP) path, comprising means for receiving a packet having a segment routing header (SRH) with a segment identifier (SID) list of next hops and sub-trees coupled with the transit node, and a destination address (DA), wherein the DA comprises a number of next hop branches (No-Branches) coupled with the transit node, a number of SIDs (No-SIDs) encoding sub-trees under the transit node and the SIDs following, means for duplicating the packet once for each next hop node of the transit node along the P2MP path, means for setting the DA of each duplicated packet to a respective SID of the next hop node and setting segment left (SL) in SRH to No-SIDs in the DA, and means for sending the duplicate packet to the DA.
  • SID segment identifier
  • any one of the foregoing embodiments may be combined with any one or more of the other foregoing embodiments to create a new embodiment within the scope of the present disclosure.
  • FIG. 1 is a schematic diagram of a SRv6 topology including a SRv6 multicast domain.
  • FIG. 2 is a multicast node segment identifier (SID) with branch and sub-tree information according to an embodiment of the disclosure.
  • SID segment identifier
  • FIG. 3 is a multicast adjacency SID according to an embodiment of the disclosure.
  • FIG. 4A is a multicast node SID with branch and sub-tree information according to an embodiment of the disclosure.
  • FIG. 4B is a multicast adjacency SID with branch and sub-tree information according to an embodiment of the disclosure.
  • FIG. 5 is a schematic diagram of multicast adjacency SIDs assigned to links according to an embodiment of the disclosure.
  • FIG. 6 is a segment list encoding sub-tree corresponding to a path shown in the example of FIG. 1.
  • FIG. 7 is a packet sent from ingress PE8 to Pl corresponding to the example of FIG. 1.
  • FIG. 8 depicts a packet received by Pl from PE8 corresponding to the example of FIG.
  • FIG. 9 is a packet duplicated at Pl for sending to P2 and P3 corresponding to the example of FIG. 1.
  • FIG. 10 is a packet received at Pl and duplicated for sending to P2 and P3 corresponding to the example of FIG. 1.
  • FIG. 11 is a packet received at P2 and duplicated for sending to PEI and PE2 corresponding to the example of FIG. 1.
  • FIG. 12 is a packet received at PEI corresponding to the example of FIG. 1.
  • FIG. 13 is a packet received at PE2 corresponding to the example of FIG. 1.
  • FIG. 14 is an example implementation of an embodiment of the disclosure.
  • FIG. 15 is an example of an IPv6 header using generalized SRv6 (G-SRv6) according to an embodiment of the disclosure.
  • FIG. 16 is an example of an IPv6 header for sending from an ingress node to a destination address according to an embodiment of the disclosure.
  • FIG. 17 is a schematic diagram of a network apparatus according to an embodiment.
  • the present disclosure proposes systems and methods for a segment routing version 6 (SRv6) multicast implemented without modifying the packet header except for popping SIDs and encapsulating the packet with SIDs.
  • a segment identifier (SID) block is allocated for SR Multicast. SIDs in this block are called multicast SIDs.
  • DA destination address
  • the node duplicates the packet received from an incoming interface and delivers the duplicated packet to each of the multiple outgoing interfaces along the SR P2MP path/tree (branches).
  • each node in a network is assigned a multicast SID. For example, as depicted in FIG. 1, there are nodes PEI to PE5, PE8, Pl to P4. They are assigned multicast SIDs PEl-m to PE5-m, PE8-m, Pl-m to P4-m, respectively.
  • the SR P2MP path/tree from the ingress to egresses (or leaves) is encoded in the segment list of the segment routing header (SRH) of a packet at the ingress.
  • the SR P2MP path in FIG. 1 comprises multicast SIDs PE8-m, Pl-m, PE5-m, P2-m, P3-m, PEl-m, PE2- m, P4-m, PE3-m and PE4-m.
  • these SIDs are pushed into the segment list of SRH of the packet at ingress node PE8, wherein the SRH includes a segments left (SL) field and the packet includes a destination address (DA) and a source address (SA).
  • SL segments left
  • SA source address
  • Ingress node PE8 sets the DA of the packet to multicast SID PE8- m, which is the multicast SID of ingress node PE8; sets the SA of the packet to an IPv6 address of ingress node PE8; sets the SL in the SRH to the value in a number of SIDs (No-SID) field in PE8- m; “sends” the packet to ingress node PE8 (i.e., calls a procedure for a multicast SID for a transit node on ingress node PE8).
  • ingress node PE8 acting as a transit node duplicates the packet for each of the sub-trees branching from ingress node PE8 and sends the duplicated packet to the next hop node along the sub-tree.
  • ingress node PE8 after receiving a packet from a multicast traffic source, duplicates the packet for each of the sub-trees branching from ingress node PE8; pushes a SRH with a segment list into the duplicated packet for each sub-tree, wherein the segment list is for the sub-tree; sets the DA of the duplicated packet to a multicast SID of a next hop node along the subtree; sets the SA of the packet to an IPv6 address of ingress node PE8; sets the SL in the SRH to the value in No-SID field in the multicast SID and sends the duplicated packet the next hop node along the sub-tree.
  • the SR P2MP path/tree uses multicast SIDs.
  • the packet received from a multicast source is imported into the SR P2MP path/tree at ingress and sent to the egresses/leaves of the path/tree along the path/tree.
  • a packet from CE3 is imported into the SR P2MP path/tree at ingress PE8 and sent to egresses PEI to PE5 along the path/tree.
  • a multicast node SID is allocated from the multicast SID block to the node, which is globally unique.
  • a network administrator configures the multicast node SID for every node, which distributes the multicast SID in the SR multicast domain.
  • a central controller allocates a multicast SID for each node and sends the information about the SID to its node, which may then distribute the information in the SR multicast domain.
  • FIG. 2 illustrates an embodiment showing an example of a format of a multicast node SID of 128 bits.
  • the multicast node SID comprises a multicast node SID block of B bits (i.e., the common prefix of the multicast node SIDs) and a node identifier (ID) of N bits.
  • the former is the common prefix allocated for the multicast node SIDs.
  • the latter is the ID of a node that is globally unique.
  • the open shortest path first (OSPF) router ID of 32-bits for a node is used as the ID of the node.
  • the multicast node SID also comprises some arguments and functions (not shown).
  • Every multicast link (or interface) connected to the node has an associated multicast segment identifier (SID), which is called Multicast Adjacency Segment Identifier.
  • SID multicast segment identifier
  • a multicast adjacency SID is relative to a specific node, and is locally significant.
  • Every node in the network SR multicast domain assigns a multicast SID from the multicast SID block to each of its links as the multicast adjacency SID for the link and advertises the information about the SID and its link.
  • a central controller assigns a multicast SID from the multicast SID block to each link of the node as the multicast adjacency SID for the link and sends the information about the SID and its link to the node and the neighbors of the node.
  • FIG. 3 shows an example of an embodiment of a possible format of a multicast adjacency SID of 128 bits.
  • the multicast adjacency SID comprises a multicast adjacency SID locator of B bits and a link number of L bits.
  • the multicast adjacency SID locator B bits for a node indicate the location of the node, which includes the common prefix allocated for the multicast adjacency SIDs and the specific identifier to the node.
  • the link number L bits for a node is the link sequence number assigned to every link of the node. In one embodiment, for all n links of a node, link sequence number (or link number for short) 1, 2, . . ., n are assigned to the n links, respectively.
  • the multicast adjacency SID also comprises some arguments and fiinction(s) (not shown).
  • a Multicast SID contains the following information.
  • the SID includes the number of branches or next hops along the P2MP path or tree from the node.
  • the number of branches or next hops is included in the SRv6 SID as an argument of a 128-bit SID. This is shown in the examples of FIG. 4 A and FIG. 4B.
  • the number of the SIDs is included in the SRv6 SID as an argument of a 128-bit SID. This is also shown in FIG. 4A and FIG. 4B.
  • An example of the encoding of P2MP Path/Tree is described with further reference to FIG. 1. For a sub-tree (ST) of a SR P2MP path/tree from the ingress node of the P2MP path/tree, suppose that the multicast SID of a next hop node NH (e.g., node Pl in FIG.
  • BNHj e.g., P2 in FIG. 1
  • Sub-tree ST is encoded as segment list ⁇ NH-m, BNHl-m, . . ., BNHB-m, SidSeq-1, . . ., SidSeq-B>, where NH-m contains the number of branches in its No-Branches field, which is B, and the number of SIDs in its No-SIDs field, which is the number of the SIDs encoding the subtrees from NH, i.e., the number of the SIDs following NH-m (i.e., B plus the number of the SIDs in SidSeq-1, ..., SidSeq-B).
  • each node is assigned a multicast node SID.
  • the multicast node SID assigned to the node is named as X-m.
  • node Pl is assigned a multicast node SID Pl-m.
  • P2-m, P3-m, P4-m, PEl-m, PE2-m, PE3-m, PE4-m, and PE5-m are the multicast node SIDs assigned to nodes P2, P3, P4, PEI, PE2, PE3, PE4, and PE5, respectively.
  • the links/interfaces for nodes Pl, P2, P3, P4, PEI, PE2, PE3, PE4, and PE5 are connected to each of the nodes assigned multicast SIDs.
  • node Pl has three links connected to it.
  • Multicast adjacency SIDs Pl-lm, Pl-2m and Pl-3m are assigned to these three links respectively.
  • Node PE2 has one link connected to it, Multicast adjacency SID PE2-lm is assigned to the link.
  • the P2MP path in FIG. 1 from ingress node PE8 to egress nodes PEI, PE2, PE3, PE4, and PE5, there are two sub-trees from ingress PE8.
  • the first sub-tree is from ingress PE8 via Pl to egresses PEI to PE4, the second one is from ingress PE8 to PE5.
  • the second sub-tree is in fact a P2P path and can be encoded in the same way as a SR P2P path.
  • the first sub-tree is encoded as segment list ⁇ Pl-m, P2-m, P3-m, PEl-m, PE2-m, P4- m, PE3-m, PE4-m>, where PEl-m, PE2-m is the SID sequence (SidSeq-1) in the segment list encoding the sub-trees from P2.
  • P4-m, PE3-m, PE4-m is the SID sequence (SidSeq-2) in the segment list encoding the sub-tree from P3.
  • P2-m’s No-Branches field is set to 2 since there are 2 branches from P2, P2-m’s NoSIDs field is set to 5, which the number of SIDs in SidSeq-1 encoding the sub-trees from P2 plus the number of the SIDs following SidSeq-1.
  • P3-m’s No-Branches field is set to 1 since there is 1 branch from P3, P3-m’s No-SIDs field is set to 3, which is the number of SIDs in SidSeq-2 encoding the sub-tree from P3. No SID follows SidSeq-2.
  • P4-m No-Branches field is set to 2 since there are 2 branches from P4 and No-SIDs field is set to 2.
  • PEl-m, PE2-m, PE3-m, PE4-m are the multicast SIDs of leaf nodes in the P2MP path. Their No-Branches fields and No-SIDs fields are zeros.
  • FIG. 6 shows the segment list in detail.
  • SID Pl-m indicates that there are 2 branches and 7 SIDs.
  • SID P2-m indicates that there are 2 branches and 5 SIDs.
  • SID P3-m indicates that there are 1 branch and 3 SIDs.
  • Pl-m corresponds to Pl
  • P2-m corresponds to P2
  • P3-m corresponds to P3 in FIG. 1.
  • SIDs PEl-m and PE2-m indicate that no branch is under them.
  • SID P4-m indicates that there are 2 branches and 2 SIDs. PE3-m and PE4-m indicate that no branch is under them.
  • the procedure/behavior on an ingress node is as follows. For a packet to be transported by a SR P2MP Path, the ingress of the P2MP path duplicates the packet for each sub-tree of the SR P2MP path branching from the ingress, sets the destination address (DA) of the packet to the multicast SID of the next hop node along the sub-tree, pushes the segment list encoding the sub-tree into the packet and sends the packet to the next hop node.
  • DA destination address
  • the first sub-tree is from ingress PE8 via next hop node Pl towards PEI to PE4.
  • the second sub-tree is from ingress PE8 to egress PE5.
  • the contents of the multicast SIDs Pl-m, P2-m, P3-m, PEl-m, PE2-m, P4-m, PE3-m, PE4-m are shown in FIG. 6.
  • the packet ingress PE8 sends Pl the packet shown in FIG. 7.
  • the DA of the packet is a multicast SID of the node and the packet contains a segment list for the sub-trees from the node.
  • the DA and the segment list comprise the information for encoding the sub-trees under the transit node.
  • the contents of the multicast SIDs Pl-m, P2-m, P3-m, PEl-m, PE2-m, P4-m, PE3-m, PE4-m are shown in FIG. 6.
  • the No-Branches field (which has value of B, where B > 0) of the DA indicates that there are B branches (or next hops) from the transit node.
  • the No-SIDs field of the DA indicates the number of the SIDs encoding the sub-trees under the transit node and the SIDs following.
  • the multicast SIDs of the next hop nodes are the first B multicast SIDs of the segment list in the packet.
  • the first multicast SID (P2-m) of the segment list is the SID of the next hop node (P2).
  • the second multicast SID (P3-m) of the segment list is the SID of the next hop node (P3).
  • the No-SIDs field (which has value of SI) of the first multicast SID of the next hop nodes indicates that there are SI SIDs from the first SIDs sequence to the last one.
  • the No-SIDs field (which has value of S2) of the second multicast SID of the next hop nodes indicates that there are S2 SIDs from the second SIDs sequence to the last one, and so on.
  • the No-SIDs field of P2-m (the first multicast SID of the next hop nodes) has value of 5, indicating that there are 5 SIDs from the first SIDs sequence to the last one, which are PEl-m, PE2-m, P4-m, PE3-m and PE4-m.
  • the No-SIDs field of P3-m (the second multicast SID of the next hop nodes) has value of 3, indicating that there are 3 SIDs from the second SIDs sequence to the last one, which are P4-m, PE3-m and PE4-m.
  • the transit node duplicates the packet for each sub-tree or next hop node from/under the transit node, sets the DA of the packet to the multicast SID of the next hop node along the subtree, sets SL in SRH to the No-SIDs in DA, and sends the packet to the DA.
  • node Pl duplicates the packet for next hop P2 or the first sub-tree towards PEI and PE2, sets DA to P2-m (multicast SID of next hop P2), sets SL in SRH to 5, and sends the packet to the DA (i.e., P2).
  • Node Pl duplicates the packet for next hop P3 or the second sub-tree towards PE3 and PE4, sets DA to P3-m (multicast SID of next hop P3), sets SL in SRH to 3, and sends the packet to the DA (i.e., P3).
  • Pl duplicates the packet shown in FIG. 9 for sending to P2 and P3.
  • Pl sets DA of the duplicated packet for P2 to P2-m sets SL in SRH to 5 (the No-SIDs in DA), and sends P2 the packet shown in FIG. 10.
  • the multicast SIDs from the top of the segment list in the SRH, which is indicated by SL 5, are shown in the FIG. Note that the segment list in the SRH is not changed and still contains P2-m and P3-m (not shown in the FIG).
  • Pl sets DA of the duplicated packet for P3 to P3-m sets SL in SRH to 3 (the No-SIDs in DA), and sends P3 the packet shown in FIG. 10.
  • the multicast SIDs from the top of the segment list in the SRH, which is indicated by SL 3, are shown in the FIG.
  • the segment list in the SRH is not changed and still contains P2-m, P3-m, PEl-m and PE2-m (not shown in the FIG).
  • P2 receives the packet shown in FIG. 11.
  • P2 duplicates packet for PEI, sets DA to PEl-m, sets SL in SRH to 0 (the No-SIDs in DA), and sends the packet shown in FIG. 12 to PEI.
  • Multicast SID behavior is executed by transit node N when the DA of the packet received by N is N’s Multicast SID. It is a variant of the Endpoint behavior in Section 4.1 of Internet Engineering Task Force (IETF) document Request for Comments (RFC) 8986 entitled “Segment Routing over IPv6 (SRv6) Network Programming” by C. Filsfils, et al., February 2021, with the change from S13 - S15 to S13a - SI 5b.
  • IETF Internet Engineering Task Force
  • RRC Request for Comments
  • This change duplicates the packet for each of B next hop nodes, branches, or sub-trees from/under N, sends the duplicated packet to the next hop node along the branch through setting the DA of the duplicated packet to the multicast SID of the next hop node, sets SL in SRH to the No-SIDs in DA to pop SIDs and have the SIDs sequence encoding the sub-trees from/under the next hop at the top of the segment list in SRH, and submits the duplicated packet to the egress IPv6 FIB lookup for transmission to the new destination DA (i.e., the next hop). See FIG. 14.
  • the egress node proceeds to process the next header in the packet (refer to S03 in Section 4.1 of RFC 8986).
  • FIG. 15 illustrates an example of an IPv6 Header using G-SRv6.
  • 64 bits for Common Prefix 16 bits for Node ID, 8 bits for the number of branches (No-Branches) and 8 bits for the number of SIDs (No-SIDs) are used when G-SRv6 compression method is applied for ⁇ Pl-m, P2-m, P3-m, PEl-m, PE2-m, P4-m, PE3-m, PE4-m> at ingress node PE8 in FIG. 1.
  • the Destination Address (DA) as illustrated contains the Common Prefix of 64 bits, node Pl’s ID of 16 bits, the value 2 for the number of branches (No-Branches) of 8 bits, and the value 7 for the number of SIDs (No-SIDs) of 8 bits.
  • the IPv6 header is shown in FIG. 16. In this example, ingress node PE8 sends a packet with the IPv6 header to the DA.
  • FIG. 17 is a schematic diagram of a routing device 1700 according to an embodiment of the disclosure.
  • the routing device 1700 is suitable for implementing the disclosed embodiments as described herein.
  • the routing device 1700 may be a router, a switch, a node, or another communication device configured to process Internet traffic.
  • the routing device 1700 comprises ingress ports 1710 (or input ports 1710) and receiver units (Rx) 1720 for receiving data; a processor, logic unit, or central processing unit (CPU) 1730 to process the data; transmitter units (Tx) 1740 and egress ports 1750 (or output ports 1750) for transmitting the data; and a memory 1760 for storing the data.
  • the routing device 1700 may also comprise optical-to-electrical (OE) components and electrical-to-optical (EO) components coupled to the ingress ports 1710, the receiver units 1720, the transmitter units 1740, and the egress ports 1750 for egress or ingress of optical or electrical signals.
  • OE optical-to-electrical
  • EO electrical-to-optical
  • the processor 1730 is implemented by hardware and software.
  • the processor 1730 may be implemented as one or more CPU chips, cores (e.g., as a multi-core processor), filed programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), and digital signal processors (DSPs).
  • the processor 1730 is in communication with the ingress ports 1710, receiver units 1720, transmitter units 1740, egress ports 1750, and memory 1760.
  • the processor 1730 comprises a routing module 1770.
  • the routing module 1770 implements the disclosed embodiments described above. For instance, the routing module 1770 implements, processes, prepares, or provides the various coding operations.
  • routing module 1770 therefore provides a substantial improvement to the functionality of the routing device 1700 and effects a transformation of the routing device 1700 to a different state.
  • the routing module 1770 is implemented as instructions stored in the memory 1760 and executed by the processor 1730.
  • the memory 1760 may comprise one or more disks, tape drives, and solid-state drives and may be used as an over-flow data storage device, to store programs when such programs are selected for execution, and to store instructions and data that are read during program execution.
  • the memory 1760 may be, for example, volatile and/or non-volatile and may be a read-only memory (ROM), random access memory (RAM), ternary content-addressable memory (TCAM), and/or static random-access memory (SRAM).

Landscapes

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

Abstract

L'invention concerne un procédé mis en œuvre dans un domaine de multidiffusion par routage de segments (SR) le long d'un chemin point à multipoint (P2MP) comprenant la réception, à un nœud d'entrée, d'un paquet provenant d'une source de multidiffusion, la duplication du paquet pour chacun des sous-tresses du chemin P2MP du nœud d'entrée à une pluralité de nœuds de sortie, l'encapsulation du paquet dupliqué avec un en-tête de routage de segments (SRH) pour la sous-arborescence, et l'envoi du paquet dupliqué au nœud de saut suivant le long de la sous-arborescence.
PCT/US2022/052931 2021-12-15 2022-12-15 Multidiffusion à routage rapide de segment pour ipv6 WO2023114351A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US202163289918P 2021-12-15 2021-12-15
US63/289,918 2021-12-15

Publications (1)

Publication Number Publication Date
WO2023114351A1 true WO2023114351A1 (fr) 2023-06-22

Family

ID=85172942

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2022/052931 WO2023114351A1 (fr) 2021-12-15 2022-12-15 Multidiffusion à routage rapide de segment pour ipv6

Country Status (1)

Country Link
WO (1) WO2023114351A1 (fr)

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
C. FILSFILS ET AL., SEGMENT ROUTING OVER IPV6 (SRV6) NETWORK PROGRAMMING, February 2021 (2021-02-01)
CHEN M MCBRIDE FUTUREWEI Y FAN CASA SYSTEMS Z LI X GENG HUAWEI M TOY G MISHRA VERIZON A WANG CHINA TELECOM L LIU FUJITSU X LIU VOL: "Stateless SRv6 Point-to-Multipoint Path draft-chen-pim-srv6-p2mp-path-05; draft-chen-pim-srv6-p2mp-path-05.txt", no. 5, 12 November 2021 (2021-11-12), pages 1 - 18, XP015148855, Retrieved from the Internet <URL:https://tools.ietf.org/html/draft-chen-pim-srv6-p2mp-path-05> [retrieved on 20211112] *

Similar Documents

Publication Publication Date Title
US8320374B2 (en) Method and apparatus for improved multicast routing
US8717934B2 (en) Multicast source move detection for layer-2 interconnect solutions
WO2021257141A1 (fr) Trajet point à multipoint de routage de segment
US9344382B2 (en) Multicast support for internet protocol version four residual deployment via encapsulation or translation
CN113726667B (zh) 一种反向路径转发rpf检查方法及装置
US9641649B2 (en) IGMP/MLD translation
WO2023114351A1 (fr) Multidiffusion à routage rapide de segment pour ipv6
US8155125B1 (en) Apparatus and method for utilizing aggregate network links for multicast switching
CN115499366B (zh) 报文传输方法以及装置
EP4397020A2 (fr) Multidiffusion de routage de segment compact pour ipv6
WO2023147477A1 (fr) En-tête de routage de multidiffusion utilisant un numéro de liaison
WO2023147477A9 (fr) En-tête de routage de multidiffusion utilisant un numéro de liaison
US20230143419A1 (en) Segment Routing MPLS Point To Multipoint Path
US20240146642A1 (en) BIER-TE Encapsulation With Multiple Sets
WO2023164320A1 (fr) Arbre de multidiffusion à codage optimal utilisant un numéro de liaison et un bit
CN115134290B (zh) 组播信令传递方法和系统
US20230283558A1 (en) Bit Index Explicit Replication Traffic Engineering Fast Reroute
CN112866076B (zh) 以太网虚拟专用网络、运营商设备和用户侧设备
WO2023168134A1 (fr) Multidiffusion sans état avec indice de nœud et chaîne de bits flexible
US20230344763A1 (en) Bit Index Explicit Replication Traffic Engineering For Broadcast Link
WO2023196689A2 (fr) Multidiffusion au mieux sans état optimal
WO2024010954A1 (fr) Distribution de numéro de liaison pour multidiffusion
WO2023158889A2 (fr) Multidiffusion sans état avec sauts mobiles
CN116368782A (zh) 位索引显式复制出口保护

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

Country of ref document: EP

Kind code of ref document: A1