US 7,657,703 B1Grant

Double density content addressable memory (CAM) lookup scheme

Issue Date:2010-02-02

•21 Claims

•4 Drawing Sheets

Abstract

The number of content addressable memory (CAM) lookups is reduced from two to one. Each side (left and right sides) of a CAM is programmed with network addresses, such as IP addresses, based on certain bits of the network addresses. These bits of the network addresses (which represent packet routes) are examined and used to determine whether the particular network address is to be placed on the left or right sides of the CAM. The grouping of certain network addresses either on the left or right sides of the CAM can be performed by examining an individual bit of each network address, by performing an exclusive OR (XOR) operation on a plurality of bits of each network address, and/or by searching for bit patterns of the network address in a decision table. Network addresses that cannot be readily assigned to a particular side of the CAM using these grouping techniques are programmed into both sides of the CAM. During packet routing, techniques similar to the grouping techniques that populated the CAM are used to determine which of the two sides of the CAM is to be searched.

Metadata

Assignee

Foundry Networks, Inc.

Inventor

Ram Dular Singh

Application Information

Application Number:US 11/118,697

Filing Date:2005-04-28

Priority Date:2004-10-29

Art Unit:2824

Classifications

IPC:

G06F12/00

Patent Drawings (4 sheets)

Description

Cross Reference to Related Application

[0001] The present application claims the benefit under 35 U.S.C. § 119(e) of U.S. Provisional Patent Application Ser. No. 60/623,435, entitled “DOUBLE DENSITY CAM LOOKUP SCHEME WITHOUT ACTUAL HARDWARE CAPABILITY,” filed Oct. 29, 2004, assigned to the same assignee as the present application, and which is incorporated herein by reference in its entirety.

Technical Field

[0002] This disclosure relates generally to a content addressable memory (CAM), and to communication networks. More particularly, but not exclusively, the present disclosure relates to techniques to use an address portion of a packet to program and read a CAM residing in a networking device of a communication network.

Background Information

[0003] In a communication network, data is typically encapsulated and transported within the communication network in units, which in certain contexts may be called frames, packets, Internet Protocol (IP) packets, cells, or the like. Herein, such units will broadly be called “packets” for ease of nomenclature, unless for the sake of example, a particular such unit is appropriate. Each such packet includes a header with a source address and a destination address, and a payload. The destination address may, for example, indicate a network address of a next intermediate “hop” for the packet and/or a network address of the ultimate destination for the packet.

[0004] Content addressable memories (CAMs) are used for a variety of functions in many different processing environments. CAMs are typically in the form of hardware that receives a piece of data and that returns a memory address storing information pertaining to that data. One use of CAMs is in the field of packet routing over a communication network.

[0005] For instance, CAMs may be used in the following manner by network devices to forward data packets. A typical network device has multiple ports that are connected to one or more other processing systems. The ports each receive packets from and send packets to the processing system(s) connected to the port. A switching fabric in the network device connects the ports of the network device to one another to allow the network device to pass a packet received on a first port to a second port of the network device, which then transmits the packet to the processing system(s) connected to the second port. In order to forward the packet, each port has a CAM that stores the prefixes of IP addresses and/or stores data that indexes or otherwise points to locations of a memory connected to the port. In the latter case, the CAM is used to return an address in the memory that stores next hop information for the IP address. When that next hop address ultimately is obtained, the packet is routed to that hop address via the associated port of the network device.

[0006] Typically, hardware within the network device (e.g., logic circuits, FPGAs, ASICS, etc.) is required to do two CAM lookups for every packet to find the route to forward the packet. If, for instance, a CAM with a length of 64 bits or greater is used, the hardware first masks the right 32 bits and finds the best path in the left side of the CAM. Next, the hardware masks the left 32 bits of the CAM and finds the best path in the right side of the CAM. Based on an assigned preference or some other criteria, the hardware will select the best path (e.g., identify a memory location that stores the network address of the next destination for the packet) between the two best paths identified in the searches of the left and right sides of the CAM. For the processes thus described, the hardware has to either be capable of doing parallel lookups on the left and right sides of the CAM or has to be able to do two lookups, while still meeting the timing requirements for forwarding the packet.

[0007] The need to perform two CAM lookups adds to the complexity and cost of the required hardware of the network device. Moreover, performing two CAM lookups can also adversely affect timing. The required hardware can be simplified if data is only stored in one side of the CAM, such as if the data occupies only the left (or the right) 32-bits in each 64-bit CAM entry, thereby allowing use of only one mask. However, such a scheme results in waste (non-use) of 50% of the available storage space in the CAM.

Summary

[0008] An embodiment of the present invention includes a method that associates a network address to either first or second sections of a memory (e.g., a CAM). The association to the first or to the second sections of the memory is based on a value of at least one bit of the network address.

[0009] For instance, a packet is received. A network address associated with the packet is examined, including determining a value related to at least one bit of the network address. The determined value of the bit of the network address is used to select either the first or the second sections of the memory to program or to search, depending on the context. In a program operation context, the selected section of the memory is then programmed with the network address. In a search operation context, the selected section of the memory is searched for an associated network address that matches the network address of the packet. The associated next hop information for the network address may be retrieved from the memory, and used in a further operation, such as a packet forwarding operation or a further lookup operation.

Brief Description of the Several Views of the Drawings

[0010] Non-limiting and non-exhaustive embodiments are described with reference to the following figures, wherein like reference numerals refer to like parts throughout the various views unless otherwise specified.

[0011] FIG. 1 is a block diagram of a communication network in which an embodiment can operate.

[0012] FIG. 2 is a block diagram of an example network device from the embodiment of FIG. 1 that can implement an embodiment to route packets based on a CAM lookup.

[0013] FIG. 3 is a flowchart that depicts CAM programming and routing using a CAM lookup according to various embodiments.

Detailed Description

[0014] Embodiments of techniques to perform CAM lookups for use in connection with packet routing are described herein. In the following description, numerous specific details are given to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention can be practiced without one or more of the specific details, or with other methods, components, materials, etc. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the invention.

[0015] Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0016] As an introduction, an embodiment reduces the number of CAM lookups from two, as in the background example provided above, to one. To allow this, an embodiment initially populates each side (left and right sides) of a CAM based on a portion of a network address. More specifically according to various embodiments, certain bits of a network address of a packet are examined and used to determine whether the particular network address is to be placed on the left or right sides of the CAM. The determination of whether to program a network address either on the left or right sides of the CAM can be performed according various grouping techniques, including, without limitation, by examining an individual bit of the network address, by performing an exclusive OR (XOR) operation on a plurality of bits of the network address, or by searching for bit patterns of the network address in a decision table. Network addresses that cannot be readily assigned to a particular side of the CAM using these grouping techniques may be programmed into both sides of the CAM.

[0017] During a packet routing operation, a destination network address of a packet received by a network device is examined. More particularly, one or more bits of the destination network address of the received packet are examined to determine whether the left or right side of the CAM is to be searched. This determination uses the same criteria as the grouping technique that was used to program the CAM. When the side of the CAM to be searched is identified and selected, that side is searched to locate a network address that matches the destination network address specified in the received packet. The memory location of the matching network address in the CAM may be mapped or otherwise associated to another memory location that contains the network address of the next hop for the packet. That particular memory location is then accessed to obtain the address so that the packet may be routed thereto by the network device.

[0018] FIG. 1 is a block diagram of a communication network 100 in which an embodiment can operate to route packets based on a CAM lookup. For purposes of simplicity of explanation, not all of the various devices that may be present in the communication network 100 (such as DNS servers, hubs, switches, routers, and so on) are shown or described.

[0019] The communication network 100 includes a plurality of users 102, which can include any sort of suitable user-side client devices. The users 102 are communicatively coupled to a communication network 104, which can comprise the Internet, an intranet, local area network (LAN), virtual private network (VPN), or other network or portion or combination thereof. For purposes of explanation, the communication network 104 will be described in the context of the Internet herein.

[0020] Via the communication network 104, the users 102 can communicate with different networks 106. These individual networks 106 can comprise web sites, VPNs, LANs, server clusters, or other types of network arrangements. In an embodiment, each of the networks 106 can be associated with a network address.

[0021] Each network 106 comprises one or more routers 112. One or more switches 114 are coupled to the router 112. In an embodiment, a plurality of servers 120 and 122 are coupled to any one of the switches 114. In an embodiment, the routers 112, switches 114, servers 120 and 122, or any other network device also can be associated with a respective network address.

[0022] For ease of explanation and without intending to be limiting, examples herein of such network addresses will be described in the context of IP addresses, such as IPv6 addresses, Layer 3 addresses, etc. as some illustrative examples. It is appreciated that other types of network addresses, such as for example network addresses that have a parent-child or other hierarchical relationship, may operate in conjunction with other embodiments. A non-limiting example of a network address model with which an embodiment may operate is the Classless Inter-Domain Routing (CIDR) model, which is sometimes referred to as “super-netting.”

[0023] The CIDR is an IP addressing scheme that replaces an older system that used 32-bit addresses that were in three classes: A, B, and C. Each address in this older system had two parts: one part to identify a unique network and the second part to identify a unique host in that network. Another way the old Class A, B, and C addresses were identified was by looking at the first 8 bits of the address and converting it to its decimal equivalent, as set forth in the table below.

[0024]


Address Class	# Network Bits	# Hosts Bits	Decimal Address Range

Class A	8 bits	24 bits	1-126
Class B	16 bits	16 bits	128-191
Class C	24 bits	8 bits	192-223

