A high speed router employs a hashed radix tree method for IP route look-up operations. The first k bits of an X bit IP address are hashed and used as an index to a RAM whose output is a pointer to the root node of one of a plurality of radix trees. Taking into account the subnet mask of the IP address,...http://www.google.com.au/patents/US6061712?utm_source=gb-gplus-sharePatent US6061712 - Method for IP routing table look-up
