Resilient hashing with compression
Abstract:
Techniques for implementing resilient hashing with compression are provided. In some embodiments, a network device can maintain a compressed partition and an uncompressed partition for a logical hash table, where the logical hash table comprises a first set of mappings between bucket identifiers and active next-hop destinations, the compressed partition comprises a second set of mappings between compressed indices and the active next-hop destinations, and the uncompressed partition comprises a third set of mappings between uncompressed indices and the active next-hop destinations. The network device can compute a hash value using a portion of a packet. When the hash value is addressed by a compressed index, the packet is sent to a next-hop destination in the compressed partition. When the hash value is addressed by an uncompressed index, the packet is sent to a next-hop destination in the uncompressed partition.
Public/Granted literature
Information query
Patent Agency Ranking
0/0