[0025] Because Internet addresses were generally only assigned in these three sizes, there were a lot of wasted addresses. The overall result was that, while the Internet was running out of unassigned addresses during its rapid growth in the 1980s and 1990s, only a small percentage of the assigned addresses were actually being used. CIDR was developed to be a much more efficient method of assigning addresses.

[0026] A CIDR address includes the standard 32-bit IP address and also information on how many bits are used for a network prefix. For example, in the CIDR address 206.13.01.48/25, the “/25” indicates the first 25 bits are used to identify the unique network leaving the remaining bits to identify the specific host. The table below shows the association between the prefix number and the number of hosts.

[0027]


CIDR Block Prefix	# of Host Addresses


/27	32	hosts
/26	64	hosts
/25	128	hosts
/24	256	hosts
/23	512	hosts
/22	1,024	hosts
/21	2,048	hosts
/20	4,096	hosts
/19	8,192	hosts
/18	16,384	hosts
/17	32,768	hosts
/16	65,536	hosts
/15	131,072	hosts
/14	262,144	hosts
/13	524,288	hosts
/12	1,048,576

[0028] The CIDR addressing scheme also enables “route aggregation” in which a single high-level route entry can represent many lower-level routes in the global routing tables. Currently, big blocks of addresses are assigned to the large Internet Service Providers (ISPs) who then re-allocate portions of their address blocks to their customers. For example, a large ISP may be assigned a CIDR address block with a prefix of /15 (equivalent to 512 Class C addresses or 131,072 host addresses) and, in turn, may assigns its customers CIDR addresses with prefixes ranging from /27 to /19. These customers, who may be smaller ISPs themselves, in turn re-allocate portions of their address block to their users and/or customers. However, in the global routing tables all these different networks and hosts can be represented by a single Internet route entry. In this way, the growth in the number of routing table entries at each level in the network hierarchy has been significantly reduced. Currently, the global routing tables have approximately 135,000-150,000 entries.

[0029] Using the super-netting of the CIDR model, the IP address 192.168.2.0/24 and an adjacent IP address 192.168.3.0/24, for example, can be merged into 192.168.2.0/23. The “23” at the end of the address indicates that the first 23 bits are the network part of the address, leaving the remaining nine bits for specific host addresses. The network and hosts form a parent-child relationship in the CIDR model.

[0030] In an embodiment, the parent-child relationships associated with super-netting are preserved or otherwise maintained when programming sides of the CAM with IP addresses.

[0031] In one example embodiment, the CAM programming and lookup schemes are implemented in hardware (e.g., FPGA or ASIC) of the router 112 (or some other suitable Layer 3 network device). It is appreciated, however, that the CAM programming and lookup schemes of other embodiments may be implemented in other types of network devices (e.g., where it is desirable to minimize the number of memory lookups).

[0032] FIG. 2 is a block diagram of an example network device (such as the router 112) from the communication network 100 of FIG. 1 that can implement an embodiment to route packets based on a CAM lookup. In FIG. 2, for the sake of brevity and clarity, only certain components of the router 112 that are useful in understanding operation of an embodiment are shown and described.

[0033] The router 112 receives an incoming packet 201 (such as an IP packet) at an input port or other communication interface 200. Part of the communication interface 200 can comprise a Media Access Control (MAC) interface. The received packet 201 is placed in a buffer 202.

