US 12,068,871 B2
Bit indexed explicit replication using multiprotocol label switching
Ijsbrand Wijnands, Leuven (BE); Gregory J. Shepherd, Eugene, OR (US); Christian J. Martin, Rumson, NJ (US); Neale D. R. Ranns, Basingstoke (GB); and Jesper Skriver, Latsia (CY)
Assigned to CISCO TECHNOLOGY, INC., San Jose, CA (US)
Filed by CISCO TECHNOLOGY, INC., San Jose, CA (US)
Filed on Sep. 29, 2021, as Appl. No. 17/489,266.
Application 17/489,266 is a continuation of application No. 16/876,217, filed on May 18, 2020, granted, now 11,153,108.
Application 16/876,217 is a continuation of application No. 16/049,907, filed on Jul. 31, 2018, granted, now 10,659,242, issued on May 19, 2020.
Application 16/049,907 is a continuation of application No. 14/488,790, filed on Sep. 17, 2014, granted, now 10,225,090, issued on Mar. 5, 2019.
Claims priority of provisional application 61/931,473, filed on Jan. 24, 2014.
Claims priority of provisional application 61/878,693, filed on Sep. 17, 2013.
Prior Publication US 2022/0021550 A1, Jan. 20, 2022
Int. Cl. H04L 12/18 (2006.01); H04L 45/16 (2022.01); H04L 45/18 (2022.01); H04L 45/50 (2022.01); H04L 45/74 (2022.01)
CPC H04L 12/18 (2013.01) [H04L 12/1886 (2013.01); H04L 45/16 (2013.01); H04L 45/74 (2013.01); H04L 45/18 (2013.01); H04L 45/50 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
a node receiving a first message that originated at a first node in a network of nodes, wherein the first message comprises first label range value and a first identification (ID) that uniquely identifies the first node in the network;
using the first ID, the node determining a first bit-indexed explicit replication node on a path to the first node;
the node creating a first entry in a bit routing table;
the node adding the first ID, an ID of the first bit-indexed explicit replication node, and the first label value range to the first entry;
the node creating a bit forwarding table (BFT) using the bit routing table;
the node using the BFT to forward packets it receives.