Abstract: Examples relate to dynamic allocation of resources within network devices. In one example, a computing device may: receive, from a particular lookup function of a plurality of lookup functions, a lookup request for a network packet; identify, based on a logical table that corresponds to the particular lookup function, at least one physical resource included in a particular resource pool of at least one dynamic resource pool; obtain, from a particular physical resource of the at least one physical resource, response data that is responsive to the lookup request; and provide the response data to the particular lookup function.

Abstract: Examples herein disclose a generation of a hash table. The examples identify a prefix length from a routing table of various prefix lengths and corresponding distribution of entries. The identified prefix length corresponds to a larger distribution of entries in the routing table. The examples generate the hash table in accordance with the identified prefix length.

Abstract: Examples relate to dynamic allocation of hash table resources. In one example, a computing device may: receive, from a particular lookup function of a plurality of lookup functions, a lookup request; identify, based on the particular lookup function, a logical hash table that corresponds to the particular lookup function, the logical hash table mapping to at least one physical hash table resource; obtain, from one of the at least one physical hash table resource, response data that is responsive to the lookup request; and provide the response data to the particular lookup function.

Abstract: Examples disclosed herein relate, in one aspect, to method of searching a content addressable memory (CAM) that stores a plurality of entries. The method may include obtaining a search word corresponding to a matching data word stored in a matching entry of the CAM, where the matching entry may include a plurality of data words. The method may also include determining, based at least on a value of a predetermined bit of the search word, a search mask to mask off any data words within the matching entry other than the matching data word. The method may also determine, based on the search mask and a search key that includes the search word, the address of the matching entry within the CAM.

Abstract: Examples herein disclose a smaller prefix length and a greater prefix length which are identified from a routing table of various prefix lengths. The smaller prefix length is converted into the greater prefix length. The converted prefix length and the greater prefix length are combined into a hash table.

Abstract: Examples disclosed herein relate, in one aspect, to a method for searching an array of content addressable memory (CAM) devices, where each device stores a plurality of entries. The method may obtain a search key from a processor, search a first set of CAM devices in the array to determine whether the first set of CAM devices include a matching entry corresponding to the search key; upon a determination that the first set of CAM devices does not include the matching entry, search a second set of CAM devices in the array to determine whether the second set of CAM devices include the matching entry; and upon a determination that the first set of CAM devices include the matching entry, output an address of the matching entry, without searching the second set of CAM devices.

Abstract: Examples disclosed herein relate, in one aspect, to an electronic device including a processor, a lookup engine, and a content addressable memory (CAM) including a plurality of data tables. The lookup engine may obtain from the processor a search word and a table identifier identifying a selected data table from the plurality of data tables, and using a lookup table, determine table parameters associated with the selected data table. The lookup engine may also generate search parameters based on the search word and the table parameters and provide the search parameters to the CAM. The search parameters may cause the CAM to determine whether the selected data table comprises a word corresponding to the search word, and if the selected data table comprises the word, to output an entry address of an entry of the CAM that comprises the word.

Abstract: Examples relate to dynamic allocation of hash table resources. In one example, a computing device may: receive, from a particular lookup function of a plurality of lookup functions, a lookup request; identify, based on the particular lookup function, a logical hash table that corresponds to the particular lookup function, the logical hash table mapping to at least one physical hash table resource; obtain, from one of the at least one physical hash table resource, response data that is responsive to the lookup request; and provide the response data to the particular lookup function.

Abstract: Examples relate to dynamic allocation of resources within network devices. In one example, a computing device may: receive, from a particular lookup function of a plurality of lookup functions, a lookup request for a network packet; identify, based on a logical table that corresponds to the particular lookup function, at least one physical resource included in a particular resource pool of at least one dynamic resource pool; obtain, from a particular physical resource of the at least one physical resource, response data that is responsive to the lookup request; and provide the response data to the particular lookup function.

