CN106656824A - BIER boundary node identification method and device - Google Patents
BIER boundary node identification method and device Download PDFInfo
- Publication number
- CN106656824A CN106656824A CN201510731078.5A CN201510731078A CN106656824A CN 106656824 A CN106656824 A CN 106656824A CN 201510731078 A CN201510731078 A CN 201510731078A CN 106656824 A CN106656824 A CN 106656824A
- Authority
- CN
- China
- Prior art keywords
- node
- bier
- message
- boundary
- flag
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an explicit-type copying BIER boundary node identification method based on a bit index, and the method comprises the steps: enabling a preset first identification position bit when a BIER boundary node constructs a message which is used for notifying a BFR (bit forwarding router) of a local node, wherein the first identification position bit is used for identifying whether the local node is a boundary node or not, and a BIER boundary node achieves the flooding of the message in a BIER region. The device comprises a construction module and a notification module. According to the embodiment of the invention, the method enables the node in the BEIR region to easily recognize the boundary node.
Description
Technical field
The present invention relates to the network communications technology, more particularly to BIER (the Bit Indexed in multicast field
Explicit Replication, the explicit duplication based on position index) in technology, identify BIER boundary nodes
Method and apparatus.
Background technology
IP multicasting technologys realize efficient data transmission point-to-multipoint in IP network.Can effectively save
About the network bandwidth, reduce offered load, so real time data transmission, multimedia conferencing, data copy,
All many-sides such as IPTV (IPTV), game and emulation are all widely used.Present
Multicasting technology typically adopts PIM (Protocol Independent Multicast, Protocol Independent Multicast) agreement
(including PIM-SM (Protocol independent multicast-sparse mode) and PIM-DM (Protocol Independent Multicasts-close
Integrated mode)), MSDP (Multicast Source Discovery Protocol, Multicast Source Discovery Protocol)
Deng realization, one of these multicast protocols is to need to build a kind of control plane multicast tree the characteristics of common,
Using this multicast tree by network plane logic arrangement for tree-shaped, to realize the point-to-multipoint number of multicast forwarding
Avoid according to forwarding and loop, this intermediate node to build multicast routing protocol of the distribution tree as core
The state of the multicast forwarding information for being required for safeguarding complicated, with the scale of network it is increasing, multicast number
In the case of growing with each passing day according to flow, in terms of this multicasting technology faces increasing cost and O&M
Challenge.
For this purpose, industry proposes a kind of new technology for building multicast forwarding path, referred to as BIER (Bit
Indexed Explicit Replication, the explicit duplication based on position index) technology, the technology proposes one
The new multicasting technology framework that need not build multicast distribution tree is planted, as shown in figure 1, supporting BIER technologies
Router be referred to as BFR (Bit-Forwarding Router, bit forwarding router), be made up of BFR
A multicast forwarding domain be referred to as BFR domain, in the edge in BIER domains, the multicast packet to user
Carry out BFIR encapsulation equipment be referred to as BFIR (Bit-Forwarding ingress Router, bit forward into
Mouth router), the edge BFR equipment for decapsulating BIER data messages is referred to as BFER (Bit-Forwarding
Egress Router, bit forwarding egress router), multicast packet enters BIER domains by BFIR encapsulation,
The head that BIER is depended in BIER domains is forwarded, and via one or more BFER equipment
BIER domains are left, in BIER domains, receives and forward the equipment of BIER messages to be referred to as the BIER messages
Transit (forwarding) BFR.One BFR can be both BFIR according to the difference that encapsulated message is conciliate in encapsulation
Role, can be again BFER role.
In BIER domains, to every BFR (intermediate forwarding nodes can distribute can not also be distributed) point
With a globally unique bit position (bit position) in whole BIER sub-domain (subdomain),
The bit position of oneself are used IGP (Interior Gateway Protocol, in-house network by every BFER
Close agreement) agreement floods in BIER domain domains, and all of bit position constitute a bitstring
(Bit String), transmission and route of the data message in BIER domains depends on bitstring.Work as others
When BFR have received the heading for including BIER, according to the bitstring bases carried in BIER headings
Forwarded in Bit Forwarding Table (bit forward table claims position index forward table).This base
The principle forwarded in BIER bit positions will be previously required to be changed to make based on the forwarding for building multicast distribution tree
The mode forwarding multicasting that forwarding is searched in unicast is carried out with bit-identify, greatly reduces the forwarding cost of network.
Fig. 2 describes the process of BIER forwardings, and BFR1 is BFIR for ingress BFR, BFR5,
BFR6 and BFR7 are BFER for egress BFR, and the bit position of three BFR are respectively 0001,
0010,0100.Egress BFR are in advance by IGP agreements (such as IS-IS (Intermediate system to
Intermediate system, Intermediate System-to-Intermediate System) agreement, or OSPF (Open Shortest Path
First, ospf) agreement) the bit position of its own are noticed in BIER domain,
BFR1 have received after the notice of bit position of BFR5, BFR6 and BFR7, in local position index
These information are preserved in forward table.When BFR1 have received multicast message, it is assumed that the multicast message needs transmission
To BFR5 and BFR6, then BFR1 calculates the message according to the prior mapping relations for preserving
The value of Bitstring is 0101, and the multicast message of user is encapsulated as into BIER messages, wherein BIER Header
In Bitstring fillings 0101 and be forwarded to BFR2, BFR2 is received after message, searches what is preserved in advance
Entry in position index forward table, according to entry, message needs to be forwarded to BFR3, then by Bitstring
Do and behaviour with the F-BM (Forwarding Bit Mask forward bit-masks table) of the item entries of the matching
Make, the Bitstring in obtaining 0101, BFR2 using 0101 as BIER Header refills BIER
Message, and BFR3 is forwarded the packet to, BFR3 have received after the message, searches the position index of oneself and turns
Deliver, BFR3 there are 2 bar matching records, message next-hop is represented respectively and is forwarded to BFR4 and BFR6,
For first entry, the value of Bitstring is done and operation, is tied by BFR3 with the F-BM in entry
Fruit is 0001, and in second entry, it is 0100 that the value of Bitstring is done with the result of operation with F-BM,
Then message is forwarded BIER messages to BFR4 and BFR6, wherein BFR4 by BFR3 from 2 interfaces respectively
The value of Bitstring of BIER Header be 0001, and be forwarded to the BIER Header of BFR6
The value of Bitstring is 0100.For the message for reaching BFR6, the value for finding bitstring is noticed with oneself
Bit position it is the same, represent oneself be the message destination, decapsulate BIER messages.And reach
When message reaches BFR4, successively aforesaid forwarding principle, forwards the packet to BFR5, is solved by BFR5
Encapsulation BIER messages, so far, complete transmission of the multicast message in BIER domains, by multicast message by
The BFR1 nodes of entrance are forwarded to the receiving node BFR4 and BFR6 of multicast.
The notice of multicast group ability that BIER nodes are added in the existing technology with regard to BIER can be
Notice is flooded by IGP, but for intermediate forwarding nodes, the study of these information it is not necessary that,
The access message of these multicast groups only boundary node needs to learn, thus how for current border and
Intermediate node makes a distinction mark, is the problem for needing to solve.
The content of the invention
The invention provides a kind of BIER boundary nodes identification method and device, for current border is with
Intermediate node can make a distinction mark.
In order to reach the object of the invention, the invention provides a kind of explicit duplication BIER sides based on position index
Boundary's node identification method, methods described includes:
BIER boundary nodes are being configured to notice the message of this node bits forwarding router BFR marks
When, by default first flag set in the message, first flag is used to identify this node
Whether it is boundary node, the BIER boundary nodes flood the message in BIER domains.
Alternatively, methods described also includes that the BIER boundary nodes judge that this node is arranged to border
Node, or when judging that this node has non-BIER interfaces, then be configured to notice this node BFR marks
During the message of knowledge, by default first flag set in the message.
Alternatively, wherein, first flag be used for identify this node for boundary node or in the middle of turn
Send out node.
Alternatively, methods described also includes:BIER boundary nodes are being configured to notice this node BFR
During the message of mark, by default second flag set in the message, second flag is used for
Identify whether this node is intermediate forwarding nodes.
Alternatively, wherein, default first flag be BIER information sub-categories type length value TLV
A bit in middle reserved field.
Alternatively, methods described also includes:The BIER nodes of the message are received to the BIER sides
When boundary's node sends BIER data messages, the Bit String bitstring of the BIER boundary nodes is formed,
The Bit String is carried in the BIER data messages, so that the BIER data messages are sent to institute
State BIER boundary nodes.
In order to reach the object of the invention, present invention also offers a kind of explicit duplication BIER based on position index
Boundary node identity device, positioned at BIER boundary nodes, described device includes:
Constructing module, for being configured to notice the message of this node bits forwarding router BFR marks
When, by default first flag set in the message, first flag is used to identify this node
Whether it is boundary node;
Announcement module, for flooding the message in BIER domains.
Alternatively, described device also includes judge module, for judging whether this node is arranged to border
Node, or judge whether this node has non-BIER interfaces;
The constructing module is additionally operable to when the judge module judges that this node is arranged to boundary node,
Or when judging that this node has non-BIER interfaces, be configured to notice the message of this node BFR marks
When, by default first flag set in the message.
Alternatively, wherein, first flag be used for identify this node for boundary node or in the middle of turn
Send out node.
Alternatively, wherein, the constructing module is additionally operable to be configured to notice this node BFR mark
During message, by default second flag set in the message, second flag is used to identify this
Whether node is intermediate forwarding nodes.
Alternatively, default first flag is reserved word in BIER information type length value TLV
A bit in section.
Using scheme described in the embodiment of the present invention so that the node in BEIR domains easily distinguishes and know boundary node,
When the notice multicast information mutually between boundary node is needed, identified according to the BFR of the boundary node known
Border bitstring is generated, multicast information can be mutually noticed between boundary node without worrying leakage of information
To intermediate node, thus also save intermediate node and occupancy is processed to the resource of boundary information.
Other features and advantages of the present invention will illustrate in the following description, also, partly from froming the perspective of
Become apparent in bright book, or understood by implementing the present invention.The purpose of the present invention is excellent with other
Point can be realized and obtained by specifically noted structure in specification, claims and accompanying drawing.
Description of the drawings
Accompanying drawing is used for providing a further understanding of the present invention, and constitutes a part for specification, with this
Inventive embodiment is used to explain the present invention together, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is existing BIER technologies networking diagram;
Fig. 2 is existing BIER technologies repeating process figure;
Fig. 3 is existing BIER info sub-tlv encapsulation format figures;
Fig. 4 is the flow chart of the embodiment of the present invention one;
Fig. 5 is a kind of encapsulation format figures of embodiment of the present invention BIER info sub-tlv;
Fig. 6 is embodiment of the present invention two devices structural representation;
Fig. 7 is the encapsulation format figure of Application Example of the present invention three;
Fig. 8 is the encapsulation format figure of Application Example of the present invention four.
Specific embodiment
To make the object, technical solutions and advantages of the present invention become more apparent, below in conjunction with accompanying drawing
Embodiments of the invention are described in detail.It should be noted that in the case where not conflicting, this Shen
Please in embodiment and the feature in embodiment can mutually be combined.
Can be in the computer of such as one group of computer executable instructions the step of the flow process of accompanying drawing is illustrated
Perform in system.And, although show logical order in flow charts, but in some cases,
Can be with the step shown or described by performing different from order herein.
Embodiment one
The present embodiment describes a kind of explicit duplication BIER boundary node identification methods based on position index, such as schemes
Shown in 4, comprise the following steps:
Step 401, BIER boundary nodes, will when being configured to notice the message of this node BFR marks
Whether default first flag set in the message, first flag is used to identify this node and is
Boundary node;
Wherein, first flag is used to identify whether this node is boundary node, for example, can be:
First flag is used to identify this node for boundary node or intermediate forwarding nodes.
Alternatively, methods described also includes that the BIER boundary nodes judge that this node is arranged to border
Node, or when judging that this node has non-BIER interfaces, then be configured to notice this node BFR marks
During the message of knowledge, by default first flag set in the message.
Alternatively, step 401 also includes:
BIER boundary nodes when being configured to notice the message of this node BFR mark, by the message
In default second flag set, second flag be used for identify whether this node is middle forwarding
Node.
Specifically, default first flag is to protect in BIER information sub-categories type length value (TLV)
The bit write down characters in section.Fig. 3 is BIER info sub-tlv (BIER information of existing ISIS
TLV), using certain the bit set in reservation therein (Reserved) field, can identify itself is
Individual boundary node, is referred to as E marks, as shown in Figure 5 in the present embodiment by the mark.
Step 402, the BIER boundary nodes flood the message in BIER domains.
When ISIS notices sub-tlv, whole BIER domains interior nodes can learn the section for noticing the TLV
Point is a boundary node.
Thus in BIER domains, all nodes all would know that the information of all boundary nodes in domain, thus
When having message to only need to be distributed to boundary node to perceive, can be according to the set information by corresponding message
It is sent to boundary node.
Alternatively, methods described also includes:The BIER nodes of the message are received to the BIER sides
When boundary's node sends BIER data messages, the Bit String bitstring of the BIER boundary nodes is formed,
The Bit String is carried in the BIER data messages, so that the BIER data messages are sent to institute
State BIER boundary nodes.
Embodiment two
As shown in fig. 6, BIER boundary node identity devices, positioned at BIER boundary nodes, including construction
Module 601 and announcement module 602:
Constructing module 601, for when being configured to notice the message of this node BFR mark, will be described
Default first flag set in message, first flag is used to identify whether this node is border
Node;
Announcement module 602, for flooding the message in BIER domains.
Alternatively, described device also includes judge module, for judging whether this node is arranged to border
Node, or judge whether this node has non-BIER interfaces;The constructing module is additionally operable in the judgement
When module judges that this node is arranged to boundary node, or when judging that this node has non-BIER interfaces,
When being configured to notice the message of this node BFR marks, by default first home position in the message
Position.
Alternatively, the constructing module 601 is additionally operable to be configured to notice disappearing for this node BFR marks
During breath, by default second flag set in the message, second flag is used to identify this section
Whether point is intermediate forwarding nodes.
It should be noted that the device is device corresponding with above-mentioned BIER boundary nodes identification method, on
Stating all implementations in embodiment of the method can reach identical suitable for the embodiment of the device, also
Technique effect.
Illustrate below by several Application Examples.
Application Example one:
According to user configured boundary node situation, each boundary node is being configured to notice this node BFR
During the message of mark, by default E bits set in the message, and disappear described in flooding in BIER domains
Breath, makes other nodes in BIER domains know that this node is boundary node.
Application Example two:
BIER nodes judge whether this node is boundary node according to the interface type of its own interfaces, for example such as
When fruit judges the interface for having interface to be non-BIER on this node, then it is assumed that this node is BIER boundary nodes,
Then, when being configured to notice the message of this node BFR marks, by default E bits in the message
Set, and the message is flooded in BIER domains, make other nodes in BIER domains know this node
For boundary node.
Application Example three:
In the present embodiment, BIER intermediate nodes are being configured to notice the message of this node BFR marks
When, by default second flag set in the message, second flag is for identifying this node
Intermediate node, in this example, is referred to as T (Transit) bit, as shown in Figure 7 by second flag.
The flag can also be used for showing that the node is intermediate forwarding nodes or boundary node, for example, use T=1
Expression node is boundary node, represents that node is intermediate node with T=0.
Application Example four:
In the present embodiment, while arranging in the first flag and the second flag, i.e. Reserved fields
Include T and E simultaneously, as shown in figure 8, due to being only possible to an attribute for same node, no
May be both boundary node and intermediate node, therefore T the and E flags can be also used for check-node
Position arrange it is whether normal.
Although disclosed herein embodiment as above, described content is only to readily appreciate the present invention
And the embodiment for adopting, it is not limited to the present invention.Technology people in any art of the present invention
Member, without departing from disclosed herein spirit and scope on the premise of, can be in the form implemented and thin
Any modification and change, but the scope of patent protection of the present invention are carried out on section, still must be with appended right
The scope that claim is defined is defined.
Claims (11)
1. a kind of explicit duplication BIER boundary node identification methods based on position index, it is characterised in that
Methods described includes:
BIER boundary nodes are being configured to notice the message of this node bits forwarding router BFR marks
When, by default first flag set in the message, first flag is used to identify this node
Whether it is boundary node, the BIER boundary nodes flood the message in BIER domains.
2. method according to claim 1, it is characterised in that methods described also includes,
The BIER boundary nodes judge that this node is arranged to boundary node, or to judge that this node has non-
During BIER interfaces, then when being configured to notice the message of this node BFR marks, by the message
Default first flag set.
3. method according to claim 1, it is characterised in that wherein,
First flag is used to identify this node for boundary node or intermediate forwarding nodes.
4. method according to claim 1, it is characterised in that methods described also includes:
BIER boundary nodes when being configured to notice the message of this node BFR mark, by the message
In default second flag set, second flag be used for identify whether this node is middle forwarding
Node.
5. method according to claim 1, it is characterised in that wherein,
Default first flag is in reserved field in BIER information sub-categories type length value TLV
One bit.
6. method according to claim 1, it is characterised in that methods described also includes:
The BIER nodes for receiving the message are sending BIER data messages to the BIER boundary nodes
When, the Bit String bitstring of the BIER boundary nodes is formed, take in the BIER data messages
With the Bit String, so that the BIER data messages are sent to the BIER boundary nodes.
7. a kind of explicit duplication BIER boundary node identity devices based on position index, positioned at BIER sides
Boundary's node, it is characterised in that described device includes:
Constructing module, for being configured to notice the message of this node bits forwarding router BFR marks
When, by default first flag set in the message, first flag is used to identify this node
Whether it is boundary node;
Announcement module, for flooding the message in BIER domains.
8. device according to claim 7, it is characterised in that described device also includes judge module,
For judging whether this node is arranged to boundary node, or judge whether this node has non-BIER to connect
Mouthful;
The constructing module is additionally operable to when the judge module judges that this node is arranged to boundary node,
Or when judging that this node has non-BIER interfaces, be configured to notice the message of this node BFR marks
When, by default first flag set in the message.
9. device according to claim 7, it is characterised in that wherein,
First flag is used to identify this node for boundary node or intermediate forwarding nodes.
10. device according to claim 7, it is characterised in that wherein,
The constructing module is additionally operable to when being configured to notice the message of this node BFR marks, will be described
Default second flag set in message, second flag is used to identify whether this node is middle
Forward node.
11. devices according to claim 7, it is characterised in that wherein,
Default first flag is in BIER information type length value TLV in reserved field
Individual bit.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510731078.5A CN106656824A (en) | 2015-10-30 | 2015-10-30 | BIER boundary node identification method and device |
PCT/CN2016/086047 WO2016197999A1 (en) | 2015-10-30 | 2016-06-16 | Bier boundary node identification method and apparatus |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510731078.5A CN106656824A (en) | 2015-10-30 | 2015-10-30 | BIER boundary node identification method and device |
Publications (1)
Publication Number | Publication Date |
---|---|
CN106656824A true CN106656824A (en) | 2017-05-10 |
Family
ID=57503030
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510731078.5A Withdrawn CN106656824A (en) | 2015-10-30 | 2015-10-30 | BIER boundary node identification method and device |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN106656824A (en) |
WO (1) | WO2016197999A1 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109257275A (en) * | 2017-07-13 | 2019-01-22 | 中国电信股份有限公司 | Method and system for multicast data forwarding |
CN109729012A (en) * | 2018-12-24 | 2019-05-07 | 新华三技术有限公司 | A kind of unicast message transmission method and device |
CN111988228A (en) * | 2019-11-25 | 2020-11-24 | 华为技术有限公司 | Method and apparatus for processing forwarding table entry |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10574589B2 (en) * | 2017-09-28 | 2020-02-25 | Nokia Technologies Oy | Multicast based on bit indexed explicit replication |
CN112311668B (en) * | 2019-07-26 | 2022-03-29 | 华为技术有限公司 | Method, network device and system for processing BIER message |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140241372A1 (en) * | 2013-02-25 | 2014-08-28 | Futurewei Technologies, Inc. | Constructing A Topology-Transparent Zone |
US20150078379A1 (en) * | 2013-09-17 | 2015-03-19 | Cisco Technology, Inc. | Bit Indexed Explicit Replication Using Internet Protocol Version 6 |
US20150138961A1 (en) * | 2013-09-17 | 2015-05-21 | Cisco Technology, Inc. | Per-Prefix LFA FRR With Bit Indexed Explicit Replication |
CN104811387A (en) * | 2014-01-24 | 2015-07-29 | 思科技术公司 | Equal Cost Multi-path With Bit Indexed Explicit Replication |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101155135B (en) * | 2006-09-28 | 2011-04-20 | 华为技术有限公司 | Method and device for flooding autonomous system border router ability information |
-
2015
- 2015-10-30 CN CN201510731078.5A patent/CN106656824A/en not_active Withdrawn
-
2016
- 2016-06-16 WO PCT/CN2016/086047 patent/WO2016197999A1/en active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140241372A1 (en) * | 2013-02-25 | 2014-08-28 | Futurewei Technologies, Inc. | Constructing A Topology-Transparent Zone |
US20150078379A1 (en) * | 2013-09-17 | 2015-03-19 | Cisco Technology, Inc. | Bit Indexed Explicit Replication Using Internet Protocol Version 6 |
US20150138961A1 (en) * | 2013-09-17 | 2015-05-21 | Cisco Technology, Inc. | Per-Prefix LFA FRR With Bit Indexed Explicit Replication |
CN104811387A (en) * | 2014-01-24 | 2015-07-29 | 思科技术公司 | Equal Cost Multi-path With Bit Indexed Explicit Replication |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109257275A (en) * | 2017-07-13 | 2019-01-22 | 中国电信股份有限公司 | Method and system for multicast data forwarding |
CN109729012A (en) * | 2018-12-24 | 2019-05-07 | 新华三技术有限公司 | A kind of unicast message transmission method and device |
CN111988228A (en) * | 2019-11-25 | 2020-11-24 | 华为技术有限公司 | Method and apparatus for processing forwarding table entry |
CN111988228B (en) * | 2019-11-25 | 2022-01-18 | 华为技术有限公司 | Method and apparatus for processing forwarding table entry |
CN114500378A (en) * | 2019-11-25 | 2022-05-13 | 华为技术有限公司 | Method and apparatus for processing forwarding table entry |
CN114500378B (en) * | 2019-11-25 | 2023-07-14 | 华为技术有限公司 | Method and device for processing forwarding table item |
Also Published As
Publication number | Publication date |
---|---|
WO2016197999A1 (en) | 2016-12-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11431650B2 (en) | Multicast based on bit indexed explicit replication | |
CN106656524A (en) | Transmission method, apparatus and system of BIER control information | |
US9948574B2 (en) | Bit indexed explicit replication packet encapsulation | |
CN106603407B (en) | Multicast address transmission method and device | |
CN107592262A (en) | File transmitting method and the network architecture of the cross-domain forwarding of device, message | |
US10498667B2 (en) | Multicast based on bit indexed explicit replication | |
CN106656824A (en) | BIER boundary node identification method and device | |
CN111614556B (en) | BIER-based two-way forwarding detection session creation method and related equipment | |
WO2016115987A1 (en) | Method and apparatus for multicast forwarding | |
EP3863245A1 (en) | Supporting multicast communications | |
CN109756425A (en) | Multicast forward method, device and BFR | |
CN106603413B (en) | Method and device for transmitting flow through designated path | |
US10187293B2 (en) | Apparatus and method for multicast data packet forwarding | |
US11394578B2 (en) | Supporting multicast over a network domain | |
CN106603406A (en) | Method and device of traffic engineering information announcement in BIER network | |
US9281954B2 (en) | Method and system for protocol independent multicasting in multichassis link aggregation domains | |
US10003518B2 (en) | Span session monitoring | |
CN107623630B (en) | Bit index explicit copy information transfer method and device | |
WO2017177756A1 (en) | Method, apparatus and system for transmitting information | |
US20200106628A1 (en) | Bit forwarding router identifier signaling using protocol independent multicast attribute | |
CN108667731A (en) | A kind of processing and device based on BIER information | |
CN112235199B (en) | EVPN horizontal segmentation method and device based on SRV6 protocol | |
CN107786451A (en) | The transmission method and device of a kind of metadata | |
CN112260949B (en) | EVPN local priority forwarding method and device based on SRV6 protocol | |
WO2024055633A1 (en) | Bit index routing table establishment method, network device, and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
WW01 | Invention patent application withdrawn after publication | ||
WW01 | Invention patent application withdrawn after publication |
Application publication date: 20170510 |