Invention Publication
- Patent Title: EFFICIENT ALGORITHM TO ELIMINATE REDUNDANT SPECIFIC PREFIXES IN FORWARDING INFORMATION BASE USING TRIE
-
Application No.: US18160075Application Date: 2023-01-26
-
Publication No.: US20230171187A1Publication Date: 2023-06-01
- 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
- Main IPC: H04L45/48
- IPC: H04L45/48 ; H04L45/745 ; H04L45/748

Abstract:
A network element and method for programming a network element that includes detecting an update to a first route in a routing information base (RIB) is disclosed. The method includes locating a first route network prefix associated with the first route within a network prefix trie (NPT); determining that, prior to the update, a first parent network prefix and the first route network prefix were reachable using a pair of different next hops connected to the network element; and determining that, after the update, the first parent network prefix and the first route network prefix are reachable using a first common next hop connected to the network element. The method also includes removing an existing forwarding information base (FIB) entry in the FIB associated with the first route network prefix.
Public/Granted literature
- US11924093B2 Efficient algorithm to eliminate redundant specific prefixes in forwarding information base using TRIE Public/Granted day:2024-03-05
Information query