IP Library Granted Patent US 12,438,741
Granted Patent B2
US 12,438,741 · App. 17/894,673 · Granted Oct 7, 2025

Area-specific broadcasting using bit indexed explicit replication

Inventors: Ijsbrand Wijnands (Leuven, BE); Pierre Pfister (Angers, FR); Neale D. R Ranns (Basingstoke, GB); W. Mark Townsley (Paris, FR); Gregory J. Shepherd (Eugene, OR)
Assignee: CISCO TECHNOLOGY, INC.
H04L12/1886H04L12/1845H04L45/745H04L2212/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,438,741
App. No.
17/894,673
Granted
Oct 7, 2025
Kind
B2
Abstract

Methods, network devices and computer readable media are disclosed relating to a communication network. In one embodiment, a method includes receiving a message comprising a message bit array. The message bit array identifies egress nodes for the message within a bit indexed explicit replication (BIER) domain of a communications network. A first bit position in the message bit array represents a first one or more of the egress nodes, and a bit value at the first bit position indicates that the message is to be forwarded to one of the first one or more of the egress nodes. The method further includes accessing a first forwarding table entry corresponding to the first bit position, determining whether the first bit position is an anycast bit position having multiple corresponding forwarding table entries, and forwarding the message to one of the first one or more of the egress nodes.

Claims (43)

1. A method comprising:

receiving a message comprising a message bit array, a particular bit position in the message bit array identifying a plurality of destination nodes in a node group;

accessing a forwarding table entry corresponding to the particular bit position;

determining whether the particular bit position is an anycast bit position having multiple corresponding forwarding table entries;

based on a result of the determining, updating the message bit array so that the bit position identifies a subset of the plurality of destination nodes; and

forwarding the message to one of the plurality of destination nodes of the node group.

2. The method of claim 1 , wherein the message bit array identifies destination nodes for the message within a bit indexed explicit replication (BIER) domain of a communications network.

3. The method of claim 1 , wherein, when the particular bit position is an anycast bit position, forwarding the message to one of the plurality of destination nodes comprises:

identifying a neighbor node associated with one of the multiple corresponding forwarding table entries for forwarding the message; and

forwarding a copy of the message and a forwarded message bit array to the neighbor node.

4. The method of claim 3 , wherein identifying the neighbor node includes identifying the neighbor node through a load balancing procedure.

5. The method of claim 3 , wherein the forwarded message bit array is generated by resetting one or more bits in the message bit array in bit positions corresponding to routers not reachable via the neighbor node.

6. The method of claim 1 , wherein, when the particular bit position is not an anycast bit position, forwarding the message to the one of the plurality of destination nodes comprises forwarding a copy of the message and a forwarded message bit array to a neighbor node in the forwarding table entry, the forwarded message bit array being generated by resetting one or more bits in the message bit array in bit positions corresponding to routers not reachable via the neighbor node.

7. The method of claim 1 , wherein the particular bit position identifies all destination nodes in the node group.

8. A device comprising:

a network interface configured to enable network communication; and

a processor, wherein the processor is configured to perform operations comprising:

receiving a message comprising a message bit array, a particular bit position in the message bit array identifying a plurality of destination nodes in a node group;

accessing a forwarding table entry corresponding to the particular bit position;

determining whether the particular bit position is an anycast bit position having multiple corresponding forwarding table entries; and

based on a result of the determining, updating the message bit array so that the bit position identifies a subset of the plurality of destination nodes; and

forwarding the message to one of the plurality of destination nodes of the node group.

9. The device of claim 8 , wherein the message bit array identifies destination nodes for the message within a bit indexed explicit replication (BIER) domain of a communications network.

10. The device of claim 8 , wherein, when the particular bit position is an anycast bit position, when forwarding the message to one of the plurality of destination nodes, the processor is further configured to perform operations comprising:

identifying a neighbor node associated with one of the multiple corresponding forwarding table entries for forwarding the message; and

forwarding a copy of the message and a forwarded message bit array to the neighbor node.

11. The device of claim 10 , wherein, when identifying the neighbor node, the processor is further configured to perform operations comprising identifying the neighbor node through a load balancing procedure.

12. The device of claim 10 , wherein the forwarded message bit array is generated by resetting one or more bits in the message bit array in bit positions corresponding to routers not reachable via the neighbor node.

