|Application No.||Application Title||Issue Date|
|20120023082||Longest Prefix Match Using Binary Search Tree|
Longest Prefix Match (LPM) is implemented using a binary tree based search algorithm. Masked entries are stored in a plurality of binary search engines, wherein each of the binary search engines stores masked entries of a corresponding mask length. A search value is app...