Method and system for routing and filtering network data packets in fibre channel systems

Information

  • Patent Grant
  • 7792115
  • Patent Number
    7,792,115
  • Date Filed
    Tuesday, July 20, 2004
    20 years ago
  • Date Issued
    Tuesday, September 7, 2010
    13 years ago
Abstract
A fiber channel switch element with an alias cache is provided for routing and filtering frames. The alias cache includes plural entries including a control word having plural fields including an action code for routing frames; an alias word that is compared to incoming frame data using a frame byte compare block; and a bit mask generator for filtering bit combinations from the frame byte compare block; and a depth match block for determining equality between a control word depth field and incoming frame depth field. Frame data comparison is performed on a bit by bit or byte-by-byte basis. An alias cache entry also includes prerequisite data to determine if results of a different entry are to be used to determine an entry match. The action code routes a frame to a processor, discards a frame, sets a status for inspecting a frame or routes a frame based on a standard Fiber Channel addressing scheme.
Description
BACKGROUND

1. Field of the Invention


The present invention relates to fibre channel systems, and more particularly to routing and filtering network data packets.


2. Background of the Invention


Fibre channel is a set of American National Standard Institute (ANSI) standards, which provide a serial transmission protocol for storage and network protocols such as HIPPI, SCSI, IP, ATM and others. Fibre channel provides an input/output interface to meet the requirements of both channel and network users.


Fibre channel supports three different topologies: point-to-point, arbitrated loop and fibre channel fabric. The point-to-point topology attaches two devices directly. The arbitrated loop topology attaches devices in a loop. The fibre channel fabric topology attaches host systems directly to a fabric, which are then connected to multiple devices. The fibre channel fabric topology allows several media types to be interconnected.


Fibre channel is a closed system that relies on multiple ports to exchange information on attributes and characteristics to determine if the ports can operate together. If the ports can work together, they define the criteria under which they communicate.


In fibre channel, a path is established between two nodes where the path's primary task is to transport data from one point to another at high speed with low latency, performing only simple error detection in hardware.


Fibre channel fabric devices include a node port or “N_Port” that manages fabric connections. The N_port establishes a connection to a fabric element (e.g., a switch) having a fabric port or F_port. Fabric elements include the intelligence to handle routing, error detection, recovery, and similar management functions.


A fibre channel switch is a multi-port device where each port manages a simple point-to-point connection between itself and its attached system. Each port can be attached to a server, peripheral, I/O subsystem, bridge, hub, router, or even another switch. A switch receives messages from one port and automatically routes it to another port. Multiple calls or data transfers happen concurrently through the multi-port fibre channel switch.


Fibre channel switches use memory buffers to hold frames received and sent across a network. Associated with these buffers are credits, which are the number of frames that a buffer can hold per fabric port.


Conventional fibre channel switches use a frame's D_ID to route frames. This option alone may not be enough for efficiently routing and filtering frames in complex fibre channel systems.


Therefore, there is a need for a process and system that allows efficient frame routing and filtering.


SUMMARY OF THE PRESENT INVENTION

In one aspect of the present invention, a method for routing and filtering frames in a fibre channel switch is provided. The method includes comparing incoming frame data to plural alias cache entries at the same time; performing a word depth match by comparing incoming frame word depth with a programmed word depth; and routing frames based on a programmed action code that is a part of an alias cache entry. Frame data comparison is performed on a bit by bit or byte-by-byte basis. Also, an action code routes a frame to a specified destination, discards a frame, sets a status for inspecting a frame or routes a frame based on a standard Fibre Channel addressing scheme. An alias cache entry includes prerequisite data to determine if a different entry's compare results at a different frame word depth are to be used to determine an entry match.


In yet another aspect of the present invention, a system for routing and filtering frames in a fibre channel switch is provided. The system includes, an alias cache with an alias cache entry, where the alias cache entry includes, a control word having plural fields including an action code for routing frames; an alias word that is compared to incoming frame data using a frame byte compare block; and a bit mask generator for filtering bit combinations from the frame byte compare block; and a depth match block for determining equality between a control word depth field and incoming frame depth field.


In yet another aspect, a fibre channel switch element for routing and filtering frames in a fibre channel network is provided. The fibre channel switch element includes, an alias cache with an alias cache entry, where the alias cache entry includes, a control word having plural fields including an action code for routing frames; an alias word that is compared to incoming frame data using a frame byte compare block; and a bit mask generator for filtering bit combinations from the frame byte compare block; and a depth match block for determining equality between a control word depth field and incoming frame depth field.


In yet another aspect of the present invention, a method for routing and filtering frames using a fibre channel switch element having an alias cache is provided. The method includes, determining if an incoming frame is pre-destined for a switch processor; comparing incoming frame data to plural alias cache entries at the same time if the incoming frame is not pre-destined to the switch processor; performing a word depth match by comparing incoming frame word depth with a programmed word depth; and routing frames based on a programmed action code that is a part of an alias cache entry.


This brief summary has been provided so that the nature of the invention may be understood quickly. A more complete understanding of the invention can be obtained by reference to the following detailed description of the preferred embodiments thereof concerning the attached drawings.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing features and other features of the present invention will now be described with reference to the drawings of a preferred embodiment. In the drawings, the same components have the same reference numerals. The illustrated embodiment is intended to illustrate, but not to limit the invention. The drawings include the following Figures:



FIG. 1A shows an example of a Fibre Channel network system;



FIG. 1B shows an example of a Fibre Channel switch element, according to one aspect of the present invention;



FIG. 1C shows a block diagram of a 20-channel switch chassis, according to one aspect of the present invention;



FIG. 1D shows a block diagram of a Fibre Channel switch element with sixteen GL_Ports and four 10 G ports, according to one aspect of the present invention;


FIGS. 1E-1/1E-2 (jointly referred to as FIG. 1E) show another block diagram of a Fibre Channel switch element with sixteen GL_Ports and four 10 G ports, according to one aspect of the present invention;


FIGS. 2-1/2-2 (jointly referred to as FIG. 2) show a schematic of an alias cache used to route frames, according to one aspect of the present invention;


FIGS. 3A/3B (jointly referred to as FIG. 3) show a block diagram of a GL_Port, according to one aspect of the present invention;


FIGS. 4A/4B (jointly referred to as FIG. 3) show a block diagram of XG_Port (10 G) port, according to one aspect of the present invention;


FIGS. 5-i/5-ii (jointly referred to as FIG. 5) show an example of a table with various alias cache entries, used according to one aspect of the present invention; and



FIG. 6 shows a flow diagram of executable steps for routing frames using alias cache entries, according to one aspect of the present invention.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Definitions

The following definitions are provided as they are typically (but not exclusively) used in the fibre channel environment, implementing the various adaptive aspects of the present invention.


“D_ID”: 24-bit fibre channel frame header field that contains destination address.


“Domain_Id”: The high 8 bits of a 24-bit fibre channel address that identifies a switch within a fabric.


“EOF”: End of Frame


“E-Port”: A fabric expansion port that attaches to another interconnect port to create an Inter-Switch Link.


“F_Port”: A port to which non-loop N_Ports are attached to a fabric and does not include FL_ports.


“Fibre channel ANSI Standard”: This standard, incorporated herein by reference in its entirety, describes the physical interface, transmission and signaling protocol of a high performance serial link for support of other high level protocols associated with IPI, SCSI, IP, ATM and others.


“FC-1”: This is a Fibre Channel transmission protocol, which includes serial encoding, decoding and error control.


“FC-2”: This is a Fibre Channel signaling protocol that includes frame structure and byte sequences.


“FC-3”: This Fibre Channel protocol defines a set of fibre channel services that are common across plural ports of a node.


“FC-4”: This Fibre Channel Protocol provides mapping between lower levels of fibre channel, IPI and SCSI command sets, HIPPI data framing, IP and other upper level protocols.


“Fabric”: A system which interconnects various ports attached to it and is capable of routing fibre channel frames by using destination identifiers provided in FC-2 frame headers.


“Fabric Topology”: This is a topology where a device is directly attached to a fibre channel fabric that uses destination identifiers embedded in frame headers to route frames through a fibre channel fabric to a desired destination.


“FL_Port”: A L_Port that is able to perform the function of a F_Port, attached via a link to one or more NL_Ports in an Arbitrated Loop topology.


“Inter-Switch Link”: A Link directly connecting the E_port of one switch to the E_port of another switch.


Port: A general reference to N. Sub.--Port or F.Sub.--Port.


“L_Port”: A port that contains Arbitrated Loop functions associated with the Arbitrated Loop topology.


“N-Port”: A direct fabric attached port.


“NL_Port”: A L_Port that can perform the function of a N_Port.


“R_CTL”: A 8-bit fibre channel frame header field that identifies the type of frame.


