Application-aware wireless network system and method

Information

  • Patent Grant
  • 7865713
  • Patent Number
    7,865,713
  • Date Filed
    Friday, December 28, 2007
    17 years ago
  • Date Issued
    Tuesday, January 4, 2011
    14 years ago
Abstract
A technique for dynamically responding to threats in a wireless network involves deploying a single network including APs capable of booting from a plurality of software images. Individual APs can switch (or be switched) between multiple sets of software so that network managers can select the AP software most appropriate for a given instance. For example, if a threat is detected, multiple APs can be switched to sensor mode to deal with the threat. As another example, all of the APs can be switched to sensor mode after hours. Alternatively, a server can provide the software image(s) needed for an AP to operate in accordance with a desired functionality.
Description
BACKGROUND

An access point (AP) is a device used by wireless clients to connect to a network. An AP functions as a standalone entity in some implementations and functions in cooperation with distribution hardware in other implementations. Distribution hardware may include a wireless switch used to manage APs and provide network-connectivity to wireless clients. A wireless domain may refer to a group of wireless switches that are configured to exchange relevant information, and using this information make informed decisions. A known device is a station (e.g., a wireless AP or client device) that is part of a network wireless installation. A rogue device is a station that is considered harmful for a network wireless installation because it is, for example, violating policies or hampering wireless access to the network.


A traditional approach to rogue detection has been to (1) use a second set of hardware in addition to APs, or (2) provide an integrated network that provides both data services and rogue detection services. The advantage of the first approach is that a user can select the best devices for the job, though this often results in higher capital and operational expenditures. The second approach saves money by using a single network and point of administration, but the user may have to compromise product feature sets because of the need to use a single vendor.


These are but a subset of the problems and issues associated with wireless access point authentication, and are intended to characterize weaknesses in the prior art by way of example. The foregoing examples of the related art and limitations related therewith are intended to be illustrative and not exclusive. Other limitations of the related art will become apparent to those of skill in the art upon a reading of the specification and a study of the drawings.


SUMMARY

The following embodiments and aspects thereof are described and illustrated in conjunction with systems, tools, and methods that are meant to be exemplary and illustrative, not limiting in scope. In various embodiments, one or more of the above-described problems have been reduced or eliminated, while other embodiments are directed to other improvements.


A technique for dynamically responding to threats in a wireless network involves deploying a single network including APs capable of booting from a plurality of software images. Individual APs can switch (or be switched) between multiple sets of software so that network managers can select the AP software most appropriate for a given instance. For example, if a threat is detected, multiple APs can be switched to sensor mode to deal with the threat. As another example, all of the APs can be switched to sensor mode after hours. Alternatively, a server can provide the software image(s) needed for an AP to operate in accordance with a desired functionality.


The proposed system can offer, among other advantages, improved wireless network functionality. This and other advantages of the techniques described herein will become apparent to those skilled in the art upon a reading of the following descriptions and a study of the several figures of the drawings.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the invention are illustrated in the figures. However, the embodiments and figures are illustrative rather than limiting; they provide examples of the invention.



FIGS. 1A and 1B depict an example of a system having a plurality of multi-boot access points (APs).



FIGS. 2A, 2B, and 2C depict a wireless domain that includes a plurality of multi-boot APs.



FIG. 3 depicts an example of a multi-boot AP device.



FIG. 4 depicts an example of a system for changing boot1 statically at an AP.



FIG. 5 depicts an example of a system for changing boot1 dynamically at an AP.



FIG. 6 depicts a flowchart 600 of an example of a method for booting an AP using a boot image.





DETAILED DESCRIPTION

In the following description, several specific details are presented to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention can be practiced without one or more of the specific details, or in combination with other components, etc. In other instances, well-known implementations or operations are not shown or described in detail to avoid obscuring aspects of various embodiments, of the invention.



FIGS. 1A and 1B depict an example of a system 100 having a plurality of multi-boot access points (APs). In the example of FIGS. 1A and 1B, the system 100 includes distribution system 102, and a plurality of multi-boot APs 104-1 to 104-N (referred to collectively as multi-boot APs 104). In the example of FIG. 1A, the system 100 includes a station 110 that is associated, for illustrative purposes, with the multi-boot AP 104-2. Presumably, since the station 106 has associated with the multi-boot AP 104-2, the multi-boot AP 104-2 has booted software that enables operation as a traditional AP. However, any of the multi-boot APs 104 can be switched to a different mode by booting different software.