[0034] Once received from the communication interface 200, a packet lookup handler 204 analyzes the packet 201. The lookup handler 204 can comprise hardware, software, or a combination of both. The lookup handler 204 of an embodiment extracts relevant information from the packet 201 (e.g., the packet's IP destination address) as will be described in greater detail below), and initiates at least one CAM lookup based on the extracted bit(s).

[0035] The lookup handler 204 may also start a destination MAC address lookup, source MAC address lookup, ACL lookup, or other lookup. With regards to a CAM lookup, a CAM lookup buffer 206 stores data that will be a basis for the CAM lookup. Examples of such data is a binary value (1 or 0) of a particular bit of the IP destination address, an XOR value of bits of the IP destination address, or other information indicative of which side of a CAM 210 to search (i.e., CAM side selection). A CAM interface 208 applies the appropriate cam side mask for the IP destination address and performs the searching of the selected one of the sides of the CAM 210 to find a CAM index or row that contains information that identifies or is associated with the IP address of the packet 201 (i.e., CAM data lookup).

[0036] The CAM 210 of one embodiment has a section or portion where network masks for additional network addresses are stored. A network mask is applied to a destination IP address and then compared with the contents of the CAM 210. This section of the CAM 210 is called a “shadow section,” where for every CAM entry, a corresponding network mask is stored. Other forms of mask storage may be used in other embodiments.

[0037] The matching result obtained from the searching of the CAM 210 is placed by the CAM interface 208 into a CAM result buffer 212. After the results of the CAM lookup are available in the CAM result buffer 212, a memory interface 214 obtains the next hop information (or other information associated with a subsequent IP address to route the packet 201) from a location in a memory 216 that corresponds to the CAM lookup results. In an embodiment, the memory 216 comprises a partitioned random access memory (e.g., PRAM), though it is appreciated that other types of memories may be used. In one embodiment, there is a one-to-one mapping between CAM and PRAM indexes. One or more CAMs 210 and memories (PRAMs) 216 can be provided for each router 112.

[0038] The memory interface 214 places the information obtained from memory 216 into a memory results buffer 218. The contents of the memory results buffer 218 are provided to a packet forwarding component 220, which controls forwarding of the packet 201 from the received packet buffer 202 to an appropriate output port 222, according to the information obtained from the memory 216.

[0039] In an embodiment, the router 112 can include one or more processors 224 to control operation of the various components of the router 112. For example, the processor 224 may control the address extraction performed by the lookup handler 204, the CAM lookups performed by the CAM interface 208, and so forth. One or more machine-readable storage media 226 can be accessible to the processor 224. The storage medium 226 can store software or other machine-readable instructions 228 that can be executed by the processor 224. For instance, the machine-readable instructions 228 of an embodiment can include instructions to maintain and operate a software version of a decision table, which will be described in further detail below. The instructions 228 can also include instructions to perform various calculations and operations to determine the proper side of the CAM 210 to search, alternatively or additionally to embodiments that perform such operations using hardware.

[0040] FIG. 3 is a flowchart 300 that builds upon the block diagram of FIG. 2, and which depicts CAM programming and packet routing using a CAM lookup according to various embodiments. It is appreciated that the various elements of the flowchart 300 need not necessarily occur in the exact order shown. Moreover, it is possible to add, remove, combine, or modify some of the depicted elements. In one embodiment, some of the elements in the flowchart 300 may be implemented in software or other machine-readable instructions stored on a machine-readable medium and executable by a processor (e.g., the machine-readable instructions 228 stored in the storage medium 226 and executable by the processor 224 of FIG. 2).

[0041] At a block 302, left and right sides of the CAM 210 of FIG. 2 are selectively programmed with IP addresses. In other embodiments, the CAM 210 or other memory may have its memory locations apportioned differently than “left” or “right” “sides”, and therefore, the block 302 and the various CAM programming and searching embodiments described herein can be suitably adapted for these other memory location configurations. For example, rather than having memory locations arranged side by side (e.g., memory locations that are 32-bits wide, with two memory locations per row to thereby provide the CAM 210 with a 64-bit length), one embodiment of the CAM 210 can have its memory locations arranged as a single 32-bit column. In such an embodiment, it can be in the upper or the lower portions of the CAM where the selective programming or searching is performed. Moreover, it is appreciated that the CAM 210 can be sized such that it is not necessarily restricted to just 64-bits, with 32-bit left and right side portions. The CAM 210, for instance in another embodiment, can have any number of 32-bit wide columns. Accordingly, the programming depicted in the block 302 can be performed on a CAM or other memory having any suitable size and configuration. As will be described in further detail below, the addresses to program into the left and right sides, for example, of the CAM 210 can be based on a particular bit value of a destination network address, an XOR value of a plurality of bits of the destination network address, or bit patterns of the destination network address that can be correlated to a decision table, among other possibilities.

[0042] At a block 304, a packet 201 is received, such as at the communication interface 200 of FIG. 2. At a block 306, the lookup handler 204 extracts the destination address from the received packet 201.

[0043] At a block 308, the lookup handler 204 (or other suitable component of the router 112) determines on which side of the CAM 210 to perform the lookup. According to various embodiments, the same techniques used to program the CAM 210 with destination network addresses can be used to determine which side of the CAM 210 to lookup. For example, an embodiment can examine the 28^thbit of the received packet 201's destination address to determine whether that bit is a 1 or a 0. If that bit is a 1, for instance, then the lookup is performed on the right side of the CAM 210. If that bit is a 0, for instance, then the lookup is performed on the left side of the CAM 210. Further details of this type of lookup (in the context of programming the CAM 210) will be provided later below.

[0044] Blocks 310 and 312 respectively depict lookups on the left or right sides of the CAM 210 based on the determination made in the block 308. For instance, if the determination at the block 308 yields a left-side lookup, then the left-most 32 bits of the CAM 210 are searched to locate a particular CAM index (which in one embodiment corresponds to a CAM row) that contains a network address that matches the received packet's network address in some manner, such as an exact match or a match of a child address to a parent address in a super-netting relationship. Meanwhile, the right-most 32-bits of the CAM 210 are masked.

[0045] At a block 314, the CAM index is obtained. In one embodiment, the CAM index is the row number of the location in the CAM 210 where the match or best fit to the term being searched (e.g., the packet destination address, which was located during the search in block 310 or 312). At a block 316, the obtained CAM index is used to obtain a memory index (e.g., a PRAM index) of the memory 216. In one example embodiment, there is a one-to-one mapping of CAM indices to PRAM indices.

[0046] In a situation where the CAM 210 includes a 64-bit column having an upper 32 bits, which may be termed the “left side” of the CAM 210 to be consistent with the discussion above, and a lower 32 bits, which may be considered the “right side” of the CAM 210 to be consistent with the discussion above, the searching of the CAM 210 will return the same CAM index (same CAM row) whether the “hit” or “match” from the lookups at the blocks 310 and 312 belongs to upper or lower 32-bit entry, an embodiment uses the following example technique in the block 316 to determine which PRAM index corresponds to the particular CAM index:

[0047] For hits on the left side of the CAM 210:

[0048] CAM Hit for upper 32 bit: PRAM Index=(CAM_INDEX)*2

[0049] For hits on the right side of the CAM 210:

[0050] CAM Hit for lower 32 bits: PRAM Index=(CAM_INDEX)*2+1

[0051] Such a technique to locate the appropriate PRAM index can be performed using a field programmable gate array (FPGA), which may comprise part of the memory interface 214 of FIG. 2. Other techniques may be used in other embodiments to map specific CAM entries to specific entries in the memory 216.

[0052] At a block 318, the specific PRAM index in the memory 216 is accessed to obtain the forwarding information for the received packet (i.e., the forwarding information is resident in the memory 216 at the location corresponding to the index). The forwarding information can include, for example, a next hop IP address to forward the packet.

[0053] To further illustrate operation of one or more embodiments in the context of programming and searching the CAM 210, such as in the blocks 302 and 316 of FIG. 3, various examples are provided next in the context of Internet Protocol version 4 (IPv4) addresses, which are 32 bits in length. The CAM 210 used in connection with these IPv4 addresses comprises 64 bit-wide columns with a suitable number of rows. To be able to efficiently use the entire available storage of the CAM 210, two 32-bit IPv4 entries are programmed into each row of the CAM 210 (e.g., one entry is programmed into the upper 32 bits (which may be considered a “left side” of the CAM using the above terminology) and another entry is programmed into the lower 32 bits of the CAM 210. It is appreciated that the use of a 64-bit CAM with upper and lower 32-bit portions is a non-limiting example, and that other types and sizes of CAMs can be used with other embodiments.

[0054] When a packet is received and its or IP destination address is examined, selection of the particular side of the CAM 210 to be searched (i.e., mask selection) is based on a decision table as programmed by hardware and/or software or based on a special mode such as (28^thbit or XOR), all of which will be explained below in further detail. The mask determines which side of the CAM 210 is being searched and is not being searched for this IP address. Based on this mask and extracted IP destination address from the packet, a single lookup (as opposed to two lookups in existing systems) is performed.

[0055] According to various example embodiments, mask selection (i.e., whether to search the left or right side of the CAM 210) could be based on a decision table or some special mode, such as: (1) examining the 28^thbit of the IP destination address (yields a binary 1 or 0); (2) determining an Exclusive OR (XOR) result of the 26^thand 27^thbits of the IP destination address (yields a binary 1 or 0); or (3) using a plurality of the most significant bits (MSB) of the IP destination address as an index into a decision table containing binary data (yields a binary 1 or 0); for example, the software can specify to use bits 26, 27, and 28 of the IP address.

[0056] Examples of CAM Programming:

[0057] The following discussion provides various three specific examples of the manner in which the CAM 210 can be programmed or otherwise have CAM memory locations associated with IP addresses. As a baseline illustration, assume that, in each of the following three examples, five IP destination addresses are to be programmed into the CAM 210. The five IP destination addresses are:

[0058] 10.0.0.0/8 (10 in binary is: 00001010)

[0059] 10.10.0.0/16 (10 in binary is: 00001010)

[0060] 20.10.0.0/16 (20 in binary is: 00010100)

[0061] 16.0.0.0/8 (16 in binary is: 00010000)

[0062] 28.10.10.0/24 (28 in binary is: 00011100)

[0063] Using the 0-based indexing scheme, the first least significant bit (LSB) is indexed as bit 0 and the last MSB is indexed as bit 31^st. Therefore, in the example address above for 28 in binary, the 31^stthrough the 24^thbits are, respectively, 00011100.

[0064] 1. Using the 28^thBit of the IP Destination Addresses to Decide which Side of the Cam to Program IP Addresses:

[0065] In a first embodiment of a CAM programming scheme, a particular bit, e.g., the 28^thbit, of an IP destination address of a packet 201 is examined to determine which of a plurality of sections of the CAM 210 should be programmed with that IP destination address. For example, using the left and right side partitioning terminology that is discussed above, such a programming scheme can determine whether to program the IP destination address in the left side bits or right side bits of the CAM 210. Using this technique, addresses to program into left side of the CAM 210 (since the 28^thbit is 0) include:

[0066] 10.0.0.0/8

[0067] 10.10.0.0/16

[0068] That is, in this particular embodiment, the 28^thbit of the IP destination address is examined to determine whether that bit is a 1 or a 0. A 0 is associated with the left side of the CAM 210, while a 1 is associated with the right side of the CAM 210. According to the information laid out above, both of these IP destination address have a 0 at the 28^thbit, and therefore, these addresses are both programmed into the left side of the CAM 210.

[0069] It is noted that the first 8 bits (the 31^stthrough the 24^thbits) for these two IP destination addresses in the “10” network are the same (i.e., 00001010). It is also noted that the address 10.0.0.0/8 is a super-net route of 10.10.10.0/16. Since these addresses are programmed on the same side of the CAM 210, an embodiment is able to preserve a parent-child relationship between these IP destination addresses by programming at different CAM levels (rows) with different priority in the left side. In an embodiment, a particular priority is assigned to a matching IP destination address with the larger prefix (e.g., 10.10.0.0/16), as opposed to another matching IP destination address with a smaller prefix (e.g., 10.0.0.0/8) in the parent child relationship.

[0070] For example in the super-netting scheme of the Classless Inter-Domain Routing (CIDR) model, the address 10.10.0.0/16 belongs to (is a child of) the parent address 10.0.0.0/8. Therefore, if a packet with a destination address 10.20.1.1 is received, this particular address can be matched to and is included in the range of addresses corresponding to the CAM entry 10.0.0.0/8. In comparison, if a packet with a destination address of 10.10.2.1 is received, this particular address is included in the range of addresses of both CAM entries 10.0.0.0/8 and 10.10.0.0/16. An embodiment matches this particular destination address with the CAM entry having the larger prefix (10.10.0.0/16) so as to obtain a closer address match.

[0071] Continuing with this example of examining the 28^thbit, the IP destination addresses to be programmed into right side of the CAM 210 (since the 28^thbit is 1) include:

[0072] 20.10.0.0/16

[0073] 16.0.0.0/8

[0074] 28.10.10.0/24

[0075] In the above-described embodiments, the fourth MSB (the 28^thbit) was examined to determine whether the particular IP destination address is to be programmed into the left or right side of the CAM 210. The 28^thbit was selected since selection of this bit will divide addresses in each class into equal halves, and so addresses from each half can be equally distributed on both sides of the CAM 210. Theoretically, therefore, selection of the 28^thbit as the criteria should provide a good distribution of routes on each side of the CAM 210 for at least the following classes:

[0076]


	Class A: 0	(at 31^stbit)
	Class B: 10	(at 31^stand 30^thbits)
	Class C: 110	(at 31^stthrough 29^thbits)
	Class D: 111	(at 31^stthrough 29^thbits)

[0077] In an embodiment, certain IP destination addresses that have bit(s) that do not fit the characteristics used in the 28^thbit selection criteria are programmed on both sides of the CAM 210. Programming on both sides of the CAM 210 provides a measure of insurance that a match will be found in the CAM 210 if or when a packet 201 is received having one of these non-characteristic addresses. For example for the above-described embodiments that examine the 28^thbit, all the routes that have a prefix length ≦3 (i.e., addresses that fall within the address range specified by only the 31^stthrough 29^thbits) can be programmed on both sides of the CAM 210, such that children with fourth MSB=1 (i.e., the 28^thbit=1) are on the right side and children with fourth MSB=0 (i.e., the 28^thbit=0) are on the left side of the CAM 210. This arrangement preserves the super-net route's child and parent relationship in the CAM 210.

[0078] In practice, the number of such routes with prefix length ≦3 is limited to about six addresses, and hence only six entries need to be programmed in both the left and right sides of the CAM 210. Hence, the CAM 210 is not unduly overloaded with duplicative entries. In most network situations, there are usually routes having prefix lengths of 8 and higher.

[0079] 2. Using an Exclusive or (XOR) Result of the 26^thand 27^thBits to Decide which Side of the Cam to Program IP Addresses:

[0080] Based on a statistical analysis of Internet routes, the XOR result of the 26^thand 27^thbits of the IP destination addresses divides the routes into equal halves for the CAM 210. Thus, an embodiment of this CAM programming performs an XOR operation to populate the CAM 210 with address entries and to double the number of CAM entries.

[0081] Referring back to the five example IP destination addresses listed above, performing an XOR operation on the 26^thand 27^thbits yields the following results.

[0082] Addresses to program into left side of CAM 210 (since XOR result bit is 0):

[0083] 16.0.0.0/8

[0084] 28.10.10.0/24

[0085] Addresses to program into right side of CAM 210 (since XOR result bit is 1):

[0086] 10.0.0.0/8

[0087] 10.10.0.0/16

[0088] 20.10.0.0/16

[0089] It is noted that the groupings based on the XOR operation also preserve the parent-child relationship between the “10” network routes, as demonstrated above. In an embodiment, certain IP destination addresses that have bit(s) that do not fit the characteristics used in the XOR selection criteria are programmed on both sides of the CAM 210. Programming on both sides of the CAM 210 provides a measure of insurance that a match will be found in the CAM 210 if or when a packet 201 is received having one of these non-characteristic addresses. In an embodiment, both sides of the CAM 210 can be programmed similarly as described above for the 28^thbit selection criteria for the non-characteristic addresses.

[0090] 3. Using a Decision Table to Decide which on Side of the Cam to Program IP Addresses:

[0091] In this scheme, a decision table based on plurality of the MSB bits of an IP destination address is used to decide on which side of the CAM 210 the IP destination address is to be programmed. An exemplary decision table is provided below, which is based on the 28^th, 27^th, and 26^thbits of the IP destination address.

[0092]


28^th	27^th	26^th	Result

0	0	0	1
0	0	1	0
0	1	0	0
0	1	1	1
1	0	0	0
1	0	1	1
1	1	0	1
1	1	1	1

[0093] For example, assuming that under the decision table's column labeled “Result” above, the right side of the CAM=1 and the left side of the CAM=0, the five exemplary IP destination addressed provided above may be programmed as follows:

[0094] Addresses to program into left side of CAM 210 (since Result=1):

[0095] 10.0.0.0/8

[0096] 10.10.0.0/16

[0097] 16.0.0.0/8

[0098] Addresses to program into right side of CAM 210 (since Result=0):

[0099] 20.10.0.0/16

[0100] 28.0.0.0/8

[0101] The above groupings can be made by examining the 28^ththrough the 26^thbits of each IP destination addresses, and then trying to locate a decision table entry (row) that matches the bit pattern. The particular matching row specifies the side of the CAM 210 to program that address, under the column heading “Results.”

[0102] According to one embodiment, software (running on a processor) can program the route (e.g., the next hop IP address and/or the PRAM index that identifies a location in the memory 216 that stores the next hop IP address) in the CAM 210 based on the decision table. Whether to designate the “Results” of any particular bit pattern combination as a 1 or as a 0 can be based on a number of factors. Such factors include but are not limited to user preference, statistical distribution of addresses to ensure substantially equal population of both halves of the CAM 210, least or most commonly accessed addresses, specific network configurations (e.g., availability or unavailability of certain routes in particular networks), or other factors

[0103] Using selected MSB bit(s) of the IP destination address, as part of the decision table (e.g., the 28^ththrough the 26^thbits as in the above example) allows one to program IP routes into the CAM 210 without violating the super-netting relationship of routes. The MSB bits of one example embodiment is chosen such that routes (e.g., b) are statistically divided into two substantially equal groups, so that the left and right side memory locations of the CAM 210 can be efficiently utilized.

[0104] In case there are IP addresses having prefix lengths smaller than the least MSB (e.g., the 26^thbit in the example above) used in the decision process, then those IP addresses can be programmed on both sides of the CAM 210 to ensure that a match is found when a packet is received having that particular IP destination address. For example for the above-specified decision table, IP addresses with prefix lengths smaller or equal to 5 can be programmed on both sides of the CAM 210.

[0105] It is noted that the decision table can contain section numbers (0, 1, 2, 3, etc., for example) depending on the number of partitions that have been made in the decision table.

[0106] In a routing operation after the CAM 210 has been programmed, when a packet 201 is received, the 28^ththrough the 26^thbits of its IP destination address are examined (using hardware in an embodiment) and compared to entries in the decision table to find the appropriate CAM side. Based on the CAM side thus identified with the matching bit pattern, the hardware then performs a CAM lookup using an appropriate mask (e.g., the left or right side of the CAM 210) to identify a location in memory (e.g., the memory 216) that contains the address of the next hop. This process thus avoids having to perform a second lookup in the CAM 210, as with current techniques.

[0107] All of the above U.S. patents, U.S. patent application publications, U.S. patent applications, foreign patents, foreign patent applications and non-patent publications referred to in this specification and/or listed in the Application Data Sheet, are incorporated herein by reference, in their entirety.

[0108] The above description of illustrated embodiments, including what is described in the Abstract, is not intended to be exhaustive or to limit the invention to the precise forms disclosed. While specific embodiments and examples are described herein for illustrative purposes, various equivalent modifications are possible within the scope of the invention and can be made without deviating from the spirit and scope of the invention.

[0109] For example, various examples above have been described with reference to specific network addresses, message syntax, address formats, and so forth. It is appreciated that these are merely examples and that embodiments can be implemented with any type of suitable syntax or format. Moreover, embodiments can be provided for networks that do not necessarily use the addressing formats discussed herein. For example, there may be networks that use network addressing formats that are different than that of CIDR or IPv4. In such networks, embodiments can be provided that perform address programming into memory, as well as identifying network addresses in the routing path, based on the behavior or characteristics of one or more bits of an address associated with the received packet. Such an address need not necessarily be a destination address, and can, for instance, include a source network address alternatively or additionally to a destination network address. Furthermore in such embodiments, the 28^thbit and/or the particular MSB bits need not necessarily comprise the bits that are examined. The determination of which specific bit(s) to examine can be based on the type of behavior or characteristics of the network addresses that are implemented in the particular network, using non-limiting factors such as the bit(s) that can be used to distinguish between network addresses, substantially equal distribution of network addresses in a CAM, and so forth.

[0110] These and other modifications can be made to the invention in light of the above detailed description. The terms used in the following claims should not be construed to limit the invention to the specific embodiments disclosed in the specification and the claims. Rather, the scope of the invention is to be determined entirely by the following claims, which are to be construed in accordance with established doctrines of claim interpretation.

Claims

Certificate of Correction present

The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.

What is claimed is:

1. A method, comprising:

examining at least one bit of a network address associated with received data;

based on the at least one bit of the network address, determining which of first or second portions of a memory to search to obtain information; and

using the information obtained from the searched first or second portion of the memory to forward the received data.

2. The method of claim 1 wherein determining which of first or second portions of the memory to search includes determining which of first or second sides of a content addressable memory (CAM) to search.

3. The method of claim 1 wherein determining which of first or second portions of the memory to search based on the at least one bit includes determining which portion of the memory to search based on a value of a single bit of the network address associated with the received data.

4. The method of claim 1 wherein determining which of first or second portions of the memory to search based on the at least one bit includes performing an operation on a plurality of bits of the network address associated with the received data and determining which portion of the memory to search based on a result obtained from performing the operation.

5. The method of claim 4 wherein performing the operation includes performing an exclusive OR (XOR) operation on the plurality of bits.

6. The method of claim 1 wherein determining which of the first or second portions of the memory to search includes comparing a plurality of bits of the network address with data in a decision table, and determining a portion of the memory to search based on the comparison.

7. The method of claim 1, further comprising determining whether to program the information for the network address in the first portion or the second portion of the memory based on at least one bit of the network address.

8. The method of claim 7, further comprising programming both the first and second portions of the memory with same information.

9. The method of claim 1 wherein using the information obtained from the searched first or second portion of the memory comprises searching another memory using the obtained information.

10. The method of claim 1 wherein using the information obtained from the searched first or second portion of the memory comprises:

using the obtained information to locate a memory location in another memory; and

using the information stored in the memory location in the another memory to forward the received data.

11. The method of claim 5 wherein performing the XOR operation comprises performing the XOR operation on the 26^thand 27^thbits of the network address.

12. The method of claim 6 wherein comparing the plurality of bits comprises comparing the 28^th, 27^th, and 26^thbits of the network address with the data in the decision table.

13. A system comprising:

a first memory having first and second sections;

a communication interface configured to receive a packet having an associated network address;

a lookup handler coupled to the communication interface, the lookup handler configured to

examine at least one bit of the network address associated with the packet, and

select, based upon the at least one bit, one of the first or second sections of the first memory; and

a first memory interface configured to search the selected section of the first memory to obtain information for forwarding the packet.

14. The system of claim 13 wherein the first memory is a content addressable memory (CAM).

15. The system of claim 13 wherein the lookup handler is configured to:

perform an operation on a plurality of bits of the network address associated with the packet; and

select one of the first and second sections of the first memory based on a result obtained from performing the operation.

16. The system of claim 15 wherein the lookup handler is configured to perform an exclusive OR (XOR) operation on the plurality of bits.

17. The system of claim 16 wherein the lookup handler is configured to perform the XOR operation on the 26^thand 27^thbits of the network address.

18. The system of claim 13 wherein the lookup handler is configured to:

compare a plurality of bits of the network address with data in a decision table; and

select one of the first and second sections of the first memory based on the comparison.

19. The system of claim 18 wherein the lookup handler is configured to compare the 28^th, 27^th, and 26^thbits of the network address with the data in the decision table.

20. The system of claim 13 wherein the lookup handler is configured to determine whether to program the information for the network address in the first section or the second section of the first memory based on at least one bit of the network address.

21. The system of claim 13 further comprising:

a second memory; and

a second memory interface configured to use the information obtained from searching the first memory to locate a memory location in the second memory, the memory location in the second memory storing information used to forward the data packet.

Patent Citations (277)

Patent	Date	Inventor	Cited By
US4683564(A)	1987-07-01	Young et al.	Applicant
US4791629(A)	1988-12-01	Burns et al.	Applicant
US4794629(A)	1988-12-01	Pastyr et al.	Applicant
US4807280(A)	1989-02-01	Posner et al.	Applicant
US4876681(A)	1989-10-01	Hagiwara et al.	Applicant
US4985889(A)	1991-01-01	Frankish et al.	Applicant
US5101404(A)	1992-03-01	Kunimoto et al.	Applicant
US5136584(A)	1992-08-01	Hedlund	Applicant
US5195181(A)	1993-03-01	Bryant et al.	Applicant
US5224108(A)	1993-06-01	McDysan et al.	Applicant
US5282196(A)	1994-01-01	Clebowicz	Examiner
US5287477(A)	1994-02-01	Johnson et al.	Applicant
US5301192(A)	1994-04-01	Henrion	Applicant
US5307345(A)	1994-04-01	Lozowick et al.	Applicant
US5323386(A)	1994-06-01	Wiher et al.	Applicant
US5365512(A)	1994-11-01	Combs et al.	Applicant
US5390173(A)	1995-02-01	Spinney et al.	Applicant
US5392279(A)	1995-02-01	Taniguchi	Applicant
US5406643(A)	1995-04-01	Burke et al.	Applicant
US5408469(A)	1995-04-01	Opher et al.	Applicant
US5430442(A)	1995-07-01	Kaiser et al.	Applicant
US5436893(A)	1995-07-01	Barnett	Applicant
US5461615(A)	1995-10-01	Henrion	Applicant
US5490258(A)	1996-02-01	Fenner	Applicant
US5506840(A)	1996-04-01	Pauwels et al.	Applicant
US5521923(A)	1996-05-01	Willmann et al.	Applicant
US5546385(A)	1996-08-01	Caspi et al.	Applicant
US5550816(A)	1996-08-01	Hardwick et al.	Applicant
US5566170(A)	1996-10-01	Bakke et al.	Applicant
US5598410(A)	1997-01-01	Stone	Applicant
US5600795(A)	1997-02-01	Du	Applicant
US5619497(A)	1997-04-01	Gallagher et al.	Applicant
US5640504(A)	1997-06-01	Johnson et al.	Applicant
US5646878(A)	1997-07-01	Samra	Applicant
US5663952(A)	1997-09-01	Gentry, Jr.	Applicant
US5663959(A)	1997-09-01	Nakagawa et al.	Applicant
US5666353(A)	1997-09-01	Klausmeier et al.	Applicant
US5721819(A)	1998-02-01	Galles et al.	Applicant
US5732080(A)	1998-03-01	Ferguson et al.	Applicant
US5740176(A)	1998-04-01	Gupta et al.	Applicant
US5745708(A)	1998-04-01	Weppler et al.	Applicant
US5751710(A)	1998-05-01	Crowther et al.	Applicant
US5815146(A)	1998-09-01	Youden et al.	Applicant
US5835496(A)	1998-11-01	Yeung et al.	Applicant
US5838684(A)	1998-11-01	Wicki et al.	Applicant
US5862350(A)	1999-01-01	Coulson	Applicant
US5867675(A)	1999-02-01	Lomelino et al.	Applicant
US5870538(A)	1999-02-01	Manning et al.	Applicant
US5872769(A)	1999-02-01	Caldara et al.	Applicant
US5872783(A)	1999-02-01	Chin	Applicant
US5907566(A)	1999-05-01	Benson et al.	Applicant
US5907660(A)	1999-05-01	Inoue et al.	Applicant
US5909686(A)	1999-06-01	Muller et al.	Applicant
US5915094(A)	1999-06-01	Kouloheris et al.	Applicant
US5920566(A)	1999-07-01	Hendel et al.	Applicant
US5920886(A)	1999-07-01	Feldmeier	Applicant
US5936939(A)	1999-08-01	Des Jardins et al.	Applicant
US5936966(A)	1999-08-01	Ogawa et al.	Applicant
US5956347(A)	1999-09-01	Slater	Applicant
US5999528(A)	1999-12-01	Chow et al.	Applicant
US6000016(A)	1999-12-01	Curtis et al.	Applicant
US6016310(A)	2000-01-01	Muller et al.	Applicant
US6023471(A)	2000-02-01	Haddock et al.	Applicant
US6035414(A)	2000-03-01	Okazawa et al.	Applicant
US6038288(A)	2000-03-01	Thomas et al.	Applicant
US6076115(A)	2000-06-01	Sambamurthy et al.	Applicant
US6081522(A)	2000-06-01	Hendle et al.	Applicant
US6088356(A)	2000-07-01	Hendel et al.	Applicant
US6094434(A)	2000-07-01	Kotzur et al.	Applicant
US6104696(A)	2000-08-01	Kadambi et al.	Applicant
US6104700(A)	2000-08-01	Haddock et al.	Applicant
US6108306(A)	2000-08-01	Kalkunte et al.	Applicant
US6118787(A)	2000-09-01	Kalkunte et al.	Applicant
US6125417(A)	2000-09-01	Bailis et al.	Applicant
US6128666(A)	2000-10-01	Muller et al.	Applicant
US6144668(A)	2000-11-01	Bass et al.	Applicant
US6147996(A)	2000-11-01	Laor et al.	Applicant
US6151301(A)	2000-11-01	Holden	Applicant
US6154446(A)	2000-11-01	Kadambi et al.	Applicant
US6157643(A)	2000-12-01	Ma	Applicant
US6160809(A)	2000-12-01	Adiletta et al.	Applicant
US6172990(B1)	2001-01-01	Deb et al.	Applicant
US6178520(B1)	2001-01-01	DeKoning et al.	Applicant
US6222845(B1)	2001-04-01	Shue et al.	Applicant
US6243667(B1)	2001-06-01	Kerr et al.	Applicant
US6272144(B1)	2001-08-01	Berenbaum et al.	Applicant
US6320859(B1)	2001-11-01	Momirov	Applicant
US6333929(B1)	2001-12-01	Drottar et al.	Applicant
US6335932(B2)	2002-01-01	Kadambi et al.	Applicant
US6335935(B2)	2002-01-01	Kadambi et al.	Applicant
US6343072(B1)	2002-01-01	Bechtolsheim et al.	Applicant
US6351143(B1)	2002-02-01	Guccione et al.	Applicant
US6356550(B1)	2002-03-01	Williams	Applicant
US6356942(B1)	2002-03-01	Bengtsson et al.	Applicant
US6363077(B1)	2002-03-01	Wong et al.	Applicant
US6369855(B1)	2002-04-01	Chauvel et al.	Applicant
US6421352(B1)	2002-07-01	Manaka et al.	Applicant
US6424658(B1)	2002-07-01	Mathur	Applicant
US6424659(B2)	2002-07-01	Viswanadham et al.	Applicant
US6427185(B1)	2002-07-01	Ryals et al.	Applicant
US6460088(B1)	2002-10-01	Merchant	Applicant
US6463063(B1)	2002-10-01	Bianchini, Jr. et al.	Applicant
US6466608(B1)	2002-10-01	Hong et al.	Applicant
US6470436(B1)	2002-10-01	Croft et al.	Applicant
US6473433(B1)	2002-10-01	Bianchini, Jr. et al.	Applicant
US6477174(B1)	2002-11-01	Dooley et al.	Applicant
US6480477(B1)	2002-11-01	Treadway et al.	Applicant
US6490280(B1)	2002-12-01	Leung	Applicant
US6493347(B2)	2002-12-01	Sindhu et al.	Applicant
US6496502(B1)	2002-12-01	Fite et al.	Applicant
US6522656(B1)	2003-02-01	Gridley	Applicant
US6532234(B1)	2003-03-01	Yoshikawa	Applicant
US6549519(B1)	2003-04-01	Michels et al.	Applicant
US6553370(B1)	2003-04-01	Andreev et al.	Applicant
US6556208(B1)	2003-04-01	Congdon et al.	Applicant
US6567404(B1)	2003-05-01	Wilford	Applicant
US6606300(B1)	2003-08-01	Blanc et al.	Applicant
US6643269(B1)	2003-11-01	Fan et al.	Applicant
US6654342(B1)	2003-11-01	Dittia et al.	Applicant
US6654370(B1)	2003-11-01	Quirke et al.	Applicant
US6654373(B1)	2003-11-01	Maher, III et al.	Applicant
US6658002(B1)	2003-12-01	Ross et al.	Applicant
US6661791(B1)	2003-12-01	Brown	Applicant
US6671275(B1)	2003-12-01	Wong et al.	Applicant
US6678248(B1)	2004-01-01	Haddock et al.	Applicant
US6681332(B1)	2004-01-01	Byrne et al.	Applicant
US6687247(B1)	2004-02-01	Wilford et al.	Applicant
US6691202(B2)	2004-02-01	Vasquez et al.	Applicant
US6696917(B1)	2004-02-01	Heitner et al.	Applicant
US6697359(B1)	2004-02-01	George	Applicant
US6697368(B2)	2004-02-01	Chang et al.	Applicant
US6700894(B1)	2004-03-01	Shung	Applicant
US6721229(B1)	2004-04-01	Cole	Applicant
US6721268(B1)	2004-04-01	Ohira et al.	Applicant
US6721313(B1)	2004-04-01	Van Duyne	Applicant
US6735218(B2)	2004-05-01	Chang et al.	Applicant
US6745277(B1)	2004-06-01	Lee et al.	Applicant
US6751224(B1)	2004-06-01	Parruck et al.	Applicant
US6754881(B2)	2004-06-01	Kuhlmann et al.	Applicant
US6765866(B1)	2004-07-01	Wyatt	Applicant
US6775706(B1)	2004-08-01	Fukumoto et al.	Applicant
US6778546(B1)	2004-08-01	Epps et al.	Applicant
US6781990(B1)	2004-08-01	Puri et al.	Applicant
US6792484(B1)	2004-09-01	Hook	Applicant
US6792502(B1)	2004-09-01	Pandya et al.	Applicant
US6798740(B1)	2004-09-01	Senevirathne et al.	Applicant
US6804220(B2)	2004-10-01	Odenwalder et al.	Applicant
US6804731(B1)	2004-10-01	Chang et al.	Applicant
US6807179(B1)	2004-10-01	Kanuri et al.	Applicant
US6807363(B1)	2004-10-01	Abiko et al.	Applicant
US6810046(B2)	2004-10-01	Abbas et al.	Applicant
US6813243(B1)	2004-11-01	Epps et al.	Applicant
US6813266(B1)	2004-11-01	Chiang et al.	Applicant
US6816467(B1)	2004-11-01	Muller et al.	Applicant
US6831923(B1)	2004-12-01	Laor et al.	Applicant
US6831932(B1)	2004-12-01	Boyle et al.	Applicant
US6836808(B2)	2004-12-01	Bunce et al.	Applicant
US6839346(B1)	2005-01-01	Kametani	Applicant
US6842422(B1)	2005-01-01	Bianchini, Jr.	Applicant
US6854117(B1)	2005-02-01	Roberts	Applicant
US6859438(B2)	2005-02-01	Haddock et al.	Applicant
US6865153(B1)	2005-03-01	Hill et al.	Applicant
US6901072(B1)	2005-05-01	Wong	Applicant
US6912637(B1)	2005-06-01	Herbst	Applicant
US6920154(B1)	2005-07-01	Achler	Applicant
US6925516(B2)	2005-08-01	Struhsaker et al.	Applicant
US6934305(B1)	2005-08-01	Dushcatko et al.	Applicant
US6937606(B2)	2005-08-01	Basso et al.	Applicant
US6946948(B2)	2005-09-01	McCormack et al.	Applicant
US6957258(B2)	2005-10-01	Maher, III et al.	Applicant
US6959007(B1)	2005-10-01	Vogel et al.	Applicant
US7009968(B2)	2006-03-01	Ambe et al.	Applicant
US7012919(B1)	2006-03-01	So et al.	Applicant
US7050430(B2)	2006-05-01	Kalkunte et al.	Applicant
US7080238(B2)	2006-07-01	Van Hoof et al.	Applicant
US7082133(B1)	2006-07-01	Lor et al.	Applicant
US7103041(B1)	2006-09-01	Speiser et al.	Applicant
US7126956(B2)	2006-10-01	Scholten	Applicant
US7151797(B2)	2006-12-01	Limberg	Applicant
US7161948(B2)	2007-01-01	Sampath et al.	Applicant
US7167471(B2)	2007-01-01	Calvignac et al.	Applicant
US7185141(B1)	2007-02-01	James et al.	Applicant
US7185266(B2)	2007-02-01	Blightman et al.	Applicant
US7187687(B1)	2007-03-01	Davis et al.	Applicant
US7190696(B1)	2007-03-01	Manur et al.	Applicant
US7191277(B2)	2007-03-01	Broyles	Applicant
US7191468(B2)	2007-03-01	Hanner	Applicant
US7203194(B2)	2007-04-01	Chang et al.	Applicant
US7206283(B2)	2007-04-01	Chang et al.	Applicant
US7212536(B2)	2007-05-01	MacKiewich et al.	Applicant
US7218637(B1)	2007-05-01	Best et al.	Applicant
US7228509(B1)	2007-06-01	Dada et al.	Applicant
US7236490(B2)	2007-06-01	Chang et al.	Applicant
US7237058(B2)	2007-06-01	Srinivasan	Applicant
US7249306(B2)	2007-07-01	Chen	Applicant
US7266117(B1)	2007-09-01	Davis	Applicant
US7277425(B1)	2007-10-01	Sikdar	Applicant
US7283547(B1)	2007-10-01	Hook et al.	Applicant
US7286534(B2)	2007-10-01	Kloth	Applicant
US7324509(B2)	2008-01-01	Ni	Applicant
US7355970(B2)	2008-04-01	Lor	Applicant
US7356030(B2)	2008-04-01	Chang et al.	Applicant
US7366100(B2)	2008-04-01	Anderson et al.	Examiner
US7391769(B2)	2008-06-01	Rajkumar et al.	Applicant
US7468975(B1)	2008-12-01	Davis	Applicant
US7512127(B2)	2009-03-01	Chang et al.	Applicant
US7561590(B1)	2009-07-01	Walsh	Applicant
US2001/0001879(A1)	2001-05-01	Kubik et al.	Applicant
US2001/0007560(A1)	2001-07-01	Masuda et al.	Applicant
US2001/0048785(A1)	2001-12-01	Steinberg	Applicant
US2001/0053150(A1)	2001-12-01	Clear et al.	Applicant
US2002/0001307(A1)	2002-01-01	Nguyen et al.	Applicant
US2002/0040417(A1)	2002-04-01	Winograd et al.	Applicant
US2002/0054594(A1)	2002-05-01	Hoof et al.	Applicant
US2002/0069294(A1)	2002-06-01	Herkersdorf et al.	Applicant
US2002/0073073(A1)	2002-06-01	Cheng	Applicant
US2002/0087788(A1)	2002-07-01	Morris	Applicant
US2002/0089977(A1)	2002-07-01	Chang et al.	Applicant
US2002/0091844(A1)	2002-07-01	Craft et al.	Applicant
US2002/0091884(A1)	2002-07-01	Chang et al.	Applicant
US2002/0105966(A1)	2002-08-01	Patel et al.	Applicant
US2002/0126672(A1)	2002-09-01	Chow et al.	Applicant
US2002/0146013(A1)	2002-10-01	Karlsson et al.	Applicant
US2002/0161967(A1)	2002-10-01	Kirihata et al.	Applicant
US2003/0009466(A1)	2003-01-01	Ta et al.	Applicant
US2003/0043800(A1)	2003-03-01	Sonksen et al.	Applicant
US2003/0074657(A1)	2003-04-01	Bramley, Jr.	Applicant
US2003/0095548(A1)	2003-05-01	Yamano	Applicant
US2003/0103499(A1)	2003-06-01	Davis et al.	Applicant
US2003/0108052(A1)	2003-06-01	Inoue et al.	Applicant
US2003/0110180(A1)	2003-06-01	Calvignac et al.	Applicant
US2003/0115403(A1)	2003-06-01	Bouchard et al.	Applicant
US2003/0120861(A1)	2003-06-01	Calle et al.	Applicant
US2003/0152084(A1)	2003-08-01	Lee et al.	Applicant
US2003/0152096(A1)	2003-08-01	Chapman	Applicant
US2003/0159086(A1)	2003-08-01	Arndt	Applicant
US2003/0165160(A1)	2003-09-01	Minami et al.	Applicant
US2003/0177221(A1)	2003-09-01	Ould-Brahim et al.	Applicant
US2003/0223424(A1)	2003-12-01	Anderson et al.	Applicant
US2003/0227943(A1)	2003-12-01	Hallman et al.	Applicant
US2004/0022263(A1)	2004-02-01	Zhao et al.	Applicant
US2004/0054867(A1)	2004-03-01	Stravers et al.	Applicant
US2004/0062246(A1)	2004-04-01	Boucher et al.	Applicant
US2004/0088469(A1)	2004-05-01	Levy	Applicant
US2004/0128434(A1)	2004-07-01	Khanna et al.	Applicant
US2004/0141504(A1)	2004-07-01	Blanc	Applicant
US2004/0179548(A1)	2004-09-01	Chang et al.	Applicant
US2004/0190547(A1)	2004-09-01	Gordy et al.	Applicant
US2004/0223502(A1)	2004-11-01	Wybenga et al.	Applicant
US2005/0041684(A1)	2005-02-01	Reynolds et al.	Applicant
US2005/0089049(A1)	2005-04-01	Chang et al.	Applicant
US2005/0132132(A1)	2005-06-01	Rosenbluth et al.	Applicant
US2005/0138276(A1)	2005-06-01	Navada et al.	Applicant
US2005/0144369(A1)	2005-06-01	Jaspers	Applicant
US2005/0175018(A1)	2005-08-01	Wong	Applicant
US2005/0193316(A1)	2005-09-01	Chen	Applicant
US2006/0114876(A1)	2006-06-01	Kalkunte	Applicant
US2007/0038798(A1)	2007-02-01	Bouchard et al.	Applicant
US2007/0088974(A1)	2007-04-01	Chandwani et al.	Applicant
US2007/0179909(A1)	2007-08-01	Channasagara	Applicant
US2007/0208876(A1)	2007-09-01	Davis	Applicant
US2007/0253420(A1)	2007-11-01	Chang	Applicant
US2007/0258475(A1)	2007-11-01	Chinn et al.	Applicant
US2007/0288690(A1)	2007-12-01	Wang et al.	Applicant
US2008/0002707(A1)	2008-01-01	Davis	Applicant
US2008/0031263(A1)	2008-02-01	Ervin et al.	Applicant
US2008/0037544(A1)	2008-02-01	Yano et al.	Applicant
US2008/0049742(A1)	2008-02-01	Bansal	Applicant
US2008/0069125(A1)	2008-03-01	Reed et al.	Applicant
US2008/0092020(A1)	2008-04-01	Hasenplaugh et al.	Applicant
US2008/0205407(A1)	2008-08-01	Chang et al.	Applicant
US2009/0175178(A1)	2009-07-01	Yoon et al.	Applicant
EP1380127(A2)	2004-01-01		Applicant
JP2003-289359(A)	2003-10-01		Applicant
JP2004-537871(T)	2004-12-01		Applicant
WO1/84728(A1)	2001-11-01		Applicant
WO2/41544(A2)	2007-05-01		Applicant

Non-Patent Literature (181)

Notice of Allowance for U.S. Appl. No. 09/988,066, Mailed Jan. 9, 2009, 13 pages.Applicant
Non-Final Office Action For U.S. Appl. No. 11/668,322, Dated Mar. 23, 2009, 19 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/832,086, Mailed Apr. 1, 2009, 17 pages.Applicant
U.S. Appl. No. 12/400,594, filed Mar. 9, 2009, Patel et al.Applicant
U.S. Appl. No. 12/400,645, filed Mar. 9, 2009, Patel et al.Applicant
U.S. Appl. No. 12/372,390, filed Feb. 17, 2009, Chang et al.Applicant
U.S. Appl. No. 12/417,913, filed Apr. 3, 2009, Patel et al.Applicant
Final Office Action for U.S. Appl. No. 10/140,751, Mailed Mar. 17, 2009, 17 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/615,769, Mailed Apr. 15, 2009, 11 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/621,038, Mailed Apr. 23, 2009, 44 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/745,008, Mailed May 14, 2009, 27 pages.Applicant
Non Final Office Action for U.S. Appl. No. 11/804,977, Mailed Jan. 14, 2008, 13 pages.Applicant
Notice of Allowance for U.S. Appl. No. 11/804,977, Mailed Nov. 19, 2008, 17 pages.Applicant
“Classless Inter-Domain Routing (CIDR) Overview,” Pacific Bell Internet Services, 1999, 5 pages. Download date of Apr. 22, 2005.Applicant
U.S. Appl. No. 11/828,246, filed Jul. 25, 2007, Davis.Applicant
U.S. Appl. No. 11/779,778, filed Jul. 18, 2007, Wong et al.Applicant
U.S. Appl. No. 11/779,714, filed Jul. 18, 2007, Wong et al.Applicant
U.S. Appl. No. 11/724,965.Applicant
U.S. Appl. No. 11/621,038, filed Jan. 8, 2007, Davis et al.Applicant
U.S. Appl. No. 11/586,991, filed Oct. 25, 2006, Ramanathan.Applicant
U.S. Appl. No. 11/831,950, filed Jul. 31, 2007, Ravindran et al.Applicant
U.S. Appl. No. 11/953,742, filed Dec. 10, 2007, Wong et al.Applicant
U.S. Appl. No. 11/953,743, filed Dec. 10, 2007, Wong et al.Applicant
U.S. Appl. No. 11/953,745, filed Dec. 10, 2007, Wong et al.Applicant
U.S. Appl. No. 11/953,751, filed Dec. 10, 2007, Wong et al.Applicant
U.S. Appl. No. 10/141,223, filed May 7, 2002, Veerabadran et al.Applicant
U.S. Appl. No. 10/140,753, filed May 6, 2002, Davis et al.Applicant
U.S. Appl. No. 10/140,752, filed May 6, 2002, Davis.Applicant
U.S. Appl. No. 10/140,751, filed May 6, 2002, Davis et al.Applicant
U.S. Appl. No. 10/140,749, filed May 6, 2002, Davis et al.Applicant
U.S. Appl. No. 10/139,912, filed May 6, 2002, Davis et al.Applicant
U.S. Appl. No. 10/810,208, filed Mar. 26, 2004, Wong et al.Applicant
U.S. Appl. No. 10/832,086, filed Apr. 26, 2004, Wong.Applicant
Belhadj et al., “Feasibility of a 100GE MAC”, IEEE Meeting Nov. 2006, 18 pages.Applicant
Braun et al., “Fast incremental CRC updates for IP over ATM networks,” IEEE Workshop on High Performance Switching and Routing, 2001, pp. 48-52.Applicant
International Search Report of Jun. 17, 2003 for application No. PCT/US03/08719.Applicant
10 Gigabit Ethernet—Technology Overview White Paper, Sep. 2001, 16 pages.Applicant
10 Gigabit Ethernet Alliance, Interconnection with Wide Area Networks, Version 1.0, Mar. 2002, 5 pages.Applicant
Degermark, M., et al., “Small Forwarding Tables for Fast Routing Lookups,” ACM Computer Communications Review, 27(4):3-14, Oct. 1997.Applicant
Foundry Networks, “BigIron Architecture Technical Brief,” Oct. 1998—Version 1.0, 15 pages.Applicant
Foundry Networks, “BigIron Architecture Technical Brief,” Oct. 1998—Version 1.02, 15 pages.Applicant
Foundry Networks, “BigIron Architecture Technical Brief,” Dec. 1998—Version 1.03, 14 pages.Applicant
Foundry Networks, “BigIron Architecture Technical Brief,” May 1999—Version 2.0, 15 pages.Applicant
Foundry Networks, “BigIron Architecture Technical Brief,” May, 1999—Version 2.01, 15 pages.Applicant
Foundry Networks, “BigIron Architecture Technical Brief,” Jul. 2001—Version 2.02, 16 pages.Applicant
Foundry Networks, Foundry Networks, “Next Generation Terabit System Architecture—The High Performance Revolution for 10 Gigabit Networks,” Nov. 17, 2003.Applicant
Gigabit Ethernet Alliance—“Accelerating the Standard for Speed,” Copyright 1998, 10 pages.Applicant
Kichorowsky et al., “Mindspeed.TM. Switch Fabric Offers the Most Comprehensive Solution for Multi-Protocol Networking Equipment,” Apr. 30, 2001, 3 pages.Applicant
Matsumoto et al., “Switch Fabrics Touted At Interconnects Conference,” Aug. 21, 2000, URL= http://www.eetimes.com/story/OEG2000821S0011, accessed Aug. 12, 2002, 2 pages.Applicant
McAuley et al., “Fast Routing Table Lookup Using CAMs,” Proceedings of INFOCOM, Mar.-Apr. 1993, pp. 1382-1391.Applicant
Foundry Networks, “JetCore™ Based Chassis Systems—An Architecture Brief on NetIron, BigIron, and FastIron Systems,” Jan. 17, 2003.Applicant
Mier Communications, Inc., “Lab Testing Summary Report—Product Category: Layer-3 Switches, Vendor Tested:, Product Tested: Foundry Networks, BigIron 4000,” Report No. 231198, Oct. 1998, 6 pages.Applicant
Mier Communications, Inc., “Lab Testing Summary Report—Product Category: Gigabit Backbone Switches, Vendor Tested: Foundry Networks, Product Tested: BigIron 4000,” Report No. 210998, Sep. 1998, 6 pages.Applicant
Mindspeed—A Conexant Business, “Switch Fabric Chipset—CX27300 iScale.TM.,” Apr. 30, 2001, 2 pages.Applicant
Mindspeed—A Conexant Business, “17×17 3.2 Gbps Crosspoint Switch with Input Equalization—M21110,” Feb. 1, 2001, 2 pages.Applicant
The Tolly Group, “Foundry Networks, Inc.—BigIron 4000, Layer 2 & Layer 3 Interoperability Evaluation,” No. 199133, Oct. 1999, 4 pages.Applicant
The Tolly Group, “Foundry Networks, Inc.—BigIron 8000 Gigabit Ethernet Switching Router, Layer 2 & Layer 3 Performance Evaluation,” No. 199111, May 1999, 4 pages.Applicant
Satran et al., “Out of Order Incremental CRC Computation,” IEEE Transaction on Computers, 54(9): 1178-1181 (Sep. 2005).Applicant
Spurgeon, C., “Éthernet, The Definitive Guide,” O'Reilly & Associates, Inc., Sebastapol, CA, Feb. 2000.Applicant
ANSI/IEEE Standard 802.1D, 1998 Edition (373 pages).Applicant
Newton, Newton's Telecom Dictionary, CMP Books, Mar. 2004, 20th Ed., p. 617. (Examiner can obtain a copy of this reference from the file history of U.S. Appl. No. 09/855,025).Applicant
International Preliminary Examination Report for Application No. PCT/US2001/043113, mailed Nov. 6, 2003, 6pages.Applicant
Written Opinion of the International Searching Authority for Application No. PCT/US2001/043113, mailed May 1, 2003, 6 pages.Applicant
International Search Report for Application No. PCT/US2001/043113, mailed Dec. 13, 2002, 2 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 09/855,024. mailed Jun. 4, 2002, 10 pages.Applicant
Final Office Action for U.S. Appl. No. 09/855,024, mailed Jan. 15, 2003, 20 pages.Applicant
Advisory Action for U.S. Appl. No. 09/855,024, mailed May 2, 2003.Applicant
Notice of Allowance for U.S. Appl. No. 09/855,024, mailed Nov. 3, 2003.Applicant
Notice of Allowance for U.S. Appl. No. 09/855,024, mailed Dec. 15, 2003, 6 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/810,301, mailed Mar. 17, 2005,11 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/810,301, mailed Feb. 16, 2006, 12 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/810,301, mailed Jul. 28, 2006, 5 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/810,301, mailed Feb. 6, 2007, 9 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 09/855,025, mailed Nov. 23, 2004, 17 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 09/855,031, mailed May 22, 2002.Applicant
Non-Final Office Action for U.S. Appl. No. 09/855,031, mailed Dec. 10, 2002.Applicant
Final Office Action for U.S. Appl. No. 09/855,031, mailed Jul. 30, 2003.Applicant
Notice of Allowance for U.S. Appl. No. 09/855,031, mailed Nov. 4, 2003.Applicant
Non-Final Office Action for U.S. Appl. No. 10/736,680, mailed Feb. 16, 2006, 18 pages.Applicant
Final Office Action for U.S. Appl. No. 10/736,680, mailed Aug. 3, 2006, 10 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/736,680, mailed Feb. 22, 2007, 12 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/210,041, mailed Sep. 10, 2003, 12 pages.Applicant
Final Office Action for U.S. Appl. No. 10/210,041, mailed Jan. 7, 2004, 14 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/210,041, mailed Mar. 11, 2004, 12 pages.Applicant
Final Office Action for U.S. Appl. No. 10/210,041, mailed Jul. 7, 2004, 13 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/210,041, mailed Feb. 9, 2005, 7 pages.Applicant
Final Office Action for U.S. Appl. No. 10/210,041, mailed Aug. 24, 2005, 7 pages.Applicant
Advisory Action for U.S. Appl. No. 10/210,041, mailed Dec. 13, 2005, 4 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/210,108, mailed Jun. 12, 2003, 6 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/210,108, mailed Oct. 7, 2003.Applicant
Requirement for Restriction/Election for U.S. Appl. No. 10/438,545, mailed Oct. 31, 2003.Applicant
Non-Final Office Action for U.S. Appl. No. 10/438,545, mailed Dec. 12, 2003, 7 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/438,545, mailed Jun. 15, 2004, 4 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/611,067, mailed Feb. 20, 2009, 11 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/832,086, mailed Sep. 19, 2007, 12 pages.Applicant
Final Office Action for U.S. Appl. No. 10/832,086, mailed May 1, 2008, 31 pages.Applicant
Advisory Action for U.S. Appl. No. 10/832,086, mailed Jul. 21, 2008, 4 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/832,086, mailed Sep. 18, 2008, 18 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/586,991, mailed Oct. 2, 2008, 23 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/810,208, mailed Jul. 16, 2007, 24 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/810,208, mailed Dec. 18, 2007, 40 pages.Applicant
Final Office Action for U.S. Appl. No. 10/810,208, mailed Jun. 11, 2008, 34 pages.Applicant
Advisory Action for U.S. Appl. No. 10/810,208, mailed Aug. 27, 2008, 4 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/810,208, mailed Feb. 13, 2009, 17 pages.Applicant
Requirement for Restriction/Election for U.S. Appl. No. 10/140,752, mailed May 18, 2006, 8 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,752, mailed Dec. 14, 2006, 17 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,752, mailed Apr. 23, 2007, 6 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,752, mailed Jan. 24, 2008, 8 pages.Applicant
Notice of Allowance of U.S. Appl. No. 10/140,752, mailed Jul. 24, 2008, 14 pages.Applicant
Notice of Allowance of U.S. Appl. No. 10/140,752, mailed Sep. 10, 2008, 4 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/854,486, mailed Jul. 20, 2009, 29 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/139,912, mailed Jan. 25, 2006, 14 pages.Applicant
Final Office Action for U.S. Appl. No. 10/139,912, mailed Aug. 11, 2006, 26 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/139,912, mailed Apr. 20, 2007, 20 pages.Applicant
Final Office Action for U.S. Appl. No. 10/139,912, mailed Nov. 28, 2007, 20 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/139,912, mailed Aug. 1, 2008, 21 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/139,912, mailed Feb. 5, 2009, 8 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/139,912, mailed Jun. 8, 2009, 8 pages.Applicant
Requirement for Restriction/Election for U.S. Appl. No. 10/140,751, mailed Apr. 27, 2006, 5 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,751, mailed Aug. 10, 2006, 15 pages.Applicant
Final Office Action for U.S. Appl. No. 10/140,751, mailed Apr. 10, 2007, 16 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,751, mailed Oct. 30, 2007, 14 pages.Applicant
Final Office Action for U.S. Appl. No. 10/140,751, mailed May 28, 2008, 19 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,751, mailed Sep. 17, 2008, 15 pages.Applicant
Advisory Action for U.S. Appl. No. 10/140,751, mailed Jun. 1, 2009, 3 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/141,223, mailed Feb. 23, 2006, 25 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/141,223, mailed Feb. 13, 2007, 29 pages.Applicant
Final Office Action for U.S. Appl. No. 10/141,223, mailed Aug. 21, 2007, 25 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/141,223, mailed Dec. 28, 2007, 13 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/141,223, mailed Sep. 3, 2008, 22 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/139,831, mailed Oct. 17, 2005, 7 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/139,831, mailed Feb. 9, 2006, 7 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/139,831, mailed Jun. 27, 2006, 9 pages.Applicant
Final Office Action for U.S. Appl. No. 10/139,831, mailed Nov. 28, 2006, 17 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/139,831, mailed Jun. 14, 2007, 26 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/139,831, mailed Jun. 26, 2007, 25 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/828,246, mailed Jun. 15, 2009, 26 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,088, mailed Apr. 27, 2006, 13 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/140,088, mailed Sep. 7, 2006, 13 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/140,088, mailed Oct. 24, 2006, 8 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/140,088, mailed Jan. 11, 2007, 5 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,749, mailed Aug. 10, 2006, 22 pages.Applicant
Final Office Action for U.S. Appl. No. 10/140,749, mailed Jun. 27, 2007, 23 pages.Applicant
Final Office Action for U.S. Appl. No. 10/140,749, mailed Jan. 8, 2008, 23 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,749, mailed Jun. 6, 2008, 28 pages.Applicant
Final Office Action for U.S. Appl. No. 10/140,749, mailed Dec. 8, 2008, 30 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,749, mailed May 27, 2009, 38 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,753, mailed Apr. 20, 2006, 11 pages.Applicant
Final Office Action for U.S. Appl. No. 10/140,753, mailed Jan. 10, 2007, 27 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,753, mailed Aug. 22, 2007, 14 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,753, mailed Jan. 8, 2008, 14 pages.Applicant
Final Office Action for U.S. Appl. No. 10/140,753, mailed Aug. 25, 2008, 22 pages.Applicant
Requirement for Restriction/Election for U.S. Appl. No. 11/000,359, mailed Jun. 20, 2008, 7 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/000,359, mailed Oct. 23, 2008, 28 pages.Applicant
Non-Final Office Action For U.S. Appl. No. 11/000,359, mailed May 29, 2009, 14 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 09/855,038, mailed Jun. 2, 2005, 14 pages.Applicant
Final Office Action for U.S. Appl. No. 09/855,038, mailed Feb. 7, 2006, 8 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 09/855,038, mailed Oct. 4, 2006, 14 pages.Applicant
Notice of Allowance for U.S. Appl. No. 09/855,038, mailed Apr. 26, 2007, 8 pages.Applicant
Requirement for Restriction/Election for U.S. Appl. No. 09/988,066, mailed Dec. 13, 2005, 7 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 09/988,066, mailed Jul. 14, 2006, 17 pages.Applicant
Non-Final Office Action for U.S. Appl No. 09/988,066, mailed Apr. 6, 2007, 22 pages.Applicant
Final Office Action for U.S. Appl. No. 09/988,066, mailed Oct. 31, 2007, 16 pages.Applicant
Advisory Action for U.S. Appl. No. 09/988,066, mailed May 28, 2008, 4 pages.Applicant
Notice of Allowance for U.S. Appl. No. 09/988,066, mailed Oct. 30, 2008, 16 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 09/855,015, mailed Oct. 28, 2004, 12 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 09/855,015, mailed Jan. 12, 2006, 6 pages.Applicant
Notice of Allowance for U.S. Appl. No. 09/855,015, mailed Sep. 8, 2006, 3 pages.Applicant
Requirement for Restriction/Election for U.S. Appl. No. 09/855,015, mailed Nov. 3, 2006, 6 pages.Applicant
Notice of Allowance for U.S. Appl. No. 09/855,015, mailed Jan. 7, 2008, 4 pages.Applicant
Supplemental Notice of Allowance for U.S. Appl. No. 09/855,015, mailed Feb. 4, 2008, 3 pages.Applicant
U.S. Appl. No. 12/505,390, filed Jul. 17, 2009, Patel et al.Applicant
Final Office Action for U.S. Appl. No. 10/832,086, mailed on Sep. 29, 2009, 26 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/831,950, mailed on Aug. 18, 2009, 49 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 11/779,714, mailed on Sep. 1, 2009, 58 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/810,208, mailed on Aug. 24, 2009, 38 pages.Applicant
Non-Final Office Action for U.S. Appl. No. 10/140,751, mailed on Sep. 28, 2009, 34 pages.Applicant
Notice of Allowance for U.S. Appl. No. 11/000,359, mailed on Sep. 22, 2009, 17 pages.Applicant
Requirement for Restriction/Election for U.S. Appl. No. 11/668,322, mailed on Oct. 29, 2009, 6 pages.Applicant
Notice of Allowance for U.S. Appl. No. 10/139,912, mailed on Oct. 19, 2009, 17 pages.Applicant
Final Office Action for U.S. Appl. No. 11/611,067, mailed on Oct. 16, 2009, 35 pages.Applicant