Arista Networks, Inc.
Efficient algorithm to eliminate redundant specific prefixes in forwarding information base using trie

Abstract:

In general, the invention relates to a method for programming a network element. The method includes detecting an addition of a first route in a routing information base (RIB) on the network element, adding, in response to detecting the addition, a first route network prefix associated with the first route to a network prefix trie (NPT), identifying, based on the adding, a first parent network prefix for the first route network prefix using the NPT, making a first determination that the first route network prefix and the first parent network prefix are reachable via a first common next hop connected to the network element, and waiving, based on the first determination, a creation of a forwarding information base (FIB) entry associated with the first route network prefix in a FIB on the network element.