In the example of FIG. 1B, the multi-boot AP 104-2 becomes aware that the station 106 is a rogue 108. When the multi-boot AP 104-2 becomes aware of the rogue 108, the association ends. Although in the example of FIG. 1B the rogue 108 appears to be disassociated from the multi-boot AP 104-2, the rogue 108 could be detected before an actual association with the multi-boot AP 104-2.


The determination that the station 106 is the rogue 108 may be made at the distribution system 102, or by some other one or more of the multi-boot APs 104 that are configured in, for example, a sensor mode. The multi-boot AP 104-2 can be rebooted with different software that gives the multi-boot 104-2, e.g., sensor functionality to help deal with the rogue 108 with, e.g., countermeasures. In an illustrative embodiment, when the multi-boot AP 104-2 is in sensor mode, no association is possible. Some of the advantages of the system 100 are explored later.



FIGS. 2A, 2B, and 2C depict a wireless domain 200 that includes a plurality of multi-boot APs. The wireless domain 200 may include, by way of example but not limitation, a Trapeze Networks, Inc. MOBILITY DOMAIN™ wireless domain. In the example of FIG. 2A, the wireless domain 200 includes a plurality of multi-boot APs 202 configured in network connectivity mode (APs 202) and a plurality of multi-boot APs 204 configured in sensor mode (sensors 204). The APs 202 and the sensors 204 are organized in an arbitrary or implementation-specific pattern in the mobility domain 200.


In the example of FIG. 2B, a rogue 206 is detected in the wireless domain 200. When the rogue 206 is detected, an alarm may be generated. The alarm can lead to a change in the functionality of the APs 202 and/or sensors 204. One example of a change is illustrated in the example of FIG. 2C.


In the example of FIG. 2C, APs 202 in the vicinity of the rogue 206 are switched to sensors 204. For illustrative purposes, the changed sensors are shaded in the example of FIG. 2C. In an illustrative embodiment, the determination as to which APs to change to sensors may depend upon implementation-specific configurations or capabilities. For example, APs may be changed to sensors when a risk score exceeds a threshold value.


In another illustrative embodiment, the threshold value may be set, and the risk score may increase based upon activities or events associated with a station. In another illustrative embodiment, the number of APs to convert is also either statically or dynamically configurable. For example, the number of APs converted may be based upon the severity of an event that triggers the conversion. In another illustrative embodiment, multiple APs may be converted for other reasons. For example, if at least three APs are in sensor mode, then triangulation may be facilitated. Additional APs may improve the accuracy of a triangulation technique.


In another illustrative embodiment, the amount of investigation predicted to be required may have a bearing on the number of APs converted. In another illustrative embodiment, the system may convert APs depending upon the location of the event that triggers the conversion. In another illustrative embodiment, the location of the APs may have a bearing upon the choice of APs to convert. In another illustrative embodiment, the amount of load on an AP may have a bearing on whether the AP is converted. For example, if an AP that has a lot of stations associated with it is selected for conversion to a sensor, it may be decided that the conversion is not worth the disruption of service to the associated stations, if any.



FIG. 3 depicts an example of a multi-boot AP device 300. In the example of FIG. 3, the device 300 includes memory 302, a processor 304, one or more radios 306-1, 306-2 (referred to collectively as radios 306), a primary boot 308, one or more supplemental boots 310-1, 310-2 (referred to collectively as supplemental boots 310), one or more network interfaces 312-1, 312-2 (referred to collectively as network interfaces 312), and a bus 314 to which each of the other components are coupled.


In an illustrative embodiment, the memory 302 may be primary memory such as random access memory (RAM). Any applicable known or convenient memory may be used. In an illustrative embodiment, the processor 304 may be a central processing unit (CPU), a microprocessor, or some other processor capable of executing code stored in the memory 302. Any applicable known or convenient processor may be used. In an illustrative embodiment, the radios 306 may be set to work on the same technology/protocol. The radios may have different configurations, such as different channel operations or modes. The radios 306 may also be set to work on different technology/protocols, such as 802.11a for one and 802.11b/g for another. Any known or convenient radio technology may be used.