“Switch”: A fabric element conforming to the Fibre Channel Switch standards.


Fibre Channel System:


To facilitate an understanding of the preferred embodiment, the general architecture and operation of a fibre channel system will be described. The specific architecture and operation of the preferred embodiment will then be described with reference to the general architecture of the fibre channel system.



FIG. 1A is a block diagram of a fibre channel system 100 implementing the methods and systems in accordance with the adaptive aspects of the present invention. System 100 includes plural devices that are interconnected. Each device includes one or more ports, classified as node ports (N_Ports), fabric ports (F_Ports), and expansion ports (E_Ports). Node ports may be located in a node device, e.g. server 103, disk array 105 and storage device 104. Fabric ports are located in fabric devices such as switch 101 and 102. Arbitrated loop 106 may be operationally coupled to switch 101 using arbitrated loop ports (FL_Ports).


The devices of FIG. 1A are operationally coupled via “links” or “paths”. A path may be established between two N_ports, e.g. between server 103 and storage 104. A packet-switched path may be established using multiple links, e.g. an N-Port in server 103 may establish a path with disk array 105 through switch 102.


Fabric Switch Element



FIG. 1B is a block diagram of a 20-port ASIC fabric element according to one aspect of the present invention. FIG. 1B provides the general architecture of a 20-channel switch chassis using the 20-port fabric element. Fabric element includes ASIC 20 with non-blocking fibre channel class 2 (connectionless, acknowledged) and class 3 (connectionless, unacknowledged) service between any ports. It is noteworthy that ASIC 20 may also be designed for class 1 (connection-oriented) service, within the scope and operation of the present invention as described herein.


The fabric element of the present invention is presently implemented as a single CMOS ASIC, and for this reason the term “fabric element” and ASIC are used interchangeably to refer to the preferred embodiments in this specification. Although FIG. 1B shows 20 ports, the present invention is not limited to any particular number of ports.


ASIC 20 has 20 ports numbered in FIG. 1B as GL0 through GL19. These ports are generic to common Fibre Channel port types, for example, F_Port, FL_Port and E-Port. In other words, depending upon what it is attached to, each GL port can function as any type of port. Also, the GL port may function as a special port useful in fabric element linking, as described below.


For illustration purposes only, all GL ports are drawn on the same side of ASIC 20 in FIG. 1B. However, the ports may be located on both sides of ASIC 20 as shown in other figures. This does not imply any difference in port or ASIC design. Actual physical layout of the ports will depend on the physical layout of the ASIC.


Each port GL0-GL19 has transmit and receive connections to switch crossbar 50. One connection is through receive buffer 52, which functions to receive and temporarily hold a frame during a routing operation. The other connection is through a transmit buffer 54.


Switch crossbar 50 includes a number of switch crossbars for handling specific types of data and data flow control information. For illustration purposes only, switch crossbar 50 is shown as a single crossbar. Switch crossbar 50 is a connectionless crossbar (packet switch) of known conventional design, sized to connect 21×21 paths. This is to accommodate 20 GL ports plus a port for connection to a fabric controller, which may be external to ASIC 20.


In the preferred embodiments of switch chassis described herein, the fabric controller is a firmware-programmed microprocessor, also referred to as the input/out processor (“IOP”). IOP 66 is shown in FIG. 1C as a part of a switch chassis utilizing one or more of ASIC 20. As seen in FIG. 1B, bi-directional connection to IOP 66 is routed through port 67, which connects internally to a control bus 60. Transmit buffer 56, receive buffer 58, control register 62 and Status register 64 connect to bus 60. Transmit buffer 56 and receive buffer 58 connect the internal connectionless switch crossbar 50 to IOP 66 so that it can source or sink frames.


Control register 62 receives and holds control information from IOP 66, so that IOP 66 can change characteristics or operating configuration of ASIC 20 by placing certain control words in register 62. IOP 66 can read status of ASIC 20 by monitoring various codes that are placed in status register 64 by monitoring circuits (not shown).



FIG. 1C shows a 20-channel switch chassis S2 using ASIC 20 and IOP 66. S2 will also include other elements, for example, a power supply (not shown). The 20 GL ports correspond to channel C0-C19. Each GL port has a serial/deserializer (SERDES) designated as S0-S19. Ideally, the SERDES functions are implemented on ASIC 20 for efficiency, but may alternatively be external to each GL port.


Each GL port has an optical-electric converter, designated as OE0-OE19 connected with its SERDES through serial lines, for providing fibre optic input/output connections, as is well known in the high performance switch design. The converters connect to switch channels C0-C19. It is noteworthy that the ports can connect through copper paths or other means instead of optical-electric converters.



FIG. 1D shows a block diagram of ASIC 20 with sixteen GL ports and four 10 G (Gigabyte) port control modules designated as XG0-XG3 for four 10 G ports designated as XGP0-XGP3. ASIC 20 includes a control port 62A that is coupled to IOP 66 through a PCI connection 66A.


FIG. 1E-1/1E-2 (jointly referred to as FIG. 1E) show yet another block diagram of ASIC 20 with sixteen GL and four XG port control modules. Each GL port control module has a Receive port (RPORT) 69 with a receive buffer (RBUF) 69A and a transmit port 70 with a transmit buffer (TBUF) 70A, as described below in detail. GL and XG port control modules are coupled to physical media devices (“PMD”) 76 and 75 respectively.


Control port module 62A includes control buffers 62B and 62D for transmit and receive sides, respectively. Module 62A also includes a PCI interface module 62C that allows interface with IOP 66 via a PCI bus 66A.


XG_Port (for example 74B) includes RPORT 72 with RBUF 71 similar to RPORT 69 and RBUF 69A and a TBUF and TPORT similar to TBUF 70A and TPORT 70. Protocol module 73 interfaces with SERDES to handle protocol based functionality.


GL_Port:



FIGS. 3A-3B (referred to as FIG. 3) show a detailed block diagram of a GL port as used in ASIC 20. GL port 300 is shown in three segments, namely, receive segment (RPORT) 310, transmit segment (TPORT) 312 and common segment 311.


Receive Segment of GL_Port:


Frames enter through link 301 and SERDES 302 converts data into 10-bit parallel data to fibre channel characters, which are then sent to receive pipe (“Rpipe”) 303A (may be referred to as Rpipe 1 and Rpipe 2) via a de-multiplexer (DEMUX) 303. Rpipe 303A includes, parity module 305 and decoder 304. Decoder 304 decodes 10B data to 8B and parity module 305 adds a parity bit. Rpipe 303A also performs various Fibre Channel standard functions such as detecting a start of frame (SOF0), end-of frame (EOF), Idles, R_RDYs (fibre channel standard primitive) and the like, which are not described since they are standard functions.


Rpipe 303A connects to smoothing FIFO (SMF) module 306 that performs smoothing functions to accommodate clock frequency variations between remote transmitting and local receiving devices.


Frames received by RPORT 310 are stored in receive buffer (RBUF) 69A, (except for certain Fibre Channel Arbitrated Loop (AL) frames). Path 309 shows the frame entry path, and all frames entering path 309 are written to RBUF 69A as opposed to the AL path 308.


Cyclic redundancy code (CRC) module 313 further processes frames that enter GL port 300 by checking CRC and processing errors according to FC_PH rules. The frames are subsequently passed to RBUF 69A where they are steered to an appropriate output link. RBUF 69A is a link receive buffer and can hold multiple frames.


Reading from and writing to RBUF 69A are controlled by RBUF read control logic (“RRD”) 319 and RBUF write control logic (“RWT”) 307, respectively. RWT 307 specifies which empty RBUF 69A slot will be written into when a frame arrives through the data link via multiplexer (“Mux”) 313B, CRC generate module 313A and EF (external proprietary format) module 314. EF module 314 encodes proprietary (i.e. non-standard) format frames to standard Fibre Channel 8B codes. Mux 313B receives input from Rx Spoof module 314A, which encodes frames to a proprietary format (if enabled). RWT 307 controls RBUF 69A write addresses and provide the slot numbers to tag writer (“TWT”) 317.


RRD 319 processes frame transfer requests from RBUF 69A. Frames may be read out in any order and multiple destinations may get copies of the frames.


Steering state machine (SSM) 316 receives frames and determines the destination for forwarding the frame. SSM 316 produces a destination mask, where there is one bit for each destination. Any bit set to a certain value, for example, 1, specifies a legal destination, and there can be multiple bits set, if there are multiple destinations for the same frame (multicast or broadcast).


SSM 316 makes this determination using information from alias cache 315, steering registers 316A, control register 326 values and frame contents. IOP 66 writes all tables so that correct exit path is selected for the intended destination port addresses. Alias cache 315 based routing is described below in detail, according to one aspect of the present invention.


