Invention Grant
- Patent Title: Efficient algorithm to eliminate redundant specific prefixes in forwarding information base using trie
-
Application No.: US15470417Application Date: 2017-03-27
-
Publication No.: US10892986B2Publication Date: 2021-01-12
- Inventor: Kumaran Narayanan , Sudip Regmi , Prashant Srinivas , Venkitraman Kasiviswanathan
- Applicant: Arista Networks, Inc.
- Applicant Address: US CA Santa Clara
- Assignee: Arista Networks, Inc.
- Current Assignee: Arista Networks, Inc.
- Current Assignee Address: US CA Santa Clara
- Agency: Chamberlain, Hrdlicka, White, Williams & Aughtry
- Main IPC: H04L12/755
- IPC: H04L12/755 ; H04L12/753 ; H04L12/741 ; H04L12/745

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.
Public/Granted literature
- US20180278517A1 EFFICIENT ALGORITHM TO ELIMINATE REDUNDANT SPECIFIC PREFIXES IN FORWARDING INFORMATION BASE USING TRIE Public/Granted day:2018-09-27
Information query