In an illustrative embodiment, the primary boot 308 is embodied in a computer-readable medium. The computer-readable medium may include, by way of example but not limitation, flash memory. In an illustrative embodiment, the supplemental boots 310 are embodied in a computer-readable medium, as well. In an illustrative embodiment, the network interfaces 312 may include Ethernet interfaces. However, any applicable known or convenient network interfaces could be used.


In an illustrative embodiment that has two boot partitions, boot0 and boot1, the primary boot 308 is the first boot partition, boot0, and a supplemental boot 310-1 is the second boot partition, boot1. (In this illustrative embodiment, there is only one supplemental boot.) The device 300 will first attempt to boot from the boot1. If that fails, or if the boot1 partition is marked bad, it will fall back to boot0.


In a specific implementation, Trapeze Networks software may be loaded into boot0, and third-party software into boot1. That way, the device 300 will boot under control of third-party software. To switch back, the boot1 partition is marked bad, which causes the device 300 to fall back to Trapeze Networks software. In at least one implementation, the Trapeze Networks software is read-only so that the image is always available, but this is an implementation-specific decision. In this implementation, only one third-party software image is provided in boot1, but it can be swapped out for another image.



FIG. 4 depicts an example of a system 400 for changing boot1 statically at an AP. As used herein, changing boot1 statically refers to making the change by an administrator. Dynamically changing boot1 on the other hand, which is discussed later with reference to FIG. 5, involves changing boot1 in accordance with detected events, a schedule, or other environmental stimuli.


In the example of FIG. 4, the system 400 includes a network administrator 402, a management system 404, a switch 406, and an AP 408. The network administrator 402 may include a human and/or artificial entity. The management system 404 may be embodied in a computer-readable medium and may include, by way of example but not limitation, a TRAPEZE NETWORKS RINGMASTER™ management system. The switch 406 may include, by way of example but not limitation, a MOBILITY EXCHANGE™ or MX® switch. The AP may include a MOBILITY POINT™ or MP® AP.


In the example of FIG. 4, the switch 406 includes a primary boot image 410, one or more supplemental boot images 412-1 to 412-N (referred to collectively as the supplemental boot images 412), and an AP configuration database 414. The AP 408 includes the primary boot image 410 (boot0) and one of the supplemental boot images 412 (boot1).


In the example of FIG. 4, in operation, the network administrator 402 may trigger changes to boot1 at the AP 408 using the management system 404. The control application 404, upon receiving an appropriate command from the network administrator 402 sends a command to the switch 406 to change boot1, as appropriate. The network administrator 402 may also enter the appropriate command to the switch 406. The network administrator 402 may or may not be able to also change boot0 at the AP 408 using CLI or other commands. However, it may be desirable to provide the capability of allowing installation of the primary boot image at installation or re-installation.


When the command is received at the switch 406, the AP configuration database 414 on the switch 406 is updated to indicate that the AP 408 should use one of the supplemental boot images 412. The switch 406 then provides the appropriate boot image of the supplemental boot images 412 to the AP 408, which the AP 408 stores as boot1.


While the example of FIG. 4 depicts components that may be used for static AP boot image installation, in some embodiments it may be desirable to add dynamic AP boot image installation (or switching between boot images at the AP). Some examples of events leading to dynamic conversion may include by way of example but not limitation:

    • Automatic conversion of an AP to an IDS sensor based on an alarm.
    • Automatic conversion of all APs to IDS sensors based on time, so that the entire wireless network stops offering service when the facility closes and instead runs an intrusion detection application. The conversion would be reversed when the facility re-opens so that service is again provided to users.
    • By automating the conversion in a management system, it may be possible to select the “best” AP for conversion. In the case of a rogue, it will likely be detected by several APs. In an illustrative embodiment, the management system can select an AP based on a policy that includes the strongest signal strength, to pick the “closest” AP, or the least loaded AP, so as to minimize user disruption.
    • The management system can manage AP conversions so as to ensure that a minimum set of APs are being used to provide service and prevent service from falling below a threshold. Likewise, the management system can manage the AP pool so that a minimum level of third-party functionality is maintained.
    • The management system can assess threat levels based on, for example, a risk-based score so that there is a minimum threshold score for conversion, and progressively higher scores result in conversion of larger numbers of APs to security services.
    • The management system can link conversion events to a rollback, so that an AP can be “leased” to a third-party application and reclaimed at the end of a given time duration. It would also be possible for that application to extend its lease.



