Abstract: The present invention provides a method for packet processing according to a access control list table, comprising: receiving a packet, wherein the packet includes a packet information and match items for matching; providing an access control list (ACL) codeword table; providing a mask table, wherein the ACL codeword table corresponds to the mask table; obtaining a hash key by performing a multiplexing logic operation, wherein the hash key is made by combining a multiplex result of the packet information and the mask table; obtaining a hash value by performing a hash function based on the hash key, wherein the hash value is composed of X+Y, wherein X is a signature table (hash table) index and Y is a key digest; performing a hash table indexing, based on the signature table index, wherein the signature table index is the index to an address of signature table; performing a fast pattern match, wherein the signature table contains signature fields, and if any second signature field in the signature table is mat

Abstract: The present invention provides a method for packet processing according to a lookup table, comprising: receiving a packet, wherein the packet includes a packet header, and the packet header consists of control information; providing a lookup table with M entries, wherein each entry includes N conditions and a result/action indicator, and the M entries are sorted in a priority order; matching the information with the N conditions; and applying the result/action indicator in the matched entry with the highest priority on the packet.

Abstract: The present invention provides a method and system for binary search. The method comprises providing a memory device with M entries, each entry storing a value; providing an index register including N register blocks, wherein the N register blocks partition the memory device into N?1, N or N+1 search areas; wherein M and N are integers and N<M; wherein when a target value is being searched in the memory device, the target value is determined to be fall between two adjacent register blocks, and only the addresses of the memory device in between the two register blocks are left for search.

Abstract: The present invention provides a method for packet processing according to a lookup table, comprising: receiving a packet, wherein the packet includes a packet header, and the packet header consists of control information; providing a lookup table with M entries, wherein each entry includes N conditions and a result/action indicator, and the M entries are sorted in a priority order; matching the information with the N conditions; and applying the result/action indicator in the matched entry with the highest priority on the packet.

Abstract: The present invention provides a method and system for binary search. The method comprises providing a memory device with M entries, each entry storing a value; providing an index register including N register blocks, wherein the N register blocks partition the memory device into N?1, N or N+1 search areas; wherein M and N are integers and N<M; wherein when a target value is being searched in the memory device, the target value is determined to be fall between two adjacent register blocks, and only the addresses of the memory device in between the two register blocks are left for search.

Abstract: The present invention provides a method for packet processing according to a access control list table, comprising: receiving a packet, wherein the packet includes a packet information and match items for matching; providing an access control list (ACL) codeword table; providing a mask table, wherein the ACL codeword table corresponds to the mask table; obtaining a hash key by performing a multiplexing logic operation, wherein the hash key is made by combining a multiplex result of the packet information and the mask table; obtaining a hash value by performing a hash function based on the hash key, wherein the hash value is composed of X+Y, wherein X is a signature table (hash table) index and Y is a key digest; performing a hash table indexing, based on the signature table index, wherein the signature table index is the index to an address of signature table; performing a fast pattern match, wherein the signature table contains signature fields, and if any second signature field in the signature table is mat

Abstract: A per-flow rate controller is disclosed. The controller includes a queue classifying unit, a queue memory unit and a queue selecting unit. The queue classifying unit receives a plurality of per-flows and then classifies them by the source port address of each per-flow group. The queue memory unit includes a plurality of queues. The queue memory unit stores the packets into corresponding queues according to the classifying result of the queue classifying unit. Finally, the queue selecting unit selects the queue for frame transmission and controls the output throughput rate of each queue according to user settings.