The present invention relates to a method and system of performing parallel membership
queries to Bloom filters for Longest Prefix Matching, where address prefix memberships are …

(57) ABSTRACT A network address associated with a packet is obtained at a search engine
of a network device. The search engine includes a plurality of Bloom filters that represent …

In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is
performed by hashing a candidate prefix value to generate a plurality of hash values, where …

In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is
performed using a Bloom filter that was programmed with the prefixes corresponding to all of …

ABSTRACT A method and apparatus that constructs a “router database'and then uses the
database to determine a longest match between a piece of target data, Such as an address …

This invention relates to computer networking structures and systems, particularly those that
relate to the use of a hash function for the look up of an internet protocol (IP) address. More …

A system and method for performing longest prefix matching processing, such as that
employed for IP destination address lookups, is disclosed. The technique, referred as the …

BACKGROUND 0001. In Internet communications, electronic packets of data are sent from
an originating host to a receiving host by means of the Internet Protocol (IP). IP uses routers …

BACKGROUND Network packet processing. Such as forwarding and mea surement of
packets, often involves the use of table lookups. High speed network applications require …

Internet Protocol address prefixes are hashed into hash tables allocated memory blocks on
demand after collisions occur for both a first hash and a single rehash. The number of …