FIG. 5 depicts an example of a system 500 for changing boot images dynamically at an AP. The system 500 includes a management system 502, one or more third party applications 504-1 to 504-N (referred to collectively as third party applications 504), one or more wireless domains 506-1 to 506-N (referred to collectively as wireless domains 506), a server 508, a switch 510, and an AP 512.


The third party applications 504 include applications that provide functionality to the server 508 that may be of use in a wireless domain. For example, the third party applications 504 may include security applications. The wireless domains 506 provide RF data to the server 508. It should be noted that the switch 510 may be included in one of the wireless domains 506, and may provide RF data (not shown).


The server 508 may include an AP selector 514, a scheduler 516, AP images 518, and a command system 520. The AP selector 514 can receive requests for conversion from multiple sources and unify them. For example, the AP selector 514 may receive input from the third party applications 504, the wireless domains 506 (e.g., in the form of RF data), or from other applicable sources that serve to improve the accuracy of the AP selector 514 (not shown). The AP selector 514 may include an engine for making probabilistic assessments of risk prior to image selection. The AP selector may initially convert a few APs on the first request from a third-party system, and progressively add more if the situation is not resolved. The AP selector 514, after determining a course of action based upon the risk assessment, provides a command to the command system 520.


The scheduler 516 may include a timer that is set according to implementation-specific parameters. For example, the timer may be associated with a running time between conversion of APs, times when an enterprise is open (e.g., switching to network connectivity mode during work hours), or some other schedule. The scheduler 516 provides a command to the command system 520 based upon the configured schedule(s).


The AP images 518 are available to the command system 520. It may be that the AP images 518 are not needed even when an AP image is to be changed. For example, the AP 512 may include multiple boot images, including the image to which the switch 510 (as instructed by the command system 520) attempts to switch the AP 512. It may be that the AP images 518 are needed because the AP 512 can only hold a single image (requiring a new image with each AP image change), or because the AP 512 does not include the image that is needed based upon the desired functionality.


Using techniques described herein, multiple IDS partners may be used for statistical defense against attacks. APs could also be dedicated on-demand to location functions and “spotlighting” particular client devices.



FIG. 6 depicts a flowchart 600 of an example of a method for booting an AP using a boot image. This method and other methods are depicted as serially arranged modules. However, modules of the methods may be reordered, or arranged for parallel execution as appropriate. In the example of FIG. 6, the flowchart 600 starts at module 602 where a plurality of software images are provided. The software images may be provided at a server or at an AP.


In the example of FIG. 6, the flowchart 600 continues to module 604 where a boot image is selected from the plurality of software images. The boot image may be selected after a determination is made as to the desired functionality for an AP at a given time. The determination may be based upon, for example, risk assessment, according to a schedule, or to sign a spotlight on a particular station.


In the example of FIG. 6, the flowchart 600 continues to module 606 where an AP is booted using the boot image. Then the flowchart 600 ends. Presumably, the AP then operates in accordance with the functionality of the boot image.


As used herein, a wireless network refers to any type of wireless network, including but not limited to a structured network or an ad hoc network. Data on a wireless network is often encrypted. However, data may also be sent in the clear, if desired. With encrypted data, a rogue device will have a difficult time learning any information (such as passwords, etc.) from clients before countermeasures are taken to deal with the rogue. The rogue may be able to confuse the client, and perhaps obtain some encrypted data, but the risk is minimal (even less than for some wired networks).


As used herein, access point (AP) refers to receiving points for any known or convenient wireless access technology. Specifically, the term AP is not intended to be limited to 802.11 APs.


Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.


It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.


The algorithms and techniques described herein also relate to apparatus for performing the algorithms and techniques. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.


It should be noted that not all technologies include the term AP in the literature. For example, SGSN technology does not refer to an access point as an “AP.” However, all wireless access technologies require something comparable (i.e., a node at which wireless communications are received and/or transmitted). For example, an independent basic service set (BSS) includes stations that access the service area by directly communicating with one another; thus, the access nodes are the stations themselves. Accordingly, AP is considered to be generally applicable to any technology, regardless of actual verbiage used to describe a BSS with equivalent functionality.


