Sharing data between wireless switches system and method

Information

  • Patent Grant
  • 10638304
  • Patent Number
    10,638,304
  • Date Filed
    Monday, September 28, 2015
    9 years ago
  • Date Issued
    Tuesday, April 28, 2020
    4 years ago
Abstract
A technique for facilitating the management of a wireless database related to station records and radio-frequency (RF) information by reducing unnecessary sharing of the data among wireless switches, thus enhancing efficiency in a wireless network. A system constructed according to the technique includes a collection of wireless switches with each switch having associated access points (AP), an AP database distributed throughout the collection of wireless switches, and at least one station radio frequency (RF) database. The AP database includes data associated with ownership of the AP's by the switches, and the station RF database includes wireless station information and RF information. AP radio adjacency is determined by whether an AP owned by a specific switch can detect the other AP owned by another switch. The station and RF information database is shared only within the subset of switches that have AP radio adjacency.
Description
BACKGROUND

A wireless network typically includes a number of wireless switches, and each of the switches typically includes multiple access points (APs) that couple wireless stations to the respective switches. Typically, a station will be within range of only a subset of the APs. However, since the station can roam to potentially any other AP associated with the wireless network, the wireless switches must share information about the station, and indeed all of the wireless stations and radio frequency (RF) data throughout the wireless network.


The sharing of data between all of the switches is not a problem for relatively small wireless networks. However, as the size of the wireless network grows, the number of switches also grows accordingly, as does the size of the database storing station and RF data. This may result in a scaling problem as the size of the database increases, which may translate into increased maintenance costs, network costs, and latency.


These are but a subset of the problems and issues associated with sharing data between wireless switches, 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 facilitating the management of a wireless database related to station records and radio-frequency (RF) information by reducing unnecessary sharing of the data among wireless switches enhances efficiency in a wireless network. A system constructed according to the technique includes a collection of wireless switches with each switch having one or more associated access points (AP). The system further includes at least one wireless database. The system may further include an AP database distributed throughout the collection of wireless switches. The AP database includes data associated with ownership of the AP's by the switches, and the wireless data database includes, for example, wireless station information and RF information. AP radio adjacency is determined by whether an AP owned by a specific switch can detect an AP owned by another switch. The station and RF information database is shared only within the subset of switches that have AP radio adjacency.


The proposed system can offer, among other advantages, relatively small databases for use when sharing data between wireless switches. 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.



FIG. 1 depicts an example of a network with multiple wireless switches.



FIG. 2 depicts an example of a system with contiguous radio domains.



FIG. 3 depicts an example of a connected graph where nodes represent APs and edges represent the property that the APs connected by the edge can currently hear each other through their radios.



FIG. 4 depicts an example of a system with multiple contiguous radio domains and respective wireless data databases.



FIG. 5 depicts an example of an AP.



FIG. 6 depicts an example of a wireless switch.



FIG. 7 depicts a flowchart of an example of a method for maintaining a scalable dynamic station RF database.



FIG. 8 depicts an example of a diagrammatic illustration showing station radio-frequency (RF) database sharing.





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.



FIG. 1 depicts an example of a system 100 with multiple wireless switches. In the example of FIG. 1, the system 100 includes a network 102, wireless switches 104-1 to 104-N (collectively referred to as the wireless switches 104), and access points (APs) 106-1 to 106-N (collectively referred to as the respective APs 106). For illustrative purposes only, there are N1 APs 106-1, N2 APs 106-2, and NN APs 106-N. However, even one AP would be sufficient for a switch to couple a station (not shown) to the network 102.


The network 102 may include an Internet protocol (IP) network. In an embodiment, the network 102 is a wired backbone to which the wireless switches 104 are coupled. However, the network 102 may alternatively represent the network, or any other network, to which a backbone network is coupled. Thus, the network 102 could include, for example, the Internet.


The wireless switches 104 are typically wire connected to the respective APs 106. Thus, the “wireless” switch should be thought of as a switch for wireless traffic. The wireless switches 104 themselves are not wirelessly connected to anything. An AP and a wireless switch could be combined into a single device. However, in this description, the functionality of an AP is differentiated from the functionality of a switch by acting as if the APs and the wireless switches are distinct devices.


In the example of FIG. 1, each of the wireless switches 104 is associated with the respective APs 106, and the wireless switches 104 control the respective APs 106. In an embodiment, the respective APs 106 include radio transmitters and receivers (transceivers) that are used to provide wireless network connectivity for users and client access to the functions of the wireless switches 104. Within an IEEE 802.11 context, a station is any IEEE 802.11 entity or the equivalent in other related standards, and it may be roaming or stationary.


It will be appreciated in light of the description provided herein that although aspects of the invention are described relative to IEEE 802.11 standards, and that certain embodiments have particular features that are implemented within the 802.11 context, the invention itself is not limited to 802.11 networks and may generally be applied to any wireless network; and to the extent that future technological enhancements might obscure the distinctions between wireless switches, APs, and/or stations, the invention is understood to include components providing the features of such switches, access points, and stations independently of how they are packaged, combined, or labeled.


Wireless data may include, by way of example but not limitation, station association data and RF environment data. The station and RF data is used by the wireless switches 104 to support features including roaming, auto channel selection, rogue AP detection, intrusion detection and the launching of countermeasures. A wireless switch of the wireless switches 104 shares wireless data with a subset of the wireless switches 104. Specifically, the wireless switch shares information with those switches that have respective APs 106 with radio adjacency.



FIG. 2 depicts an example of a system 200 with contiguous radio domains. In the example of FIG. 2, the system 200 includes switches 201-209, domains 211-219, and a station 220. (It may be noted that the domain 215 has not been labeled with a reference numeral because it is difficult to fit in the figure, but since the domains 211-214, 216-219 have been labeled, the figure is clear.)


In the example of FIG. 2, the domains 211-219 are switch-specific in that each domain has within it a particular wireless switch (e.g., domain 211 includes the wireless switch 201, domain 212 includes the wireless switch 202, etc.). In an alternative, there may be multiple switches per domain. A radio service space is a switch-specific domain in which the switch has sufficient RF signal strength to communicate with an entity in the domain. Thus, if the station 220 roams into the domain 214, APs associated with the switch 204 should be able to communicate with the station 220.


The domains 211-219 may be part of a global radio domain (not shown), that may include other domains (not shown). Thus, the domains 211-219 may be thought of as a subset of the global radio domain. The global radio domain need not be contiguous, but in practice it is likely to be so.


In the example of FIG. 2, the domain 214 is a contiguous with the domains 211, 215, and 217 (because the radio coverage of the domain 214 overlaps with that of the domains 211, 215, and 217). A contiguous radio domain is an area where there is uninterrupted (or substantially uninterrupted) radio connectivity. Thus, the domains 211, 214, 215, and 217 may be referred to as a contiguous radio domain. Since, in the example of FIG. 2, the domains 211-219 are switch-specific, the contiguous radio domain that includes the domains 211, 214, 215, and 217, may be referred to as the contiguous radio domain 214 because the domain 214 is the domain with which the other domains overlap. This naming convention should enable one to refer to any specific contiguous radio domain with a unique reference numeral.


Wireless switches that lie in a contiguous radio domain may be referred to as “contiguous” wireless switches. For instance, in the example of FIG. 2, the wireless switches 201, 204, 205, and 207 may be referred to as contiguous radio switches because they lie in a contiguous radio domain. Contiguous wireless switches may write to, read from, or otherwise access station and radio frequency (RF) data in a shared database. Contiguous wireless switches do not usually include all of the wireless switches in the wireless network; only the switches in the contiguous radio domain share information with each other.


Any single switch may be a member of more than one contiguous radio domain and therefore may share information with other switches that belong to more than one contiguous radio domain. For instance, in the example of FIG. 2, the wireless switch 205 is in a contiguous radio domain 215 that includes wireless switches 202, 204, 206, and 208. However, the wireless switch 205 is also in a contiguous radio domain 214 that includes wireless switches 201, 204, and 207.


As is illustrated by the dashed arrow in FIG. 2, the station 220 will pass through the system 200. Notably, the station 220 always roams to a contiguous switch, Thus, the station 220 never really leaves a contiguous radio domain. For instance, the station 220 roams from domain 214 to domain 215. Domains 214, 215 are part of a contiguous radio domain (e.g., contiguous radio domain 214 or 215), The station 220 then roams from domain 215 to domain 218. Domains 215, 218 are also part of a contiguous radio domain (e.g., contiguous radio domain 215 or 218). And so forth.



FIG. 3 depicts an example of a connected graph 300 where nodes represent APs and edges represent the property that the APs connected by the edge can currently hear (or equivalently, currently receive and understand, an RF transmission from) each other through their radios. Where the graph is not connected, the nodes should not be considered as part of the same contiguous radio domain. It may be appreciated that owing at least to possible changing radio propagation parameters, the contiguous radio domain and its representation as a graph may change dynamically over time.


In the example of FIG. 3, the connected graph 300 includes nodes 301, 302, 303, 304, and 305, and a contiguous radio domain 310. Notably, the contiguous radio domain 310 includes nodes 302, 303, 304, which are connected to one another, but not 301, 305, which are connected to only one or two of the nodes 302, 303, 304.



FIG. 4 depicts an example of a system 400 with multiple contiguous radio domains and respective wireless data databases. In the example of FIG. 4, the system 400 includes wireless switches 402-1 to 402-3 (referred to collectively as wireless switches 402), APs 404-1 to 404-3 (referred to collectively as APs 404), wireless data databases 406-1 to 406-3 (referred to collectively as the wireless data databases 406), and a station 410. The wireless data databases 406 are associated with respective contiguous radio domains.


