×

Bit indexed explicit replication forwarding optimization

  • US 10,404,482 B2
  • Filed: 07/24/2017
  • Issued: 09/03/2019
  • Est. Priority Date: 09/17/2013
  • Status: Active Grant
First Claim
Patent Images

1. A method comprising:

  • generating a bit-indexed forwarding table (BIFT) at a first network node, whereinthe BIFT comprises a plurality of entries, each entry of which corresponds to a bit position of a plurality of bit positions,each bit position of the plurality of bit positions represents an egress network node of a plurality of egress network nodes,the BIFT is generated from a bit indexed routing table (BIRT), comprising a plurality of BIRT entries, and is configured to cause a packet to be forwarded toward one or more of the plurality of egress network nodes, based at least in part on a bit string in the packet, andthe generating comprisesselecting a bit position of the plurality of bit positions as a selected bit position,creating an entry of the plurality of entries, wherein the entry corresponds to the selected bit position,accessing a BIRT entry of the plurality of BIRT entries, whereinthe BIRT entry corresponds to the selected bit position,updating a neighbor information field of the entry, using neighbor information from the BIRT entry, whereinthe neighbor information is associated with a neighbor network node, andthe neighbor network node is a neighbor of the first network node, andupdating forwarding bit mask information in a forwarding bit mask field of the entry, using bit position information from the BIRT entry.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×