Abstract: A method and apparatus for efficiently performing a longest match search are provided. According to one aspect of the present invention, an entry in a forwarding database, a routing table, or the like is located using an improved longest match search. A mask is applied to an address, such as a destination Internet Protocol (IP) address, to determine a masked address that is to be used for purposes of locating a matching entry in the forwarding database. The forwarding database is searched for an entry that matches the masked address. Subsequent masks are produced by performing an address-sensitive decimation of the former mask. For example, the former mask may be shortened based upon the location of the least significant bit containing a one in the masked address. According to another aspect of the present invention, data forwarding employs the improved longest match search. Data is received at a port. An address is extracted from the data.

Abstract: A method for transporting and aligning data across a set of serial data streams. The method includes creating a predetermined number of data streams from a first data stream. The first data stream has a first predetermined bit width and each data stream of the predetermined number of data streams has a second predetermined bit width smaller than the first predetermined bit width. In addition, the method includes inserting an alignment pattern in each of the predetermined number of smaller data streams. The predetermined number of smaller data streams are combinable into a data stream having the first predetermined bit width based on the alignment pattern. The method also includes preparing the predetermined number of smaller data streams for transmission. An apparatus for performing the method is also disclosed.

Abstract: A method and apparatus for efficiently performing a longest match search are provided. According to one aspect of the present invention, an entry in a forwarding database, a routing table, or the like is located using an improved longest match search. A mask is applied to an address, such as a destination Internet Protocol (IP) address, to determine a masked address that is to be used for purposes of locating a matching entry in the forwarding database. The forwarding database is searched for an entry that matches the masked address. Subsequent masks are produced by performing an-address-sensitive decimation of the former mask. For example, the former mask may be shortened based upon the location of the least significant bit containing a one in the masked address. According to another aspect of the present invention, data forwarding employs the improved longest match search. Data is received at a port. An address is extracted from the data.

Abstract: A method and apparatus for efficiently searching a forwarding database or similar data structure are provided. According to one aspect of the present invention, the overall average time required to forward a packet from the ingress port of a network device to one or more egress ports may be reduced by attacking the worst case forwarding database search. Data is received at a first port of the network device and a search key is extracted from the data. Typically the search key includes one or more of a source or destination Internet Protocol (IP) address, a souce or destination Media Access Control (MAC) address, and/or a Virtual Local Area Network (VLAN) tag. Ultimately, the data is forwarded to a second port of the network device based upon a matching entry located by the search. The search includes retrieving keys from entries of the forwarding database and comparing the search key to the keys until a matching entry is located.

Abstract: A method and apparatus for efficiently performing a longest match search are provided. According to one aspect of the present invention, an entry in a forwarding database, a routing table, or the like is located using an improved longest match search. A mask is applied to an address, such as a destination Internet Protocol (IP) address, to determine a masked address that is to be used for purposes of locating a matching entry in the forwarding database. The forwarding database is searched for an entry that matches the masked address. Subsequent masks are produced by performing an address-sensitive decimation of the former mask. For example, the former mask may be shortened based upon the location of the least significant bit containing a one in the masked address. According to another aspect of the present invention, data forwarding employs the improved longest match search. Data is received at a port. An address is extracted from the data.