Resilient Hashing With Multiple Hashes
AssigneeArista Networks, Inc.
InventorsSimon Capper, Prashanth Krishnamurthy, Tula Kraiser
Life of this patent
Estimating the term…
Loading patent…
AssigneeArista Networks, Inc.
InventorsSimon Capper, Prashanth Krishnamurthy, Tula Kraiser
Estimating the term…
Techniques for implementing resilient hashing with multiple hashes are provided. In one set of embodiments, a network device can maintain a first hash table comprising mappings between a first set of hash indices and a set of bit values. The network device can also maintain a second hash table comprising mappings between a second set of hash indices and active next-hop destinations. Upon receiving a network packet, the network device can compute a first hash and can match the first hash value to a first mapping in the first hash table based on the first mapping's hash index. When the first mapping's bit value indicates that the first mapping's hash index corresponds to an active next-hop destination, the network device can further match the first hash value to a second mapping in the second hash table and send the network packet to the second mapping's active next-hop destination.
A method of packet forwarding comprising:
A network device comprising:
A non-transitory computer readable storage medium having stored thereon program code executable by a network device, the program code comprising:
Dependencies are inferred from the claim text.