The destination mask from SSM 316 is sent to TWT 317 and a RBUF tag register (RTAG) 318. TWT 317 writes tags to all destinations specified in the destination mask from SSM 316. Each tag identifies its corresponding frame by containing an RBUF 69A slot number where the frame resides, and an indication that the tag is valid.


Each slot in RBUF 69A has an associated set of tags, which are used to control the availability of the slot. The primary tags are a copy of the destination mask generated by SSM 316. As each destination receives a copy of the frame, the destination mask in RTAG 318 is cleared. When all the mask bits are cleared, it indicates that all destinations have received a copy of the frame and that the corresponding frame slot in RBUF 69A is empty and available for a new frame.


RTAG 318 also has frame content information that is passed to a requesting destination to pre-condition the destination for the frame transfer. These tags are transferred to the destination via a read multiplexer (RMUX) (not shown).


Transmit Segment 312 of GL Port:


Transmit segment (“TPORT”) 312 performs various transmit functions. Transmit tag register (TTAG) 330 provides a list of all frames that are to be transmitted. Tag Writer 317 or common segment 311 write TTAG 330 information. The frames are provided to arbitration module (“transmit arbiter” (“TARB”)) 331, which is then free to choose which source to process and which frame from that source to be processed next.


TTAG 330 includes a collection of buffers (for example, buffers based on a first-in first out (“FIFO”) scheme) for each frame source. TTAG 330 writes a tag for a source and TARB 331 then reads the tag. For any given source, there are as many entries in TTAG 330 as there are credits in RBUF 69A.


TARB 331 is activated anytime there are one or more valid frame tags in TTAG 330. TARB 331 preconditions its controls for a frame and then waits for the frame to be written into TBUF 70A. After the transfer is complete, TARB 331 may request another frame from the same source or choose to service another source.


TBUF 70A is the path to the link transmitter. Typically, frames don't land in TBUF 70A in their entirety. Mostly, frames simply pass through TBUF 70A to reach output pins, if there is a clear path.


Switch Mux 332 is also provided to receive output from crossbar 50. Switch Mux 332 receives input from plural RBUFs (shown as RBUF 00 to RBUF 19), and input from CPORT 62A shown as CBUF 1 frame/status. TARB 331 determines the frame source that is selected and the selected source provides the appropriate slot number. The output from Switch Mux 332 is sent to ALUT 323 for S_ID spoofing and the result is fed into TBUF Tags 333.


TxMUX 339 chooses which data path to connect to the transmitter. The sources are: primitive sequences specified by IOP 66 via control registers 326 (shown as primitive 339A), and signals as specified by Transmit state machine (“TSM”) 346, frames following the loop path, or steered frames exiting the fabric via TBUF 70A.


TSM 346 chooses the data to be sent to the link transmitter, and enforces all fibre Channel rules for transmission. TSM 346 receives requests to transmit from loop state machine 320, TBUF 70A (shown as TARB request 346A) and from various other IOP 66 functions via control registers 326 (shown as IBUF Request 345A). TSM 346 also handles all credit management functions, so that Fibre Channel connectionless frames are transmitted only when there is link credit to do so.


Loop state machine (“LPSM”) 320 controls transmit and receive functions when GL_Port is in a loop mode. LPSM 320 operates to support loop functions as specified by FC-AL-2.


IOP buffer (“IBUF”) 345 provides IOP 66 the means for transmitting frames for special purposes.


Frame multiplexer (“Frame Mux”) 336 chooses the frame source, while logic (TX spoof 334) converts D_ID and S_ID from public to private addresses. Frame Mux 336 receives input from Tx Spoof module 334, TBUF tags 333, and Mux 335 to select a frame source for transmission.


EF (external proprietary format) module 338 encodes proprietary (i.e. non-standard) format frames to standard Fibre Channel 8B codes and CRC module 337 generates CRC data for the outgoing frames.


Modules 340-343 put a selected transmission source into proper format for transmission on an output link 344. Parity 340 checks for parity errors, when frames are encoded from 8B to 10B by encoder 341, marking frames “invalid”, according to Fibre Channel rules, if there was a parity error. Phase FIFO 342A receives frames from encode module 341 and the frame is selected by Mux 342 and passed to SERDES 343. SERDES 343 converts parallel transmission data to serial before passing the data to the link media. SERDES 343 may be internal or external to ASIC 20.


Common Segment of GL_Port:


As discussed above, ASIC 20 include common segment 311 comprising of various modules. LPSM 320 has been described above and controls the general behavior of TPORT 312 and RPORT 310.


A loop look up table (“LLUT”) 322 and an address look up table (“ALUT”) 323 is used for private loop proxy addressing and hard zoning managed by firmware.


Common segment 311 also includes control register 326 that controls bits associated with a GL_Port, status register 324 that contains status bits that can be used to trigger interrupts, and interrupt mask register 325 that contains masks to determine the status bits that will generate an interrupt to IOP 66. Common segment 311 also includes AL control and status register 328 and statistics register 327 that provide accounting information for FC management information base (“MIB”).


Output from status register 324 may be used to generate a Fp Peek function. This allows a status register 324 bit to be viewed and sent to the CPORT.


Output from control register 326, statistics register 327 and register 328 (as well as 328A for an X_Port, shown in FIG. 4) is sent to Mux 329 that generates an output signal (FP Port Reg Out).


Output from Interrupt register 325 and status register 324 is sent to logic 335 to generate a port interrupt signal (FP Port Interrupt).


BIST module 321 is used for conducting embedded memory testing.


XG_Port



FIGS. 4A-4B (referred to as FIG. 4) show a block diagram of a 10 G Fibre Channel port control module (XG FPORT) 400 used in ASIC 20. Various components of XG FPORT 400 are similar to GL port control module 300 that are described above. For example, RPORT 310 and 310A, Common Port 311 and 311A, and TPORT 312 and 312A have common modules as shown in FIGS. 3 and 4 with similar functionality.


RPORT 310A can receive frames from links (or lanes) 301A-301D and transmit frames to lanes 344A-344D. Each link has a SERDES (302A-302D), a de-skew module, a decode module (303B-303E) and parity module (304A-304D). Each lane also has a smoothing FIFO (SMF) module 305A-305D that performs smoothing functions to accommodate clock frequency variations. Parity errors are checked by module 403, while CRC errors are checked by module 404.


RPORT 310A uses a virtual lane (“VL”) cache 402 that stores plural vector values that are used for virtual lane assignment. In one aspect of the present invention, VL Cache 402 may have 32 entries and two vectors per entry. IOP 66 is able to read or write VL cache 402 entries during frame traffic. State machine 401 controls credit that is received. On the transmit side, credit state machine 347 controls frame transmission based on credit availability. State machine 347 interfaces with credit counters 328A.


Also on the transmit side, modules 340-343 are used for each lane 344A-344D, i.e., each lane can have its own module 340-343. Parity module 340 checks for parity errors and encode module 341 encodes 8-bit data to 10 bit data. Mux 342B sends the 10-bit data to a transmit (TXSMF) SMF module 342 that handles clock variation on the transmit side. SERDES 343 then sends the data out to the link.


Alias Cache (May Also be Referred to as “AC”) 315:


In one aspect of the present invention, AC 315 is used to route/intercept and filter/track or trace frames in ways that are not taught by standard fibre channel physical frame address processing. In one aspect of the present invention, AC 315 assists in routing unicast, multicast and broadcast frames to any port (including IOP 66); uses a conditional match on word depth and frame word (byte or bit comparison); uses a conditional match on prerequisite entry status value; uses a conditional match on class of frames; and uses action codes, as described below.


AC 315 may also be used to route/filter virtual storage area network (“VSAN”) tagged frames or other fabric extension frames. It could also be used to route/filter frames without normal fibre channel routing information, i.e. Ethernet VSAN frames.


AC 315 includes multiple entries that are compared with incoming frame data. All AC 315 entries are compared at the same time so that frame flow is not affected by the compare process step. A word, multi byte or single byte or bit comparison may be used. Each entry consists of a valid flag, an action code, compare to data and word depth for the comparison. Entries are numbered, for example, as 0 to n, where n is the highest number (for example, as shown in FIG. 2, entry 00 to entry 15 for sixteen entries). The adaptive aspects of the present invention are not limited to any particular entry numbering scheme or number of entries.


As frame words are received, each frame word is compared for entries that match the word depth. An action code and the results of the comparison determine how the frame is routed/filtered, for example:

    • a. A frame is routed to the destinations specified by a matching AC 315 entry. IOP 66 may be one such destination.
    • b. The frame is discarded as specified by an AC 315-action code.
    • c. A status is set for later inspection.
    • d. The frame is routed using the fibre channel standard physical destination-addressing scheme.