The wireless switch 402-1 is coupled to the wireless data database 406-1 and the AP 404-1. In addition, because the wireless switch 402-1 is contiguous with the wireless switch 402-2, the AP 404-1 is in range of the AP 404-2. Also, for the same reason, the wireless switch 402-1 is coupled to the wireless data database 406-2.


The wireless switch 402-2 is coupled to the wireless data database 406-2 and the AP 404-2. In addition, because the wireless switch 402-2 is contiguous with the wireless switch 402-3, the AP 404-2 is in range of the AP 404-3. Also, for the same reason, the wireless switch 402-2 is coupled to the wireless data database 406-3 (and to the wireless data database 406-1).


The wireless switch 402-3 is coupled to the wireless data database 406-3 and the AP 404-3. In addition, because the wireless switch 402-3 is contiguous with the wireless switch 402-2, the wireless switch 402-3 is coupled to the wireless data database 406-2.


In the example of FIG. 4, for illustrative purposes, it is assumed that the wireless switch 402-1 and the wireless switch 402-3 are not contiguous. Under these circumstances, the AP 404-1 and the AP 404-3 cannot hear one another and the wireless switches 402-1, 402-3 do not have radio adjacency.


The wireless data databases 406 include data for their associated contiguous radio domain. The data may or may not be redundantly stored. For example, the wireless data database 406-1 includes data associated with a first contiguous radio domain that includes the wireless switch 402-2. However, the wireless data database 406-2 includes data associated with a second contiguous radio domain that also includes the wireless switch 402-2. Accordingly, the data associated with the wireless switch 402-2 could be redundantly stored. Alternatively, the data associated with the wireless switch 402-2 could be stored in elation to the wireless switch 402-2 itself. In this alternative, the wireless data databases 406 may be thought of as distributed databases that include data stored locally with respect to the relevant wireless switches 402.


The wireless data databases 406 includes wireless data such as, by way of example but not limitation, station record and RF information. In an embodiment, the station record and RF information are stored in RAM, as opposed to non-volatile storage, to facilitate rapid access to the data. However, the wireless data databases 406 may include any known or convenient memory having sufficient speed for a particular implementation.


The station record information may include identification of the station and the station's association with APs 404 (or other APs). The RF information may include what each AP can hear on the RF, e.g. known APs, unknown APs, any other stations, and the like. Advantageously, in the example of FIG. 4, no central configuration, server, or database is required, because the switches 402 maintain associations directly with other switches based on AP radio adjacency, independent of any central configuration.


In an embodiment, the station RF information is either added and immediately distributed to all members of the contiguous radio domain or stored locally and then accessed via broadcast queries. As the number of switches in the contiguous radio domain grows, the process of adding information to the database and distributing it or performing broadcast queries grows.


When conventional techniques are applied, with respect to any one switch, the data-processing and communication with other switches grows linearly as N−1, since for each added switch must store data or information for every other switch and communicate with every other switch. Advantageously, at some point, adding additional APs to a contiguous radio domain becomes redundant (since all APs of the radio domain can hear one another). In other words, the techniques described herein are effective to keep N small. More specifically, C is typically less than 10 in an arbitrarily large global radio domain, where C is the average number of switches in a contiguous radio domain. So, computational complexity of a network that incorporates techniques described herein scales to a constant C (probably less than 10), while prior art networks scale to O(N). In large networks N can be an order of magnitude or more larger than C.


When conventional techniques are applied, for the set of all switches, the network cost grows non-linearly as N×(N−1) or approximately N2 for large N (i.e., the number of connections grows at O(N2)). For large N, this can become unmanageable at arbitrarily large N. Advantageously, using techniques described herein, the number of connections scales to a constant O(C2), which makes an arbitrarily large global radio domain manageable.


As an aid to understand the potential scalability problem, if each of a number of N switches in a wireless network consisting (or at least including) of N total switches needs to communicates with the other N−1 switches, then the non-linear growth is on the order of N(N−1) or approximately N2 for N being other than a small number. For very large collection of N switches, this can be a scaling problem, in terms of the size of the database, network cost, and latency. For example, if N is one-hundred switches then N2=10000, and if N=1000 switches then N2=1,000,000. These numbers of switches and more are already contemplated for current and near-term future configurations. In a wireless network environment that might span an entire research campus, university, industrial facility, or even a small town or major metropolitan area, wireless networks having tens or thousands of switches may be contemplated, and were conventional technology to be utilized, the overhead and administrative burden of managing the information for the network as well as the memory requirements of each switch or other device storing the database might be prohibitive.


The increased size of a database may affect, and for large number of switches and/or stations will affect, the requirement of memory size or other physical device size. Any increase in physical memory requirements will also cause an increased cost of the device incorporating the larger memory. If the distribution of the database information needs more resources such as time and RF bandwidth, the network cost of the bandwidth utilization increases. Also, if the latency involved in receiving the database increases, it affect the network efficiency and performance. For networks supporting mobile stations that are physically moving into, out of or between different physical locations within the network, the lack of scalability of conventional systems and methods may break down to the point that the conventional system and method are incapable of supporting changes within the network.


Advantageously, the wireless data databases 406 share only a subset of the wireless data of a global radio domain. The information a wireless switch needs to make RF environmental decisions comes from switches with which it shares an AP radio adjacency. For a very large global radio domain, this can result in a significant reduction in the amount of data that a switch needs to share.


For example, even for an arbitrarily large number N of total switches in a wireless network, the number of switches having adjacent access points might be some number between about two AP's and about ten AP's, though these numbers do not represent limitations. Thus, the physical device requirements such as memory are reduced to tolerable numbers and the communications are likewise reduced as compared to a conventional system and method where the increases are on the order of N2.


The reduction in turn may help to mitigate the scaling problem mentioned above, in terms of network cost, switch cost, and network latency. Also, by reducing processing time of unnecessary data content, it may help the station 410 to roam seamlessly in the wireless network, as compared to a conventional network implementation where for a large number of switches, the same station may not be able to roam seamlessly because the physical movement might outpace the ability of the system to track or maintain communication with the station.


In the example of FIG. 4, in operation, the AP 404-1 listens for other APs on the network and hears the AP 404-2. The findings are reported back to the wireless switch 402-1. Listening may include operating in a receive signal mode where an AP attempts to detect RF; signal transmissions from other access points or stations. Typically, the AP will be understood to hear other AP's when it listens if the signal strengths of received signals are of sufficient strength (and with sufficient signal-to-noise ratio) to provide usable signal. The switch 402-1 knows of the existence of all other switches in the contiguous radio domain and their associated AP's (e.g., wireless switch 402-2, AP 404-2). This data may be stored in the appropriate one or more of the wireless data databases 406.


The wireless switches 402 do not automatically share RF and session information until they've established an AP adjacency. Once an AP adjacency is discovered by a specific switch and if the AP adjacency discovered is associated with a contiguous switch, the specific switch initiates a session with the switch having AP adjacency, and all RF and station information is now shared between the two switches. So long as an AP adjacency exists between the two switches, the switches share data, which is represented by the coupling of wireless switches to the wireless data databases of contiguous switches in the example of FIG. 4.


If over time, AP adjacency changes, the sharing of data between the two (or more) switches may also change. By way of example, if two switches had an AP adjacency at time t1 and that AP adjacency later disappeared at time t2 (perhaps because of marginal signal strength), then the two switches do not sharp the station RF database anymore and the lost AP adjacency information is updated. Therefore, in an embodiment, the ability to currently receive RF signals transmitted by the other AP owned by another switch is a dynamic ability that may change over time and may be a function of the location of a station relative to an AP radio.


The station 410 is, for illustrative purposes, within RF range of the APs 404.1 and 404-2. The dotted arrow represents the direction the station 410 will roam in this example. The station 410 may be any IEEE 802.11 entity or the equivalent in other related standards. Although the station 410 roams in this example, it could alternatively be stationary.


Initially, the station 410 is assumed to have been associated at AP 404-1 in the contiguous radio domain 408-1. As shown in the example of FIG. 4, the station is within range of the APs 404-1, 404-2. Thus, the station 410 is in either the contiguous radio domain 408-1 or the contiguous radio domain 408-2 (because the station is within range of the APs 404-1, 404-2, both of which are in the contiguous radio domain 408-1 and the contiguous radio domain 408-2). In an embodiment, actually deciding which of the contiguous radio domains to which the station 410 belongs is not necessary, since the data that is needed is available to both the wireless switch 402-1 and the wireless switch 402-2. Thus, if the station 410 changes associations from AP 404-1 to AP 404-2, the handoff is smooth (because the wireless switch 402-2 has access to all of the data it needs).


Later, the station 410 may roam to near the AP 404-3. At this point, the station is presumably no longer in range of the AP 404-1. However, the switch 4024 does not need data associated with the station 410 because the station is now out of range. In addition, the switch 402-3 has access to the data known to wireless data database 406-2 (since it is in a contiguous radio domain). So the handoff of the station 410, if one occurs, will also be smooth.



FIG. 5 depicts an example of an AP 500. In the example of FIG. 5, the AP 500 includes a processor 502 that is coupled to an Ethernet interface 504, a radio 506, and memory 510. The memory includes an RF monitoring module 512 and an active scan module 514. The RF monitoring module 512 monitors the air and the active scan module 514 probes RE channels for other APs on different RE channels. The active scan module 514 may be turned off when, for example, its operation reduces performance of a specific application.