13. The device of claim 8 , wherein, when the particular bit position is not an anycast bit position, when forwarding the message to one of the plurality of destination nodes, the processor is further configured to perform operations comprising forwarding a copy of the message and a forwarded message bit array to a neighbor node in the forwarding table entry, the forwarded message bit array being generated by resetting one or more bits in the message bit array in bit positions corresponding to routers not reachable via the neighbor node.

14. The device of claim 8 , wherein the particular bit position identifies all destination nodes in the node group.

15. A non-transitory computer readable medium comprising computer readable instructions executable by one or more processors to:

receive a message comprising a message bit array, a particular bit position in the message bit array identifying a plurality of destination nodes in a node group;

access a forwarding table entry corresponding to the particular bit position;

determine whether the particular bit position is an anycast bit position having multiple corresponding forwarding table entries;

based on a result of the determining, update the message bit array so that the bit position identifies a subset of the plurality of destination nodes; and

forward the message to one of the plurality of destination nodes of the node group.

16. The non-transitory computer readable medium of claim 15 , wherein the message bit array identifies destination nodes for the message within a bit indexed explicit replication (BIER) domain of a communications network.

17. The non-transitory computer readable medium of claim 15 , wherein, when the particular bit position is an anycast bit position, when forwarding the message to one of the plurality of destination nodes, the computer readable instructions are further executable by one or more processors to:

identify a neighbor node associated with one of the multiple corresponding forwarding table entries for forwarding the message; and

forward a copy of the message and a forwarded message bit array to the neighbor node.

18. The non-transitory computer readable medium of claim 17 , wherein, when identifying the neighbor node, the computer readable instructions are further executable by one or more processors to identify the neighbor node through a load balancing procedure.

19. The non-transitory computer readable medium of claim 18 , wherein the forwarded message bit array is generated by resetting one or more bits in the message bit array in bit positions corresponding to routers not reachable via the neighbor node.

