×

Bit indexed explicit replication forwarding optimization

  • US 9,806,897 B2
  • Filed: 01/23/2015
  • Issued: 10/31/2017
  • Est. Priority Date: 09/17/2013
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method comprising:

  • receiving a packet at a node, whereinthe packet comprises a bit string;

    selecting a selected entry in a bit indexed forwarding table (BIFT) generated, using at least one of a bit-indexed routing table (BIRT) or an existing BIFT generated using the BIRT, such that the BIFT is indexed by bit position, whereinthe BIFT comprises a plurality of entries, each of whichcorresponds to a corresponding bit position in the bit string, andstores a corresponding identifier of a plurality of identifiers,as a result of the BIFT being indexed by bit position, the BIFT allows a plurality of the corresponding identifiers to correspond to another node,the selecting comprisesidentifying a bit position, andin response to a first value of a first bit stored in the bit string at the bit position and a second value of a second bit stored in the entry indicating that the entry should be selected as the selected entry, selecting an entry in the BIFT corresponding to the bit position, as the selected entry, andthe selected entry comprisesa forwarding bit mask, andan identifier; and

    in response to the entry being selected as the selected entry, forwarding the packet to the another node, whereinthe another node is identified by the identifier, andthe forwarding comprisescreating an outgoing bit string in an outgoing packet using at least the forwarding bit mask and the bit string, andtransmitting the outgoing packet to the another node.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×