The invention relates generally to network congestion and flow control.
In a bridged network environment, two networks are interconnected by either a bridge (or a router). When one network transmits into the other network, the bridge stores the traffic from that network in buffers until the bridge has an opportunity to transmit the buffered traffic into the other network. Typically, when the buffers in the bridge reach a certain threshold of fullness, i.e., when congestion occurs, e.g., because the transmitting network is operating at a higher speed than the other (receiving) network or the receiving network is heavily congested, the bridge uses one of two techniques to “flow control” further traffic that the transmitting network wishes to transmit to the other network. First, the bridge can transmit to the transmitting network a frame having an illegally long length. Such transmission has the effect of slowing down the traffic from that network, giving the bridge time to unload its buffers. Second, the bridge can transmit a “jam packet” in response to a frame from a node in the transmitting network, thus causing that node to re-transmit using its exponential back-off algorithm. Again, the effect on the bridge being that the bridge has gained time to unload its buffers.
In powerline network applications, however, these techniques are problematic. Current powerline modem device implementations discard any “illegally long” frame from the bridge because the length of that frame exceeds a defined maximum length. Also, the transmitted jam packet is too short in length to be received by any device on a power line network. Thus, both techniques have no effect on flow control of the transmitting network when the transmitting network is a powerline network.
In one aspect, the invention provides methods and apparatus, including computer program products, for performing flow control in a network. The methods include: (i) detecting receipt of a jam packet from a bridge device in response to an attempt to transmit a frame received from a node in a network of nodes to the bridge device; and (ii) for a predetermined time interval, causing a fail response to be transmitted to the network for the frame and any subsequent frames transmitted by any of the nodes when such frames are of the type for which a response is expected.
Embodiments of the invention may include one or more of the following features.
Causing the fail response to be transmitted to the network can include asserting a fail response override signal when the receipt of the jam packet is detected, setting a fail response override timer to time the predetermined time interval and de-asserting the fail response override signal upon expiration of the fail response override signal.
Causing the fail response to be transmitted to the network can further include determining if a frame transmitted by one of the nodes is a unicast frame for which a response is expected and determining if the fail response override signal is asserted.
A fail response can be transmitted if it is determined that the frame is a unicast frame for which a response is expected and that the fail response override signal is asserted. Otherwise, a response can be sent in accordance with ARQ protocol.
The network of nodes can be a powerline network.
The nodes in the network can operate according to HomePlug 1.0 Specification protocols.
The jam packet can be received over a Media Independent Interface bus.
The bridge device can be a host computer that executes a bridge application.
Particular implementations of the invention may provide one or more of the following advantages.
The fail response override mechanism allows the bridge device the time to mitigate the congestion conditions that gave rise to the transmission of the jam packet. It is particularly useful in a powerline network, as the jam packet might be dropped (thus having no impact on flow control) or, if it is transmitted onto the powerline network, still having no effect on flow control as it may be too short to be received.
Other features and advantages of the invention will be apparent from the following detailed description and from the claims.
Referring to
In the environment 10, the first network 12 transmits traffic through the bridge device 16 to the second network 14. When the first network 12 transmits into the second network 14, the bridge device 16 stores the traffic from the first network 12 in buffers until the bridge device 16 has an opportunity to transmit the buffered traffic into the second network 14. The second network 14 may be operating at a lower speed than the first network 12 or become heavily congested. Under such conditions, the bridge device 16 may be unable to empty its buffers fast enough to accommodates incoming traffic from the first network 12. If the bridge device 16 is unable to empty its buffers and the buffers in the bridge device 16 reach a certain threshold of fullness, the bridge device itself becomes congested and exerts back pressure on the first network 12.
Referring to
The host unit 30 is intended to represent any device that uses one of the units 32, 34 to communicate with any node on the PL network 12 or the Ethernet network 14. Preferrably, the host unit 30 is coupled to both of units 32, 34 by a Media Independent Interface (MII) compatible bus. That is, the host unit 30 is connected to the PL modem 32 by a first MII bus 54 and is connected to the PHY unit 34 by a second MII bus 56. The first MII bus 54 includes separate TX and RX lines 54a and 54b, respectively. Likewise, the second MII bus 56 includes TX and RX lines 56a and 56b, respectively. Each of the units 32, 34 includes a MII bus interface, respective interfaces 43 and 60.
In the embodiment shown, the host unit 30 further includes an 802.3 MAC device with an MII interface 62. It will be appreciated that the 802.3 MAC portion of the unit 62 could be integrated with the PHY unit 34. Because the 802.3 MAC and PHY functionality can be partitioned in different ways, the actual implementation of units 62 and 34 may be a matter of design choice or driven by the choice of particular commercially available Ethernet chips, e.g., a MAC controller chip with a built-in MII interface, or separate MAC and PHY chips with integrated MII interfaces.
With reference to the PL modem 32, preferably the MAC unit 42 and PHY unit 44 may conform to the Open System Interconnect (OSI) Model. More particularly, the MAC unit 42 may conform to the OSI Model's data link MAC sublayer and the PHY layer unit 44 to the OSI Model's physical layer. The MAC unit 42 performs data encapsulation/decapsulation, as well as media access management for transmit (TX) and receive (RX) functions. Preferably, the MAC unit 42 employs a collision avoidance medium access control scheme like carrier sense multiple access with collision avoidance (CSMA/CA) as described by the IEEE 802.11 standard, although other suitable MAC protocols of the collision avoidance type or other MAC protocol types may be used. The MAC unit 42 also provides Automatic Repeat request (ARQ) protocol support. The PHY unit 44 performs transmit encoding and receive decoding, modulation/demodulation, among other functions.
The unit of communication exchanged between nodes is in the form of a protocol data unit (“PDU”), also referred to as a packet or frame. The PDU may include data, i.e., payload (or MAC frame), in conjunction with a delimiter, or a delimiter by itself. The delimiter is a combination of preamble and frame control information. A MAC Service Data Unit (MSDU) refers to any information that the MAC unit 42 has been tasked to transport by upper protocol layers (e.g., OSI layers to which the OSI MAC layer provides services), along with any management information supplied by the MAC unit 42. The payload has a maximum length in time (for latency considerations) and a varying byte capacity determined by length and channel conditions. Therefore, the payload may have the capacity to contain an entire MSDU or only a segment of the MSDU.
Preferably, packets are transmitted and received by the PHY layer unit 44, as well as processed by the MAC unit 42, in accordance with techniques and formats described in U.S. Pat. No. 6,397,368, entitled “Forward Error Correction With Channel Estimation,” in the name of Lawrence W. Yonge III et al., U.S. Pat. No. 6,442,129 entitled “Enhanced Channel Estimation,” in the name of Lawrence W. Yonge III et al., U.S. Pat. No. 6,289,000, entitled “Frame Control Encoder/Decoder for Robust OFDM Frame Transmissions,” in the name of Lawrence W. Yonge III, co-pending U.S. patent application Ser. No. 09/632,303, entitled “Media Access Control Protocol With Priority and Contention-Free Intervals,” in the name of Lawrence W. Yonge III, co-pending U.S. patent application Ser. No. 10/180,175, entitled “A Communication Buffer Scheme Optimized for VOIP, QOS and Data Networking Over a Power Line,” in the name of James Philip Patella et al. , U.S. Pat. No. 6,278,685, entitled “Robust Transmission Mode”, in the name of Lawrence W. Yonge III et al., and the HomePlug 1.0 Specification, all of which are incorporated herein by reference; however, other techniques may be used.
Preferably, the MAC unit 42 supports standard MAC functions, such as framing, as well as ensures Quality of Service and provides for reliable frame delivery through a number of different mechanisms such as those described in the above-referenced application Ser. No. 09/632,303. For example, it can support rate adaptive PHY characteristics and channel estimation control between each transmitter/receiver to establish PHY modulation parameters that are optimized for channel conditions in each direction.
Also, as mentioned above, ARQ is used to ensure delivery for unicast transmissions. The receipt of certain frame types requires acknowledgment by the receiver and ARQ uses different types of acknowledgments. The acknowledgment can be positive or negative depending on the status of the received frame. A correctly addressed frame with a valid PHY frame Check Sequence causes the MAC unit 42 to transmit a positive acknowledgment (or “ACK”) response to the originator. Transmitting nodes attempt error recovery by retransmitting frames that are known or are inferred to have failed. Failures occur due to collisions or bad channel conditions, or lack of sufficient resources at the receiver. Transmissions are known to have failed if a “NACK” (in the case of bad channel conditions) or “FAIL” (in the case of insufficient resources) response is received. Transmissions are inferred to have failed for some other reason (for example, due to collisions) if no response, that is, no ACK, NACK, FAIL or other defined response types not discussed herein, is received when one is expected.
As mentioned above, the MAC unit 42 supports segmentation/reassembly. The process of partitioning MSDUs from the host into smaller MAC frames or segments is referred to as segmentation. The reverse process is called reassembly. Segmentation improves chances of frame delivery over harsh channels and contributes to better latency characteristics for stations of higher priority. All forms of addressed delivery (unicast, multicast, broadcast) may be subject to segmentation. An MSDU arriving at the MAC unit 42 is placed in one or more segments depending on the size of the MSDU and the data rate the link will sustain. Every effort is made to transmit all of the segments of a single MSDU in a single, continuous burst of MAC frames. Acknowledgments and retransmissions occur independently for each segment.
Referring to
The MAC unit 42 further includes a PHY interface 80 for coupling to the PHY unit 44 and a Host Interface, implemented as the MII interface 43 (from
During receives, the link sequencer 74 receives RX segments which can be RX encrypted segments (RES). It parses frame control information of any incoming segments, as well as receives the body of any incoming segments, saves information about the channel characteristics and reassembles the RES. The link sequencer 74 accumulates segments until an entire frame is assembled. All segments are reassembled prior to decryption to extract the MSDU. The MSDU or RX encrypted frame (REF) or RX cleartext frame (RCF) is then passed to the decryption unit 72.
The decryption unit 72 receives the reassembled frame from the link sequencer 74 and, if the frame is encrypted, retrieves an appropriate network encryption key and decrypts the frame to generate the RCF. The decryption unit 72 determines if there are any errors in the RCF. If there are no errors detected by the decryption unit 72 for the RCF, the decryption unit 72 provides the RCF to the MAC processing unit 70.
The MAC processing unit 70 parses and processes the cleartext frame body. It determines the type of frame body from the type value specified in the first occurring type field. If the frame data to follow is MSDU data, the type field and the frame data, along with the DA field and the SA field, are provided to the host unit 30 (
During transmits, the MAC processing unit 70 operates on requests made by the host unit 30. The encryption unit 72 performs an encryption process on any MSDUs (processed by the MAC processing unit 70) that require encryption. Once encrypted, the link sequencer 74 segments MSDUs by partitioning the frame body into segments based on a maximum segment (or frame) size (or other parameters) until the last segment. The link sequencer 74 also initiates a transmission or transmission attempt, as well as subsequent transmission retries, as necessary.
Still referring to
The MII is an industry standard, interoperable interface between MAC and PHY sublayers. It consists of separate 4-bit data paths for transmit and receive data along with carrier sense and collision detection. Data is transferred over each 4-bit data path synchronous with a clock signal supplied to the unit 62 by the MAC unit 42. Further details of the MII can be found in the IEEE 802.3u Standard. The MII behaves much like an Ethernet interface without the physical layer.
Commercially available Ethernet MAC controller devices can be programmed to invoke Ethernet flow control whenever buffers are not available to receive a new host RX frame. Such devices send a jam frame in half-duplex mode over the MII (more specifically, the TX bus lines) whenever a new RX frame is detected and no host buffers are available.
Referring back to
Because the mere transmission of a jam packet over the PL 20 may not result in such a desired flow control activity, the MAC processing unit 70 and link sequencer 74 are adapted to use control information in the control block 92, more specifically, the OB 96 and override timer 98, to effect a slow down in transmissions from the PL network 12 when a node on that network results in the transmission of a jam frame by the host unit 30.
In particular, the MAC processing unit 70 includes “jam detect” logic 100 to sense a “jam packet” (defined as a short packet, approximately 68 bits of alternating ones and zeroes) from the host unit 30.
Thus, upon sensing a jam packet, the logic 100 asserts the FAIL response override indicator 96 and starts the override timer 98 running for some predefined duration. The jam packet transmission is based on a buffer threshold. It keeps extending the timer value (duration) with each detected jam until the override timer 98 expires. The duration corresponds to a predefined timer value (e.g., ˜20 ms default value). When the override timer 98 expires, the logic 100 resets the FAIL response override indicator 96. When the OB 96 is set, and the RX process 90 is processing a unicast frame for which a response is expected, the RX process automatically sends a FAIL response to the transmitting node on the PL network 12; otherwise, the RX process 90 provide FAIL responses under normal conditions, as will be described.
Referring to
The process 90 determines if the destination address (DA) is valid (step 130). If the DA is valid, the process determines if an RX buffer is available (step 132). If buffer space is available, the process determines if the segment is received in error by checking the FEC error flag and determining if a calculated CRC is not equal to the FCS (step 134) and, if valid and a response is requested, the process prepares and directs the transmission of an ACK response (step 136). The process determines if additional segments are to be received as part of a segmented frame (step 138). If no more segments are to be received, the process indicates successful frame reception (to the other RX processes) (step 140) and proceeds to carrier sense monitoring and synchronization signal searching of step 122.
Still referring to
Otherwise, and returning to step 128, if it is determined at step 128 that the conditions (unicast with response expected and OB set) are met, the process 90 determines if the DA is valid (step 154). If the DA is determined not to be valid (at step 154), the process 90 discards the frame or segment (at step 144). If the DA is determined to be valid (at step 154), the process 90 transmits a FAIL response (step 156). By doing so, the process 90 makes it appear to the transmitting node as though resources are not available, thus causing the transmitting node to take appropriate action. In response to the FAIL response, the transmitting node may attempt to re-transmit the frame (to which the FAIL response responded) at a later time, or, under certain conditions (for example, if a frame lifetime timer times out), simply discard the frame. Exemplary activities of a transmitting node that receives a FAIL response are described in the above-referenced U.S. application Ser. No. 09/632,303. After transmitting the FAIL response, the process 90 proceeds to step 144.
A requirement of this override mechanism is that the bridge application 38 have sufficient buffer capacity in the buffers 40 after sending the jam packet to process some additional number of frames from the first network 12 to account for latency.
This override response mechanism gives the bridge application 38 time to unload its buffers by sending pending frames intended for the second network 14 to the second network 14. Frames (multi-cast or unicast) received from the first network 12 that do not expect a response will be accepted and processed by the link sequencer 74, but may be dropped by the host unit 30 if the host unit 30 does not have available buffer capacity.
Other control information that does not directly pertain to the congestion control, for example, control information related to channel access contention, has been omitted herein. Preferably, channel access contention, and other aspects of operation not described herein, may be implemented according to techniques described in the above-referenced U.S. patent application Ser. No. 09/632,303 or the HomePlug 1.0 Specification. Other techniques may be used as well.
It is to be understood that while the invention has been described in conjunction with the detailed description thereof, the foregoing description is intended to illustrate and not limit the scope of the invention, which is defined by the scope of the appended claims. Other embodiments are within the scope of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
3806885 | Moore | Apr 1974 | A |
4569044 | Tao et al. | Feb 1986 | A |
4581734 | Olson et al. | Apr 1986 | A |
4630261 | Irvin | Dec 1986 | A |
4677612 | Olson et al. | Jun 1987 | A |
4682324 | Ulug | Jul 1987 | A |
4720850 | Oberlander et al. | Jan 1988 | A |
4726018 | Bux et al. | Feb 1988 | A |
4792947 | Takiyasu et al. | Dec 1988 | A |
4819229 | Pritty et al. | Apr 1989 | A |
4881241 | Pommier et al. | Nov 1989 | A |
4943959 | Arnold | Jul 1990 | A |
5001472 | Fischer et al. | Mar 1991 | A |
5003539 | Takemoto et al. | Mar 1991 | A |
5046069 | Calvignac et al. | Sep 1991 | A |
5081678 | Kaufman et al. | Jan 1992 | A |
5105423 | Tanaka et al. | Apr 1992 | A |
5121396 | Irvin et al. | Jun 1992 | A |
5140584 | Suzuki | Aug 1992 | A |
5157659 | Schenkel | Oct 1992 | A |
5197061 | Halbert-Lassalle et al. | Mar 1993 | A |
5214646 | Yacoby | May 1993 | A |
5228025 | Le Floch et al. | Jul 1993 | A |
5231634 | Giles et al. | Jul 1993 | A |
5274629 | Helard et al. | Dec 1993 | A |
5280480 | Pitt et al. | Jan 1994 | A |
5307376 | Castelain et al. | Apr 1994 | A |
5339313 | Ben-Michael et al. | Aug 1994 | A |
5343473 | Cidon et al. | Aug 1994 | A |
5384777 | Ahmadi et al. | Jan 1995 | A |
5416801 | Chouly et al. | May 1995 | A |
5426646 | Slack | Jun 1995 | A |
RE35001 | Grow | Jul 1995 | E |
5432848 | Butter et al. | Jul 1995 | A |
5436905 | Li et al. | Jul 1995 | A |
5448565 | Chang et al. | Sep 1995 | A |
5452288 | Rahuel et al. | Sep 1995 | A |
5452322 | Lauer | Sep 1995 | A |
5473602 | McKenna et al. | Dec 1995 | A |
5481535 | Hershey | Jan 1996 | A |
5483529 | Baggen et al. | Jan 1996 | A |
5488632 | Mason et al. | Jan 1996 | A |
5504747 | Sweazey | Apr 1996 | A |
5515379 | Crisler et al. | May 1996 | A |
5524027 | Huisken | Jun 1996 | A |
5537414 | Takiyasu et al. | Jul 1996 | A |
5541922 | Pyhalammi | Jul 1996 | A |
5548649 | Jacobson | Aug 1996 | A |
5555268 | Fattouche et al. | Sep 1996 | A |
5563883 | Cheng | Oct 1996 | A |
5563897 | Pyndiah et al. | Oct 1996 | A |
5568476 | Sherer et al. | Oct 1996 | A |
5610908 | Shelswell et al. | Mar 1997 | A |
5612975 | Becker et al. | Mar 1997 | A |
5615212 | Ruszczyk et al. | Mar 1997 | A |
5619651 | Young | Apr 1997 | A |
5623512 | Sasaki | Apr 1997 | A |
5627829 | Gleeson et al. | May 1997 | A |
5629948 | Hagiwara et al. | May 1997 | A |
5636230 | Marturano et al. | Jun 1997 | A |
5644576 | Bauchot et al. | Jul 1997 | A |
5651009 | Perreault et al. | Jul 1997 | A |
5694389 | Seki et al. | Dec 1997 | A |
5706348 | Gray et al. | Jan 1998 | A |
5717689 | Ayanoglu | Feb 1998 | A |
5732113 | Schmidl et al. | Mar 1998 | A |
5737330 | Fulthorp et al. | Apr 1998 | A |
5745769 | Choi | Apr 1998 | A |
5757766 | Sugita | May 1998 | A |
5757770 | Lagoutte et al. | May 1998 | A |
5764931 | Schmahl et al. | Jun 1998 | A |
5771235 | Tang et al. | Jun 1998 | A |
5787071 | Basso et al. | Jul 1998 | A |
5790541 | Patrick et al. | Aug 1998 | A |
5793307 | Perreault et al. | Aug 1998 | A |
5799033 | Baggen | Aug 1998 | A |
5812599 | Van Kerckhove | Sep 1998 | A |
5818821 | Schurig | Oct 1998 | A |
5818826 | Gfeller et al. | Oct 1998 | A |
5825807 | Kumar | Oct 1998 | A |
5828677 | Sayeed et al. | Oct 1998 | A |
5841778 | Shaffer et al. | Nov 1998 | A |
5841873 | Lockhart et al. | Nov 1998 | A |
5884040 | Chung | Mar 1999 | A |
5886993 | Ruszczyk et al. | Mar 1999 | A |
5892769 | Lee | Apr 1999 | A |
5896561 | Schrader et al. | Apr 1999 | A |
5903614 | Suzuki et al. | May 1999 | A |
5914932 | Suzuki et al. | Jun 1999 | A |
5914959 | Marchetto et al. | Jun 1999 | A |
5940399 | Weizman | Aug 1999 | A |
5940438 | Poon et al. | Aug 1999 | A |
5948060 | Gregg et al. | Sep 1999 | A |
5956338 | Ghaibeh | Sep 1999 | A |
5966412 | Ramaswamy | Oct 1999 | A |
5970062 | Bauchot | Oct 1999 | A |
5987011 | Toh | Nov 1999 | A |
6005894 | Kumar | Dec 1999 | A |
6006017 | Joshi et al. | Dec 1999 | A |
6041063 | Povlsen et al. | Mar 2000 | A |
6041358 | Huang et al. | Mar 2000 | A |
6044154 | Kelly | Mar 2000 | A |
6044482 | Wong | Mar 2000 | A |
6052377 | Ohmi et al. | Apr 2000 | A |
6076115 | Sambamurthy et al. | Jun 2000 | A |
6092214 | Quoc et al. | Jul 2000 | A |
6097703 | Larsen et al. | Aug 2000 | A |
6098179 | Harter, Jr. | Aug 2000 | A |
6108713 | Sambamurthy et al. | Aug 2000 | A |
6125150 | Wesel et al. | Sep 2000 | A |
6130887 | Dutta | Oct 2000 | A |
6130894 | Ojard et al. | Oct 2000 | A |
6151296 | Vijayan et al. | Nov 2000 | A |
6169744 | Grabelsky et al. | Jan 2001 | B1 |
6170022 | Linville et al. | Jan 2001 | B1 |
6182147 | Farinacci | Jan 2001 | B1 |
6188717 | Kaiser et al. | Feb 2001 | B1 |
6192397 | Thompson | Feb 2001 | B1 |
6202082 | Tomizawa et al. | Mar 2001 | B1 |
6215792 | Abi-Nassif | Apr 2001 | B1 |
6216244 | Myers et al. | Apr 2001 | B1 |
6222851 | Petry | Apr 2001 | B1 |
6243386 | Chan et al. | Jun 2001 | B1 |
6243449 | Margulis et al. | Jun 2001 | B1 |
6246770 | Stratton et al. | Jun 2001 | B1 |
6252849 | Rom et al. | Jun 2001 | B1 |
6259696 | Yazaki et al. | Jul 2001 | B1 |
6263445 | Blumenau | Jul 2001 | B1 |
6275861 | Chaudri et al. | Aug 2001 | B1 |
6278685 | Yonge, III et al. | Aug 2001 | B1 |
6278716 | Rubenstein et al. | Aug 2001 | B1 |
6289000 | Yonge, III | Sep 2001 | B1 |
6295296 | Tappan | Sep 2001 | B1 |
6334185 | Hansson et al. | Dec 2001 | B1 |
6343083 | Mendelson et al. | Jan 2002 | B1 |
6345310 | Allison et al. | Feb 2002 | B1 |
6363052 | Hosein | Mar 2002 | B1 |
6370156 | Spruyt et al. | Apr 2002 | B2 |
6385672 | Wang et al. | May 2002 | B1 |
6397368 | Yonge, III et al. | May 2002 | B1 |
6421725 | Vermilyea et al. | Jul 2002 | B1 |
6430192 | Creedon et al. | Aug 2002 | B1 |
6430661 | Larson et al. | Aug 2002 | B1 |
6434153 | Yazaki et al. | Aug 2002 | B1 |
6442129 | Yonge, III et al. | Aug 2002 | B1 |
6456649 | Isaksson et al. | Sep 2002 | B1 |
6466580 | Leung | Oct 2002 | B1 |
6469992 | Schieder | Oct 2002 | B1 |
6473435 | Zhou et al. | Oct 2002 | B1 |
6480489 | Muller et al. | Nov 2002 | B1 |
6487212 | Erimli et al. | Nov 2002 | B1 |
6501760 | Ohba et al. | Dec 2002 | B1 |
6519263 | Huth | Feb 2003 | B1 |
6526451 | Kasper | Feb 2003 | B2 |
6538985 | Petry et al. | Mar 2003 | B1 |
6538990 | Prorock | Mar 2003 | B1 |
6553534 | Yonge, III et al. | Apr 2003 | B2 |
6567914 | Just et al. | May 2003 | B1 |
6628613 | Joung et al. | Sep 2003 | B1 |
6654410 | Tzannes | Nov 2003 | B2 |
6667991 | Tzannes | Dec 2003 | B1 |
6671284 | Yonge, III et al. | Dec 2003 | B1 |
6680911 | Kim | Jan 2004 | B1 |
6697358 | Bernstein | Feb 2004 | B2 |
6741561 | Lee | May 2004 | B1 |
6747976 | Bensaou et al. | Jun 2004 | B1 |
6765885 | Jiang et al. | Jul 2004 | B2 |
6778507 | Jalali | Aug 2004 | B1 |
6877043 | Mallory et al. | Apr 2005 | B2 |
6882637 | Le et al. | Apr 2005 | B1 |
6957269 | Williams et al. | Oct 2005 | B2 |
6980520 | Erimli | Dec 2005 | B1 |
7180857 | Kawakami et al. | Feb 2007 | B2 |
20010012319 | Foley | Aug 2001 | A1 |
20010043576 | Terry | Nov 2001 | A1 |
20010048692 | Karner | Dec 2001 | A1 |
20020001314 | Yi et al. | Jan 2002 | A1 |
20020012320 | Ogier et al. | Jan 2002 | A1 |
20020042836 | Mallory | Apr 2002 | A1 |
20020048368 | Gardner | Apr 2002 | A1 |
20020065047 | Moose | May 2002 | A1 |
20020131591 | Henson et al. | Sep 2002 | A1 |
20020191533 | Chini et al. | Dec 2002 | A1 |
20030006883 | Kim et al. | Jan 2003 | A1 |
20030067910 | Razazian et al. | Apr 2003 | A1 |
20030079169 | Ho et al. | Apr 2003 | A1 |
20030133427 | Cimini et al. | Jul 2003 | A1 |
20030174664 | Benveniste | Sep 2003 | A1 |
20030217182 | Liu et al. | Nov 2003 | A1 |
20030231652 | Sprague et al. | Dec 2003 | A1 |
20030231658 | Liang et al. | Dec 2003 | A1 |
Number | Date | Country |
---|---|---|
3413144 | Oct 1985 | DE |
9857440 | Dec 1998 | WO |
WO0072495 | Nov 2000 | WO |
0241598 | May 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20040001440 A1 | Jan 2004 | US |