As described below in detail, each AC 315 entry includes the following:

    • 32 bits (4 bytes) of data that is compared with frame data.


Word depth, indicating the word in the frame to compare with.


Compare byte enable flags, which determine the 4 bytes of the frame word that are compared.


Bit masks to determine which bits of the bytes are compared.


“Bit mask select” determines the byte to which the bit mask is applied.


Prerequisite data to determine if results of a different entry (at a lower word depth) are to be used to determine if the entry is a match.


Action code, to determine what action is to be performed depending on the results of the compare.


Destination list to determine what destinations the frame is routed to, if routing is indicated by the action codes. Copies of the frame can be routed to multiple destinations, including IOP 66.



FIG. 2 shows a schematic of AC 315 used for routing/filtering frames, according to one aspect of the present invention. AC 315 receives incoming word depth 209 and frame data word 210. AC 315 includes entries 0 to 15, i.e. 16 entries. The first entry is shown in detail as 216. Entry 216 includes 32 bits alias word entry 202, which is compared with frame data word 210. It is noteworthy that the present invention is not limited to any particular size of alias word 202. Alias word 202 is written by IOP 66 and is used to compare to frame data word 210.


Entry 216 also includes a control word 201 in register 326 that is written by IOP 66. Control word 201 field(s) settings determine the associated entry's mode of operation. The following provides a listing of control word 201 field/bit entries:

    • “V”: This indicates a valid field;
    • “IOP”: This field denotes that a frame is to be sent/copied to IOP 66;
    • Prerequisite Entry Number (“PEN”): This field denotes which slot PE will be used for determining an entry match on a slot.;
    • “D”: This field is for word depth indicating which word in a frame is compared;
    • “PE”: This field denotes a prerequisite enable status. Prerequisite data determines if results of a different entry (for example, at a lower word depth) are used to determine if an entry is a match;
    • “A”: This field is used for an action code that determines what action should be taken regarding a particular frame, for example, route frame on a match, toss frame on a match or set status on match;
    • “SV”: This field is used to denote active state of the status bit.
    • “BMS”: This field is for “bit mask select” which is sent to a bit mask generator (“BMG”) 208 and determines the byte to which the bit mask is applied;
    • “BE”: This field enables bit comparison which determines the bytes of a word that are compared; and
    • “BM”; This field provides the bit mask to BMG 208 to determine which bits of the bytes are compared.


As shown in FIG. 2, word depth 209 is compared by logic 211 with the control word 201 field “D”. Logic 211 generates a depth match signal 211A that is sent to a valid and status generator 207.


BMS 208 receives control word 201 field BM and BMS. BMS 208 filters various bit combinations from frame byte compare modules 213-215 and 217. Alias word 202 entries (for example, byte 0, byte 1, byte 2 and byte 3, as shown in FIG. 2) are compared to frame data 210 by logic 213-215 and 217. BMS 208 provides the bit mask to modules 213-215 and 217. Logic 212 determines if there is a word match between frame data 210 and the AC 315 programmed entry word.


If there is a word match, then a word match signal (212A) is sent to the valid and status generator 207 that also receives various inputs from the control word 201, for example, V, A, PE, and SV and depth match entry 211A from logic 211. Valid and Status generator 207 also receives input 206A from status Mux 206 which is based on control word 201 field PEN. Mux 206 receives 16 status signals one from each of the 16 alias cache entries, and one of the 16 entries is sent to valid and status generator 207.


Output 207A from the valid and status generator 207 is sent to an encoder 204. Based on the asserted valid signals from the alias cache entries, encoder 204 asserts an Alias Cache slot value 204A that represents the entry number of the lowest numbered entry which asserted a valid signal.


Based on the value of 204B (output of encoder 204), Mux 203 outputs an alias-valid signal 203A. If more than one alias-valid signal is asserted, then an alias multiple valid status signal 203B is asserted. The valid signal 203A is used to validate information from the destination mask 205.


Destination mask 205 provides routing port information. In one aspect, an IOP 66 read/written register is used to store this information. Destination mask 205 information is sent to Mux 204F that also receives input from encoder 204 and control word 201 IOP field values. Mux 204F generates Toss/Route 204E and Hit/Miss 204D signals. Signal 204E determines whether a frame is routed or tossed. Signal 204D denotes whether the comparison has resulted in a hit or miss. Signal 204C provides the destination mask (frame routing information). Signals 204C, 204D and 204E are sent to SSM 316.


Action codes determine the action based on the results of the comparison described above. No further checks are done for higher word depths any time an action specifies that a frame be routed using the Alias cache 315 destinations, or discarded. The following provides examples of some of the action codes that can be used with the various adaptive aspects of the present invention. It is noteworthy that the invention is not limited to any particular type or number of action codes:


0—If a match, route the frame using the destinations in the Alias cache 315. If not a match, stop compare on higher word depths and use other steering mechanisms.

    • 1—If a match, discard the frame. If not a match, stop compare at higher word depths and use other steering mechanisms.
    • 2—If not a match, stop compares at higher word depths and use other steering mechanisms. If a match, continue to compare at higher word depths.
    • 3—If a match, route the frame using the destinations in the Alias cache 315. If not a match, continue to do compares at higher word depths.
    • 4—If a match, set the entry status to 1 for use by a compare at a higher word depth, and continue.
    • 5—If not a match, set entry status to 1 for use by compare at a higher word depth, and continue.
    • 6—If match and class 3 frame toss, ignore other class of frames.
    • 7—If a match, then increment a counter or set status.


When alias cache 315 is comparing data at a particular word depth, only compares and action codes in entries that specify the particular word depth have any effect. Prerequisite matching is done for prerequisite entries that are a lower word depth than the entry that checks them. Alias cache 315 processing stops if a frame disposition has been determined, the maximum-programmed word depth is reached or the end of the frame is reached, whichever happens first. If alias cache 315 processing ends without a route or discard action, normal physical address processing is done on the frame D_ID per fibre channel standards.


The following provides an example of 16 alias cache entries 216. The word depth for each Alias Cache entry is also provided below:


























0
1
2
3
4
5
6
7
8
9
10
11
12
13
14 15








0
2
0
1
3
5
2

7
2
3


1









The foregoing provides the incoming frame word entry numbers from 0-15. When word 0 is received for a frame, entries 1 and 3 are compared to frame word 0. If the frame disposition is not determined, the comparison continues and then word 1 is compared with entries 4 and 14. If the frame disposition is still not determined and comparison is continued, then word 2 is compared with entries 2, 7, and 10. If the frame disposition is still not determined and comparison is continued, then word 3 is compared with entries 5 and 11. If the frame disposition is still not determined and comparison is continued, then word 5 is compared with entry 6. If the frame disposition is still not determined and comparison is continued, then word 7 is compared with entry 9. If the frame disposition is not still determined by the controlling action codes and comparison is continued after all entries, the normal standard routing logic that uses the D_ID as a physical port number is used to route the frame.


The following provides an illustration of the adaptive aspects of the present invention with typical Fibre Channel frames. As discussed above, alias cache 315 can route broadcast frames to all appropriate destinations; intercept the Fibre Channel Extended Link Service (ELS) LS_RJT frame and route it to IOP 66; and intercept the Fiber Channel Switch Internal Link Service (SW_ILS) SW_RJT frame and route it to IOP 66.


Alias cache entry 0:















Compare data—0x00ffffff
Fibre Channel broadcast address


Word depth—0
Compare with first word in frame



(D_ID)


Byte enables—bytes 1, 2, 3
Compare the 3 bytes of the D_ID


Byte bit mask—0xff


Bit mask select—byte 0
Bit mask not needed


Prerequisite match required—0
No prerequisite needed


Prerequisite value—0


Prerequisite entry—0


Action code—3
Route on match, else continue


Destination list—
All logged in N-ports on local switch



and ports used to route broadcasts



between switches










Alias cache entry 1:















Compare data—0x20000000
Extended Link code in R_CTL field


Word depth—0
Word 0 contains R_CTL field


Byte enables—byte 0
R_CTL field in byte 0 of word 0


Byte bit mask—0xf0
High 4 bits of R_CTL field


Bit mask select—byte 0


Prerequisite match required—0
No prerequisite needed


Prerequisite value—0


Prerequisite entry—0


Action code—4,
Set entry status on match and continue


Destination list—
None










Alias cache entry 2:















Compare data—0x22000000
Type field Switch Fabric Services


Word depth—2
Word 2 contains Type field


Byte enables—byte 0
Type field in byte 0 of word 2


Byte bit mask—0xff


Bit mask select—byte 1
Bit mask not needed


Prerequisite match required—0
No prerequisite needed


Prerequisite value—0


Prerequisite entry—0


Action code—4
Set entry status on match and continue


Destination list—
None










Alias cache entry 3:















