Juniper Networks, Inc.
Dynamically mapping hash indices to member interfaces

Abstract:

Techniques are described for dynamically mapping hash indices to member interfaces of an aggregated interface in a hash data structure. As one example, a network device may compute net weights for the member links of a link aggregation group (LAG) and respective utilization values of hash indices in a hash map for the LAG. The network device may generate binary trees based on the net weights and utilization values of the member links of the LAG, and may map values, e.g., median values, of one or more nodes of the binary trees to member interfaces, and update the hash data structure based on the mapping.