Lines Matching refs:hops

9 weights of constituent next hops.
48 constituent next hops: a hash table. The selection algorithm uses SKB hash
55 the individual next hops is arbitrary. Therefore when a next hop is deleted
56 the buckets that held it are simply reassigned to other next hops::
69 When weights of next hops in a group are altered, it may be possible to
83 cause bucket allocation change, the wants counts for individual next hops
86 Next hops that have fewer buckets than their wants count, are called
88 overweight (and therefore no underweight) next hops in the group, it is
97 After assigning wants counts to next hops, an "upkeep" algorithm runs. For
105 underweight next hops. If, after considering all buckets in this manner,
106 there are still underweight next hops, another upkeep run is scheduled to a
110 of all next hops. Another attribute of a resilient group is the "unbalanced
128 among next hops is still the one in SW. Drivers are notified of updates to
226                       next hops that use the device with this ifindex.
228                       next hops that use a device in the VRF with this ifindex.