Compare data—0x01000000
Extended Link LS_RJT code


Word depth—6
Word 6 first payload word


Byte enables—byte 0
ELS command field in byte 0 of word 6


Byte bit mask—0xff


Bit mask select—byte 1
Bit mask not needed


Prerequisite match required—1
Prerequisite needed for match


Prerequisite value—1
Prerequisite match status needs to be set


Prerequisite entry—1
Entry 1 is prerequisite


Action code—0
Route on match


Destination list—
IOP 66










Alias cache entry 4:















Compare data—0x01000000
Switch Fabric Services SW_RJT



command


Word depth—6
Word 6 first payload word


Byte enables—byte 0
SW_ILS command code in byte 0 of



word 6


Byte bit mask—0xff


Bit mask select—byte 1
Bit mask not needed


Prerequisite match required—1
Prerequisite needed for match


Prerequisite value—1
Prerequisite match status needs to be set


Prerequisite entry—2
Entry 2 is prerequisite


Action code—0
Route on match


Destination list—
IOP 66










This following provides an example of a 30-bit alias control word 201 format:













Bits
Function







07:00
Compare Bit Mask


Bit 00 =
Enable compare on data bits 00, 08, 16, or 24


Bit 01 =
Enable compare on data bits 01, 09, 17, or 25


Bit 02 =
Enable compare on data bits 02, 10, 18, or 26


Bit 03 =
Enable compare on data bits 03, 11, 19, or 27


Bit 04 =
Enable compare on data bits 04, 12, 20, or 28


Bit 05 =
Enable compare on data bits 05, 13, 21, or 29


Bit 06 =
Enable compare on data bits 06, 14, 22, or 30


Bit 07 =
Enable compare on data bits 07, 15, 23, or 31



Where 0 = Compare bit for equal or not equal



1 = Force compare equal


11:08
Compare Byte Enable


Bit 08 =
Enable compare on data bits 07:00 (Byte 3)


Bit 09 =
Enable compare on data bits 15:08 (Byte 2)


Bit 10 =
Enable compare on data bits 23:16 (Byte 1)


Bit 11 =
Enable compare on data bits 31:24 (Byte 0)



Where 0 = Force compare equal



1 = Enable compare for equal or not equal


13:12
Bit Mask Select


00 =
Apply Bit Mask to compare bits 31:24 (Byte 0)


01 =
Apply Bit Mask to compare bits 23:16 (Byte 1)


10 =
Apply Bit Mask to compare bits 15:08 (Byte 2)


11 =
Apply Bit Mask to compare bits 07:00 (Byte 3)


14
Prerequisite compare status value


18:15
Action Code


0000 =
Route frame on match


0001 =
Toss frame on match


0010 =
Stop compares on miss but continue on match


0011 =
Continue compares on miss but route on a match


0100 =
Set entry status on match and continue


0101 =
Set entry status on miss and continue


0110 =
Increment counter on hit and continue


0111 =
Increment counter on miss and continue


1000 =
Set FPORT Common status register bit on hit and continue


1001 =
Set FPORT Common status register bit on hit and continue


19
Prerequisite match required for an entry match



Where 0 = Force prerequisite compare equal



1 = Enable prerequisite compare for equal or not equal


23:20
Word Match Depth


0000 =
Compare Alias Data against frame



data word 0 (R_CTL & D_ID for non-extended fabric frames)


0001 =
Compare Alias Data against frame



data word 1 (CS_CTL & S_ID for non-extended fabric frames)


.
.


.
.


.
.


1111 =
Compare Alias Data against frame data word 15


27:24
Prerequisite Alias cache entry number


28
Reserved


29
Destination = IOP



0 = no



1 = yes


30
Reserved


31
Valid



0 = Not valid



1 = Valid









Addressing is as follows.
















Address
Function









Base
Entry 0



Base + 4
Entry 1



.
.



.
.



.
.



Base + 3Ch
Entry Fh










Alias Data 202

    • This provides the 32-bit alias data for the compare mask.
















Bits
Function









31:0
Alias Data










Addressing is as follows.
















Address
Function









Base
Entry 0



Base + 4
Entry 1



.
.



.
.



.
.



Base + 3Ch
Entry Fh












    • Alias Mask:





This provides a 16-bit destination mask used to steer the frame if there was a hit in the Alias Address. Each Alias Mask Entry has the following format. IOP 66 destination and OBR bits come from the Alias Control field.
















Bits
Function









 0
Destination = FPORT0




0 = no




1 = yes



 1
Destination = FPORT1




0 = no




1 = yes



.
.



.
.



.
.



15
Destination = FPORT15




0 = no




1 = yes



31:16
Reserved for higher port count switches










Addressing is as follows.
















Address
Entry #









Base
0



Base + 4
1



.
.



.
.



.
.



Base + 3Ch
Fh










Alias Status


This provides the 16-bit alias status for the prerequisite compare function.
















Bits
Function









15:0
Alias Status



31:16
Reserved or used for higher port count switches











FIG. 5 shows a table of various values that are compared and how the action codes are used.


It is noteworthy that the foregoing examples are to illustrate the various adaptive aspects of the present invention. The examples are not intended to limit the invention to any particular field size/functionality or description.



FIG. 6 shows a flow diagram of using alias cache 315, according to one aspect of the invention. In step S600, the process determines if an incoming frame is destined for IOP 66 based on fixed condition, for example, SOF, without automatic routing fields etc. If yes, then in step S602, the frame is sent to IOP 66.


If the frame is not pre-destined for IOP 66, then in step S601, the process tries Alias Cache 315 routing. In step S603, the process determines, if the Alias cache 315 generates a valid signal. If not, then in step S604, a new frame word is tried.


If the Alias Cache 315 generates a valid signal in step S605, then the process determines, if the frame is to be tossed (signal 204E). If the frame is to be tossed, then it is tossed in step S606.


If the frame does not need to be tossed and there is an Alias Cache 315 hit (203A) in step S607A, then the frame is routed by Alias Cache 315 in step S607. If there is no Alias Cache 315 hit, then in step S608, the process determines if the frame is an exception. If yes, the frame is routed to IOP 66 in step S602. If the frame is not an exception, then steering registers 316A are used in step S609. If there is a valid steering register hit, then the frames are routed by steering register 316A values, in step S610. Otherwise, the frames are routed to IOP 66 in step S602.


In one aspect of the present invention, an efficient routing/filtering/tracking method and system is provided that is flexible and programmable.


Although the present invention has been described with reference to specific embodiments, these embodiments are illustrative only and not limiting. Many other applications and embodiments of the present invention will be apparent in light of this disclosure and the following claims