FIG. 6 depicts an example of a wireless switch 600. In the example of FIG. 6, the wireless switch 600 includes a processor 602, an Ethernet interface 604, an adjacent AP data database 606, a detected station data database 608, and memory 610. The Ethernet interface 604 may be used to provide a communication path between the switch 600 and an AP (e.g., the AP 500 of FIG. 5). The adjacent AP data database 606 and the detected station data database 608 may be implemented in RAM or some other sufficiently fast known or convenient memory. The memory 610 includes an RE detect module 612, which may include RF data, and a cluster database module 614. In an embodiment, the memory 610 includes the adjacent AP data database 606 and the detected station data database 608.


In the example of FIG. 6, in an embodiment, the RF detect module 612 sends commands through the Ethernet interface 604 to an AP (not shown). The AP provides data related to anything that it finds. Data related to other APs can be stored in the adjacent AP data database 606, while data related to stations may be stored in the detected station data database 608. Notably, all switches on the wireless network are known to all of the other switches. This data is stored in a cluster database (not shown). The cluster database includes data about AP ownership. The switch 600 can access the data using the cluster database module 614.


Depending upon the wireless technology, all APs may be stations. However, since data associated with each of the stations of the wireless network is stored in a cluster database, the cluster database module 614 can distinguish between APs and clients (and, for example, rogue APs, as well). So data stored in the adjacent AP data database 606 can be limited to that of APs coupled to switches on the wireless network. Thus, when the RF detect module 612 detects a station, the data associated with the station will be stored in the adjacent AP data database 606 or the detected station data database 608 as appropriate. (Other wireless data may also be stored, but that is omitted for the purpose of this example.)



FIG. 7 depicts a flowchart 700 of an example of a method for maintaining a scalable dynamic station RF database. In the example of FIG. 7, the flowchart 700 starts at module 702 where switches of a global radio domain share information about AP ownership. The AP ownership (and other data) may be stored in, for example, a cluster database.


In the example of FIG. 7, the flowchart 700 continues to module 704 where a switch determines what APs are within range. A switch may determine that APs are in range if at least one AP that is coupled to the switch detects the AP. For the purpose of this description, it is assumed that even if only one AP associated with a switch detects another AP, the detected AP is adjacent. However, it may be desirable to include a threshold determination (e.g., a “strong adjacency threshold”) that requires more in order for a switch to be treated as contiguous.


In the example of FIG. 7, the flowchart 700 continues to module 706 where, for each AP within range, the switch determines AP ownership. AP ownership may be determined by, for example, consulting a cluster database. Notably, rogue APs can be identified with this determination (and appropriate countermeasures taken).


In the example of FIG. 7, the flowchart 700 continues to module 708 where the switch concludes it has radio adjacency to switches that own APs within range; the switch and the adjacent switches make up a contiguous radio domain. It may be noted that the switch may “conclude” it has radio adjacency without taking any affirmative steps. Thus, module 708 may or may not be a no-op.


In the example of FIG. 7, the flowchart 700 continues to module 710 where the switch adds data associated with adjacent switches to a contiguous radio domain database. The contiguous radio domain database may or may not be local with respect to the switch.


In the example of FIG. 7, the flowchart 700 continues to module 712 where station data and RF data is shared within the contiguous radio domain. For example, as a station roams from an AP of a first switch to an AP of a second switch, where the first and second switch are part of the contiguous radio domain, the second switch has access to the station data and RF data. Thus, the transition between the first and second switch is smooth (e.g., the data does not have to “catch up with” the station as it roams).


Advantageously, as the station roams, the records need only be propagated within the subset of the domains that are adjacent to one another. This enables wireless networks to scale arbitrarily large.



FIG. 8 depicts an example of a diagrammatic illustration 800 showing station radio-frequency (RF) database sharing. The example of FIG. 8 shows at least one embodiment of the sharing scheme of the station RF database. The RF information should include all known and unknown stations, not just APs, which are a special kind of station. Various embodiments may provide for a local database defined within a storage media of each switch, such as a RAM memory 800, as well as for a data base that is distributed between and among a plurality of switches.


The data or information stored within each switch may generally differ from switch to switch, and the organization or structure of data or information in each switch may or may not be the same. Persistent memory may be used for storage if there is a desirability to maintain the most recent memory contents in the event of a power do or power off situation, however such persistent memory is not required because in at least one non-limiting embodiment, the information is newly gathered when a switch is powered up or reinitiated.


The database or data structure includes a first storage (such as a first field or register) for storing a station information 802 and a second storage (such as for example a second field or register or record) for storing an RF information 804 for each switch. In another embodiment, a common storage (such as a common field or register or record) may store both the station information 802 and the RF information 804. In one embodiment, the station information 802 may include an identification of any detected stations and location record; and, the RF information 804 may include an access-point (AP) information of known APs, unknown APs, and AP radio adjacency 806, where the adjacency may be determined by whether an AP owned by a specific switch can receive RF signals transmitted by the other AP owned by another switch.


Since switch 10 shares a radio adjacency with switch 20, they share the station RF database. Also, since switch 20 shares a radio adjacency with switch 30, they share the station RF database. However, switch 30 and switch 10 do not share a radio adjacency and therefore do not include each others' information. So, the station information and RF information on switch 10 include what it learns from its APs plus what switch 20 has learned from its APs, Switch 20 DB includes switch 20's, switch 10's and switch 30's information. Switch 30 includes switch 30's and switch 20's. Switch 10 does not include switch 30's and switch 30 does not include switch 10's. Advantageously, the amount of information stored on switch 10 and switch 30 is then half of what it would be without using the techniques described herein.


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 system, comprising: (1) a first wireless switch coupled to a first access point including a module monitoring a radio frequency to detect radio adjacency, (2) a second wireless switch coupled to a second access point that is radio adjacent to the first access point, and (3) a third wireless switch coupled to a third access point that is radio adjacent to the second access point and not radio adjacent to the first access point;the first wireless switch configured to be coupled to a first database including wireless data associated with the first wireless switch;the first wireless switch configured to receive access point ownership data from a third database, and to detect, using the access point ownership data, that the second access point is radio adjacent to the first access point;the first wireless switch configured to be coupled to a second database (1) including the wireless data associated with the first wireless switch, (2) including wireless data associated with the second wireless switch based on the detecting of the second access point being radio adjacent to the first access point, the wireless data associated with the second wireless switch including access point radio adjacency information associated with the second access point, and (3) not including wireless data associated with the third wireless switch based on the third access point not being radio adjacent to the first access point; andthe first wireless switch configured to decouple from the second database in response to detecting that the second access point is no longer radio adjacent to the first access point.
  • 2. The system of claim 1, wherein the first wireless switch is configured to be coupled to the third wireless switch including a fourth database storing wireless data associated with the second wireless switch based on the third access point being radio adjacent the second access point.
  • 3. The system of claim 1, wherein the first database is distributed among the first wireless switch, the second wireless switch and the third wireless switch.
  • 4. The system of claim 1, wherein the wireless data associated with the first wireless switch includes radio adjacency information associated with the first access point.
  • 5. The system of claim 1, wherein: the third access point is not radio adjacent to the first access point at a first time,the third access point is radio adjacent to the first access point at a second time after the first time,the first wireless switch is configured to include, at the second time, the wireless data associated with the third wireless switch based on the third access point being radio adjacent to the first access point at the second time.
  • 6. The system of claim 1, wherein the second wireless switch is configured to be coupled to the first database, the second database, and a fourth database, the fourth database including the wireless data associated with the third wireless switch based on the second access point being radio adjacent to the third access point.
  • 7. A method comprising: (1) storing, in a database, wireless data associated with a first wireless switch coupled to a first access point including a module monitoring a radio frequency to detect radio adjacency, (2) detecting a second wireless switch coupled to a second access point that is radio adjacent to the first access point, and (3) detecting a third wireless switch coupled to a third access point not being radio adjacent to the first access point;receiving wireless data associated with the second wireless switch;receiving access point ownership data;detecting, using the access point ownership data, that the second access point is radio adjacent to the first access point;storing, in the database, the wireless data associated with the second wireless switch based on the detecting of the second access point being radio adjacent to the first access point, and not wireless data associated with the third wireless switch based on the third access point not being radio adjacent to the first access point; anddecoupling from the second wireless switch in response to detecting that the second access point is no longer radio adjacent to the first access point.
  • 8. The method of claim 7, wherein the database is a first database, the method further comprising defining a second database, the second database configured to include station information and RF information.
  • 9. The method of claim 7, wherein the wireless data associated with the second wireless switch include data associated with the second access point.
  • 10. The method of claim 7, further comprising: detecting a station; andstoring, in the database, data associated with the station.
  • 11. An apparatus, comprising: (1) a first wireless switch configured to be coupled to a first access point including a module monitoring a radio frequency to detect radio adjacency, (2) a second wireless switch coupled to a second access point being radio adjacent to the first access point and (3) a third wireless station coupled to a third access point being radio adjacent to the second access point and not being radio adjacent to the first access point,the first wireless switch configured to include a memory storing a database including station information and RF information, the RF information including access point radio adjacency data,the first wireless switch configured to include a processor to: evaluate whether the second access point is radio adjacent to the first access point;update the database with the station information and the RF information of the second wireless switch when the second access point is radio adjacent to the first access point;not update the database with the station information and RF information of the third wireless switch when the third access point is not radio adjacent to the first access point;update adjacency information of the database when the first access point is no longer radio adjacent to the second access point; anddecouple from the second wireless switch when the first access point is no longer radio adjacent to the second access point.
  • 12. The apparatus of claim 11, wherein the database is a first database, the first wireless switch is configured to include the memory storing a second database including station radio frequency data.
  • 13. The apparatus of claim 11, wherein the database includes a first field associated with the station information and a second field associated with the RF information; the station information including identification of any detected stations and location record;the RF information including an access-point information of a known access point, an unknown access point, and an access point radio adjacency, the adjacency being determined by whether an access point owned by the first wireless switch can receive RF signals transmitted by the other access point owned by another switch.
