Partitioning and filtering a search space of particular use for determining a longest prefix match thereon

摘要: Disclosed are, inter alia, methods, apparatus, data structures, computer readable media, mechanisms, and means for partitioning filtering a search space of particular use determining longest prefix match thereon, such as routing packets. One implementation uses one or more mechanisms to filter portions lookup word against first set values, as, but not limited the value any corresponding portion entry in space. A possible matching prefixes defined by consecutive from highest-order position are determined, operations typically performed parallel on each these generate results (if any), which is used identify prefix.