As used herein, the term “embodiment” means an embodiment that serves to illustrate by way of example but not limitation.


It will be appreciated to those skilled in the art that the preceding examples and embodiments are exemplary and not limiting to the scope of the present invention. It is intended that all permutations, enhancements, equivalents, and improvements thereto that are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present invention. It is therefore intended that the following appended claims include all such modifications, permutations and equivalents as fall within the true spirit and scope of the present invention.

Claims
  • 1. A device comprising: a plurality of software images embodied in a computer-readable medium;a management interface through which one of the plurality of software images is designated as a boot image;a processor that implements the boot image in a boot procedure;radio hardware through which functionality associated with the boot image is applied to a wireless domain.
  • 2. The device of claim 1, wherein the plurality of software sets include a primary software set and one or more subordinate software sets.
  • 3. The device of claim 1, wherein at least one of the software sets is associated with wireless network connectivity.
  • 4. The device of claim 1, wherein at least one of the software sets is associated with wireless network security.
  • 5. The device of claim 1, further comprising an interface through which new software images may be received.
  • 6. The device of claim 1, wherein the management interface is implemented using XML.
  • 7. A system comprising: an access point (AP), including a management interface, capable of booting from a plurality of software sets;a management engine embodied in a computer-readable medium;wherein, in operation, the management engine selects one of the plurality of software sets with which the AP boots through the management interface of the AP.
  • 8. The system of claim 7, wherein the plurality of software sets include a primary software set and one or more subordinate software sets.
  • 9. The system of claim 7, wherein at least one of the software sets is associated with wireless network connectivity.
  • 10. The system of claim 7, wherein at least one of the software sets is associated with wireless network security.
  • 11. The system of claim 7, wherein, in operation, the management engine receives a selection from an administrator and selects the one of the plurality of software sets in accordance with the selection.
  • 12. The system of claim 7, wherein, in operation, the management engine dynamically selects the one of the plurality of software sets.
  • 13. The system of claim 7, wherein, in operation, the management engine uses time of day to select the one of the plurality of software sets.
  • 14. The system of claim 7, wherein, in operation, the management engine prevents observed devices from obtaining wireless connectivity at particular times of day.
  • 15. The system of claim 7, wherein, in operation, the management engine selects the one of the plurality of software sets to enable more detailed investigation of an event.
  • 16. The system of claim 7, further comprising an independent management system, wherein the management engine is included in the independent management system.
  • 17. A method comprising: providing a plurality of software images;selecting a boot image from the plurality of software images;booting an access point (AP) using the boot image.
  • 18. The method of claim 17, further comprising selecting the boot image according to time of day.
  • 19. The method of claim 17, further comprising selecting the boot image to investigate an event.
  • 20. The method of claim 17, wherein the boot image is a first boot image, further comprising: setting a risk threshold;assigning a risk score based upon events in a wireless environment;selecting a second boot image from the plurality of software images if the risk score exceeds the risk threshold.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to U.S. Provisional Patent Application No. 60/877,907, filed Dec. 28, 2006, which is hereby incorporated by reference in its entirety.