Claims
  • 1. A method for processing frames, comprising: (a) receiving a frame at a port of a switch element;(b) simultaneously comparing incoming frame information with a plurality of fields of an alias cache entry from among a plurality of alias cache entries that are configured by a switch element processor; wherein the alias cache entry includes a control word based on which the frame is processed by the switch element; and wherein the control word includes a word depth field for identifying which word in the frame is compared to the alias cache entry field, and a programmed action code that determines an action based on the comparison to route the frame to a destination based on a matching alias cache entry, discard the frame, set a status for inspecting the frame and route the frame based on a standard addressing scheme;(c) performing a word depth match by comparing incoming frame word depth with a programmed word depth of the alias cache entry; and(d) routing the frame based on the action code of the alias cache entry.
  • 2. The method of claim 1, wherein the frame data comparison is performed on a bit by bit or byte-by-byte basis, based on the settings in the alias cache entry.
  • 3. The method of claim 1, wherein a plurality of frame words are compared before any action is taken.
  • 4. The method of claim 1, wherein the alias cache entry includes prerequisite data to determine if a result from a comparison with a different alias cache entry at a different fame word depth is used to determine if the frame information has an entry match.
  • 5. A system, comprising: a switch element receiving a frame from another device, the switch element comprising:an alias cache having a plurality of entries for simultaneously comparing frame information with a plurality of fields of an alias cache entry that are configured by a switch element processor;wherein the alias cache entry includes a control word having a plurality of fields based on which the frame is processed by the switch element; and wherein the control word includes a word depth field identifying which word in the frame is compared to the alias cache entry, and a programmed action code that determines an action based on the comparison to route the frame to a destination based on a matching alias cache entry, discard the frame, set a status for inspecting the frame and route the frame based on a standard addressing scheme;a frame byte compare block for comparing frame information with an alias cache entry word;a bit mask generator for filtering bit combinations received from the frame byte compare block; anda depth match block for determining equality between a control word depth field and an incoming frame depth field.
  • 6. The system of claim 5, further comprising: a valid and status generator module that receives plural inputs from the alias cache entry and the depth match block and generates an output signal that is sent to an encoder module.
  • 7. The system of claim 5, wherein comparison of information in the frame is performed on a bit by bit or byte-by-byte basis, based on the settings in the alias cache entry.
  • 8. The system of claim 5, wherein a plurality of frame words are compared before any action is taken.
  • 9. The system of claim 5, wherein the alias cache entry includes prerequisite data to determine if a result from a comparison with a different alias cache entry at a different fame word depth is used to determine if the frame information has an entry match.
  • 10. A switch element, comprising: an alias cache having a plurality of entries for simultaneously comparing frame information with a plurality of fields of an alias cache entry that are configured by a switch element processor;wherein the alias cache entry includes a control word having a plurality of fields based on which the frame is processed by the switch element; and wherein the control word includes a word depth field identifying which word in the frame is compared to the alias cache entry, and a programmed action code that determines an action based on the comparison to route the frame to a destination based on a matching alias cache entry, discard the frame, set a status for inspecting the frame and route the frame based on a standard addressing scheme;a frame byte compare block for comparing frame information with an alias cache entry word;a bit mask generator for filtering bit combinations received from the frame byte compare block; anda depth match block for determining equality between a control word depth field and an incoming frame depth field.
  • 11. The switch element of claim 10, further comprising: a valid and status generator module that receives plural inputs from the alias cache entry and the depth match block and generates an output signal that is sent to an encoder module.
  • 12. The switch element of claim 10, wherein comparison of information in the frame is performed on a bit by bit or byte-by-byte basis.
  • 13. The switch element of claim 10, wherein a plurality of frame words are compared before any action is taken.
  • 14. The switch element of claim 10, wherein the alias cache entry includes prerequisite data to determine if a result from a comparison with a different alias cache entry at a different fame word depth is used to determine if the frame information has an entry match.
  • 15. A method for processing frames, comprising: (a) receiving a frame at a port of a switch element;(b) determining if the frame is pre-destined for a switch processor;(c) if the incoming frame is not pre-destined for the switch processor, simultaneously comparing frame information with a plurality of fields of an alias cache entry from among a plurality of alias cache entries that are configured by a switch element processor; wherein the alias cache entry includes a control word based on which the frame is processed by the switch element; and wherein the control word includes a word depth field for identifying which word in the frame is compared to the alias cache entry field, and a programmed action code that determines an action based on the comparison to route the frame to a destination based on a matching alias cache entry, discard the frame, set a status for inspecting the frame and route the frame based on a standard addressing scheme;(d) performing a word depth match by comparing the frame's word depth with a programmed word depth in the alias cache entry; and(d) routing the frames based on the action code of the alias cache entry.
  • 16. The method of claim 15, wherein the frame data comparison is performed on a bit by bit or byte-by-byte basis, based on the settings in the alias cache entry.
  • 17. The method of claim 15, wherein a plurality of frame words are compared before any action is taken.
  • 18. The method of claim 15, wherein the alias cache entry includes prerequisite data to determine if a result from a comparison with a different alias cache entry at a different fame word depth is used to determine if the frame information has an entry match.
CROSS REFERENCE TO RELATED APPLICATIONS

This application claims priority under 35 U.S.C. §119(e)(1) to the following provisional patent applications: Filed on Sep. 19, 2003, Ser. No. 60/503,812, entitled “Method and System for Fibre Channel Switches”;Filed on Jan. 21, 2004, Ser. No. 60/537,933 entitled “Method And System For Routing And Filtering Network Data Packets In Fibre Channel Systems”;Filed on Jul. 21, 2003, Ser. No. 60/488,757, entitled “Method and System for Selecting Virtual Lanes in Fibre Channel Switches”;Filed on Dec. 29, 2003, Ser. No. 60/532,965, entitled “Programmable Pseudo Virtual Lanes for Fibre Channel Systems”;Filed on Sep. 19, 2003, Ser. No. 60/504,038, entitled” Method and System for Reducing Latency and Congestion in Fibre Channel Switches;Filed on Aug. 14, 2003, Ser. No. 60/495,212, entitled “Method and System for Detecting Congestion and Over Subscription in a Fibre channel Network”Filed on Aug. 14, 2003, Ser. No. 60/495,165, entitled “LUN Based Hard Zoning in Fibre Channel Switches”;Filed on Sep. 19, 2003, Ser. No. 60/503,809, entitled “Multi Speed Cut Through Operation in Fibre Channel Switches”Filed on Sep. 23, 2003, Ser. No. 60/505,381, entitled “Method and System for Improving bandwidth and reducing Idles in Fibre Channel Switches”;Filed on Sep. 23, 2003, Ser. No. 60/505,195, entitled “Method and System for Keeping a Fibre Channel Arbitrated Loop Open During Frame Gaps”;Filed on Mar. 30, 2004, Ser. No. 60/557,613, entitled “Method and System for Congestion Control based on Optimum Bandwidth Allocation in a Fibre Channel Switch”;Filed on Sep. 23, 2003, Ser. No. 60/505,075, entitled “Method and System for Programmable Data Dependent Network Routing”;Filed on Sep. 19, 2003, Ser. No. 60/504,950, entitled “Method and System for Power Control of Fibre Channel Switches”;Filed on Dec. 29, 2003, Ser. No. 60/532,967, entitled “Method and System for Buffer to Buffer Credit recovery in Fibre Channel Systems Using Virtual and/or Pseudo Virtual Lane”Filed on Dec. 29, 2003, Ser. No. 60/532,966, entitled “Method And System For Using Extended Fabric Features With Fibre Channel Switch Elements”Filed on Mar. 4, 2004, Ser. No. 60/550,250, entitled “Method And System for Programmable Data Dependent Network Routing”Filed on May 7, 2004, Ser. No. 60/569,436, entitled “Method And System For Congestion Control In A Fibre Channel Switch”Filed on May 18, 2004, Ser. No. 60/572,197, entitled “Method and System for Configuring Fibre Channel Ports” andFiled on Dec. 29, 2003, Ser. No. 60/532,963 entitled “Method and System for managing Traffic in Fibre Channel Switches”. The disclosure of the foregoing applications is incorporated herein by reference in their entirety.