Abstract: Examples disclosed herein relate, in one aspect, to an electronic device including a processor, a lookup engine, and a content addressable memory (CAM) including a plurality of data tables. The lookup engine may obtain from the processor a search word and a table identifier identifying a selected data table from the plurality of data tables, and using a lookup table, determine table parameters associated with the selected data table. The lookup engine may also generate search parameters based on the search word and the table parameters and provide the search parameters to the CAM. The search parameters may cause the CAM to determine whether the selected data table comprises a word corresponding to the search word, and if the selected data table comprises the word, to output an entry address of an entry of the CAM that comprises the word.

Abstract: Examples disclosed herein relate, in one aspect, to a method for searching an array of content addressable memory (CAM) devices, where each device stores a plurality of entries. The method may obtain a search key from a processor, search a first set of CAM devices in the array to determine whether the first set of CAM devices include a matching entry corresponding to the search key; upon a determination that the first set of CAM devices does not include the matching entry, search a second set of CAM devices in the array to determine whether the second set of CAM devices include the matching entry; and upon a determination that the first set of CAM devices include the matching entry, output an address of the matching entry, without searching the second set of CAM devices.

Abstract: Examples herein disclose a generation of a hash table. The examples identify a prefix length from a routing table of various prefix lengths and corresponding distribution of entries. The identified prefix length corresponds to a larger distribution of entries in the routing table. The examples generate the hash table in accordance with the identified prefix length.

Abstract: Examples herein disclose a smaller prefix length and a greater prefix length which are identified from a routing table of various prefix lengths. The smaller prefix length is converted into the greater prefix length. The converted prefix length and the greater prefix length are combined into a hash table.

Abstract: Examples disclosed herein relate, in one aspect, to method of searching a content addressable memory (CAM) that stores a plurality of entries. The method may include obtaining a search word corresponding to a matching data word stored in a matching entry of the CAM, where the matching entry may include a plurality of data words. The method may also include determining, based at least on a value of a predetermined bit of the search word, a search mask to mask off any data words within the matching entry other than the matching data word. The method may also determine, based on the search mask and a search key that includes the search word, the address of the matching entry within the CAM.

Abstract: Network devices and methods are provided involving a support chip in association with network chips. One embodiment includes a network device having a processor, a high speed interconnect, and a number of network chips coupled to one another through the high speed interconnect. The number of network chips include a conduit port which can be selectively chosen to exchange packets, received to the number of network chips, with the processor. The support chip is coupled to the number of network chips in association with selecting a conduit port on one of the number of network chips to exchange packets with the processor.

Abstract: A method of providing redundancy in a ternary content addressable memory (TCAM), the method including detecting a defective entry in building block in a ternary content addressable memory (TCAM), configuring a failover logic to redirect a software query toward a spare building block and away from the building block with the defective entry, and avoiding in using the building block with the defective entry.

Abstract: Network devices and methods are provided for device monitoring. One embodiment includes a network device having a processor, a high speed interconnect and a number of network chips. The number of network chips are coupled to one another through the high speed interconnect. The number of network chips have a conduit port which can be selectively chosen to exchange packets, received to any network chip, with the processor.

Abstract: Systems, devices, and methods, including executable instructions are provided for content addressable memory (CAM). One method includes defining the CAM into an array of data words having M rows and N columns, with each of N and M being greater than one. The data words of the CAM are arranged according to a 2-dimensional priority scheme. Data words outside a selected 1×M column are masked to be ignored in determining a match, and the CAM is searched. Each search includes N compare cycles and each compare cycle having a different 1×M column selected. A highest priority match per compare cycle is pipelined from a priority encoder with the pipelined matches arranged to communicate a priority order in a first dimension of the 2-dimensional priority scheme.

Abstract: Systems, devices, and methods, including executable instructions are provided for resolving content addressable memory (CAM) match address priority. One method includes retaining a first match address as the best match address. Subsequent match addresses are compared to the retained best match address, each match address being associated with a compare cycle during which a selected columnar portion of each CAM entry is compared to a corresponding portion of a search term. The best match address is updated as a result of the comparison.

Abstract: Systems, methods, and devices are provided for moving packets on a network device. One method includes receiving packets to a number of network chips, the number of network chips having a conduit port which can be selectively chosen to exchange packets with a processor responsible for processing packets. The method includes adding data for additional functionality to certain packets. Adding data includes encapsulating the certain packets to maintain an appearance of a certain packet format.