1. An address lookup structure comprising: at least one hash table storing prefixes for address lookups; and a content addressable memory storing at least some prefixes for which a collision occurs within the at least one hash table.