20. The non-transitory computer readable medium of claim 18 , wherein the particular bit position identifies all destination nodes in the node group.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 24, 2022
From: WIJNANDS, IJSBRAND; PFISTER, PIERRE; RANNS, NEALE D.R.; TOWNSLEY, W. MARK; SHEPHERD, GREGORY J.
To: CISCO TECHNOLOGY, INC.
Reel/Frame 060890/0051 →
Continuity (3)
Continuation 16834860 · Mar 30, 2020
Continuation 15347443 · Nov 9, 2016
Related Publication 20220407736A1 · Dec 22, 2022
References Cited (276)
US 5088091A · Schroeder · 1992 [cited by applicant]
US 5138615A · Lamport · 1992 [cited by applicant]
US 5764624A · Endo · 1998 [cited by applicant]
US 5999531A · Ferolito · 1999 [cited by applicant]
US 6130881A · Stiller · 2000 [cited by applicant]
US 6147976A · Shand · 2000 [cited by applicant]
US 6148000A · Feldman · 2000 [cited by applicant]
US 6240188B1 · Dondeti · 2001 [cited by applicant]
US 6615336B1 · Chen · 2003 [cited by applicant]
US 6625773B1 · Boivie et al. · 2003 [cited by applicant]
US 6771673B1 · Baum · 2004 [cited by applicant]
US 6778532B1 · Akahane · 2004 [cited by applicant]
US 6873627B1 · Miller · 2005 [cited by applicant]
US 7111101B1 · Bourke · 2006 [cited by applicant]
US 7263099B1 · Woo et al. · 2007 [cited by applicant]
US 7281085B1 · Garg · 2007 [cited by applicant]
US 7519733B1 · Thubert · 2009 [cited by applicant]
US 7551599B2 · Levit · 2009 [cited by applicant]
US 7925778B1 · Wijnands · 2011 [cited by applicant]
US 8320374B2 · de Heer · 2012 [cited by applicant]
US 8325726B2 · Baban et al. · 2012 [cited by applicant]
US 8670146B1 · Van Couvering · 2014 [cited by applicant]
US 8774179B1 · Gaggara · 2014 [cited by applicant]
US 8787400B1 · Barth · 2014 [cited by applicant]
US 8830826B2 · Chen · 2014 [cited by applicant]
US 8848728B1 · Revah · 2014 [cited by applicant]
US 8880869B1 · Shah · 2014 [cited by applicant]
US 8890903B2 · Russell · 2014 [cited by applicant]
US 8942256B1 · Barth · 2015 [cited by applicant]
US 9065766B2 · Matsuoka · 2015 [cited by applicant]
US 9455918B1 · Revah · 2016 [cited by applicant]
US 9832031B2 · Zhao · 2017 [cited by examiner]
US 10122614B2 · Eckert · 2018 [cited by examiner]
US 10341221B2 · Eckert · 2019 [cited by examiner]
US 10341222B2 · Eckert · 2019 [cited by examiner]
US 10404482B2 · Wijnands et al. · 2019 [cited by applicant]
US 10461946B2 · Wijnands et al. · 2019 [cited by applicant]
US 10637675B2 · Wijnands · 2020 [cited by examiner]
US 10693765B2 · Eckert · 2020 [cited by examiner]
US 10873524B2 · Allan · 2020 [cited by examiner]
US 11153108B2 · Wijnands et al. · 2021 [cited by applicant]
US 11303470B2 · Wijnands · 2022 [cited by examiner]
US 11438186B2 · Wijnands · 2022 [cited by examiner]
US 20020080798A1 · Hariguchi et al. · 2002 [cited by applicant]
US 20020126661A1 · Ngai · 2002 [cited by applicant]
US 20020191628A1 · Liu · 2002 [cited by applicant]
US 20030043802A1 · Yazaki · 2003 [cited by applicant]
US 20030048779A1 · Doberty · 2003 [cited by applicant]
US 20030088696A1 · McCanne · 2003 [cited by applicant]
US 20030142685A1 · Bare · 2003 [cited by applicant]
US 20030210695A1 · Henrion · 2003 [cited by applicant]
US 20040027995A1 · Miller et al. · 2004 [cited by applicant]
US 20040190526A1 · Kumar · 2004 [cited by applicant]
US 20040190527A1 · Okura · 2004 [cited by applicant]
US 20040240442A1 · Grimminger · 2004 [cited by applicant]
US 20040258066A1 · Chen et al. · 2004 [cited by applicant]
US 20040264374A1 · Yu · 2004 [cited by applicant]
US 20050002371A1 · Andersen · 2005 [cited by applicant]
US 20050016469A1 · Wong et al. · 2005 [cited by applicant]
US 20050018693A1 · Dull · 2005 [cited by applicant]
US 20050080901A1 · Reader · 2005 [cited by applicant]
US 20050100016A1 · Miller et al. · 2005 [cited by applicant]
US 20050157724A1 · Montuno · 2005 [cited by applicant]
US 20050169270A1 · Mutou · 2005 [cited by applicant]
US 20050181807A1 · Dowling · 2005 [cited by applicant]
US 20050232272A1 · Deng · 2005 [cited by applicant]
US 20060133298A1 · Ng · 2006 [cited by applicant]
US 20060182035A1 · Vasseur · 2006 [cited by applicant]
US 20060187817A1 · Charzinski · 2006 [cited by applicant]
US 20060280192A1 · Desanti · 2006 [cited by applicant]
US 20060291444A1 · Alvarez · 2006 [cited by applicant]
US 20070115968A1 · Brown · 2007 [cited by applicant]
US 20070127474A1 · Mirtorabi et al. · 2007 [cited by applicant]
US 20070189291A1 · Tian · 2007 [cited by applicant]
US 20080069125A1 · Reed · 2008 [cited by applicant]
US 20080159285A1 · de Heer · 2008 [cited by applicant]
US 20080165783A1 · Desanti · 2008 [cited by applicant]
US 20080194240A1 · Dowling · 2008 [cited by applicant]
US 20080212465A1 · Yan · 2008 [cited by applicant]
US 20080240105A1 · Abdallah · 2008 [cited by applicant]
US 20080316916A1 · Tazzari · 2008 [cited by applicant]
US 20090067348A1 · Vasseur · 2009 [cited by applicant]
US 20090185549A1 · Sbon · 2009 [cited by applicant]
US 20090190587A1 · Zhao et al. · 2009 [cited by applicant]
US 20090196289A1 · Shankar · 2009 [cited by applicant]
US 20090213735A1 · Check · 2009 [cited by applicant]
US 20090219817A1 · Carley · 2009 [cited by applicant]
US 20090225650A1 · Vasseur · 2009 [cited by applicant]
US 20090310610A1 · Sandstrom · 2009 [cited by applicant]
US 20100046400A1 · Wu · 2010 [cited by applicant]
US 20100046515A1 · Wong · 2010 [cited by applicant]
US 20100124225A1 · Fedyk · 2010 [cited by applicant]
US 20100191911A1 · Heddes · 2010 [cited by applicant]
US 20100290464A1 · Assarpour · 2010 [cited by applicant]
US 20110149973A1 · Esteve Rothenberg · 2011 [cited by applicant]
US 20110202761A1 · Sarela et al. · 2011 [cited by applicant]
US 20110228770A1 · Dholakia · 2011 [cited by applicant]
US 20110238816A1 · Vohra · 2011 [cited by applicant]
US 20110274112A1 · Czaszar · 2011 [cited by applicant]
US 20110299531A1 · Yu · 2011 [cited by applicant]
US 20120075988A1 · Lu · 2012 [cited by applicant]
US 20120099591A1 · Kotha · 2012 [cited by applicant]
US 20120106560A1 · Gumaste · 2012 [cited by applicant]
US 20120198064A1 · Bouwos · 2012 [cited by applicant]
US 20120236857A1 · Manzella · 2012 [cited by applicant]
US 20120243539A1 · Keesara · 2012 [cited by applicant]
US 20130034097A1 · Dharmapurikar · 2013 [cited by applicant]
US 20130051376A1 · Hatashita · 2013 [cited by applicant]
US 20130100988A1 · Miyoshi et al. · 2013 [cited by applicant]
US 20130107725A1 · Jeng · 2013 [cited by applicant]
US 20130114595A1 · Mack-Crane · 2013 [cited by applicant]
US 20130114619A1 · Wakumoto · 2013 [cited by applicant]
US 20130136117A1 · Schrum, Jr. · 2013 [cited by applicant]
US 20130136123A1 · Ge · 2013 [cited by applicant]
US 20130170450A1 · Anchan · 2013 [cited by applicant]
US 20130195001A1 · Liu · 2013 [cited by applicant]
US 20130201988A1 · Zhou · 2013 [cited by applicant]
US 20130308948A1 · Swinkels · 2013 [cited by applicant]
US 20130329728A1 · Ramesh · 2013 [cited by applicant]
US 20130336315A1 · Guichard · 2013 [cited by applicant]
US 20130343384A1 · Shepherd · 2013 [cited by applicant]
US 20140010074A1 · Ye · 2014 [cited by applicant]
US 20140010223A1 · Wang · 2014 [cited by applicant]
US 20140025821A1 · Baphna et al. · 2014 [cited by applicant]
US 20140043964A1 · Gabriel · 2014 [cited by applicant]
US 20140064081A1 · Morandin · 2014 [cited by applicant]
US 20140098813A1 · Misbra · 2014 [cited by applicant]
US 20140119191A1 · Onoue · 2014 [cited by applicant]
US 20140126575A1 · Janneteau · 2014 [cited by applicant]
US 20140160925A1 · Xu · 2014 [cited by applicant]
US 20140189174A1 · Ajanovic · 2014 [cited by applicant]
US 20140241357A1 · Liu et al. · 2014 [cited by applicant]
US 20140301390A1 · Scott et al. · 2014 [cited by applicant]
US 20140362846A1 · Li · 2014 [cited by applicant]
US 20140369356A1 · Bryant · 2014 [cited by applicant]
US 20140376549A1 · Lu · 2014 [cited by applicant]
US 20150003458A1 · Li · 2015 [cited by applicant]
US 20150009823A1 · Ganga · 2015 [cited by applicant]
US 20150016469A1 · Ganicbev · 2015 [cited by applicant]
US 20150023328A1 · Thubert et al. · 2015 [cited by applicant]
US 20150049760A1 · Xu · 2015 [cited by applicant]
US 20150078377A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150078378A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150078379A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150078380A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150081941A1 · Brown · 2015 [cited by applicant]
US 20150085635A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150092546A1 · Baratam · 2015 [cited by applicant]
US 20150131658A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150131659A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150131660A1 · Shepherd et al. · 2015 [cited by applicant]
US 20150138961A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150139228A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150146526A1 · Kulkarni · 2015 [cited by applicant]
US 20150172190A1 · Song · 2015 [cited by applicant]
US 20150181309A1 · Wijnands et al. · 2015 [cited by applicant]
US 20150200852A1 · Solis · 2015 [cited by examiner]
US 20150249587A1 · Kozat · 2015 [cited by applicant]
US 20150304450A1 · van Bemmel · 2015 [cited by applicant]
US 20150319086A1 · Tripathi · 2015 [cited by applicant]
US 20150334006A1 · Shao · 2015 [cited by examiner]
US 20160087890A1 · Przygienda · 2016 [cited by applicant]
US 20160105397A1 · Davis, Jr. et al. · 2016 [cited by applicant]
US 20160119159A1 · Zhao · 2016 [cited by applicant]
US 20160127139A1 · Tian · 2016 [cited by examiner]
US 20160127142A1 · Tian et al. · 2016 [cited by applicant]
US 20160134518A1 · Callon · 2016 [cited by applicant]
US 20160134535A1 · Callon · 2016 [cited by applicant]
US 20160142248A1 · Thubert et al. · 2016 [cited by applicant]
US 20160182353A1 · Garcia-Luna-Aceves · 2016 [cited by applicant]
US 20160191372A1 · Zhang · 2016 [cited by applicant]
US 20160205588A1 · Liu · 2016 [cited by applicant]
US 20160218961A1 · Lindem · 2016 [cited by applicant]
US 20160226725A1 · Iizuka · 2016 [cited by applicant]
US 20160254987A1 · Eckert et al. · 2016 [cited by applicant]
US 20160254988A1 · Eckert et al. · 2016 [cited by applicant]
US 20160254991A1 · Eckert et al. · 2016 [cited by applicant]
US 20160344616A1 · Roch · 2016 [cited by applicant]
US 20170012880A1 · Yang · 2017 [cited by applicant]
US 20170099232A1 · Shepherd · 2017 [cited by applicant]
US 20170126416A1 · McCormick · 2017 [cited by applicant]
US 20170142006A1 · Wijnands et al. · 2017 [cited by applicant]
US 20170302566A1 · Zhang · 2017 [cited by applicant]
US 20180048566A1 · Bannister · 2018 [cited by applicant]
US 20180083790A1 · Wijnands et al. · 2018 [cited by applicant]
US 20180091473A1 · Wijnands et al. · 2018 [cited by applicant]
US 20180102965A1 · Hari · 2018 [cited by applicant]
US 20180131532A1 · Wijnands et al. · 2018 [cited by applicant]
US 20180205565A1 · Wijnands et al. · 2018 [cited by applicant]
US 20180205636A1 · Hu · 2018 [cited by applicant]
US 20180278470A1 · Wijnands et al. · 2018 [cited by applicant]
US 20180287934A1 · Wang · 2018 [cited by applicant]
US 20180287935A1 · Wang · 2018 [cited by applicant]
US 20180309664A1 · Balasubramanian · 2018 [cited by applicant]
US 20180316520A1 · Wijnands et al. · 2018 [cited by applicant]
US 20190013964A1 · Wijnands · 2019 [cited by applicant]
US 20190014034A1 · Allan · 2019 [cited by applicant]
US 20190020574A1 · Eckert et al. · 2019 [cited by applicant]
US 20190058606A1 · Wijnands et al. · 2019 [cited by applicant]
US 20190075041A1 · Wang · 2019 [cited by applicant]
US 20190116114A1 · Chen · 2019 [cited by applicant]
US 20190215176A1 · Wijnands et al. · 2019 [cited by applicant]
US 20190327168A1 · Eckert et al. · 2019 [cited by applicant]
US 20190356500A1 · Wijnands et al. · 2019 [cited by applicant]
US 20190386848A1 · Wang et al. · 2019 [cited by applicant]
US 20200052918A1 · Wijnands et al. · 2020 [cited by applicant]
US 20200067722A1 · Wijnands et al. · 2020 [cited by applicant]
US 20200366512A1 · Wijnands et al. · 2020 [cited by applicant]
US 20210184982A1 · Zhang et al. · 2021 [cited by applicant]
CN 1754353 · 2006 [cited by applicant]
CN 1792065 · 2006 [cited by applicant]
CN 101242413 · 2008 [cited by applicant]
CN 101385275 · 2009 [cited by applicant]
CN 101572667 · 2009 [cited by applicant]
CN 101689172 · 2010 [cited by applicant]
CN 102025538 · 2011 [cited by applicant]
CN 102577238 · 2012 [cited by applicant]
WO WO2007095331 · 2007 [cited by applicant]
Wijnands, Ijsbrand et al.; “Unicast Media Replication Fabric Using Bit Indexed Explicit Replication”; U.S. Appl. No. 16/834,551, filed Mar. 30, 2020; consisting of Specification, Claims, Abstract, and Drawings (65 pages… [cited by applicant]
Wijnands, Ijsbrand et al., “Bridging of Non-Capable Subnetworks in a Bit Indexed Explicit Replication”; U.S. Appl. No. 16/777,945, filed Jan. 31, 2020; consisting of Specification, Claims, Abstract, and Drawings (69 pag… [cited by applicant]
Aggarwal, R., et al., “BGP Encodings and Procedures for Multicast in MPLS/BGP IP VPNs,” Internet Engineering Task Force (IETF), Request for Comments 6514, Feb. 2012, pp. 1-59. [cited by applicant]
Aguilar, L., “Datagram Routing For Internet Multicasting,” SRI International, Menlo Park, California, ACM SIGCOMM Computer Communication Review Newsletter, vol. 14, Issue 2, Jun. 1984, pp. 58-63. [cited by applicant]
Artel Video Systems, White Paper; “The Broadcaster's Guide to SMPTE 2022: Applications in Video Contribution and Distribution,” Oct. 2014, pp. 1-7. [cited by applicant]
Bates, T. et al.; “Multiprotocol Extensions for BGP-4,” Network Working Group, Request for Comments 4760, Jan. 2007, pp. 1-12. [cited by applicant]
Boivie, Rick, and N. Feldman, IBM Watson Research Center; “Small Group Multicast,” draft-boivie-sgm-02.txt, Internet—Draft, Feb. 2001, pp. 1-17. [cited by applicant]
Boivie, Rick, et al., “Explicit Multicast (Xcast) Concepts and Options, draft-ooms-xcast-basic-spec-13.txt,” Internet—Draft, Jul. 2007, pp. 1-34. [cited by applicant]
Cisco Systems, Inc., “Multi-Topology Routing,” Feb. 2007, pp. 1-72. [cited by applicant]
Cisco Systems, Inc., White Paper, “Diffserv—The Scalable End-To-End Quality of Service Model,” Aug. 2005, pp. 1-18. [cited by applicant]
Das, Kaushik, “IPv6 Header Deconstructed”; http://www.ipv6.com/articles/general/IPv6-Header.htm; Apr. 18, 2008; 2 pages. [cited by applicant]
Deering, S., Cisco Systems, Inc. and R. Hinden, Nokia;“Internet Protocol, Version 6 (IPv6),” Network Working Group, Request for Comments 2460, Dec. 1998, pp. 1-39. [cited by applicant]
Eckert, T., “Traffic Engineering for Bit Index Explicit Replication BIER-TE, draft-eckert-bier-te-arch-00,” Network Working Group, Internet—Draft, Mar. 5, 2015, pp. 1-21. [cited by applicant]
Eckert, T., et al., “Traffic Engineering for Bit Index Explicit Replication BIER-TE, draft-eckert-bier-te-arch-01,” Network Working Group, Internet—Draft, Jul. 5, 2015, pp. 1-23. [cited by applicant]
Gharai, L. et al., “RTP Payload Format for Society of Motion Picture and Television Engineers (SMPTE) 292M Video,” Network Working Group, Request for Comments 3497, Mar. 2003, pp. 1-12. [cited by applicant]
Hinden, R., Nokia and S. Deering, Cisco Systems, Inc.;“IP Version 6 Addressing Architecture,” Network Working Group, Request for Comments 4291, Feb. 2006, pp. 1-25. [cited by applicant]
Kompella, K. et al., “The Use of Entropy Labels in MPLS Forwarding.” Internet Engineering Task Force (IETF), Request for Comments 6790, Nov. 2012, pp. 1-25. [cited by applicant]
Kumar, N. et al., Cisco Systems, Inc., “OSPF Extension for Bit Index Explicit Replication, draft-kumar-ospf-bier-extension-00,” Internet—Draft, May 19, 2014, pp. 1-7. [cited by applicant]
Kumar, N., et al., “BIER Use Cases, draft-kumar-bier-use-cases-00,” Network Working Group, Internet—Draft, Oct. 25, 2014, pp. 1-7. [cited by applicant]
Laabs, Matthias, “SDI over IP—Seamless Signal Switching in SMPTE 2022-6 and a Novel Multicast Routing Concept,” EBU Technical Review, 2012 Q4, pp. 1-7. [cited by applicant]
Li, Tony et al., “IGP Requirements for Traffic Engineering With MPLS, draft-li-mpls-igp-te-00.txt,” Network Working Group, Internet—Draft, Feb. 1999, pp. 1-6. [cited by applicant]
Microsoft, “IPv6 Addressing (TechRef)”; Apr. 3, 2011; https://technet.microsoft.com/en-us/library/dd392266(v=ws.10).aspx; pp. 1-30. [cited by applicant]
Moy, J., Ascend Communications, Inc., “OSPF Version 2,” Network Working Group, Request for Comments 2328, Apr. 1998, pp. 1-244. [cited by applicant]
Przygienda, T. et al., “M-ISIS: Topology (MT) Routing in Intermediate System to Intermediate Systems (IS-ISs),” Network Working Group, Request for Comments 5120, Feb. 2008, pp. 1-14. [cited by applicant]
Psenak, P. et al., “Multi-Topology (MT) Routing in OSPF,” Network Working Group, Request for Comments 4915, Jun. 2007, pp. 1-20. [cited by applicant]
Psenak, P. et al., Cisco Systems; “OSPF Extensions for BIER, draft-psenak-ospf-bier-extensions-00,” OSPF, Internet—Draft, Sep. 27, 2014, pp. 1-6. [cited by applicant]
Psenak, P. et al., Cisco Systems; “OSPF Extensions for BIER, draft-psenak-ospf-bier-extensions-01,” OSPF, Internet—Draft, Oct. 24, 2014, pp. 1-8. [cited by applicant]
Psenak, P. et al., “OSPF Extensions For Segment Routing, draft-psenak-ospf-segment-routing-extension-05,” Open Shortest Path First IGP, Internet—Draft, Jun. 2014, pp. 1-33. [cited by applicant]
Rekhter, Ed. Y. et al., “A Border Gateway Protocol 4 (BGP-4),” Network Working Group, Request for Comments 4271, Jan. 2006, pp. 1-104. [cited by applicant]
Rosen, Ed. E. et al., “Multicast VPN Using BIER, draft-rosen-13vpn-mvpn-bier-01,” Internet Engineering Task Force, Internet—Draft, Oct. 16, 2014, pp. 1-9. [cited by applicant]
Schulzrinne, H. et al., “RTP: A Transport Protocol for Real-Time Applications,” Network Working Group, Request for Comments 3550, Jul. 2003, pp. 1-89. [cited by applicant]
Shen, Naiming et al., “Calculating IGP Routes Over Traffic Engineering Tunnels, draft-ietf-rtgwg-igp-shortcut-01.txt,” Network Working Group, Internet—Draft, May 2004, pp. 1-7. [cited by applicant]
Shen, N et al., “Calculating Interior Gateway Protocol (IGP) Routes Over Traffic Engineering Tunnels,” Network Working Group, Request for Comments 3906, Oct. 2004, pp. 1-8. [cited by applicant]
SMPTE, “Beyond The Digital Conversion, The Integration of Information Technology and Professional Media, The Convergence of 2 Industries—The Adoption of Information Technology by the Professional Media Industry; Report … [cited by applicant]
SMPTE, “Transport of High Bit Rate Media Signals Over IP Networks (HBRMT),” ST 2022-6:2012, © 2015 by the Society of Motion Picture and Television Engineers, Inc. (SMPTE), p. 1. [cited by applicant]
SMPTE, “Definition of Vertical Interval Switching Point for Synchronous Video Switching,” RP 168:2009, © 2015 by the Society of Motion Picture and Television Engineers, Inc. (SMPTE), p. 1. [cited by applicant]
Whitcomb, Leigh, “Real-Time Professional Broadcast Signals Over IP Networks,” Harris Corporation, Technology Conference, Apr. 2011, pp. 1-60. [cited by applicant]
Wijnands, Ijsbrand, et al., Cisco Systems, Inc.; “Multipoint Label Distribution Protocol In-Band Signaling in a VPN Context, draft-wijnands-mpls-mldp-vpn-in-band-signaling-00,” Internet—Draft, Oct. 7, 2011, pp. 1-13. [cited by applicant]
Wijnands, Ijsbrand, Cisco Systems, Inc., “Bit Index Explicit Replication using MPLS Encapsulation, draft-wijnands-mpls-bmf-encapsulation-00,” Internet—Draft, Feb. 2014, pp. 1-9. [cited by applicant]
Wijnands, Ijsbrand, et al., “Multicast Using Bit Index Explicit Replication, draft-wijnands-bier-architecture-01,” Internet Engineering Task Force, Internet—Draft, Oct. 16, 2014, pp. 1-24. [cited by applicant]
Wijnands, Ijsbrand, et al., “Multicast Using Bit Index Explicit Replication, draft-wijnands-bier-architecture-02,” Internet Engineering Task Force, Internet—Draft, Dec. 4, 2014, pp. 1-27. [cited by applicant]
Wijnands, Ijsbrand, et al., “Multicast Using Bit Index Explicit Replication, draft-wijnands-bier-architecture-03,” Internet Engineering Task Force, Internet—Draft, Jan. 27, 2015; pp. 1-29. [cited by applicant]
Xu, X. et al., “BIER Encapsulation, draft-xu-bier-encapsulation-00,” Network Working Group, Internet—Draft, Sep. 30, 2014, pp. 1-6. [cited by applicant]
Xu, X. et al., “BIER Encapsulation, draft-xu-bier-encapsulation-01,” Network Working Group, Internet—Draft, Oct. 20, 2014, pp. 1-6. [cited by applicant]
Eckert T., et al., “Traffic Engineering for Bit Indexed Explicit Replication,” U.S. Appl. No. 16/457,339, filed Jun. 28, 2019, Consisting of Specification, Claims, Abstract, and Drawings, 88 Pages. [cited by applicant]
Li Y., et al., “Method and Device for Realizing Multicasting Flow Load Sharing Based on Equal-Cost Multi-Path (ECMP) Routing,” EPODOC, European Patent Office, The Hague, NL, Apr. 20, 2011, 2 Pages, XP002740355. [cited by applicant]
Wang X., et al., “Internet Protocol Based Encapsulation for Bit Indexed Explicit Replication (BIER),” U.S. Appl. No. 15/487,626, filed Apr. 14, 2017, Consisting of Specification, Claims, Abstract, and Drawings, 94 Pages. [cited by applicant]
Wang X., et al., “Multicast Traffic Steering Using Tree Identity in Bit Indexed Explicit Replication (BIER),” U.S. Appl. No. 15/474,583, filed Mar. 30, 2017, Consisting of Specification, Claims, Abstract, and Drawings, … [cited by applicant]
Wang X., et al., “Multicast Traffic Steering Using Tree Identity in Bit Indexed Explicit Replication (BIER),” U.S. Appl. No. 16/557,065, filed Aug. 30, 2019, Consisting of Specification, Claims, Abstract, and Drawings, … [cited by applicant]
Wijnands I., et al. “Bit Indexed Explicit Replication for Layer 2 Networking,” U.S. Appl. No. 16/987,017, filed Aug. 6, 2020, Consisting of Specification, Claims, Abstract, and Drawings, 51 pages. [cited by applicant]
Wijnands I., et al., “Bit Indexed Explicit Replication,” U.S. Appl. No. 16/669,653, filed Oct. 31, 2019, Consisting of Specification, Claims, Abstract, and Drawings, 49 Pages. [cited by applicant]
Wijnands I., et al., “Bit Indexed Explicit Replication Using Internet Protocol Version 6,” U.S. Appl. No. 15/919,552, filed Mar. 13, 2018, Consisting of Specification, Claims, Abstract, and Drawings, 49 Pages. [cited by applicant]
Wijnands I., et al., “Bit Indexed Explicit Replication Using Multiprotocol Label Switching,” U.S. Appl. No. 16/876,217, filed May 18, 2020, Consisting of Specification, Claims, Abstract, and Drawings, 72 Pages. [cited by applicant]
Wijnands I., et al., “Bridging of Non-Capable Subnetworks in Bit Indexed Explicit Replication,” U.S. Appl. No. 15/582,090, filed Apr. 28, 2017, Consisting of Specification, Claims, Abstract, and Drawings, 68 Pages. [cited by applicant]
Wijnands I., et al., “Overlay Signaling for Bit Indexed Explicit Replication,” U.S. Appl. No. 16/654,078, filed Oct. 16, 2019, Consisting of Specification, Claims, Abstract, and Drawings, 53 Pages. [cited by applicant]
Wijnands I., et al., “Unicast Media Replication Fabric Using Bit Indexed Explicit Replication,” U.S. Appl. No. 15/581,806, filed Apr. 28, 2017, Consisting of Specification, Claims, Abstract, and Drawings, 64 Pages. [cited by applicant]
Chen, Ran, et al., “YANG Data Model for BIER Protocol draft-chh-bier-bier-yang-00.txt”, BIER WG, Internet-Draft, Internet—Draft, Jan. 7, 2016, pp. 1-13. [cited by applicant]
Kumar, N., et al., “BIER Ping and Trace,” Network Working Group, Internet—Draft, Sep. 6, 2015, pp. 1-20. [cited by applicant]