US Referenced Citations (385)
Number Name Date Kind
4081612 Hafner Mar 1978 A
4162375 Schilichte Jul 1979 A
4200929 Davidjuk et al. Apr 1980 A
4258418 Heath Mar 1981 A
4344132 Dixon et al. Aug 1982 A
4382159 Bowditch May 1983 A
4425640 Philip et al. Jan 1984 A
4546468 Christmas et al. Oct 1985 A
4569043 Simmons et al. Feb 1986 A
4691296 Struger Sep 1987 A
4716561 Angell et al. Dec 1987 A
4725835 Schreiner et al. Feb 1988 A
4821034 Anderson et al. Apr 1989 A
4860193 Bentley et al. Aug 1989 A
4964119 Endo et al. Oct 1990 A
4980857 Walter et al. Dec 1990 A
5025370 Koegel et al. Jun 1991 A
5051742 Hullett et al. Sep 1991 A
5090011 Fukuta et al. Feb 1992 A
5115430 Hahne et al. May 1992 A
5144622 Takiyasu et al. Sep 1992 A
5258751 DeLuca et al. Nov 1993 A
5260933 Rouse Nov 1993 A
5260935 Turner Nov 1993 A
5280483 Kamoi et al. Jan 1994 A
5291481 Doshi et al. Mar 1994 A
5339311 Turner Aug 1994 A
5367520 Cordell Nov 1994 A
5390173 Spinney et al. Feb 1995 A
5425022 Clark et al. Jun 1995 A
5537400 Diaz et al. Jul 1996 A
5568165 Kimura Oct 1996 A
5568167 Galbi et al. Oct 1996 A
5579443 Tatematsu et al. Nov 1996 A
5590125 Acampora et al. Dec 1996 A
5594672 Hicks Jan 1997 A
5598541 Malladi Jan 1997 A
5610745 Bennett Mar 1997 A
5623492 Teraslinna Apr 1997 A
5638518 Malladi Jun 1997 A
5666483 McClary Sep 1997 A
5677909 Heide Oct 1997 A
5687172 Cloonan et al. Nov 1997 A
5687387 Endejan et al. Nov 1997 A
5701416 Thorson et al. Dec 1997 A
5706279 Teraslinna Jan 1998 A
5732206 Mendel Mar 1998 A
5748612 Stoevhase et al. May 1998 A
5751710 Crowther et al. May 1998 A
5757771 Li et al. May 1998 A
5764927 Murphy et al. Jun 1998 A
5768271 Seid et al. Jun 1998 A
5768533 Ran Jun 1998 A
5784358 Smith et al. Jul 1998 A
5790545 Holt et al. Aug 1998 A
5790840 Bulka et al. Aug 1998 A
5812525 Teraslinna Sep 1998 A
5818842 Burwell et al. Oct 1998 A
5821875 Lee et al. Oct 1998 A
5822300 Johnson et al. Oct 1998 A
5825748 Barkey et al. Oct 1998 A
5828475 Bennett et al. Oct 1998 A
5835748 Orenstein et al. Nov 1998 A
5835752 Chiang et al. Nov 1998 A
5850386 Anderson et al. Dec 1998 A
5892604 Yamanaka et al. Apr 1999 A
5894560 Carmichael et al. Apr 1999 A
5925119 Maroney Jul 1999 A
5936442 Liu et al. Aug 1999 A
5954796 McCarty et al. Sep 1999 A
5974547 Klimenko Oct 1999 A
5978359 Caldara et al. Nov 1999 A
5978379 Chan et al. Nov 1999 A
5987028 Yang et al. Nov 1999 A
5999528 Chow et al. Dec 1999 A
6009226 Tsuji et al. Dec 1999 A
6011779 Wills Jan 2000 A
6014383 McCarty Jan 2000 A
6021128 Hosoya et al. Feb 2000 A
6026092 Abu-Amara et al. Feb 2000 A
6031842 Trevitt et al. Feb 2000 A
6046979 Bauman Apr 2000 A
6047323 Krause Apr 2000 A
6055618 Thorson Apr 2000 A
6061360 Miller et al. May 2000 A
6081512 Muller et al. Jun 2000 A
6108738 Chambers et al. Aug 2000 A
6108778 LaBerge Aug 2000 A
6118776 Berman Sep 2000 A
6118791 Fichou et al. Sep 2000 A
6128292 Kim et al. Oct 2000 A
6131123 Hurst et al. Oct 2000 A
6134127 Kirchberg Oct 2000 A
6144668 Bass et al. Nov 2000 A
6147976 Shand et al. Nov 2000 A
6148421 Hoese et al. Nov 2000 A
6151644 Wu Nov 2000 A
6158014 Henson Dec 2000 A
6160813 Banks et al. Dec 2000 A
6185203 Berman Feb 2001 B1
6201787 Baldwin et al. Mar 2001 B1
6209089 Selitrennikoff et al. Mar 2001 B1
6229822 Chow et al. May 2001 B1
6230276 Hayden May 2001 B1
6240096 Book May 2001 B1
6252891 Perches Jun 2001 B1
6253267 Kim et al. Jun 2001 B1
6278708 Von Hammerstein et al. Aug 2001 B1
6286011 Velamuri et al. Sep 2001 B1
6289002 Henson et al. Sep 2001 B1
6301612 Selitrennikoff et al. Oct 2001 B1
6307857 Yokoyama et al. Oct 2001 B1
6308220 Mathur Oct 2001 B1
6311204 Mills Oct 2001 B1
6324181 Wong et al. Nov 2001 B1
6330236 Ofek et al. Dec 2001 B1
6333932 Kobayasi et al. Dec 2001 B1
6335935 Kadambi et al. Jan 2002 B2
6339813 Smith et al. Jan 2002 B1
6353612 Zhu et al. Mar 2002 B1
6370605 Chong Apr 2002 B1
6397360 Bruns May 2002 B1
6401128 Stai et al. Jun 2002 B1
6404749 Falk Jun 2002 B1
6411599 Blanc et al. Jun 2002 B1
6411627 Hullett et al. Jun 2002 B1
6418477 Verma Jul 2002 B1
6421342 Schwartz et al. Jul 2002 B1
6421711 Blumenau et al. Jul 2002 B1
6424658 Mathur Jul 2002 B1
6438628 Messerly et al. Aug 2002 B1
6449274 Holden et al. Sep 2002 B1
6452915 Jorgensen Sep 2002 B1
6467008 Gentry et al. Oct 2002 B1
6470026 Pearson et al. Oct 2002 B1
6480500 Erimli et al. Nov 2002 B1
6509988 Saito Jan 2003 B1
6522656 Gridley Feb 2003 B1
6532212 Soloway et al. Mar 2003 B1
6553036 Miller et al. Apr 2003 B1
6563796 Saito May 2003 B1
6570850 Gutierrez et al. May 2003 B1
6570853 Johnson et al. May 2003 B1
6594231 Byham et al. Jul 2003 B1
6597691 Anderson et al. Jul 2003 B1
6606690 Padovano Aug 2003 B2
6614796 Black et al. Sep 2003 B1
6622206 Kanamaru et al. Sep 2003 B1
6625157 Niu et al. Sep 2003 B2
6629161 Matsuki et al. Sep 2003 B2
6643298 Brunheroto et al. Nov 2003 B1
6657962 Barri et al. Dec 2003 B1
6684209 Ito et al. Jan 2004 B1
6697359 George Feb 2004 B1
6697368 Chang et al. Feb 2004 B2
6697914 Hospodor et al. Feb 2004 B1
6700877 Lorenz et al. Mar 2004 B1
6718497 Whitby-Strevens Apr 2004 B1
6738381 Agnevik et al. May 2004 B1
6744772 Eneboe et al. Jun 2004 B1
6760302 Ellinas et al. Jul 2004 B1
6765871 Knobel et al. Jul 2004 B1
6779083 Ito et al. Aug 2004 B2
6785241 Lu et al. Aug 2004 B1
6807181 Weschler Oct 2004 B1
6816492 Turner et al. Nov 2004 B1
6816750 Klaas Nov 2004 B1
6859435 Lee et al. Feb 2005 B1
6865155 Wong et al. Mar 2005 B1
6865157 Scott et al. Mar 2005 B1
6888831 Hospodor et al. May 2005 B1
6901072 Wong May 2005 B1
6904507 Gil Jun 2005 B2
6922408 Bloch et al. Jul 2005 B2
6928470 Hamlin Aug 2005 B1
6934799 Acharya et al. Aug 2005 B2
6941357 Nguyen et al. Sep 2005 B2
6941482 Strong Sep 2005 B2
6947393 Hooper, III Sep 2005 B2
6952659 King et al. Oct 2005 B2
6968463 Pherson et al. Nov 2005 B2
6975627 Parry et al. Dec 2005 B1
6983342 Helenic et al. Jan 2006 B2
6987768 Kojima et al. Jan 2006 B1
6988130 Blumenau et al. Jan 2006 B2
6988149 Odenwald Jan 2006 B2
7000025 Wilson Feb 2006 B1
7002926 Eneboe et al. Feb 2006 B1
7010607 Bunton Mar 2006 B1
7024410 Ito et al. Apr 2006 B2
7031615 Genrile Apr 2006 B2
7039070 Kawakatsu May 2006 B2
7039870 Takaoka et al. May 2006 B2
7047326 Crosbie et al. May 2006 B1
7050392 Valdevit May 2006 B2
7051182 Blumenau et al. May 2006 B2
7055068 Riedl May 2006 B2
7061862 Horiguchi et al. Jun 2006 B2
7061871 Sheldon et al. Jun 2006 B2
7076569 Bailey et al. Jul 2006 B1
7082126 Ain et al. Jul 2006 B2
7092374 Gubbi Aug 2006 B1
7110394 Chamdani et al. Sep 2006 B1
7120728 Krakirian et al. Oct 2006 B2
7123306 Goto et al. Oct 2006 B1
7124169 Shimozono et al. Oct 2006 B2
7150021 Vajjhala et al. Dec 2006 B1
7151778 Zhu et al. Dec 2006 B2
7171050 Kim Jan 2007 B2
7185062 Lolayekar et al. Feb 2007 B2
7187688 Garmire et al. Mar 2007 B2
7188364 Volpano Mar 2007 B2
7190667 Susnow et al. Mar 2007 B2
7194538 Rabe et al. Mar 2007 B1
7200108 Beer et al. Apr 2007 B2
7200610 Prawdiuk et al. Apr 2007 B1
7209478 Rojas et al. Apr 2007 B2
7215680 Mullendore et al. May 2007 B2
7221650 Cooper et al. May 2007 B1
7230929 Betker et al. Jun 2007 B2
7233570 Gregg Jun 2007 B2
7233985 Hahn et al. Jun 2007 B2
7239641 Banks et al. Jul 2007 B1
7245613 Winkles et al. Jul 2007 B1
7245627 Goldenberg et al. Jul 2007 B2
7248580 George et al. Jul 2007 B2
7263593 Honda et al. Aug 2007 B2
7266286 Tanizawa et al. Sep 2007 B2
7269131 Cashman et al. Sep 2007 B2
7269168 Roy et al. Sep 2007 B2
7275103 Thrasher et al. Sep 2007 B1
7277431 Walter et al. Oct 2007 B2
7287063 Baldwin et al. Oct 2007 B2
7292593 Winkles et al. Nov 2007 B1
7310389 Waschura et al. Dec 2007 B2
7315511 Morita et al. Jan 2008 B2
7319669 Kunz et al. Jan 2008 B1
7327680 Kloth Feb 2008 B1
7334046 Betker, Steven M. Feb 2008 B1
7346707 Erimli Mar 2008 B1
7352701 Kunz Apr 2008 B1
7352740 Hammons et al. Apr 2008 B2
7362702 Terrell et al. Apr 2008 B2
7397788 Mies et al. Jul 2008 B2
7406034 Cometto et al. Jul 2008 B1
7406092 Dropps et al. Jul 2008 B2
7424533 Di Benedetto et al. Sep 2008 B1
7443794 George et al. Oct 2008 B2
7460534 Ballenger Dec 2008 B1
7466700 Dropps et al. Dec 2008 B2
7471691 Black et al. Dec 2008 B2
7492780 Goolsby Feb 2009 B1
20010011357 Mori Aug 2001 A1
20010022823 Renaud Sep 2001 A1
20010033552 Barrack et al. Oct 2001 A1
20010038628 Ofek et al. Nov 2001 A1
20010043564 Bloch et al. Nov 2001 A1
20020016838 Geluc et al. Feb 2002 A1
20020034178 Schmidt et al. Mar 2002 A1
20020067726 Ganesh et al. Jun 2002 A1
20020071387 Horiguchi et al. Jun 2002 A1
20020103913 Tawil et al. Aug 2002 A1
20020104039 DeRolf et al. Aug 2002 A1
20020118692 Oberman et al. Aug 2002 A1
20020122428 Fan et al. Sep 2002 A1
20020124102 Kramer et al. Sep 2002 A1
20020124124 Matsumoto et al. Sep 2002 A1
20020147560 Devins et al. Oct 2002 A1
20020147843 Rao Oct 2002 A1
20020156918 Valdevit et al. Oct 2002 A1
20020159385 Susnow et al. Oct 2002 A1
20020172195 Pekkala et al. Nov 2002 A1
20020174197 Schimke et al. Nov 2002 A1
20020191602 Woodring et al. Dec 2002 A1
20020194294 Blumenau et al. Dec 2002 A1
20020196773 Berman Dec 2002 A1
20030002516 Boock et al. Jan 2003 A1
20030016683 George et al. Jan 2003 A1
20030021239 Mullendore et al. Jan 2003 A1
20030026267 Oberman et al. Feb 2003 A1
20030026287 Mullendore et al. Feb 2003 A1
20030033487 Pfister et al. Feb 2003 A1
20030035433 Craddock et al. Feb 2003 A1
20030037159 Zhao et al. Feb 2003 A1
20030046396 Richter et al. Mar 2003 A1
20030063567 Dehart Apr 2003 A1
20030072316 Niu et al. Apr 2003 A1
20030076788 Grabauskas et al. Apr 2003 A1
20030079019 Lolayekar et al. Apr 2003 A1
20030084219 Yao et al. May 2003 A1
20030086377 Berman May 2003 A1
20030091062 Lay et al. May 2003 A1
20030093607 Main et al. May 2003 A1
20030103451 Lutgen et al. Jun 2003 A1
20030112819 Kofoed et al. Jun 2003 A1
20030115355 Cometto et al. Jun 2003 A1
20030117961 Chuah et al. Jun 2003 A1
20030118053 Edsall et al. Jun 2003 A1
20030120743 Coatney et al. Jun 2003 A1
20030120791 Weber et al. Jun 2003 A1
20030120983 Vieregge et al. Jun 2003 A1
20030126223 Jenne et al. Jul 2003 A1
20030126242 Chang Jul 2003 A1
20030131105 Czeiger et al. Jul 2003 A1
20030137941 Kaushik et al. Jul 2003 A1
20030139900 Robison Jul 2003 A1
20030152076 Lee et al. Aug 2003 A1
20030172149 Edsall et al. Sep 2003 A1
20030172239 Swank Sep 2003 A1
20030174652 Ebata Sep 2003 A1
20030174721 Black et al. Sep 2003 A1
20030174789 Waschura et al. Sep 2003 A1
20030179709 Huff Sep 2003 A1
20030179748 George et al. Sep 2003 A1
20030179755 Fraser Sep 2003 A1
20030189930 Terrell et al. Oct 2003 A1
20030189935 Warden et al. Oct 2003 A1
20030191857 Terell et al. Oct 2003 A1
20030191883 April Oct 2003 A1
20030195983 Krause Oct 2003 A1
20030198238 Westby Oct 2003 A1
20030200315 Goldenberg et al. Oct 2003 A1
20030218986 DeSanti et al. Nov 2003 A1
20030229808 Heintz et al. Dec 2003 A1
20040013088 Gregg Jan 2004 A1
20040013092 Betker et al. Jan 2004 A1
20040013113 Singh et al. Jan 2004 A1
20040013125 Betker et al. Jan 2004 A1
20040015638 Forbes Jan 2004 A1
20040024831 Yang et al. Feb 2004 A1
20040027989 Martin et al. Feb 2004 A1
20040028038 Anderson et al. Feb 2004 A1
20040054776 Klotz et al. Mar 2004 A1
20040054866 Blumenau et al. Mar 2004 A1
20040057389 Klotz et al. Mar 2004 A1
20040064664 Gil Apr 2004 A1
20040081186 Warren et al. Apr 2004 A1
20040081196 Elliott Apr 2004 A1
20040081394 Biren et al. Apr 2004 A1
20040085955 Walter et al. May 2004 A1
20040085974 Mies et al. May 2004 A1
20040085994 Warren et al. May 2004 A1
20040092278 Diepstraten et al. May 2004 A1
20040100944 Richmond et al. May 2004 A1
20040109418 Fedorkow et al. Jun 2004 A1
20040123181 Moon et al. Jun 2004 A1
20040125799 Buer Jul 2004 A1
20040141518 Milligan et al. Jul 2004 A1
20040141521 George Jul 2004 A1
20040151188 Maveli et al. Aug 2004 A1
20040153526 Haun et al. Aug 2004 A1
20040153566 Lalsangi et al. Aug 2004 A1
20040153863 Klotz et al. Aug 2004 A1
20040153914 El-Batal Aug 2004 A1
20040174813 Kasper et al. Sep 2004 A1
20040202189 Arndt et al. Oct 2004 A1
20040208201 Otake Oct 2004 A1
20040218531 Cherian et al. Nov 2004 A1
20040267982 Jackson et al. Dec 2004 A1
20050018673 Dropps et al. Jan 2005 A1
20050023656 Leedy Feb 2005 A1
20050036485 Eilers et al. Feb 2005 A1
20050036499 Dutt et al. Feb 2005 A1
20050036763 Kato et al. Feb 2005 A1
20050047334 Paul et al. Mar 2005 A1
20050073956 Moores et al. Apr 2005 A1
20050076113 Klotz et al. Apr 2005 A1
20050088969 Carlsen et al. Apr 2005 A1
20050099970 Halliday May 2005 A1
20050108444 Flauaus et al. May 2005 A1
20050111845 Nelson et al. May 2005 A1
20050117522 Basavaiah et al. Jun 2005 A1
20050177641 Yamagami Aug 2005 A1
20050198523 Shanbhag et al. Sep 2005 A1
20060013248 Mujeeb et al. Jan 2006 A1
20060034192 Hurley et al. Feb 2006 A1
20060034302 Peterson Feb 2006 A1
20060047852 Shah et al. Mar 2006 A1
20060074927 Sullivan et al. Apr 2006 A1
20060107260 Motta May 2006 A1
20060143300 See et al. Jun 2006 A1
20060184711 Pettey et al. Aug 2006 A1
20060203725 Paul et al. Sep 2006 A1
20060274744 Nagai et al. Dec 2006 A1
20070206502 Martin et al. Sep 2007 A1
Foreign Referenced Citations (5)
Number Date Country
0649098 Sep 1994 EP
0856969 Jan 1998 EP
WO-9836537 Aug 1998 WO
WO-0195566 Dec 2001 WO
WO03088050 Oct 2003 WO
Related Publications (1)
Number Date Country
20050044267 A1 Feb 2005 US
Provisional Applications (19)
Number Date Country
60503812 Sep 2003 US
60537933 Jan 2004 US
60488757 Jul 2003 US
60532965 Dec 2003 US
60504038 Sep 2003 US
60495212 Aug 2003 US
60495165 Aug 2003 US
60503809 Sep 2003 US
60505381 Sep 2003 US
60505195 Sep 2003 US
60557613 Mar 2004 US
60505075 Sep 2003 US
60504950 Sep 2003 US
60532967 Dec 2003 US
60532966 Dec 2003 US
60550250 Mar 2004 US
60569436 May 2004 US
60572197 May 2004 US
60532963 Dec 2003 US