US Referenced Citations (258)
Number Name Date Kind
3641433 Mifflin et al. Feb 1972 A
4168400 De Couasnon et al. Sep 1979 A
4176316 DeRosa et al. Nov 1979 A
4247908 Lockhart et al. Jan 1981 A
4291401 Bachmann Sep 1981 A
4291409 Weinberg et al. Sep 1981 A
4409470 Shepard et al. Oct 1983 A
4460120 Shepard et al. Jul 1984 A
4475208 Ricketts Oct 1984 A
4494238 Groth, Jr. Jan 1985 A
4500987 Hasegawa Feb 1985 A
4503533 Tobagi et al. Mar 1985 A
4550414 Guinon et al. Oct 1985 A
4562415 McBiles Dec 1985 A
4630264 Wah Dec 1986 A
4635221 Kerr Jan 1987 A
4639914 Winters Jan 1987 A
4644523 Horwitz Feb 1987 A
4672658 Kavehrad Jun 1987 A
4673805 Shepard et al. Jun 1987 A
4707839 Andren et al. Nov 1987 A
4730340 Frazier Mar 1988 A
4736095 Shepard et al. Apr 1988 A
4740792 Sagey et al. Apr 1988 A
4758717 Shepard et al. Jul 1988 A
4760586 Takeda Jul 1988 A
4789983 Acampora et al. Dec 1988 A
4829540 Waggener et al. May 1989 A
4850009 Zook et al. Jul 1989 A
4872182 McRae et al. Oct 1989 A
4894842 Broekhoven et al. Jan 1990 A
4901307 Gilhousen et al. Feb 1990 A
4933952 Albrieux et al. Jun 1990 A
4933953 Yagi Jun 1990 A
4995053 Simpson et al. Feb 1991 A
5008899 Yamamoto Apr 1991 A
5029183 Tymes Jul 1991 A
5103459 Gilhousen et al. Apr 1992 A
5103461 Tymes Apr 1992 A
5109390 Gilhousen et al. Apr 1992 A
5142550 Tymes Aug 1992 A
5151919 Dent Sep 1992 A
5157687 Tymes Oct 1992 A
5187575 Dent et al. Feb 1993 A
5231633 Hluchyj et al. Jul 1993 A
5280498 Tymes et al. Jan 1994 A
5285494 Sprecher et al. Feb 1994 A
5329531 Diepstraten Jul 1994 A
5339316 Diepstraten Aug 1994 A
5371783 Rose et al. Dec 1994 A
5418812 Reyes et al. May 1995 A
5450615 Fortune et al. Sep 1995 A
5465401 Thompson Nov 1995 A
5479441 Tymes et al. Dec 1995 A
5483676 Mahany et al. Jan 1996 A
5488569 Kaplan Jan 1996 A
5491644 Pickering et al. Feb 1996 A
5517495 Lund May 1996 A
5519762 Bartlett May 1996 A
5528621 Heiman et al. Jun 1996 A
5561841 Markus Oct 1996 A
5568513 Croft et al. Oct 1996 A
5584048 Wieczorek Dec 1996 A
5598532 Liron Jan 1997 A
5630207 Gitlin et al. May 1997 A
5640414 Blakeney et al. Jun 1997 A
5649289 Wang et al. Jul 1997 A
5668803 Tymes et al. Sep 1997 A
5774460 Schiffel et al. Jun 1998 A
5793303 Koga Aug 1998 A
5794128 Brockel et al. Aug 1998 A
5812589 Sealander et al. Sep 1998 A
5815811 Pinard et al. Sep 1998 A
5828960 Tang et al. Oct 1998 A
5838907 Hansen Nov 1998 A
5844900 Hong et al. Dec 1998 A
5872968 Knox et al. Feb 1999 A
5875179 Tikalsky Feb 1999 A
5887259 Zicker et al. Mar 1999 A
5896561 Schrader et al. Apr 1999 A
5915214 Reece et al. Jun 1999 A
5920821 Seazholtz et al. Jul 1999 A
5933607 Tate et al. Aug 1999 A
5949988 Feisullin et al. Sep 1999 A
5953669 Stratis et al. Sep 1999 A
5960335 Umemoto et al. Sep 1999 A
5982779 Krishnakumar et al. Nov 1999 A
5987062 Engwer et al. Nov 1999 A
5987328 Ephremides et al. Nov 1999 A
5991817 Rowett et al. Nov 1999 A
6005853 Wang et al. Dec 1999 A
6011784 Brown Jan 2000 A
6041240 McCarthy et al. Mar 2000 A
6078568 Wright Jun 2000 A
6088591 Trompower Jul 2000 A
6101539 Kennelly et al. Aug 2000 A
6118771 Tajika et al. Sep 2000 A
6119009 Baranger et al. Sep 2000 A
6160804 Ahmed et al. Dec 2000 A
6188649 Fine et al. Feb 2001 B1
6199032 Anderson Mar 2001 B1
6208629 Jaszewski et al. Mar 2001 B1
6208841 Wallace et al. Mar 2001 B1
6218930 Katzenberg et al. Apr 2001 B1
6240078 Kuhnel et al. May 2001 B1
6240083 Wright May 2001 B1
6256300 Ahmed et al. Jul 2001 B1
6256334 Adachi Jul 2001 B1
6262988 Vig Jul 2001 B1
6285662 Watanabe Sep 2001 B1
6304596 Yamano et al. Oct 2001 B1
6317599 Rappaport et al. Nov 2001 B1
6336035 Somoza et al. Jan 2002 B1
6336152 Richman et al. Jan 2002 B1
6347091 Wallentin et al. Feb 2002 B1
6356758 Almeida et al. Mar 2002 B1
6393290 Ufongene May 2002 B1
6404772 Beach et al. Jun 2002 B1
6473449 Cafarella et al. Oct 2002 B1
6493679 Rappaport et al. Dec 2002 B1
6496290 Lee Dec 2002 B1
6512916 Forbes, Jr. Jan 2003 B1
6580700 Pinard et al. Jun 2003 B1
6587680 Ala-Laurila et al. Jul 2003 B1
6614787 Jain et al. Sep 2003 B1
6624762 End, III Sep 2003 B1
6625454 Rappaport et al. Sep 2003 B1
6661787 Jain et al. Sep 2003 B1
6631267 Thomson et al. Oct 2003 B1
6659947 Rappaport et al. Dec 2003 B1
6687498 McKenna et al. Feb 2004 B2
6697415 Mahany Feb 2004 B1
6725260 Philyaw Apr 2004 B1
6760324 Scott et al. Jul 2004 B1
6747961 Ahmed et al. Oct 2004 B1
6839338 Amara et al. Jan 2005 B1
6839348 Tang et al. Jan 2005 B2
6879812 Rappaport et al. Apr 2005 B2
6957067 Iyer et al. Oct 2005 B1
6973622 Rappaport et al. Dec 2005 B1
6978301 Tindal Dec 2005 B2
7020438 Sinivaara et al. Mar 2006 B2
7020773 Otway et al. Mar 2006 B1
7024394 Ashour et al. Apr 2006 B1
7062566 Amara et al. Jun 2006 B2
7068999 Ballai Jun 2006 B2
7110756 Diener Sep 2006 B2
7116979 Backes et al. Oct 2006 B2
7146166 Backes et al. Dec 2006 B2
7155518 Forslow Dec 2006 B2
7221927 Kolar et al. May 2007 B2
7224970 Smith et al. May 2007 B2
7263366 Miyashita Aug 2007 B2
7280495 Zweig et al. Oct 2007 B1
7317914 Adya et al. Jan 2008 B2
7324468 Fischer Jan 2008 B2
7324487 Saito Jan 2008 B2
7359676 Hrastar Apr 2008 B2
7370362 Olson et al. May 2008 B2
7376080 Riddle et al. May 2008 B1
7421248 Laux et al. Sep 2008 B1
7466678 Cromer et al. Dec 2008 B2
7489648 Griswold Feb 2009 B2
7509096 Palm et al. Mar 2009 B2
7529925 Harkins May 2009 B2
7551619 Tiwari Jun 2009 B2
7573859 Taylor Aug 2009 B2
7577453 Matta Aug 2009 B2
7788475 Zimmer et al. Aug 2010 B2
20010024953 Balogh Sep 2001 A1
20020052205 Belostofsky et al. May 2002 A1
20020060995 Cervello et al. May 2002 A1
20020069278 Forslow Jun 2002 A1
20020095486 Bahl Jul 2002 A1
20020101868 Clear et al. Aug 2002 A1
20020176437 Busch et al. Nov 2002 A1
20020191572 Weinstein et al. Dec 2002 A1
20030014646 Buddhikot et al. Jan 2003 A1
20030018889 Burnett et al. Jan 2003 A1
20030055959 Sato Mar 2003 A1
20030107590 Levillain et al. Jun 2003 A1
20030134642 Kostic et al. Jul 2003 A1
20030135762 Macaulay Jul 2003 A1
20030174706 Shankar et al. Sep 2003 A1
20030227934 White et al. Dec 2003 A1
20040003285 Whelan et al. Jan 2004 A1
20040019857 Teig et al. Jan 2004 A1
20040025044 Day Feb 2004 A1
20040053632 Nikkelen et al. Mar 2004 A1
20040062267 Minami et al. Apr 2004 A1
20040064560 Zhang et al. Apr 2004 A1
20040068668 Lor et al. Apr 2004 A1
20040095914 Katsube et al. May 2004 A1
20040095932 Astarabadi et al. May 2004 A1
20040143428 Rappaport et al. Jul 2004 A1
20040165545 Cook Aug 2004 A1
20040208570 Reader Oct 2004 A1
20040047320 Eglin Nov 2004 A1
20040120370 Tzamaloukas Nov 2004 A1
20040221042 Meier Nov 2004 A1
20040230370 Tzamaloukas Nov 2004 A1
20040236702 Fink et al. Nov 2004 A1
20040255167 Knight Dec 2004 A1
20040259555 Rappaport et al. Dec 2004 A1
20050030929 Swier et al. Feb 2005 A1
20050037818 Seshadri et al. Feb 2005 A1
20050054326 Rogers Mar 2005 A1
20050058132 Okano et al. Mar 2005 A1
20050059406 Thomson et al. Mar 2005 A1
20050064873 Karaoguz et al. Mar 2005 A1
20050068925 Palm et al. Mar 2005 A1
20050073980 Thomson et al. Apr 2005 A1
20050097618 Arling et al. May 2005 A1
20050122977 Lieberman Jun 2005 A1
20050128989 Bhagwat et al. Jun 2005 A1
20050157730 Grant et al. Jul 2005 A1
20050180358 Kolar et al. Aug 2005 A1
20050181805 Gallagher Aug 2005 A1
20050193103 Drabik Sep 2005 A1
20050223111 Bhandaru et al. Oct 2005 A1
20050239461 Verma et al. Oct 2005 A1
20050240665 Gu et al. Oct 2005 A1
20050245269 Demirhan et al. Nov 2005 A1
20050259597 Benedetto et al. Nov 2005 A1
20050059405 Rappaport et al. Dec 2005 A1
20050273442 Bennett Dec 2005 A1
20050276218 Ooghe et al. Dec 2005 A1
20060045050 Floros et al. Mar 2006 A1
20060104224 Singh et al. May 2006 A1
20060128415 Horikoshi et al. Jun 2006 A1
20060161983 Cothrell et al. Jul 2006 A1
20060174336 Chen Aug 2006 A1
20060189311 Cromer et al. Aug 2006 A1
20060200862 Olson et al. Sep 2006 A1
20060245393 Bajic Nov 2006 A1
20060248331 Harkins Nov 2006 A1
20060274774 Srinivasan et al. Dec 2006 A1
20060276192 Dutta et al. Dec 2006 A1
20070025265 Porras et al. Feb 2007 A1
20070064718 Ekl et al. Mar 2007 A1
20070070937 Demirhan et al. Mar 2007 A1
20070083924 Lu Apr 2007 A1
20070086378 Matta et al. Apr 2007 A1
20070091889 Xiao et al. Apr 2007 A1
20070189222 Kolar et al. Aug 2007 A1
20070260720 Morain Nov 2007 A1
20080008117 Alizadeh-Shabdiz Jan 2008 A1
20080013481 Simons et al. Jan 2008 A1
20080014916 Chen Jan 2008 A1
20080056200 Johnson Mar 2008 A1
20080056211 Kim et al. Mar 2008 A1
20080096575 Aragon et al. Apr 2008 A1
20080107077 Murphy May 2008 A1
20080114784 Murphy May 2008 A1
20080117822 Murphy et al. May 2008 A1
20080151844 Tiwari Jun 2008 A1
20090031044 Barrack et al. Jan 2009 A1
20090198999 Harkins Aug 2009 A1
Foreign Referenced Citations (11)
Number Date Country
2429080 Feb 2007 GB
WO 9403986 Feb 1994 WO
WO-9403986 Feb 1994 WO
WO 9911003 Mar 1999 WO
WO-9911003 Mar 1999 WO
WO 03085544 Oct 2003 WO
WO-03085544 Oct 2003 WO
WO 2004095192 Nov 2004 WO
WO 2004095800 Nov 2004 WO
WO-2004095192 Nov 2004 WO
WO-2004095800 Nov 2004 WO
Related Publications (1)
Number Date Country
20080162921 A1 Jul 2008 US
Provisional Applications (1)
Number Date Country
60877907 Dec 2006 US