CROSS-REFERENCE TO RELATED PATENT APPLICATIONS

This patent application is a Continuation of and claims priority to and the benefit of U.S. patent application Ser. No. 11/595,119, now U.S. Pat. No. 9,191,799, titled “Sharing Data Between Wireless Switches System And Method,” filed Nov. 10, 2006, which claims priority to and the benefit of U.S. Provisional Application No. 60/812,403, filed Jun. 9, 2006, the disclosures of each of which are hereby incorporated by reference in their entireties.

US Referenced Citations (589)
Number Name Date Kind
3641433 Mifflin et al. Feb 1972 A
4168400 deCouasnon et al. Sep 1979 A
4176316 DeRosa et al. Nov 1979 A
4247908 Lockhart, Jr. 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 et al. Dec 1986 A
4635221 Kerr Jan 1987 A
4639914 Winters Jan 1987 A
4644523 Horwitz Feb 1987 A
4672658 Kavehrad et al. Jun 1987 A
4673805 Shepard et al. Jun 1987 A
4707839 Andren et al. Nov 1987 A
4730340 Frazier, Jr. 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, Sr. 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
4955053 Siegmund Sep 1990 A
5008899 Yamamoto Apr 1991 A
5027343 Chan et al. Jun 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
5119502 Kallin et al. Jun 1992 A
5142550 Tymes Aug 1992 A
5151919 Dent Sep 1992 A
5157687 Tymes Oct 1992 A
5157987 Tymes Oct 1992 A
5187575 Lim Feb 1993 A
5231633 Hluchyj et al. Jul 1993 A
5280498 Tymes et al. Jan 1994 A
5285494 Sprecher et al. Feb 1994 A
5327144 Stilp et al. Jul 1994 A
5329531 Diepstraten et al. Jul 1994 A
5339316 Diepstraten Aug 1994 A
5371783 Rose et al. Dec 1994 A
5418812 Reyes et al. May 1995 A
5444851 Woest Aug 1995 A
5448569 Huang et al. Sep 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 et al. Jan 1996 A
5491644 Pickering et al. Feb 1996 A
5517495 Lund et al. May 1996 A
5519762 Bartlett May 1996 A
5528621 Heiman et al. Jun 1996 A
5542100 Hatakeyama Jul 1996 A
5546389 Wippenbeck et al. Aug 1996 A
5561841 Markus Oct 1996 A
5568513 Croft et al. Oct 1996 A
5570366 Baker et al. Oct 1996 A
5584048 Wieczorek Dec 1996 A
5598532 Liron Jan 1997 A
5630207 Gitlin et al. May 1997 A
5640414 Blakeney, II et al. Jun 1997 A
5649289 Wang et al. Jul 1997 A
5668803 Tymes et al. Sep 1997 A
5677954 Hirata et al. Oct 1997 A
5706428 Boer et al. Jan 1998 A
5715304 Nishida et al. Feb 1998 A
5729542 Dupont Mar 1998 A
5742592 Scholefield et al. Apr 1998 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
5828653 Goss Oct 1998 A
5828960 Tang et al. Oct 1998 A
5835061 Stewart Nov 1998 A
5838907 Hansen Nov 1998 A
5844900 Hong et al. Dec 1998 A
5852722 Hamilton Dec 1998 A
5862475 Zicker et al. Jan 1999 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
5909686 Muller et al. Jun 1999 A
5915214 Reece et al. Jun 1999 A
5920821 Seazholtz et al. Jul 1999 A
5933607 Tate et al. Aug 1999 A
5938721 Dussell 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
5969678 Stewart Oct 1999 A
5970066 Lowry et al. Oct 1999 A
5977913 Christ Nov 1999 A
5980078 Krivoshein et al. Nov 1999 A
5982779 Krishnamkumar 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
5999813 Lu et al. Dec 1999 A
6005853 Wang et al. Dec 1999 A
6011784 Brown et al. Jan 2000 A
6012088 Li et al. Jan 2000 A
6029196 Lenz Feb 2000 A
6041240 McCarthy et al. Mar 2000 A
6041358 Huang et al. Mar 2000 A
6070243 See et al. May 2000 A
6073075 Kondou et al. Jun 2000 A
6073152 De Vries Jun 2000 A
6078568 Wright et al. Jun 2000 A
6088591 Trompower et al. Jul 2000 A
6101539 Kennelly et al. Aug 2000 A
6115390 Chuah Sep 2000 A
6118771 Tajika et al. Sep 2000 A
6119009 Baranger et al. Sep 2000 A
6122520 Want et al. Sep 2000 A
6144638 Obenhuber et al. Nov 2000 A
6148199 Hoffman et al. Nov 2000 A
6154776 Martin Nov 2000 A
6160804 Ahmed et al. Dec 2000 A
6177905 Welch Jan 2001 B1
6188649 Birukawa et al. Feb 2001 B1
6199032 Anderson Mar 2001 B1
6208629 Jaszewski et al. Mar 2001 B1
6208841 Wallace et al. Mar 2001 B1
6212395 Lu et al. Apr 2001 B1
6218930 Katzenberg et al. Apr 2001 B1
6240078 Kuhnel et al. May 2001 B1
6240083 Wright et al. May 2001 B1
6240291 Narasimhan et al. May 2001 B1
6246751 Bergl et al. Jun 2001 B1
6249252 Dupray Jun 2001 B1
6256300 Ahmed et al. Jul 2001 B1
6256334 Adachi Jul 2001 B1
6259405 Stewart et al. Jul 2001 B1
6262988 Vig Jul 2001 B1
6269246 Rao et al. Jul 2001 B1
6285662 Watanabe et al. Sep 2001 B1
6304596 Yamano et al. Oct 2001 B1
6304906 Bhatti et al. Oct 2001 B1
6317599 Rappaport et al. Nov 2001 B1
6326918 Stewart Dec 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
6397040 Titmuss et al. May 2002 B1
6404772 Beach et al. Jun 2002 B1
6421714 Rai et al. Jul 2002 B1
6429879 Sturgeon et al. Aug 2002 B1
6446206 Feldbaum Sep 2002 B1
6456239 Werb et al. Sep 2002 B1
6470025 Wilson et al. Oct 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
6526275 Calvert Feb 2003 B1
6535732 McIntosh et al. Mar 2003 B1
6564380 Murphy May 2003 B1
6567146 Hirakata et al. May 2003 B2
6567416 Chuah May 2003 B1
6574240 Tzeng Jun 2003 B1
6580700 Pinard et al. Jun 2003 B1
6587680 Ala-Laurila et al. Jul 2003 B1
6587835 Treyz et al. Jul 2003 B1
6603970 Huelamo Platas et al. Aug 2003 B1
6614787 Jain et al. Sep 2003 B1
6615276 Mastrianni et al. Sep 2003 B1
6624762 End, III Sep 2003 B1
6625454 Rappaport et al. Sep 2003 B1
6631267 Clarkson et al. Oct 2003 B1
6650912 Chen et al. Nov 2003 B2
6658389 Alpdemir Dec 2003 B1
6659947 Carter et al. Dec 2003 B1
6661787 O'Connell et al. Dec 2003 B1
6674403 Gray et al. Jan 2004 B2
6677894 Sheynblat et al. Jan 2004 B2
6678516 Nordman et al. Jan 2004 B2
6678802 Hickson Jan 2004 B2
6687498 McKenna et al. Feb 2004 B2
6697415 Mahany Feb 2004 B1
6721334 Ketcham Apr 2004 B1
6725260 Philyaw Apr 2004 B1
6738629 McCormick et al. May 2004 B1
6747961 Ahmed et al. Jun 2004 B1
6756940 Oh et al. Jun 2004 B2
6760324 Scott et al. Jul 2004 B1
6785275 Boivie et al. Aug 2004 B1
6798788 Viswanath et al. Sep 2004 B1
6801782 McCrady et al. Oct 2004 B2
6826399 Hoffman et al. Nov 2004 B1
6839338 Amara et al. Jan 2005 B1
6839348 Tang et al. Jan 2005 B2
6839388 Vaidyanathan Jan 2005 B2
6847620 Meier Jan 2005 B1
6847892 Zhou et al. Jan 2005 B2
6856800 Henry et al. Feb 2005 B1
6879812 Agrawal et al. Apr 2005 B2
6901439 Bonasia et al. May 2005 B1
6917688 Yu et al. Jul 2005 B2
6934260 Kanuri Aug 2005 B1
6937566 Forslow Aug 2005 B1
6938079 Anderson et al. Aug 2005 B1
6954790 Forslöw Oct 2005 B2
6957067 Iyer et al. Oct 2005 B1
6973622 Rappaport et al. Dec 2005 B1
6978301 Tindal Dec 2005 B2
6980533 Abraham et al. Dec 2005 B1
6985469 Leung Jan 2006 B2
6993683 Bhat et al. Jan 2006 B2
6996630 Masaki et al. Feb 2006 B1
7013157 Norman et al. Mar 2006 B1
7020438 Sinivaara et al. Mar 2006 B2
7020773 Otway Mar 2006 B1
7024199 Massie et al. Apr 2006 B1
7024394 Ashour et al. Apr 2006 B1
7027773 McMillin Apr 2006 B1
7031705 Grootwassink Apr 2006 B2
7035220 Simcoe Apr 2006 B1
7039037 Wang et al. May 2006 B2
7058414 Rofheart et al. Jun 2006 B1
7062566 Amara et al. Jun 2006 B2
7068999 Ballai Jun 2006 B2
7079537 Kanuri et al. Jul 2006 B1
7089322 Stallmann Aug 2006 B1
7092529 Yu et al. Aug 2006 B2
7110756 Diener Sep 2006 B2
7116979 Backes et al. Oct 2006 B2
7126913 Patel et al. Oct 2006 B1
7134012 Doyle et al. Nov 2006 B2
7139829 Wenzel et al. Nov 2006 B2
7142867 Gandhi et al. Nov 2006 B1
7146166 Backes et al. Dec 2006 B2
7155236 Chen et al. Dec 2006 B2
7155518 Forslöw Dec 2006 B2
7158777 Lee et al. Jan 2007 B2
7159016 Baker Jan 2007 B2
7221927 Kolar et al. May 2007 B2
7224970 Smith et al. May 2007 B2
7239862 Clare et al. Jul 2007 B1
7246243 Uchida Jul 2007 B2
7263366 Miyashita Aug 2007 B2
7274730 Nakabayashi Sep 2007 B2
7277434 Astarabadi et al. Oct 2007 B2
7280495 Zweig et al. Oct 2007 B1
7290051 Dobric et al. Oct 2007 B2
7293136 More et al. Nov 2007 B1
7295960 Rappaport et al. Nov 2007 B2
7310664 Merchant et al. Dec 2007 B1
7317914 Adya et al. Jan 2008 B2
7320070 Baum Jan 2008 B2
7324468 Fischer Jan 2008 B2
7324487 Saito Jan 2008 B2
7324489 Iyer et al. Jan 2008 B1
7350077 Meier et al. Mar 2008 B2
7359676 Hrastar Apr 2008 B2
7370362 Olson et al. May 2008 B2
7376080 Riddle et al. May 2008 B1
7379423 Caves et al. May 2008 B1
7382756 Barber et al. Jun 2008 B2
7417953 Hicks et al. Aug 2008 B2
7421248 Laux et al. Sep 2008 B1
7421487 Peterson et al. Sep 2008 B1
7440416 Mahany et al. Oct 2008 B2
7443823 Hunkeler et al. Oct 2008 B2
7447502 Buckley Nov 2008 B2
7451316 Halasz et al. Nov 2008 B2
7460855 Barkley et al. Dec 2008 B2
7466678 Cromer et al. Dec 2008 B2
7475130 Silverman Jan 2009 B2
7477894 Sinha Jan 2009 B1
7480264 Duo et al. Jan 2009 B1
7483390 Rover et al. Jan 2009 B2
7489648 Griswold Feb 2009 B2
7493407 Leedom et al. Feb 2009 B2
7505434 Backes Mar 2009 B1
7509096 Palm et al. Mar 2009 B2
7525215 Keenley et al. Apr 2009 B2
7529925 Harkins May 2009 B2
7551574 Peden, II et al. Jun 2009 B1
7551619 Tiwari Jun 2009 B2
7558266 Hu Jul 2009 B2
7570656 Raphaeli et al. Aug 2009 B2
7573859 Taylor Aug 2009 B2
7577453 Matta Aug 2009 B2
7592906 Hanna et al. Sep 2009 B1
7636363 Chang et al. Dec 2009 B2
7680086 Eglin Mar 2010 B2
7680501 Sillasto et al. Mar 2010 B2
7693526 Qian et al. Apr 2010 B2
7715432 Bennett May 2010 B2
7716379 Ruan et al. May 2010 B2
7724703 Matta et al. May 2010 B2
7724704 Simons et al. May 2010 B2
7729278 Chari et al. Jun 2010 B2
7733868 Van Zijst Jun 2010 B2
7746897 Stephenson et al. Jun 2010 B2
7788475 Zimmer et al. Aug 2010 B2
7805529 Galluzzo et al. Sep 2010 B2
7817554 Skog et al. Oct 2010 B2
7844298 Riley Nov 2010 B2
7865713 Chesnutt et al. Jan 2011 B2
7873061 Gast et al. Jan 2011 B2
7894852 Hansen Feb 2011 B2
7912982 Murphy Mar 2011 B2
7929922 Kubo Apr 2011 B2
7945399 Nosovitsky et al. May 2011 B2
7986940 Lee et al. Jul 2011 B2
8072952 Aragon et al. Dec 2011 B2
8238942 Gast Aug 2012 B2
8250587 Zeldin et al. Aug 2012 B2
8340110 Gast Dec 2012 B2
8457031 Matta Jun 2013 B2
8509128 Gast Aug 2013 B2
8638762 Tiwari Jan 2014 B2
8818322 Murphy et al. Aug 2014 B2
8902904 Gast et al. Dec 2014 B2
20010024953 Balogh Sep 2001 A1
20020021701 Lavian et al. Feb 2002 A1
20020052205 Belostotsky et al. May 2002 A1
20020060995 Cervello et al. May 2002 A1
20020062384 Tso May 2002 A1
20020078361 Giroux et al. Jun 2002 A1
20020080790 Beshai Jun 2002 A1
20020087699 Karagiannis et al. Jul 2002 A1
20020094824 Kennedy et al. Jul 2002 A1
20020095486 Bahl Jul 2002 A1
20020101868 Clear et al. Aug 2002 A1
20020116655 Lew et al. Aug 2002 A1
20020157020 Royer Oct 2002 A1
20020174137 Wolff et al. Nov 2002 A1
20020176437 Busch et al. Nov 2002 A1
20020191572 Weinstein et al. Dec 2002 A1
20020194251 Richter et al. Dec 2002 A1
20030014646 Buddhikot et al. Jan 2003 A1
20030018889 Burnett et al. Jan 2003 A1
20030043073 Gray et al. Mar 2003 A1
20030055959 Sato Mar 2003 A1
20030107590 Levillain et al. Jun 2003 A1
20030120764 Laye et al. Jun 2003 A1
20030133450 Baum Jul 2003 A1
20030134642 Kostic et al. Jul 2003 A1
20030135762 Macaulay Jul 2003 A1
20030156586 Lee et al. Aug 2003 A1
20030174706 Shankar et al. Sep 2003 A1
20030193910 Shoaib et al. Oct 2003 A1
20030204596 Yadav Oct 2003 A1
20030227934 White et al. Dec 2003 A1
20040002343 Brauel et al. Jan 2004 A1
20040003285 Whelan et al. Jan 2004 A1
20040019857 Teig et al. Jan 2004 A1
20040025044 Day Feb 2004 A1
20040029580 Haverinen et al. Feb 2004 A1
20040030777 Reedy et al. Feb 2004 A1
20040038687 Nelson Feb 2004 A1
20040044749 Harkin Mar 2004 A1
20040053632 Nikkelen et al. Mar 2004 A1
20040054569 Pombo et al. Mar 2004 A1
20040054774 Barber et al. Mar 2004 A1
20040054926 Ocepek 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
20040072587 Tari Apr 2004 A1
20040078598 Barber et al. Apr 2004 A1
20040093506 Grawrock et al. May 2004 A1
20040095914 Katsube et al. May 2004 A1
20040106403 Mori et al. Jun 2004 A1
20040111640 Baum Jun 2004 A1
20040114546 Seshadri et al. Jun 2004 A1
20040119641 Rapeli Jun 2004 A1
20040120370 Lupo Jun 2004 A1
20040165545 Cook Aug 2004 A1
20040174900 Volpi et al. Sep 2004 A1
20040184475 Meier Sep 2004 A1
20040208570 Reader Oct 2004 A1
20040214572 Thompson et al. Oct 2004 A1
20040221042 Meier Nov 2004 A1
20040230370 Tzamaloukas Nov 2004 A1
20040233234 Chaudhry et al. Nov 2004 A1
20040236702 Fink et al. Nov 2004 A1
20040246937 Duong et al. Dec 2004 A1
20040246962 Kopeikin et al. Dec 2004 A1
20040252656 Shiu et al. Dec 2004 A1
20040255167 Knight Dec 2004 A1
20040259542 Viitamaki et al. Dec 2004 A1
20040259555 Rappaport et al. Dec 2004 A1
20040259575 Perez-Breva et al. Dec 2004 A1
20050015592 Lin Jan 2005 A1
20050021979 Wiedmann et al. Jan 2005 A1
20050025105 Rue Feb 2005 A1
20050026611 Backes Feb 2005 A1
20050030894 Stephens Feb 2005 A1
20050030929 Swier, Jr. et al. Feb 2005 A1
20050037818 Seshadri et al. Feb 2005 A1
20050040968 Damarla et al. Feb 2005 A1
20050054326 Rogers Mar 2005 A1
20050054350 Zegelin Mar 2005 A1
20050058132 Okano et al. Mar 2005 A1
20050059405 Thomson et al. Mar 2005 A1
20050059406 Thomson Mar 2005 A1
20050064873 Karaoguz et al. Mar 2005 A1
20050068925 Palm Mar 2005 A1
20050073980 Thomson et al. Apr 2005 A1
20050078644 Tsai et al. Apr 2005 A1
20050097618 Arling et al. May 2005 A1
20050114649 Challener et al. May 2005 A1
20050120125 Morten et al. Jun 2005 A1
20050122927 Wentink Jun 2005 A1
20050122977 Lieberman Jun 2005 A1
20050128142 Shin et al. Jun 2005 A1
20050128989 Bhagwat et al. Jun 2005 A1
20050144237 Heredia et al. Jun 2005 A1
20050154933 Hsu et al. Jul 2005 A1
20050157730 Grant et al. Jul 2005 A1
20050159154 Goren Jul 2005 A1
20050163078 Oba et al. Jul 2005 A1
20050163146 Ota et al. Jul 2005 A1
20050175027 Miller et al. Aug 2005 A1
20050180345 Meier Aug 2005 A1
20050180358 Kolar et al. Aug 2005 A1
20050181805 Gallagher Aug 2005 A1
20050181814 Okamoto Aug 2005 A1
20050190714 Gorbatov et al. Sep 2005 A1
20050193103 Drabik Sep 2005 A1
20050207336 Choi et al. Sep 2005 A1
20050213519 Relan et al. Sep 2005 A1
20050220033 DelRegno et al. Oct 2005 A1
20050223111 Bhandaru et al. Oct 2005 A1
20050239461 Verma et al. Oct 2005 A1
20050240665 Gu et al. Oct 2005 A1
20050243737 Dooley et al. Nov 2005 A1
20050245258 Classon et al. Nov 2005 A1
20050245269 Demirhan et al. Nov 2005 A1
20050259597 Benedetto et al. Nov 2005 A1
20050259611 Bhagwat et al. Nov 2005 A1
20050270992 Sanzgiri et al. Dec 2005 A1
20050273442 Bennett Dec 2005 A1
20050276218 Ooghe et al. Dec 2005 A1
20050286466 Tagg et al. Dec 2005 A1
20060030290 Rudolf et al. Feb 2006 A1
20060030330 Black Feb 2006 A1
20060035662 Jeong et al. Feb 2006 A1
20060039395 Perez-Costa et al. Feb 2006 A1
20060041683 Subramanian et al. Feb 2006 A1
20060045050 Floros et al. Mar 2006 A1
20060046744 Dublish et al. Mar 2006 A1
20060050742 Grandhi et al. Mar 2006 A1
20060073847 Pirzada et al. Apr 2006 A1
20060094440 Meier et al. May 2006 A1
20060098607 Zeng et al. May 2006 A1
20060104224 Singh et al. May 2006 A1
20060114872 Hamada Jun 2006 A1
20060117174 Lee Jun 2006 A1
20060128415 Horikoshi et al. Jun 2006 A1
20060143496 Silverman Jun 2006 A1
20060152344 Mowery Jul 2006 A1
20060160540 Strutt et al. Jul 2006 A1
20060161983 Cothrell et al. Jul 2006 A1
20060165103 Trudeau et al. Jul 2006 A1
20060168383 Lin Jul 2006 A1
20060174336 Chen Aug 2006 A1
20060178168 Roach Aug 2006 A1
20060182118 Lam et al. Aug 2006 A1
20060189311 Cromer et al. Aug 2006 A1
20060193258 Ballai Aug 2006 A1
20060200862 Olson et al. Sep 2006 A1
20060206582 Finn Sep 2006 A1
20060215601 Vieugels et al. Sep 2006 A1
20060217131 Alizadeh-Shabdiz et al. Sep 2006 A1
20060245393 Bajic Nov 2006 A1
20060246892 vonDoenhoff Nov 2006 A1
20060248229 Saunderson et al. Nov 2006 A1
20060248331 Harkins Nov 2006 A1
20060274774 Srinivasan et al. Dec 2006 A1
20060276192 Dutta et al. Dec 2006 A1
20060285489 Francisco et al. Dec 2006 A1
20060292992 Tajima et al. Dec 2006 A1
20070002833 Bajic Jan 2007 A1
20070008884 Tang Jan 2007 A1
20070011318 Roth Jan 2007 A1
20070025265 Porras et al. Feb 2007 A1
20070025306 Cox et al. Feb 2007 A1
20070027964 Herrod et al. Feb 2007 A1
20070054616 Culbert Mar 2007 A1
20070058598 Ling Mar 2007 A1
20070064673 Bhandaru et al. Mar 2007 A1
20070064718 Eki et al. Mar 2007 A1
20070067823 Shim et al. Mar 2007 A1
20070070937 Demirhan et al. Mar 2007 A1
20070076694 Iyer et al. Apr 2007 A1
20070083924 Lu Apr 2007 A1
20070086378 Matta et al. Apr 2007 A1
20070086397 Taylor Apr 2007 A1
20070086398 Tiwari Apr 2007 A1
20070091845 Brideglall Apr 2007 A1
20070091889 Xiao et al. Apr 2007 A1
20070098086 Bhaskaran May 2007 A1
20070104197 King May 2007 A1
20070115842 Matsuda et al. May 2007 A1
20070127414 Sridhar Jun 2007 A1
20070133494 Lai et al. Jun 2007 A1
20070135866 Baker et al. Jun 2007 A1
20070136372 Proctor et al. Jun 2007 A1
20070160046 Matta Jul 2007 A1
20070171909 Pignatelli Jul 2007 A1
20070183375 Tiwari Aug 2007 A1
20070189222 Kolar et al. Aug 2007 A1
20070195793 Grosser et al. Aug 2007 A1
20070230457 Kodera et al. Oct 2007 A1
20070248009 Petersen Oct 2007 A1
20070253380 Jollota et al. Nov 2007 A1
20070255116 Mehta et al. Nov 2007 A1
20070258448 Hu Nov 2007 A1
20070260720 Morain Nov 2007 A1
20070268506 Zeldin Nov 2007 A1
20070268514 Zeldin et al. Nov 2007 A1
20070268515 Freund et al. Nov 2007 A1
20070268516 Bugwadia et al. Nov 2007 A1
20070286208 Kanada et al. Dec 2007 A1
20070287390 Murphy et al. Dec 2007 A1
20070291689 Kapur et al. Dec 2007 A1
20070297329 Park et al. Dec 2007 A1
20080002588 McCaughan et al. Jan 2008 A1
20080008117 Alizadeh-Shabdiz Jan 2008 A1
20080014916 Chen Jan 2008 A1
20080031257 He Feb 2008 A1
20080056200 Johnson Mar 2008 A1
20080056211 Kim et al. Mar 2008 A1
20080064356 Khayrallah Mar 2008 A1
20080069018 Gast Mar 2008 A1
20080075059 Kermoal Mar 2008 A1
20080080441 Park et al. Apr 2008 A1
20080096575 Aragon et al. Apr 2008 A1
20080102815 Sengupta et al. May 2008 A1
20080107077 Murphy May 2008 A1
20080114784 Murphy May 2008 A1
20080117822 Murphy et al. May 2008 A1
20080151844 Tiwari Jun 2008 A1
20080159319 Gast et al. Jul 2008 A1
20080162921 Chestnutt et al. Jul 2008 A1
20080220772 Islam et al. Sep 2008 A1
20080226075 Gast Sep 2008 A1
20080228942 Lor et al. Sep 2008 A1
20080250496 Namihira Oct 2008 A1
20080261615 Kalhan Oct 2008 A1
20080276303 Gast Nov 2008 A1
20090031044 Barrack et al. Jan 2009 A1
20090046688 Volpi et al. Feb 2009 A1
20090059930 Ryan et al. Mar 2009 A1
20090067436 Gast Mar 2009 A1
20090073905 Gast Mar 2009 A1
20090131082 Gast May 2009 A1
20090198999 Harkins Aug 2009 A1
20090247103 Aragon Oct 2009 A1
20090257437 Taylor Oct 2009 A1
20090260083 Szeto et al. Oct 2009 A1
20090274060 Taylor Nov 2009 A1
20090287816 Matta et al. Nov 2009 A1
20090293106 Peden, II et al. Nov 2009 A1
20100002610 Bowser et al. Jan 2010 A1
20100024007 Gast Jan 2010 A1
20100040059 Hu Feb 2010 A1
20100067379 Zhao et al. Mar 2010 A1
20100172276 Aragon Jul 2010 A1
20100180016 Bugwadia et al. Jul 2010 A1
20100195549 Aragon et al. Aug 2010 A1
20100261475 Kim et al. Oct 2010 A1
20100329177 Murphy et al. Dec 2010 A1
20110128858 Matta et al. Jun 2011 A1
20110158122 Murphy et al. Jun 2011 A1
20110255466 Gast et al. Oct 2011 A1
Foreign Referenced Citations (17)
Number Date Country
0 992 921 Apr 2000 EP
1 542 409 Jun 2005 EP
2 329 801 Mar 1999 GB
2429080 Feb 2007 GB
2000-215169 Aug 2000 JP
2003-234751 Aug 2003 JP
2003274454 Sep 2003 JP
2004-032525 Jan 2004 JP
WO 1994003986 Feb 1994 WO
WO 1999011003 Mar 1999 WO
WO 0006271 Feb 2000 WO
WO 0018148 Mar 2000 WO
WO 02089442 Nov 2002 WO
WO 03085544 Oct 2003 WO
WO 2004095800 Jan 2004 WO
WO 04013986 Feb 2004 WO
WO 2004095192 Nov 2004 WO
Non-Patent Literature Citations (178)
Entry
U.S. Appl. No. 11/377,850, filed Mar. 16, 2006, Tsai-Shih Tung.
U.S. Appl. No. 11/417,830, filed May 3, 2006, Morain, Gary Eugene.
U.S. Appl. No. 11/437,537, filed May 19, 2006, Yun Freund et al.
U.S. Appl. No. 11/437,538, filed May 19, 2006, Zeldin, Paul.
U.S. Appl. No. 11/437,387, filed May 19, 2006, Zeldin, Paul.
U.S. Appl. No. 11/437,582, filed May 19, 2006, Jamsheed Bugwadia.
U.S. Appl. No. 11/588,849, filed Oct. 26, 2006, Zelden, Paul E.
U.S. Appl. No. 11/588,878, filed Oct. 26, 2006, Zelden, Paul E.
U.S. Appl. No. 11/592,891, filed Nov. 3, 2006, Murphy, James.
U.S. Appl. No. 11/643,329, filed Dec. 20, 2006, Tiwari, Manish.
U.S. Appl. No. 11/648,359, filed Dec. 28, 2006, Gast, Matthew Stuart.
U.S. Appl. No. 11/066,942, filed Feb. 26, 2005, Ettlinger, Eugene.
U.S. Appl. No. 12/077,051, filed Mar. 14, 2008, Gast, Matthew Stuart.
U.S. Appl. No. 11/595,119, filed Nov. 10, 2006, Murphy, James.
U.S. Appl. No. 11/966,912, filed Dec. 28, 2007, Chestnutt, Stan.
P. Martinez, M. Brunner, J. Quittek, F. Straus, J. Schonwlder, S. Mertens, T. Klie “Using the Script MIB for Policy-based Configuration Management”, Technical University Braunschweig, Braunschweig, Germany, 2002.
Law, A., “New Service Discovery Protocol,” Internet Citation [Online] XP002292473 Retrieved from the Internet: <URL: http://sem.uccalgary.ca˜lawa/SENG60921/arch/SDP.htm> [retrieved Aug. 12, 2004] (15 pages).
P. Bahl et al., RADAR: An In-Building RF-based User Location and Tracking System, Microsoft Research, Mar. 2000, 10 pages.
Latvala J. et al., Evaluation of RSSI-Based Human Tracking, Proceedings for the 2000 European Signal Processing Conference, Sep. 2000, 9 pages.
Bahl P. et al. “User Location and Tracking in an In-Building Radio Network,” Microsoft Research, Feb. 1999, 13 pages.
P. Bahl et al., A Software System for Locating Mobile Users: Design, Evaluation, and Lessons, Microsoft Research, Feb. 1999, 13 pages.
Chen, Yen-Chen et al., “Enabling Location-Based Services on Wireless LANs”, Networks, 2003. ICON2003. The 11th IEEE International Conference, Sep. 28-Oct. 1, 2003, pp. 567-572.
Erten, Y. Murat, “A Layered Security Architecture for Corporate 802.11 Wireless Networks”, Wireless Telecommunications Symposium, May 14-15, 2004, pp. 123-128.
Kleine-Ostmann, T., et al., “A Data Fusion Architecture for Enhanced Position Estimation in Wireless Networks,” IEEE Communications Letters , vol. 5(8), Aug. 2001, p. 343-345.
Pulson, Time Domain Corporation, Ultra wideband (UWB) Radios for Precision Location, Third IEEE Workshop on Wireless Local Area Networks, Sep. 27-28, 2001, 8 pages.
Barber, S., Monitoring 802.1 Networks, IEEE 802.11, Sydney, NSW, May 13-17, 2002.
Latvala, J. et al. “Patient Tracking in a Hospital Environment Using Extended Kalman-filtering,” Proceedings of the 1999 Middle East Conference on Networking, Nov. 1999, 5 pages.
Myllymaki, P. et al., “A Probabilistic Approach to WLAN User Location Estimation,” Third IEEE Workshop on Wireless Local Area Networks, Sep. 27-28, 2001, 12 pages.
Potter, B., and Fleck, B., 802.11 Security, O'Reilly Media Inc., Dec. 2002, 14 pages.
McCann, S., et al., “Emergency Services for 802,” IEEE 802.11-07/0505r1, Mar. 2007, 27 pages.
Di Sorte, D., et al., “On the Performance of Service Publishing in IEEE 802.11 Multi-Access Environment,” IEEE Communications Letters, vol. 11, No. 4, Apr. 2007, 3 pages.
Microsoft Computer Dictionary, Fifth Edition, Microsoft Corporation, 2002, 2 pages.
Thomson, Allan, Cisco Systems, AP Power Down Notification, Power Point slide show; IEEE standards committee meeting Jul. 15, 2008; doc.: IEEE 802.11-08/0759r0, 14 pages.
3COM, Wireless LAN Mobility System: Wireless LAN Switch and Controller Configuration Guide, 3COM, Revision A, Oct. 2004, 476 pages.
3COM, Wireless LAN Switch Manager (3WXM), 3COM, Revision C, Oct. 2004, 8 pages.
3COM, Wireless LAN Switch and Controller; Quick Start Guide, 3COM, Revision B, Nov. 2004, 10 pages.
3COM, Wireless LAN Mobility System; Wireless LAN Switch and Controller Installation and Basic Configuration Guide, Revision B, Apr. 2005, 496 pages.
Johnson, David B, et al., “DSR The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks,” Computer Science Department, Carnegie Mellon University, Nov. 3, 2005 (http://monarch.cs.rice.edu/monarch-papers/dsr-chapter00.pdf).
Information Sciences Institute, RFC-791—Internet Protocol, DARPA, Sep. 1981.
Aerohive Blog, posted by Devin Akin, Cooperative Control: Part 3, [Online] Retrieved from the Internet: <URL: http://blog.aerohive.com/blog/?p=71> Mar. 1, 2010 (3 pages).
Wikipedia, Wireless LAN, 2 definitions for wireless LAN roaming, [Online] [retrieved Oct. 4, 2010] Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Wireless LAN> (1 page).
Puttini, R., Percher, J., Mr, L. and deSousa, R., 2004, A fully distributed IDS for MANET. In Proceedings of the Ninth International Symposium on Computers and Communications 2004, vol. 2, (Iscc '04)—vol. 02 (Jun. 28-Jul. 1, 2004), ISCC, IEEE Computer Society, Washington, DC, 331-338.
Acampora and Winters, IEEE Communications Magazine, 25(8):11-20 (1987).
Acampora and Winters, IEEE Journal on selected Areas in Communications SAC 5:796-804 (1987).
Bing and Subramanian, IEEE, 1318-1322 (1997).
Durgin, et al., “Measurements and Models for Radio Path Loss and Penetration Loss in and Around Homes and Trees at 5.85 GHz”, IEEE Transactions on Communications, vol. 46, No. 11, Nov. 1998.
Freret et al., “Applications of Spread-Spectrum Radio to Wireless Terminal Communications,” Conf. Record, Nat'l Telecom. Conference, Nov. 30-Dec. 4, 1980.
Fortune, et al., IEEE Computational Science and Engineering, “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, pp. 58-68 (1995).
Geier, Jim, Wireless Lans Implementing Interoperable Networks, Chapter 3, (pp. 89-125) Chapter 4 (pp. 129-157) Chapter 5 (pp. 159-189) and Chapter 6 (pp. 193-234), 1999, United States.
Ho et al., “Antenna Effects on Indoor Obstructed Wireless Channels and a Deterministic Image-Based Wide-Based Propagation Model for In-Building Personal Communications Systems”, International Journal of Wireless Information Networks, vol. 1, No. 1, 1994.
Kim et al., “Radio Propagation Measurements and Prediction Using Three-Dimensional Ray Tracing in Urban Environments at 908 MHz and 1.9 GHz”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
Kleinrock and Scholl, Conference record 1977 ICC vol. 2 of 3, Jun. 12-15 Chicago Illinois, “Packet Switching in radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of data Useres”, (1977).
LAN/MAN Standars Committee of the IEEE Computer Society, Part II: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Higher Speed Physical Layer Extension in the 2.4 GHz Band, IEEE Std. 802.11b (1999).
Okamoto and Xu, IEEE, Proceeding of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).
Panjwani et al., “Interactive Computation of Coverage Regions for Wireless Communication in Multifloored Indoor Environments”, IEEE Journal on Selected Areas in Communications, vol. 14, No. 3, Apr. 1996.
Perram and Martinez, “Technology Developments for Low-Cost Residential Alarm Systems”, Proceedings 1977 Carnahan Conference on Crime Countermeasures, Apr. 6-8, pp. 45-50 (1977).
Piazzi et al., “Achievable Accuracy of Site-Specific Path-Loss Predictions in Residential Environments”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
Seidel et al., “Site-Specific Propagation Prediction for Wireless In-Building Personal Communications System Design”, IEEE Transactions on Vehicular Technology, vol. 43, No. 4, Nov. 1994.
Skidmore et al., Interactive Coverage Region and System Design Simulation for Wireless Communication Systems in Multi-floored Indoor Environments, SMT Plus IEEE ICUPC '96 Proceedings (1996).
Ullmo et al., “Wireless Propagation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
U.S. Appl. No. 12/957,997, filed Dec. 1, 2010.
U.S. Appl. No. 12/603,391, filed Oct. 21, 2009.
U.S. Appl. No. 12/763,057, filed Apr. 19, 2010.
U.S. Appl. No. 09/866,474, filed May 29, 2001.
U.S. Appl. No. 13/017,801, filed Jan. 31, 2011.
Office Action for U.S. Appl. No. 11/784,307, dated Sep. 22, 2009.
Final Office Action for U.S. Appl. No. 11/784,307, dated Jun. 14, 2010.
Non-Final Office Action for U.S. Appl. No. 11/377,859, dated Jan. 8, 2008.
Final Office Action for U.S. Appl. No. 11/377,859, dated Aug. 27, 2008.
Office Action for U.S. Appl. No. 12/401,073, dated Aug. 23, 2010.
Final Office Action for U.S. Appl. No. 12/401,073, dated Apr. 1, 2011.
Office Action for U.S. Appl. No. 12/401,073, dated Sep. 20, 2011.
Office Action for U.S. Appl. No. 11/326,966, dated Nov. 14, 2008.
Office Action for U.S. Appl. No. 12/500,392, dated Jun. 20, 2011.
Office Action for U.S. Appl. No. 11/400,165, dated Aug. 19, 2008.
Office Action for U.S. Appl. No. 12/489,295, dated Apr. 27, 2011.
Office Action for U.S. Appl. No. 11/330,877, dated Sep. 11, 2008.
Final Office Action for U.S. Appl. No. 11/330,877, dated Mar. 13, 2009.
Office Action for U.S. Appl. No. 11/330,877, dated Aug. 6, 2009.
Final Office Action for U.S. Appl. No. 11/330,877, dated Apr. 22, 2010.
Office Action for U.S. Appl. No. 11/330,877, dated Jan. 13, 2011.
Final Office Action for U.S. Appl. No. 11/330,877, dated May 27, 2011.
Office Action for U.S. Appl. No. 11/351,104, dated Oct. 28, 2008.
Office Action for U.S. Appl. No. 11/351,104, dated Dec. 2, 2009.
Final Office Action for U.S. Appl. No. 11/351,104, dated Jun. 10, 2009.
Office Action for U.S. Appl. No. 11/351,104, dated May 26, 2010.
Office Action for U.S. Appl. No. 11/351,104, dated Nov. 29, 2010.
Office Action for U.S. Appl. No. 11/351,104, dated Jul. 26, 2011.
Office Action for U.S. Appl. No. 11/437,537, dated Dec. 23, 2008.
Final Office Action for U.S. Appl. No. 11/437,537, dated Jul. 16, 2009.
Office Action for U.S. Appl. No. 11/331,789, dated Jun. 13, 2008.
Final Office Action for U.S. Appl. No. 11/331,789, dated Oct. 23, 2008.
Office Action for U.S. Appl. No. 11/331,789, dated Aug. 5, 2009.
Office Action for U.S. Appl. No. 12/785,362, dated Apr. 22, 2011.
Office Action for U.S. Appl. No. 11/417,830, dated Nov. 14, 2008.
Final Office Action for U.S. Appl. No. 11/417,830, dated May 28, 2009.
Office Action for U.S. Appl. No. 11/417,993, dated Oct. 29, 2008.
Office Action for U.S. Appl. No. 12/370,562, dated Sep. 30, 2010.
Office Action for U.S. Appl. No. 12/370,562, dated Apr. 6, 2011.
Office Action for U.S. Appl. No. 11/592,891, dated Jan. 15, 2009.
Final Office Action for U.S. Appl. No. 11/592,891, dated Jul. 20, 2009.
Office Action for U.S. Appl. No. 11/604,075, dated May 3, 2010.
Office Action for U.S. Appl. No. 11/845,029, dated Jul. 9, 2009.
Final Office Action for U.S. Appl. No. 11/845,029, dated Jan. 25, 2010.
Office Action for U.S. Appl. No. 11/845,029, dated May 14, 2010.
Final Office Action for U.S. Appl. No. 11/845,029, dated Dec. 9, 2010.
Office Action for U.S. Appl. No. 11/845,029, dated Sep. 27, 2011.
Office Action for U.S. Appl. No. 11/437,538, dated Dec. 22, 2008.
Final Office Action for U.S. Appl. No. 11/437,538, dated Jun. 10, 2009.
Office Action for U.S. Appl. No. 11/437,387, dated Dec. 23, 2008.
Final Office Action for U.S. Appl. No. 11/437,387, dated Jul. 15, 2009.
Office Action for U.S. Appl. No. 11/437,582, dated Jan. 8, 2009.
Final Office Action for U.S. Appl. No. 11/437,582, dated Jul. 22, 2009.
Office Action for U.S. Appl. No. 11/801,964, dated Sep. 17, 2010.
Final Office Action for U.S. Appl. No. 11/801,964, dated May 11, 2011.
Office Action for U.S. Appl. No. 12/304,100, dated Jun. 17, 2011.
Office Action for U.S. Appl. No. 11/487,722, dated Aug. 7, 2009.
Office Action for U.S. Appl. No. 11/643,329, dated Jul. 9, 2010.
Office Action for U.S. Appl. No. 11/648,359, dated Nov. 19, 2009.
Office Action for U.S. Appl. No. 11/944,346, dated Nov. 23, 2010.
Office Action for U.S. Appl. No. 12/077,051, dated Dec. 28, 2010.
Office Action for U.S. Appl. No. 12/113,535, dated Apr. 21, 2011.
Office Action for U.S. Appl. No. 11/852,234, dated Jun. 29, 2009.
Office Action for U.S. Appl. No. 11/852,234, dated Jan. 21, 2010.
Office Action for U.S. Appl. No. 11/852,234, dated Aug. 9, 2010.
Office Action for U.S. Appl. No. 11/852,234, dated Apr. 27, 2011.
Office Action for U.S. Appl. No. 11/970,484, dated Nov. 24, 2010.
Final Office Action for U.S. Appl. No. 11/970,484, dated Jul. 22, 2011.
Office Action for U.S. Appl. No. 12/172,195, dated Jun. 1, 2010.
Office Action for U.S. Appl. No. 12/172,195, dated Nov. 12, 2010.
Office Action for U.S. Appl. No. 12/336,492, dated Sep. 15, 2011.
Office Action for U.S. Appl. No. 12/210,917, dated Nov. 15, 2010.
Final Office Action for U.S. Appl. No. 12/210,917, dated May 13, 2011.
Office Action for U.S. Appl. No. 12/350,927, dated Aug. 17, 2011.
Office Action for U.S. Appl. No. 12/365,891, dated Aug. 29, 2011.
Office Action for U.S. Appl. No. 10/235,338, dated Jan. 8, 2003.
Office Action for U.S. Appl. No. 11/094,987, dated Dec. 27, 2007.
Final Office Action for U.S. Appl. No. 11/094,987, dated May 23, 2008.
Office Action for U.S. Appl. No. 11/094,987, dated Oct. 21, 2008.
Office Action for U.S. Appl. No. 12/474,020, dated Jun. 3, 2010.
Final Office Action for U.S. Appl. No. 12/474,020, dated Oct. 4, 2010.
Office Action for U.S. Appl. No. 09/866,474, dated Nov. 30, 2004.
Final Office Action for U.S. Appl. No. 09/866,474, dated Jun. 10, 2005.
Office Action for U.S. Appl. No. 10/667,027, dated Jul. 29, 2005.
Final Office Action for U.S. Appl. No. 10/667,027, dated Mar. 10, 2006.
Office Action for U.S. Appl. No. 10/667,027, dated May 5, 2006.
Final Office Action for U.S. Appl. No. 10/667,027, dated Feb. 26, 2007.
Office Action for U.S. Appl. No. 10/666,848, dated Mar. 22, 2007.
Office Action for U.S. Appl. No. 10/667,136, dated Jan. 25, 2006.
Office Action for U.S. Appl. No. 10/667,136, dated Aug. 28, 2006.
Final Office Action for U.S. Appl. No. 10/667,136, dated Mar. 9, 2007.
International Search Report and Written Opinion for PCT/US05/004702, dated Aug. 10, 2006.
International Search Report and Written Opinion for PCT/US2006/009525, dated Sep. 13, 2007.
International Search Report and Written Opinion for PCT/US06/40500, dated Aug. 17, 2007.
International Search Report and Written Opinion for PCT/US06/40498, dated Dec. 28, 2007.
International Search Report and Written Opinion for PCT/US2007/012194 dated Feb. 4, 2008.
International Search Report and Written Opinion for PCT/US06/40499, dated Dec. 13, 2007.
International Search Report and Written Opinion for PCT/US2007/19696, dated Feb. 29, 2008.
International Search Report and Written Opinion for PCT/US2007/12016, dated Jan. 4, 2008.
International Search Report and Written Opinion for PCT/US2007/012195, dated Mar. 19, 2008.
International Search Report and Written Opinion for PCT/US07/013758 dated Apr. 3, 2008.
First Office Action for Chinese Application No. 2007800229623.X , dated Dec. 31, 2010.
International Search Report and Written Opinion for PCT/US07/013757, dated Jan. 22, 2008.
International Search Report and Written Opinion for PCT/US07/14847, dated Apr. 1, 2008.
International Search Report and Written Opinion for PCT/US07/089134, dated Apr. 10, 2008.
International Search Report and Written Opinion for PCT/US2008/010708, dated May 18, 2009.
Office Action for Canadian Application No. 2,638,754, dated Oct. 3, 2011.
Supplementary Partial European Search Report for European Application No. 02770460, dated Aug. 20, 2004.
Supplementary Partial European Search Report for European Application No. 02770460, dated Dec. 15, 2004.
Examination Report for European Application No. 02770460, dated Mar. 18, 2005.
Summons for Oral Hearing Proceedings for European Application No. 02770460, dated Jan. 31, 2006.
International Search Report for PCT/US02/28090, dated Aug. 13, 2003.
International Preliminary Examination Report for PCT/US02/28090, dated Oct. 29, 2003.
Examination Report for European Application No. 06006504, dated Oct. 10, 2006.
English Translation of Office Action for Japanese Application No. 2006-088348, dated Jan. 4, 2011.
International Search Report and Written Opinion for PCT/US04/30769, dated Oct. 4, 2005.
International Search Report and Written Opinion for PCT/US04/30683, dated Feb. 10, 2006.
International Search Report and Written Opinion for PCT/US04/30684, dated Feb. 10, 2006.
Related Publications (1)
Number Date Country
20160021528 A1 Jan 2016 US
Provisional Applications (1)
Number Date Country
60812403 Jun 2006 US
Continuations (1)
Number Date Country
Parent 11595119 Nov 2006 US
Child 14868102 US