Dynamic route profile storage in a hardware trie routing table

    公开(公告)号:US11570105B2

    公开(公告)日:2023-01-31

    申请号:US17244936

    申请日:2021-04-29

    Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

    DYNAMIC ROUTE PROFILE STORAGE IN A HARDWARE TRIE ROUTING TABLE

    公开(公告)号:US20210250296A1

    公开(公告)日:2021-08-12

    申请号:US17244936

    申请日:2021-04-29

    Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

    Dynamic route profile storage in a hardware trie routing table

    公开(公告)号:US10404596B2

    公开(公告)日:2019-09-03

    申请号:US15723713

    申请日:2017-10-03

    Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

    DYNAMIC ROUTE PROFILE STORAGE IN A HARDWARE TRIE ROUTING TABLE

    公开(公告)号:US20190104067A1

    公开(公告)日:2019-04-04

    申请号:US15723713

    申请日:2017-10-03

    Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

    Multicast routing
    17.
    发明授权

    公开(公告)号:US10250399B1

    公开(公告)日:2019-04-02

    申请号:US14734987

    申请日:2015-06-09

    Abstract: In accordance with one example embodiment, a system configured for programming a network layer multicast address entry in a routing table of an ingress line card module is disclosed. The network layer multicast address entry includes a network layer address associated with at least one egress line card. The system is further configured for programming a data link layer multicast routing address entry in a routing table of a fabric card module in which the data link layer multicast routing address entry corresponds to the network layer multicast address entry.

    DYNAMIC AND COMPRESSED TRIE FOR USE IN ROUTE LOOKUP

    公开(公告)号:US20180212876A1

    公开(公告)日:2018-07-26

    申请号:US15414589

    申请日:2017-01-24

    CPC classification number: H04L45/748 H04L45/7457

    Abstract: In one embodiment, a method includes receiving a request to add a prefix to memory for a route lookup at a forwarding device, the memory comprising a plurality of pivot tiles for storing pivot entries, each of the pivot entries comprising a plurality of prefixes and a pointer to a trie index, searching at the forwarding device, a dynamic pool of the pivot tiles based on a base-width associated with the prefix, allocating at least a portion of the pivot tile to the base-width and creating a pivot entry for the prefix and other prefixes with a corresponding base-width, and dynamically updating prefixes stored on the pivot tiles based on route changes to optimize storage of prefixes on the pivot tiles. An apparatus and logic are also disclosed herein.

Patent Agency Ranking