Untethered access point mesh system and method

Information

  • Patent Grant
  • 11758398
  • Patent Number
    11,758,398
  • Date Filed
    Tuesday, July 26, 2022
    a year ago
  • Date Issued
    Tuesday, September 12, 2023
    8 months ago
Abstract
A technique for implementing an untethered access point (UAP) mesh involves enabling AP-local switching at one or more UAPs of the mesh. A system constructed according to the technique may include an untethered access point (UAP), including: a radio; a backhaul service set identifier (SSID) stored in a computer-readable medium; an anchor access point (AAP) selection engine embodied in a computer-readable medium. In operation, the AAP selection engine may use the radio to attempt to associate with the AAP if a beaconed backhaul SSID matches the stored backhaul SSID. A method according to the technique may include beaconing with a backhaul SSID, acting in concert with an upstream switch as an authenticator for a downstream station that responds to the beacon; providing limited local switching functionality for the downstream station.
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.


Trapeze Networks, Inc (Trapeze), uses a MOBILITY POINT™ (MP®) APs in a MOBILITY DOMAIN™ wireless domain. An MP® AP is coupled to a MOBILITY EXCHANGE® (MX®) wireless switch. Trapeze uses MOBILITY DOMAIN™ to refer to a collection of MX® switches. This collection of MX® switches shares RF environment and station association information. This information is used by the MX® switches to support features including by way of example but not limitation roaming, auto channel selection, rogue AP detection, intrusion detection and/or the launching of countermeasures. Some additional details regarding the Trapeze-specific implementation is provided by way of example but not limitation, including novel features that are discussed later in this application, in the provisional application to which this application claims priority.


In a typical implementation, APs are coupled to a switch via a wire. Implementations that include untethered APs (UAPs), introduce additional configuration difficulties that are only recently being explored. This is an area that is ripe for experimentation and innovation because it has proven challenging to find a way to scale wireless domains using UAPs.


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 implementing an untethered access point (UAP) mesh involves enabling AP-local switching at one or more UAPs of the mesh. A system constructed according to the technique may include a wireless switch; an access point (AP) wire-coupled to the wireless switch; and a UAP mesh, wirelessly coupled to the AP, including a UAP with an AP-local switching engine embodied in a computer-readable medium. The system may or may not further include a wired backbone coupled to a wired network including the wireless switch. The UAP mesh may or may not be self-healing. A spanning-tree algorithm may or may not be embodied in a computer readable medium of the UAP mesh. The wireless switch may or may not include an authorization engine, embodied in a computer-readable medium, for acting in concert with an anchoring AP to authorize a downstream station. The AP-local switching engine may or may not make use of a station switching record (SSR) stored the UAP.


Another system constructed according to the technique may include an untethered access point (UAP), including: a radio; a backhaul service set identifier (SSID) stored in a computer-readable medium; an anchor access point (AAP) selection engine embodied in a computer-readable medium. In operation, the AAP selection engine may use the radio to attempt to associate with the AAP if a beaconed backhaul SSID matches the stored backhaul SSID. The UAP may or may not further include a bootable image stored in a computer readable medium, wherein, in operation, the UAP boots up using the bootable image. The UAP may or may not use regulatory domain information to ensure the UAP is operating within regulatory limits before receiving a complete configuration. The AAP selection engine may or may not listen for a beacon from an AAP that includes the backhaul SSID. The AAP may or may not include a backhaul SSID stored in a computer-readable medium. The AAP may or may not include an authentication engine embodied in a computer-readable medium, wherein, in operation, the authentication engine works in concert with upstream components to authenticate the UAP. The AAP may or may not include a backhaul radio; a backhaul radio and service profile stored in a computer-readable medium; wherein, in operation, when the UAP is associated to the AAP, the backhaul radio sends messages from the UAP upstream using the backhaul radio and service profile. The AAP may or may not be configured to anchor the UAP and a limited number of additional UAPs.


A method according to the technique may include beaconing with a backhaul SSID; acting in concert with an upstream switch as an authenticator for a downstream station that responds to the beacon; providing limited local switching functionality for the downstream station. The method may or may not further include sending a station switching record (SSR) from the upstream switch to the downstream station; receiving the SSR from the downstream station; storing the SSR locally and sending the SSR upstream to a next upstream hop. The method may or may not further include receiving in an initial configuration the backhaul SSID; listening for a beacon with the backhaul SSID; attempting to associate with an anchoring AP that is beaconing with the backhaul SSID; if association is successful, receiving a station switching record (SSR) from the upstream switch, storing the SSR locally, and passing the SSR upstream.


The proposed system can offer, among other advantages, improved wireless domain scaling capabilities. 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 system including an untethered access point (UAP) mesh.



FIG. 2 depicts an example of a subtree of a UAP mesh.



FIG. 3 depicts a flowchart of an example of a method for linking a UAP to an anchoring access point (AAP).



FIG. 4 depicts a diagram illustrating a UAP linking to an existing wireless network.



FIG. 5 depicts an example of a system including a self-healing UAP mesh.





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 including an untethered access point (UAP) mesh. In the example of FIG. 1, the system 100 includes a network 102, a wireless switch 104, one or more APs 106-1 to 106-N (referred to collectively as APs 106), and a UAP mesh 108.


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


The wireless switch 104 is typically wire connected to the APs 106. Thus, the “wireless” switch could be thought of, depending upon the implementation, as a switch for wireless traffic to and/or from a wired network. The wireless switch 104 is not necessarily wirelessly connected to anything. Each of the APs 106 could be wire coupled to respective switches such that each switch is wire coupled to only a single AP. So, although the one or more APs 106 is depicted as a plurality in the example of FIG. 1, it should be understood that the number of APs per switch is implementation-and/or embodiment-specific. An AP and the wireless switch 104 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.


The wireless switch 104 may or may not have all of the tools to manage wireless stations and the UAP mesh locally. For example, there may be additional management (e.g., AAA servers) further upstream from the wireless switch 104. Since it is not critical where these services take place beyond the wireless switch 104, for illustrative simplicity, it is assumed that the wireless switch 104 handles all of these functions, either locally or by utilizing upstream components. For this reasons, the figures (other than FIG. 1) do not depict components further upstream from the wireless switch 104.


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, by way of example but not limitation, roaming, auto channel selection, rogue AP detection, intrusion detection and the launching of countermeasures. The wireless switch 104 may share wireless data with other wireless switches (not shown).


The wireless switch 104 controls the APs 106 (and the APs in the UAP mesh 108). In an embodiment, the APs 106 include radio transmitters and receivers (e.g., transceivers) that are used to provide wireless network connectivity for users and station access to the functions of the wireless switch 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 should be noted that this definition may include APs.


Each of the APs 106 anchors at least a portion of the UAP mesh 108 to the wired network. The APs 106 may be treated as border devices between the wireless switch 104 (or other upstream components of the system 100) and the UAP mesh 108. This enables more efficient use of wireless resources because proxy address resolution protocol (proxy ARP) may be used to enable the Aps 106 to answer ARP requests on behalf of a remote device (e.g., a UAP for which an AP serves as an anchor to the wireless switch 104).


In the example of FIG. 1, the UAP mesh 108 is intended to depict a plurality of potentially discrete APs that do not have a wired connection to the wireless switch 104 or to the APs 106. That is why the APs in the wireless mesh are referred to as “untethered.” Any station in the UAP mesh 108, whether a UAP or some other wireless station, is anchored to the wireless switch 104 by the AP 106 and zero or more UAPs that make up a chain of nodes from the station to the AP 106. An AP that is closer to the wireless switch 104 in the chain may be referred to as anchoring downstream stations. For any given station, the path from the station to the wireless switch 104 may be referred to as a spanning tree because the UAP mesh 108 should not allow loops for traffic passing between a station and the wireless switch 104.


When a UAP in the UAP mesh 108 is brought online, it will attempt to reach the wireless switch 104 through a path that is optimal. (Note: Although an optimal path is desired, it may or may not be accomplished in practice, depending upon the implemented algorithm and/or environmental factors). There are multiple metrics for measuring the distance of a UAP from one of the APs 106. For example, the metric may be time. That is, the amount of time it takes for a packet to travel between the UAP and the AP anchoring the UAP. Although such a metric may work fine, it will typically vary depending upon environmental factors, such as traffic congestion or degraded received signal strength. For simplicity, the metric used herein is the number of hops between the UAP and the anchoring AP (AAP), with the understanding that this is but one of many potential metrics. Thus, if a UAP is one hop away from the AAP, the UAP may be referred to as a one-hop UAP. In general, a UAP may be referred to as an N-hop UAP where the UAP is N hops from the AAP.


Advantageously, UAPs of the UAP mesh 108 may include an AP-local switching engine embodied in a computer-readable medium. An AP-local switching engine may make use of a station switching record (SSR) to determine how to switch a given message unit (e.g., a packet, frame, datagram, etc.). This enables at least some traffic to be efficiently switched within the UAP mesh 108. Moreover, advantageously, some traffic may be tunneled back to a switch, while other traffic is locally switched. Which traffic is tunneled back, and which traffic is locally switched, is an implementation-specific decision that becomes available by using the teachings described herein.


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 applicable 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, APs, and stations independently of how they are packaged, combined, or labeled.


In an illustrative embodiment, the UAP mesh 108 is created from a spanning tree. Each station in the UAP mesh 108 attempts to reach the wireless switch 104 along an optimal path. Assuming the optimal path is measured in the number of hops to the wire, if a first station's traffic passes through a UAP and along a path from there to the wire, a second station's traffic that passes through the UAP will take the same path from there to the wire. Since all stations take the optimal path, the stations may be represented as edge nodes of a tree where the AP at the wire is the root node. Thus, the AP mesh acts as a spanning tree for each station. It may be noted that the spanning tree is greedy at each node, which naturally results in an efficient (perhaps even optimized) tree flow.



FIG. 2 depicts an example of a subtree 200 of a UAP mesh. The subtree 200 includes an anchor AP (AAP) 202, and one or more UAPs 204-1 to 204-N (referred to collectively as UAPs 204). The path upstream from the AAP 202 to the switch may include no hops, if the AAP 202 is a (tethered) AP; one hop, if the AAP 202 is wirelessly coupled directly to a (tethered) AP, or a chain of UAP nodes; or multiple hops, if the path from the AAP 202 to the switch includes a chain of UAPs. The path downstream from the UAP 204-2 may include multiple jumps, as well. However, it should be noted that if the stations are not wirelessly coupled directly to the UAP 204-2, the UAP 204-2 is actually an AAP (i.e., the UAP 204-2 would be anchoring downstream UAPs).


In the example of FIG. 2, the AAP 202 includes a backhaul radio 210 and memory 212. The number of UAPs 204 that are anchored by the AAP 202 may be implementation- or embodiment-specific. For example, a particular installation may limit the number of UAPs 204 to, e.g., five.


The backhaul radio 210 may be a radio that is dedicated to transmitting data associated with the UAPs 204. Whether the radio is dedicated to backhauling is an implementation-specific decision. Since there may be multiple radio and SSID configurations per radio-profile, the radio may be used to perform both the backhaul function and other, e.g., 802.11 services. However, it is expected that many customers who implement backhaul services will dedicate a radio to backhaul services because the backhaul link is an important one. In an illustrative embodiment, the backhaul radio 210 is capable of passive scan and active scan. However, it should be noted that in some implementations, best practice may advice against active scan. The channel and power settings are often hard configured so auto-tuning may not be available and may even be undesirable. The ability to change the backhaul channel and force all UAPs to do likewise without dropping any sessions would potentially make auto-tuning more viable. The AAP 202 may or may not include one or more radios (not shown) in addition to the backhaul radio 210.


The memory 212 includes a plurality of modules, some of which are depicted in FIG. 2 for illustrative purposes. A processor (not shown) is coupled to the memory 212 in a manner that is well-known in the relevant arts. The memory 212 is intended to represent any of a plurality of known or convenient computer-readable mediums, including non-volatile storage, RAM, flash memory, cache, etc. Any applicable computer-readable medium may be used.


In the example of FIG. 2, the memory 212 includes a backhaul radio and service profile module 214, a backhaul service set identifier (SSID) 216, and an authentication engine 218. The backhaul radio and service profile module 214 includes data to be used in association with the backhaul. The backhaul SSID 216 identifies the support network. The authentication engine 218 facilitates authentication of wireless stations (including UAPs). In an illustrative embodiment, the authentication engine 218 authenticates a station in concert with a switch or other upstream component. The station or upstream component may assist in the authentication “on the fly” when a wireless station attempts to associate with the AAP 202, or in advance for a pre-authorized wireless station. In an embodiment that does not have (or has more limited) centralized management, the authentication engine 218 could even be configured to authenticate without the assistance of a switch or other upstream component.


The AAP 202 may be configured to beacon the backhaul SSID 216. The service profile is then associated to a radio profile and AP following known or convenient conventions. Since backhaul services will be applied to specific APs in at least one embodiment, general AP-configuration policies (such as auto-dap templates) that can apply to unspecific APs are not enabled in this embodiment. They may be enabled in other embodiments, however.


In the example of FIG. 2, the UAP 204-2 includes a radio 220 and memory 222. Details of other ones of the UAPs 204 are omitted to avoid cluttering the figure. Each of the UAPs 204 may be identical to, similar to, or different from the UAP 204-2. The radio 220 may or may not be a dedicated backhaul radio. The value of making the radio 220 into a dedicated backhaul radio diminishes if the UAP 204-2 is at the edge of a UAP mesh (e.g., when there are no downstream UAPs), though the value may or may not be diminished to zero.


The memory 222 includes regulatory domain information 224, a backhaul SSID 226, a bootable image 228, and an AAP selection engine 230. The regulatory domain information 224 provides information to the UAP about allowed broadcast parameters for a given region. The CLI to preconfigure a DAP for untethered operation may include the SSID of the anchor AP and a preshared key (not shown). When the UAP is configured with the backhaul SSID 226, the regulatory domain information 224 should probably be stored in, e.g., flash, as well (as shown). This prevents the UAP from operating outside of the regulatory limits before it receives its complete configuration from the switch. It must be clearly documented that when prestaging UAPs, the regulatory and antenna information is correct and reflects the actual deployment to avoid regulatory violations. The regulatory domain information may be updated with a running configuration.


The bootable image 228 enables the UAP 204-2 to be deployed with the same services as the AAP 202 (though performance could be adversely impacted by the radio link). When the UAP 204-2 is up and running, the boot configuration associated with the bootable image 228 may be changed. When the boot configuration is changed, the UAP 204-2 must be reset for the changes to take effect. It is not always desirable to allow the boot configuration to change. For example, it is possible for a UAP to find a switch running a software version that does not support untethered APs. When the UAP sees than an older version of software is trying to manage it, the UAP may choose to reboot so as to protect its untethered-capable running image. (This may further require that the anchor AP generate a log message when a radio link is created or destroyed so that link flapping can be identified and, hopefully, remedied.)


The AAP selection engine 230 enables the UAP 204-2 to select an AAP from a plurality of potential AAPs. Any known or convenient algorithm may be implemented to choose an AAP. For example, the AAP may be selected by comparing relative signal strengths and choosing the strongest. Alternatively or in addition, each AAP could broadcast an estimated time to wire, or number of hops to wire, which the AAP selection engine 230 can use to choose an optimal AAP. In a non-limiting embodiment, the implemented algorithm is greedy at the UAP 204-2.


In a non-limiting embodiment, if the UAP 204-2 is unable to associate with the AAP 202, the UAP 204-2 may beacon an SOS signal, including its serial number. The beacon signal is (hopefully) received at an AP, and sent to the wired network for processing (e.g., at a wireless switch). If appropriate, the upstream component may provide the AAP 202 (or some other AP within range of the UAP 204-2) with data and/or instructions to facilitate an association.



FIG. 3 depicts a flowchart 300 of an example of a method for linking a UAP to an AAP. In the example of FIG. 3, the flowchart 300 starts at module 302 where a UAP listens for a beacon with a correct SSID. To know whether an SSID is correct, the UAP must either have the SSID stored in memory, or be informed in some other manner. The UAP will associate to the AAP, at which point (or perhaps after authentication) the UAP will have layer 2 connectivity to the AAP. In order for the associated radio link to be established, the AAP acts as an anchor point and the UAP acts as a client device.


In the example of FIG. 3, the flowchart 300 continues to module 304 where the AAP acts as an authenticator in concert with a switch to authenticate the UAP. Implementation of this technique may be based on wpa_supplicant under a BSD license including minimum eap methods. Although wpa_supplicant and WPA-PSK may be used to authenticate, this is an implementation-specific choice; any known or convenient technique that works for the intended purpose may be used.


In the example of FIG. 3, the flowchart 300 continues to module 306 where OAP operations are carried out. This may include OAP+TAP A protocols, including optional switch-AP security. At this point, the flowchart 300 ends, though if the OAP operations end, the flowchart 300 could resume at any point (i.e., module 302, 304, or 306).



FIG. 4 depicts a diagram 400 illustrating a UAP linking to an existing wireless network. The diagram 400 includes a switch 402, an AAP 404, and a UAP 406. The switch 402 may be similar to the wireless switch 104 (FIG. I). The break 408 is intended to represent the case where the AAP 404 is untethered so that there are additional nodes (e.g., a tethered AP) between the AAP 404 and the switch 402. However, in an alternative, the AAP 404 may itself be a tethered AP wire connected to the switch 402. The UAP 406 is initially not linked to the AAP 404, but becomes linked as described below.


The UAP 406 is 1) configured with a backhaul SSID. While this is not a strict requirement, it is a convenience for those who are responsible for installing or placing the UAP within a UAP mesh. Conceivably, the UAP could be configured to receive an SSID over the air or acquire an SSID in some other manner.


The UAP 406 is powered up and 2) listens for a beacon with a backhaul SSID. Again, this is not a strict requirement. It is believed to be more convenient to have the UAP 406 listen for a beacon than to have the UAP initiate a link prior to or instead of receiving a beacon. This is at least in part due to standard practice in 802.11 systems, though such a practice may not be prevalent or even desired in other wireless systems.


The AAP 404 3) broadcasts a beacon with the backhaul SSID. The backhaul SSID may be preconfigured at the AAP 404 or could be received at the AAP 404 from the switch at boot time or after.


The UAP 406 4) attempts to associate with the AAP 404 upon matching the broadcast backhaul SSID with the backhaul SSID stored locally. It may be noted that the backhaul SSID of the UAP 406 is assumed to be the same as that of the broadcast backhaul SSID. However, there may be other UAPs that are within range of the AAP 404 that have different backhaul SSIDs (perhaps associated with a different AAP). Also, a single AAP could conceivably have multiple backhaul radios, each associated with a different backhaul SSID, or even a single backhaul radio associated with multiple backhaul SSIDs.


The AAP 404 5) authenticates the UAP 406 in concert with the switch 402. The UAP 406 may be able to form a layer 2 connection with the AAP 404 when it associates, but the AAP 404 will likely not allow traffic to flow upstream until authentication is complete. While this is not a strict requirement, wireless resources are often relatively scarce, so, in an effort to conserve resources in the case where the UAP 406 is unable to be authenticated, it may be desirable to restrict traffic flow until authentication is complete.


The switch 402 6) generates an SSR for the UAP 406. Since the AAP 404 authenticates the UAP 406 in concert with the switch 402, the switch 402 knows about the UAP 406. So the switch 402 is capable of producing an SSR for the UAP 406. In an embodiment, the SSR includes data associated with authorized stations and access control list (ACL) filters. An ACL refers to rules that typically detail service ports or the like that are available on a host or other layer 3 device, each with a list of hosts and/or networks permitted to use the service. ACLs can be configured to control upstream and downstream traffic. (In this context, they are similar to firewalls.) Typically, servers and routers have network ACLs, but in an illustrative embodiment, ACL rules are provided to APs. The SSR enables the UAP 406 to switch at least some traffic, thereby reducing the amount of traffic that has to be switched higher upstream. Advantageously, this pushes message filtering to the edges (or root) of the UAP mesh.


The switch 402 7) forms a control channel 410 to the UAP 406. It should be noted that the control channel 410 may simply be a virtual “tunnel” in that tables at each hop along the path to the UAP 406 identify the next hop. This is advantageous because it avoids flooding the UAP mesh, which is wasteful of wireless resources. It should be noted that the control channel 410 is not a “tunnel” in the traditional sense because a tunnel is used to carry user data, which is not necessarily the case here.


The switch 402 8) sends the SSR to the UAP 406 via the control channel 410.


The AAP 404 9) unicasts the SSR to the UAP 406. In a non-limiting embodiment, this type of action actually occurs at each hop along the path. The SSR is “unicast” because the AAP 404 knows that the destination of the message is the UAP 406, and any other UAPs (now shown) that are listening to the AAP 404 know the destination is not them or downstream from them.


The UAP 406 10) receives the SSR and propagates the SSR upstream. That is, the SSR is stored at the UAP 406, then sent to the next hop closer to the switch 402. Traffic associated with the UAP 406 can travel upstream as the SSR is propagated.


The AAP 404 11) receives the SSR and propagates the SSR upstream. This occurs at other nodes along the UAP chain up to and including the anchoring (tethered) AP.



FIG. 5 depicts an example of a system 500, including a self-healing UAP mesh. In the example of FIG. 5, the system 500 includes a switch 502, an AP 504, UAPs 506-1 and 506-2 (referred to collectively as “one-hop UAPs 506”), UAPs 508-1 and 508-2 (referred to collectively as “two-hop UAPs 508”), UAPs 510-1 and 510-2 (referred to collectively as “three-hop UAPs 510”), a UAP 512, a station 520, and a station 522.


Initially, it is assumed that each UAP is authenticated and has a valid SSR. The SSRs facilitate at least some switching capability within the UAP mesh. For example, if the station 520 sends a packet to the station 522, the packet travels upstream to the UAP 508-1, then to the UAP 506-1. The UAP 506-1 knows that the destination (station 522) is downstream. Accordingly, rather than sending the packet upstream to the switch 502, the UAP 506-1 makes use of the limited data included in the SSR to send the packet downstream to the UAP 508-2, which sends the packet to the UAP 510-2, which sends the packet to the UAP 512, which sends the packet to the station 522.


The UAP mesh is self-healing in that if a node goes down, only the affected UAPs need to update. Specifically, say the UAP 510-2 goes down. (This is represented in the example of FIG. 5 by the shading of the UAP 510-2.) When the UAP 510-2 goes down, it causes several problems, including 1) the station 522 is no longer associated with a UAP that can forward messages to and from the station 522; 2) the UAP 508-2 and other upstream nodes (e.g., the UAP 506-1) have incorrect data.


Problem 1) can be remedied in the following manner.


1.1) The UAP 512 detects a link failure between itself and the UAP 510-2 because, for the purpose of example, the UAP 510-2 is assumed to have gone down.


1.2) The UAP 512 establishes a link with the UAP 510-1. The new link is represented in the example of FIG. 5 as a dotted line 530. It may be noted that the UAP 512 may have multiple choices of UAPs, though in the example of FIG. 5, only the available UAP 510-1 is depicted. (Presumably, if one of the two-hop UAPs 508 were within range of the UAP 512, the UAP 512 would not have been linked with the UAP 510-2, which is a three-hop UAP. Accordingly, it is assumed that only the UAP 510-1 is in range of the UAP 512.)


1.3) The UAP 510-1 sends a message to the switch 502, alerting the switch 502 that a new SSR is needed because the station 522-and any other stations downstream from UAP 512 (not shown)—is now reachable via a new path.


1.4) The switch 502 sends an SSR downstream to the UAP 510-1. Relevant data from the SSR is propagated at each node, either as the SSR is passed down or by propagation upstream from the UAP 510-1, as has been described previously. Depending upon the implementation and/or embodiment, since the UAP 512 already knows about each station associated with it, and can update upstream routing data locally, the UAP 512 need not necessarily receive the newly sent SSR because the downstream paths remain unbroken, and the upstream path is established through the link to the UAP 510-1.


It may be noted that part of problem 2 is already solved in addressing problem 1. Specifically, the UAP 506-1 has been updated correctly as the SSR is propagated at each node (if applicable). However, the UAP 508-2 still includes incorrect data. Problem 2 can be fully remedied in the following manner:


2.1) The UAP 508-2 detects a link failure between itself and the UAP 510-2.


2.2) The UAP 508-2 waits for a timeout period. Waiting for a timeout period may be important for ensuring that the station 522 maintains connectivity with the switch 502. Specifically, if the UAP 508-2 deletes the data associated with the UAP 510-2 (and therefore data associated with downstream nodes, including the UAP 512 and the station 522), and sends the update upstream, upstream nodes will also delete the data. Eventually the update will reach the switch 502, which will update records to show that stations downstream from the UAP 510-2, including the station 522, are now disassociated. By waiting for a timeout period, the UAP 510-1 can update appropriately, before any disassociation, to ensure continuous connectivity (and, e.g., a smooth handoff).


2.3) The UAP 508-2 deletes the data associated with the UAP 510-2 (necessarily including data associated with the station 522). Since the UAP 508-2 waited for a timeout period, the UAP 510-1 has presumably updated the switch 502, and an SSR and/or other data has been propagated along the path between the switch 502 and the UAP 512. Accordingly, the UAP 506-1—and, more generally, all APs on the path between the UAP 512 and the switch 502—will have current data. Therefore, it is not desirable for the update from the UAP 508-2 (deleting the UAP 510-2 and nodes downstream from UAP 510-2) to be implemented at any of the newly updated nodes because the update will or could (depending upon the implementation) delete good data. In an illustrative embodiment, sequence numbers for updates may be used. Specifically, the sequence number associated with the deletion of the data at the UAP 508-2 should be before the sequence number associated with the update at the UAP 510-1. In this way, when the UAP 506-1 receives an update from the UAP 508-2 to delete data, the UAP 506-1 can check the sequence number of the update and, noticing that the sequence number is before the sequence number associated with the latest update, ignore the update. Advantageously, when a UAP notices that the sequence number comes before a most recent update, the UAP can drop the old update; all upstream nodes will have the correct data so the update need not be passed upstream.


After the UAP 512 is linked back into the UAP mesh via the link 530, the switching functionality of the mesh is also updated. So, if the station 520 sends a packet to the station 522, the packet may be sent up to the UAP 508-1, which recognizes that the station 522 is downstream. Then the UAP 508-1 sends the packet downstream to UAP 510-1, which sends the packet to the UAP 512, which sends the packet to the station 522.


As used herein, an AP may refer to a standard (tethered) AP or to a UAP. Where a distinction should be drawn, an AP may be referred to as a “(tethered) AP” or a “UAP,” as appropriate.


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 method, comprising: receiving, at an access point (AP), a signal from an untethered access point (UAP), the signal associated with an attempt by the UAP to associate with the AP;associating the UAP with the AP in response to a determination that a backhaul service set identifier (SSID) matches a local backhaul SSID of the UAP; andtransmitting a station-switching record (SSR) to the UAP after the UAP is associated with the AP, the SSR enabling the UAP to determine between (1) switching traffic, locally at the UAP, upstream to a switch and (2) switching the traffic via a UAP mesh that has a plurality of UAPs (i) operatively coupled to each other and the switch and (ii) including the UAP.
  • 2. The method of claim 1, wherein: the UAP is configured to be assigned the local backhaul SSID;the UAP is configured to store the local backhaul SSID.
  • 3. The method of claim 1, further comprising: broadcasting, prior to associating the UAP with the AP, a beacon signal that includes the backhaul SSID.
  • 4. The method of claim 1, further comprising: authenticating, at the AP and in concert with the switch, the UAP prior to the transmitting the SSR to the UAP.
  • 5. The method of claim 1, wherein: the signal is a first signal;the method further includes broadcasting, prior to receiving the first signal, a second signal indicating a number of hops between the AP and the UAP.
  • 6. The method of claim 1, further comprising: transmitting, by the UAP, a beacon signal including a serial number associated with the UAP in response to the UAP being unable to associate with the AP.
  • 7. The method of claim 1, further comprising: configuring the UAP with the local backhaul SSID.
  • 8. The method of claim 1, further comprising: listening, by the UAP, for a beacon signal having an SSID that matches the local backhaul SSID; andtransmitting, by the UAP, a signal including an association request to the AP based on receiving a beacon signal having an SSID that matches the local backhaul SSID.
  • 9. The method of claim 1, further comprising: forming, by the switch, a control channel to the UAP; andtransmitting the SSR to the UAP via the control channel.
  • 10. The method of claim 9, wherein the control channel is a virtual tunnel.
  • 11. A system, comprising: an access point (AP) having a wired connection to a switch;an untethered access point mesh including at least one untethered access point (UAP), the at least one UAP configured to determine whether a backhaul service set identifier (SSID) transmitted by the AP matches a local SSID of the UAP,the UAP further configured to transmit a signal to the AAP including an attempt to associate with the AP;the UAP further configured to receive a station-switching record (SSR) after the UAP is associated with the AAP, the SSR enabling the UAP to determine between (1) switching traffic, locally at the UAP, upstream to the switch and (2) switching the traffic via a UAP mesh that has a plurality of UAPs (i) operatively coupled to each other and the switch and (ii) including the UAP.
  • 12. The system of claim 11, wherein: the UAP is configured to be assigned the local backhaul SSID;the UAP is configured to store the local backhaul SSID.
  • 13. The system of claim 11, further comprising: broadcasting, by the AP and prior to associating the UAP with the AP, a beacon signal that includes the backhaul SSID.
  • 14. The system of claim 11, further comprising: authenticating, at the AP and in concert with the switch, the UAP prior to the transmitting the SSR to the UAP.
  • 15. The system of claim 11, wherein: the signal is a first signal;wherein the AP is further configured to broadcast, prior to receiving the first signal, a second signal indicating a number of hops between the AP and the UAP.
  • 16. The system of claim 11, wherein the UAP is further configured to: transmit a beacon signal including a serial number associated with the UAP in response to the UAP being unable to associate with the AP.
  • 17. The system of claim 11, wherein the UAP is further configured to: listen for a beacon signal having an SSID that matches the local backhaul SSID; andtransmit a signal including an association request to the AP based on receiving a beacon signal having an SSID that matches the local backhaul SSID.
  • 18. The system of claim 11, wherein the switch is further configured to: form a control channel to the UAP; andtransmit the SSR to the UAP via the control channel.
  • 19. The system of claim 18, wherein the control channel is a virtual tunnel.
  • 20. A non-transitory computer-readable medium comprising instructions that when executed by one or more processors cause the one or more processors to: associate an untethered access point (UAP) with an AP in response to a determination that a backhaul service set identifier (SSID) transmitted by the AP) matches a local backhaul SSID of the UAP; andtransmit a station-switching record (SSR) to the UAP after the UAP is associated with the AP, the SSR enabling the UAP to determine between (1) switching traffic, locally at the UAP, upstream to a switch and (2) switching the traffic via a UAP mesh that has a plurality of UAPs (i) operatively coupled to each other and the switch and (ii) including the UAP.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 17/069,353, filed Oct. 13, 2020, which is a continuation of U.S. patent application Ser. No. 14/951,766, filed Nov. 25, 2015, and issued as U.S. Pat. No. 10,834,585, which is a continuation of U.S. patent application Ser. No. 14/468,079, filed Aug. 25, 2014, and issued as U.S. Pat. No. 9,232,451, which is a divisional of U.S. patent application Ser. No. 11/801,964, filed May 11, 2007, and issued as U.S. Pat. No. 8,818,322, which claims the benefit of U.S. Provisional Patent Application No. 60/812,403, filed Jun. 9, 2006, each of which is incorporated by reference herein in its entirety.

US Referenced Citations (794)
Number Name Date Kind
3246751 Brenner Apr 1966 A
3249252 Smith May 1966 A
3256300 Wygant Jun 1966 A
3256334 Scheidt Jun 1966 A
3262988 Joyce Jul 1966 A
3285662 Lobbe Nov 1966 A
3304906 Nace Feb 1967 A
3336035 Price Aug 1967 A
3356758 Omietanski Dec 1967 A
3404772 Ernst Oct 1968 A
3496290 Smith Feb 1970 A
3564380 Zeldman Feb 1971 A
3567416 Stilley et al. Mar 1971 A
3636524 Holland Jan 1972 A
3641433 Mifflin et al. Feb 1972 A
3661787 Brown, Jr. May 1972 A
3674403 Jonsson et al. Jul 1972 A
3697415 Steitzer Oct 1972 A
3721334 Jarema Mar 1973 A
3785275 Keats Jan 1974 A
3839348 Elslager et al. Oct 1974 A
3906166 Cooper et al. Sep 1975 A
3934260 Kasami Jan 1976 A
3937566 Townsley Feb 1976 A
3973622 Laing Aug 1976 A
3993683 Nicki Nov 1976 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 Brockhaven 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
4995053 Siegmund et al. Feb 1991 A
5008899 Yamamoto Apr 1991 A
5027343 Chan et al. Jun 1991 A
5029183 Tymes Jul 1991 A
5073075 Duran Dec 1991 A
5088591 Grecksch Feb 1992 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 Aug 1992 A
5157687 Tymes Oct 1992 A
5187575 Dent et al. Feb 1993 A
5231633 Hluchyj et al. Jul 1993 A
5240083 Lyon Aug 1993 A
5259405 Hua-Chou Nov 1993 A
5280498 Tymes et al. Jan 1994 A
5285494 Sprecher et al. Feb 1994 A
5304596 Moriya Apr 1994 A
5326918 Correia Jul 1994 A
5327144 Stilp et al. Jul 1994 A
5329531 Diepstraten Jul 1994 A
5339316 Diepstraten Aug 1994 A
5347091 Schroeder Sep 1994 A
5371783 Rose et al. Dec 1994 A
5397040 Lee Mar 1995 A
5418812 Reyes et al. May 1995 A
5432842 Kinoshita Jul 1995 A
5444851 Woest Aug 1995 A
5448569 Huang et al. Sep 1995 A
5450615 Fortune et al. Sep 1995 A
5465401 Thompson Dec 1995 A
5479441 Tymes et al. Dec 1995 A
5483676 Mahany et al. 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
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
5570867 Norkus Nov 1996 A
5574240 Cartwright Nov 1996 A
5584048 Wieczorek Dec 1996 A
5598532 Liron Jan 1997 A
5614787 Kawai Mar 1997 A
5630207 Gitlin et al. May 1997 A
5640414 Blakeney et al. Jun 1997 A
5649289 Wang et al. Jul 1997 A
5658389 Matsuda Aug 1997 A
5668803 Tymes et al. Sep 1997 A
5670964 Dent Sep 1997 A
5677894 Erath Oct 1997 A
5677954 Hirata et al. Oct 1997 A
5678802 Lunder Oct 1997 A
5706428 Boer et al. Jan 1998 A
5715304 Nishida et al. Feb 1998 A
5725260 Eikmeier Mar 1998 A
5729542 Dupont Mar 1998 A
5734699 Lu Mar 1998 A
5738629 Moll Apr 1998 A
5740533 Lin Apr 1998 A
5742592 Scholefield et al. Apr 1998 A
5745481 Phillips Apr 1998 A
5756940 Van Driel May 1998 A
5760324 Wakuda Jun 1998 A
5774460 Schiffel et al. Jun 1998 A
5793303 Koga Aug 1998 A
5794128 Brockel et al. Aug 1998 A
5798788 Meehan Aug 1998 A
5812589 Sealander et al. Sep 1998 A
5815811 Pinard et al. Sep 1998 A
5818385 Bartholomew Oct 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
5847620 Wong 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
5959546 Dorenbosch 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 Krishnakumar et al. Nov 1999 A
5987062 Engwer et al. Nov 1999 A
5987328 Ephremides et al. Nov 1999 A
5990348 Lyons 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 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 Jun 2000 A
6088591 Trompower 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
6130896 Lueker Oct 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 Fine et al. Feb 2001 B1
6199032 Anderson Mar 2001 B1
6208629 Jaszewki 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 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 Watannabe 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
6400722 Chuah et al. Jun 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
6487604 Rochford et al. Nov 2002 B1
6490443 Freeny, Jr. Dec 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
6570867 Robinson et al. May 2003 B1
6574240 Tzeng Jun 2003 B1
6580700 Pinard et al. Jun 2003 B1
6584494 Manabe et al. Jun 2003 B1
6587604 Yamauchi Jul 2003 B2
6587680 Ata-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
6661787 Jain et al. Sep 2003 B1
6631267 Thomson et al. Oct 2003 B1
6636524 Chen Oct 2003 B1
6650912 Chen et al. Nov 2003 B2
6658389 Alpdemir Dec 2003 B1
6659947 Rappaport 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
6721548 Mohindra et al. Apr 2004 B1
6725260 Philyaw Apr 2004 B1
6738629 McCormick et al. May 2004 B1
6745333 Thomsen Jun 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
6788938 Sugaya et al. Sep 2004 B1
6795421 Heinonen Sep 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
6865609 Gubbi et al. Mar 2005 B1
6879812 Rappaport 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
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
6985697 Smith et al. Jan 2006 B2
6990348 Benveniste Jan 2006 B1
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 et al. 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 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 Forslow Dec 2006 B2
7158777 Lee et al. Jan 2007 B2
7159016 Baker Jan 2007 B2
7167718 Hayashi et al. 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
7269155 Joshi Sep 2007 B2
7274730 Nakabayashi Sep 2007 B2
7280495 Zweig et al. Oct 2007 B1
7290051 Dobric et al. Oct 2007 B2
7293136 More Nov 2007 B1
7310664 Merchant et al. Dec 2007 B1
7313111 Hietalahti Dec 2007 B2
7317914 Adya Jan 2008 B2
7320070 Baum Jan 2008 B2
7324468 Fischer Jan 2008 B2
7324487 Saito Jan 2008 B2
7324489 Iyer Jan 2008 B1
7336961 Ngan Feb 2008 B1
7349412 Jones et al. Mar 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
7441043 Henry et al. Oct 2008 B1
7443823 Hunkeler et al. Oct 2008 B2
7447217 Knaebchen Nov 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
7519372 MacDonald et al. Apr 2009 B2
7525215 Keenly 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
7587750 Zimmer et al. Sep 2009 B2
7592906 Hanna Sep 2009 B1
7603119 Durig et al. Oct 2009 B1
7603710 Harvey et al. Oct 2009 B2
7633909 Jones Dec 2009 B1
7636363 Chang et al. Dec 2009 B2
7665132 Hisada et al. Feb 2010 B2
7680501 Sillasto et al. Mar 2010 B2
7685295 Myers et al. Mar 2010 B2
7693526 Qian et al. Apr 2010 B2
7697516 Frei Apr 2010 B2
7706749 Ritala 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
7738433 Tao Jun 2010 B2
7746897 Stephenson et al. Jun 2010 B2
7788475 Zimmer Aug 2010 B2
7805529 Galluzzo et al. Sep 2010 B2
7817554 Skog et al. Oct 2010 B2
7844298 Riley Nov 2010 B2
7856659 Keeler et al. Dec 2010 B2
7865713 Chesnutt et al. Jan 2011 B2
7873061 Gast Jan 2011 B2
7876704 Bims Jan 2011 B1
7894852 Hansen Feb 2011 B2
7912982 Murphy Mar 2011 B2
7920548 Lor et al. Apr 2011 B2
7929922 Kubo Apr 2011 B2
7945399 Nosovitsky et al. May 2011 B2
7958953 Chafai Jun 2011 B2
7986940 Lee Jul 2011 B2
8000724 Rayburn et al. Aug 2011 B1
8014404 Eki et al. Sep 2011 B2
8019082 Wiedmann et al. Sep 2011 B1
8019352 Rappaport et al. Sep 2011 B2
8072952 Aragon et al. Dec 2011 B2
8116275 Matta et al. Feb 2012 B2
8140845 Buddhikot et al. Mar 2012 B2
8150357 Aragon Apr 2012 B2
8161278 Harkins Apr 2012 B2
8189600 Jabr May 2012 B2
8190750 Balachandran et al. May 2012 B2
8238942 Gast Aug 2012 B2
8270384 Cheng et al. Sep 2012 B2
8340110 Gast Dec 2012 B2
8457031 Matta Jun 2013 B2
8509128 Gast Aug 2013 B2
8514827 Matta et al. Aug 2013 B2
8542836 Pochop Sep 2013 B2
8594606 Aragon Nov 2013 B2
8594697 Aragon Nov 2013 B2
8635444 Harkins Jan 2014 B2
8638762 Tiwari Jan 2014 B2
8804732 Hepting et al. Aug 2014 B1
8818322 Murphy Aug 2014 B2
8902904 Gast et al. Dec 2014 B2
9043792 Xu May 2015 B1
9232451 Murphy Jan 2016 B2
9258702 Murphy Feb 2016 B2
9838942 Murphy et al. Dec 2017 B2
10007567 Zhang Jun 2018 B2
10024953 Johnson Jul 2018 B2
10327202 Murphy et al. Jun 2019 B2
10798650 Murphy et al. Oct 2020 B2
10834585 Murphy et al. Nov 2020 B2
20010007567 Ando et al. Jul 2001 A1
20010024953 Balogh Sep 2001 A1
20020021701 Lavian et al. Feb 2002 A1
20020052205 Belostofsky et al. May 2002 A1
20020060995 Cervello et al. May 2002 A1
20020062384 Tso May 2002 A1
20020069278 Forslow Jun 2002 A1
20020078361 Giroux et al. Jun 2002 A1
20020080790 Beshai Jun 2002 A1
20020082913 Li Jun 2002 A1
20020083316 Platenberg et al. 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
20020107023 Chari et al. Aug 2002 A1
20020116655 Lew et al. Aug 2002 A1
20020157020 Royer Oct 2002 A1
20020174137 Wolff et al. Nov 2002 A1
20020174364 Nordman Nov 2002 A1
20020176437 Busch et al. Nov 2002 A1
20020188756 Weil et al. Dec 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
20030036350 Jonsson Feb 2003 A1
20030043073 Gray et al. Mar 2003 A1
20030055959 Sato Mar 2003 A1
20030107590 Levillain et al. Jun 2003 A1
20030120763 Volpano 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
20030145081 Lau et al. Jul 2003 A1
20030149787 Mangan Aug 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
20030223383 Chang Dec 2003 A1
20030227934 White et al. Dec 2003 A1
20040001467 Cromer et al. Jan 2004 A1
20040002343 Brauel et al. Jan 2004 A1
20040003285 Whelan et al. Jan 2004 A1
20040008652 Tanzella 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
20040030931 Chamandy et al. Feb 2004 A1
20040038687 Nelson Feb 2004 A1
20040044749 Harkin Mar 2004 A1
20040047320 Eglin Mar 2004 A1
20040049699 Griffith et al. Mar 2004 A1
20040053632 Wilhelmus 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
20040062224 Brownrigg et al. Apr 2004 A1
20040062267 Minami et al. Apr 2004 A1
20040064560 Zhang et al. Apr 2004 A1
20040064591 Noble Apr 2004 A1
20040066756 Ahmavaara Apr 2004 A1
20040066757 Molteni Apr 2004 A1
20040068668 Lor et al. Apr 2004 A1
20040078598 Barber et al. Apr 2004 A1
20040093506 Grawrock et al. May 2004 A1
20040095914 Katsube et al. May 2004 A1
20040095932 Astarabadi et al. May 2004 A1
20040097232 Haverinen 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
20040132438 White Jul 2004 A1
20040141511 Rune Jul 2004 A1
20040143428 Rappaport et al. Jul 2004 A1
20040143755 Whitaker et al. Jul 2004 A1
20040151193 Rune Aug 2004 A1
20040156384 Rune Aug 2004 A1
20040156399 Eran Aug 2004 A1
20040165545 Cook Aug 2004 A1
20040174900 Volpi et al. Sep 2004 A1
20040184475 Meier Sep 2004 A1
20040193709 Selvaggi et al. Sep 2004 A1
20040208570 Reader Oct 2004 A1
20040214572 Thompson et al. Oct 2004 A1
20040215665 Edgar et al. Oct 2004 A1
20040120370 Tzamaloukas Nov 2004 A1
20040221042 Meier Nov 2004 A1
20040228319 Melville Nov 2004 A1
20040230370 Tzamaloukas Nov 2004 A1
20040233234 Chaudhry et al. Nov 2004 A1
20040236702 Fink et al. Nov 2004 A1
20040236851 Kuan Nov 2004 A1
20040242250 Sasai Dec 2004 A1
20040246937 Duong et al. Dec 2004 A1
20040246962 Kopeikin et al. Dec 2004 A1
20040252656 Shiu et al. Dec 2004 A1
20040253969 Nguyen et al. Dec 2004 A1
20040255167 Knight Dec 2004 A1
20040259542 Viitamaki et al. Dec 2004 A1
20040259552 Thori et al. Dec 2004 A1
20040259555 Rappaport et al. Dec 2004 A1
20040259575 Perez-Breva et al. Dec 2004 A1
20040268140 Zimmer et al. Dec 2004 A1
20050009565 Kwak Jan 2005 A1
20050010811 Zimmer et al. Jan 2005 A1
20050015592 Lin Jan 2005 A1
20050020284 Benco et al. Jan 2005 A1
20050021979 Wiedmann et al. Jan 2005 A1
20050025103 Ko et al. Feb 2005 A1
20050025105 Rue Feb 2005 A1
20050026611 Backes Feb 2005 A1
20050030894 Stephens Feb 2005 A1
20050030929 Swier et al. Feb 2005 A1
20050037733 Coleman 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
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
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
20050147032 Lyon et al. Jul 2005 A1
20050147060 Buckley Jul 2005 A1
20050148326 Nogawa et al. Jul 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
20050166072 Converse et al. Jul 2005 A1
20050175027 Miller et al. Aug 2005 A1
20050180345 Meier Aug 2005 A1
20050180358 Kolar et al. Aug 2005 A1
20050180367 Dooley Aug 2005 A1
20050181805 Gallagher 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
20050250487 Miwa et al. Nov 2005 A1
20050256963 Proctor Jr. et al. Nov 2005 A1
20050259597 Benedetotto et al. Nov 2005 A1
20050259611 Bhagwat et al. Nov 2005 A1
20050259654 Faulk Jr. Nov 2005 A1
20050059405 Rappaport et al. Dec 2005 A1
20050268335 Le et al. Dec 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
20060035662 Jeong et al. Feb 2006 A1
20060039395 Perez-Costa et al. Feb 2006 A1
20060041683 Subramanian et al. Feb 2006 A1
20060045050 Floras et al. Mar 2006 A1
20060046744 Dublish et al. Mar 2006 A1
20060050742 Grandhi et al. Mar 2006 A1
20060062187 Rune Mar 2006 A1
20060064480 Lesartre et al. Mar 2006 A1
20060068702 Miwa et al. Mar 2006 A1
20060072532 Dorenbosch Apr 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
20060104231 Gidwani May 2006 A1
20060114872 Hamada Jun 2006 A1
20060114938 Kalkunte et al. Jun 2006 A1
20060117174 Lee Jun 2006 A1
20060128415 Horikoshi et al. Jun 2006 A1
20060143496 Silverman Jun 2006 A1
20060143702 Hisada et al. Jun 2006 A1
20060146748 Ng Jul 2006 A1
20060152344 Mowery Jul 2006 A1
20060153122 Hinman et al. Jul 2006 A1
20060160540 Strutt et al. Jul 2006 A1
20060161983 Cothren et al. Jul 2006 A1
20060165103 Trudeau et al. Jul 2006 A1
20060166699 Aghvami et al. Jul 2006 A1
20060168383 Lin Jul 2006 A1
20060173844 Zhang et al. Aug 2006 A1
20060174336 Chen Aug 2006 A1
20060178168 Roach Aug 2006 A1
20060182118 Lam et al. Aug 2006 A1
20060187878 Calhoun et al. Aug 2006 A1
20060189311 Cromer et al. Aug 2006 A1
20060190721 Kawakami et al. Aug 2006 A1
20060193258 Ballai Aug 2006 A1
20060200563 Hirose Sep 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
20060223527 Lee Oct 2006 A1
20060245393 Bajic Nov 2006 A1
20060248229 Saunderson et al. Nov 2006 A1
20060251021 Nakano Nov 2006 A1
20060268696 Konstantinov et al. Nov 2006 A1
20060268749 Rahman et al. Nov 2006 A1
20060268756 Wang Nov 2006 A1
20060274774 Srinivasan et al. Dec 2006 A1
20060276192 Dutta et al. Dec 2006 A1
20060285489 Francisco et al. Dec 2006 A1
20060286984 Bonner Dec 2006 A1
20060292992 Tajima et al. Dec 2006 A1
20070002742 Krishnaswamy Jan 2007 A1
20070002833 Bajic Jan 2007 A1
20070008884 Tang et al. Jan 2007 A1
20070010248 Dravida et al. Jan 2007 A1
20070011318 Roth Jan 2007 A1
20070021126 Nanda et al. Jan 2007 A1
20070025265 Porras et al. Feb 2007 A1
20070025306 Cox et al. Feb 2007 A1
20070027964 Herrod et al. Feb 2007 A1
20070032219 Rudolf Feb 2007 A1
20070054616 Culbert Mar 2007 A1
20070058598 Ling Mar 2007 A1
20070064673 Bhandaru et al. Mar 2007 A1
20070064718 Ekl et al. Mar 2007 A1
20070067823 Shimel Mar 2007 A1
20070070937 Demirhan et al. Mar 2007 A1
20070076694 Iyer et al. Apr 2007 A1
20070081477 Jakkahalli et al. Apr 2007 A1
20070082677 Hart et al. Apr 2007 A1
20070083924 Lu Apr 2007 A1
20070086397 Taylor 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
20070106776 Konno et al. May 2007 A1
20070109991 Bennett May 2007 A1
20070110035 Bennett May 2007 A1
20070115842 Matsuda et al. May 2007 A1
20070121618 Hirano May 2007 A1
20070127423 Ho Jun 2007 A1
20070133494 Lai et al. Jun 2007 A1
20070135159 Sinivaara Jun 2007 A1
20070135866 Baker et al. Jun 2007 A1
20070136372 Proctor et al. Jun 2007 A1
20070140163 Meier et al. Jun 2007 A1
20070143851 Nicodemus et al. Jun 2007 A1
20070147318 Ross et al. Jun 2007 A1
20070150945 Whitaker et al. Jun 2007 A1
20070171909 Pignatelli Jul 2007 A1
20070183402 Bennett Aug 2007 A1
20070189222 Kolar et al. Aug 2007 A1
20070195793 Grosser et al. Aug 2007 A1
20070206527 Lo et al. Sep 2007 A1
20070230457 Kodera et al. Oct 2007 A1
20070237093 Rajagopalan Oct 2007 A1
20070248009 Petersen Oct 2007 A1
20070253369 Abhishek Nov 2007 A1
20070253380 Jollota et al. Nov 2007 A1
20070255116 Mehta et al. 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
20070291689 Kapur et al. Dec 2007 A1
20070294722 Kang 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
20080039114 Phatak et al. Feb 2008 A1
20080049615 Bugenhagen Feb 2008 A1
20080052393 McNaughton et al. Feb 2008 A1
20080056200 Johnson Mar 2008 A1
20080056211 Kim et al. Mar 2008 A1
20080064356 Khayrallah Mar 2008 A1
20080080441 Park et al. Apr 2008 A1
20080102815 Sengupta et al. May 2008 A1
20080107077 Murphy May 2008 A1
20080114784 Murphy May 2008 A1
20080130523 Fridman et al. Jun 2008 A1
20080151844 Tiwari Jun 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
20090010206 Giaretta et al. Jan 2009 A1
20090028118 Gray et al. Jan 2009 A1
20090031044 Barrack et al. Jan 2009 A1
20090046688 Volpi et al. Feb 2009 A1
20090059930 Ryan et al. Mar 2009 A1
20090129386 Rune May 2009 A1
20090198999 Harkins Aug 2009 A1
20090247103 Aragon Oct 2009 A1
20090252120 Kim et al. 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
20100113098 Riley May 2010 A1
20100130212 So May 2010 A1
20100142478 Forssell et al. Jun 2010 A1
20100159827 Rhodes et al. Jun 2010 A1
20100172276 Aragon Jul 2010 A1
20100180016 Bugwadia et al. Jul 2010 A1
20100195549 Aragon et al. Aug 2010 A1
20100252120 Kim et al. Oct 2010 A1
20100261475 Kim et al. Oct 2010 A1
20100271188 Nysen Oct 2010 A1
20110013588 Jeon Jan 2011 A1
20110047474 Sung Feb 2011 A1
20110128858 Matta et al. Jun 2011 A1
20110158122 Murphy et al. Jun 2011 A1
20110255466 Gast et al. Oct 2011 A1
20120140705 Matta et al. Jun 2012 A1
20120144462 Pochop Jun 2012 A1
20120190320 Aragon Jul 2012 A1
20120190323 Aragon Jul 2012 A1
20120204031 Harkins Aug 2012 A1
20150257152 Hasegawa Sep 2015 A1
20180063673 Jang et al. Mar 2018 A1
20200404498 Murphy et al. Dec 2020 A1
20230007477 Murphy et al. Jan 2023 A1
Foreign Referenced Citations (19)
Number Date Country
0992921 Apr 2000 EP
1542409 Jun 2005 EP
2329801 Mar 1999 GB
2429080 Feb 2007 GB
2000215169 Aug 2000 JP
2003234751 Aug 2003 JP
2003274454 Sep 2003 JP
2004032525 Jan 2004 JP
1994003986 Feb 1994 WO
1999011003 Mar 1999 WO
2000006271 Feb 2000 WO
2000018148 Mar 2000 WO
2002089442 Nov 2002 WO
2003085544 Oct 2003 WO
2004013986 Feb 2004 WO
2004095192 Nov 2004 WO
2004095800 Nov 2004 WO
2006014512 Feb 2006 WO
2010130133 Nov 2010 WO
Non-Patent Literature Citations (195)
Entry
3COM, Wireless LAN Mobility System: Wireless LAN Switch and Controller Configuration Guide, 3COM, Revision A, Oct. 2004, 476 pages.
3COM, Wireless LAN Mobility System; Wireless LAN Switch and Controller Installation and Basic Configuration Guide, Revision B, Apr. 2005, 496 pages.
3COM, Wireless LAN Switch and Controller; Quick Start Guide, 3COM, Revision B, Nov. 2004, 10 pages.
3COM, Wireless LAN Switch Manager (3WXM), 3COM, Revision C, Oct. 2004, 8 pages.
Acampora and Winters, “A Wireless Network for Wide-Band Indoor Communications,” IEEE Journal on selected Areas in Communications, vol. SAC-5, No. 5, Jun. 1987, pp. 796-804.
Acampora and Winters, “System Applications for Wireless Indoor Communications” IEEE Communications Magazine, vol. 25, No. 8, Aug. 1987, pp. 11-20.
Akin, D., Aerohive Blog, Cooperative Control: Part 3, [Online] Retrieved from the Internet: <URL: http://blog.aerohive.com/blog/?p=71> Mar. 1, 2010, 3 pages.
Bahl et al., A Software System for Locating Mobile Users: Design, Evaluation, and Lessons, Microsoft Research, Feb. 1999, 13 pages.
Bahl et al., Radar: An In-Building RF-based User Location and Tracking System, Microsoft Research, Mar. 2000, 10 pages.
Bahl P. et al. “User Location and Tracking in an In-Building Radio Network,” Microsoft Research, Feb. 1999, 13 pages.
Barber, S., Monitoring 802.1 Networks, IEEE 802.11, Sydney, NSW, May 13-17, 2002.
Bing and Subramanian, “A New Multiaccess Technique for Multimedia Wireless LANs” IEEE Global Telecommunications Conference, Nov. 3-8, 1997, pp. 1318-1322.
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.
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.
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. 1988, pp. 1484-1496.
English Translation of Office Action for Japanese Application No. 2006-088348, dated Jan. 4, 2011.
Erten, Y. Murat, “A Layered Security Architecture for Corporate 802.11 Wireless Networks”, Wireless Telecommunications Symposium, May 14-15, 2004, pp. 123-128.
Examination Report for European Application No. 02770,460, dated Mar. 18, 2005.
Examination Report for European Application No. 06006,504, dated Oct. 10, 2006.
Extended Search Report for European Application No. 11188566.1, dated Jan. 30, 2012.
Final Office Action for U.S. Appl. No. 09/866,474, dated Jun. 10, 2005.
Final Office Action for U.S. Appl. No. 10/667,027, dated Feb. 26, 2007.
Final Office Action for U.S. Appl. No. 10/667,027, dated Mar. 10, 2006.
Final Office Action for U.S. Appl. No. 10/667,136, dated Mar. 9, 2007.
Final Office Action for U.S. Appl. No. 11/437,537, dated Jul. 16, 2009.
Final Office Action for U.S. Appl. No. 11/845,029, dated Dec. 9, 2010.
Final Office Action for U.S. Appl. No. 11/845,029, dated Jan. 25, 2010.
Final Office Action for U.S. Appl. No. 12/077,051, dated Oct. 25, 2011.
Final Office Action for U.S. Appl. No. 12/113,535, dated Jan. 3, 2012.
Final Office Action for U.S. Appl. No. 12/474,020, dated Oct. 4, 2010.
Final Office Action for U.S. Appl. No. 11/784,307, dated Jun. 14, 2010.
Final Office Action for U.S. Appl. No. 11/330,877, dated Apr. 22, 2010.
Final Office Action for U.S. Appl. No. 11/351,104, dated Aug. 14, 2012.
Final Office Action for U.S. Appl. No. 12/370,562, dated Jul. 26, 2012.
Final Office Action for U.S. Appl. No. 12/683,281, dated Sep. 21, 2012.
Final Office Action for U.S. Appl. No. 11/094,987, dated May 23, 2008.
Final Office Action for U.S. Appl. No. 11/330,877, dated Mar. 13, 2009.
Final Office Action for U.S. Appl. No. 11/330,877, dated May 27, 2011.
Final Office Action for U.S. Appl. No. 11/331,789, dated Oct. 23, 2008.
Final Office Action for U.S. Appl. No. 11/351,104, dated Jun. 10, 2009.
Final Office Action for U.S. Appl. No. 11/377,859, dated Aug. 27, 2008.
Final Office Action for U.S. Appl. No. 11/417,830, dated May 28, 2009.
Final Office Action for U.S. Appl. No. 11/437,387, dated Jul. 15, 2009.
Final Office Action for U.S. Appl. No. 11/437,538, dated Jun. 10, 2009.
Final Office Action for U.S. Appl. No. 11/437,582, dated Jul. 22, 2009.
Final Office Action for U.S. Appl. No. 11/592,891, dated Jul. 20, 2009.
Final Office Action for U.S. Appl. No. 11/595,119, dated Aug. 2, 2011.
Final Office Action for U.S. Appl. No. 11/595,119, dated Jan. 5, 2010.
Final Office Action for U.S. Appl. No. 11/852,234, dated Jan. 20, 2012.
Final Office Action for U.S. Appl. No. 11/970,484, dated Jul. 22, 2011.
Final Office Action for U.S. Appl. No. 12/210,917, dated May 13, 2011.
Final Office Action for U.S. Appl. No. 12/336,492, dated Jun. 15, 2012.
Final Office Action for U.S. Appl. No. 12/350,927, dated Jan. 18, 2012.
Final Office Action for U.S. Appl. No. 12/401,073, dated Apr. 1, 2011.
Final Office Action for U.S. Appl. No. 12/489,295, dated Jan. 18, 2012.
Fortune et al., “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, IEEE Computational Science and Engineering, p. 58-68 (1995). (Applicant points out, in accordance with MPEP 609.04(a), that the year of publication, 1995, is sufficiently earlier than the effective U.S. filing date, so that the particular month of publication is not in issue.).
Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, IEEE, 1980, pp. 69.7.1-69.7.4.
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, (Applicant points out, in accordance with MPEP 609.04(a), that the year of publication, 1999, is sufficiently earlier than the effective U.S. filing date, so that the particular month of publication is not in issue.) 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, Jan. 1994.
Information Sciences Institute, RFC-791 -Internet Protocol, DARPA, Sep. 1981.
International Preliminary Examination Report for PCT/US02/28090, dated Oct. 29, 2003.
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.
International Search Report and Written Opinion for PCT/US04/30769, dated Oct. 4, 2005.
International Search Report and Written Opinion for PCT/US05/004702, dated Aug. 10, 2006.
International Search Report and Written Opinion for PCT/US06/40498, dated Dec. 28, 2007.
International Search Report and Written Opinion for PCT/US06/40499, dated Dec. 13, 2007.
International Search Report and Written Opinion for PCT/US06/40500, dated Aug. 17, 2007.
International Search Report and Written Opinion for PCT/US07/089134, dated Apr. 10, 2008.
International Search Report and Written Opinion for PCT/US07/14847, dated Apr. 1, 2008.
International Search Report and Written Opinion for PCT/US2006/009525, dated Sep. 13, 2007.
International Search Report and Written Opinion for PCT/US2007/012194 dated Feb. 4, 2008.
International Search Report and Written Opinion for PCT/US2007/012195, dated Mar. 19, 2008.
International Search Report and Written Opinion for PCT/US2007/12016, dated Jan. 4, 2008.
International Search Report and Written Opinion for PCT/US2007/19696, dated Feb. 29, 2008.
International Search Report and Written Opinion for PCT/US2008/010708, dated May 18, 2009.
International Search Report for PCT/US02/28090, dated Aug. 13, 2003.
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/monarchpapers/dsr-chapterOO.pdf).
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.
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.
Kleinrock and Scholl, “Packet Switching in Radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of Data Users”, Conference record 1977 ICC vol. 2 of 3, June 12-15 Chicago Illinois (1977).
LAN/MAN Standars Committee of the IEEE Computer Society, Part 11 :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) (Applicant points out, in accordance with MPEP 609.04(a), that the year of publication, 1999, is sufficiently earlier than the effective U.S. filing date, so that the particular month of publication is not in issue.).
Latvala J. et al., Evaluation of RSSI-Based Human Tracking, Proceedings for the 2000 European Signal Processing Conference, Sep. 2000, 9 pages.
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.
Law, A, “New Service Discovery Protocol,” Internet Citation [Online] XP002292473 Retrieved from the Internet: <URL: http://sern.uccalgary.ca˜lawa/SENG60921/arch/SDP.htm> [retrieved Aug. 12, 2004] (15 pages).
Martinez, P. et al., “Using the Script MIB for Policy-based Configuration Management”, Technical University Braunschweig, Braunschweig, Germany, 2002 (Applicant points out, in accordance with MPEP 609.04(a), that the year of publication, 2002, is sufficiently earlier than the effective U.S. filing date, so that the particular month of publication is not in issue.).
McCann, S., et al., “Emergency Services for 802,” IEEE 802.11-07/0505rl, Mar. 2007, 27 pages.
Microsoft Computer Dictionary, Fifth Edition, Microsoft Corporation, 2002 (Applicant points out, in accordance with MPEP 609.04(a), that the year of publication, 2002, is sufficiently earlier than the effective U.S. filing date, so that the particular month of publication is not in issue.), 2 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.
Non-Final Office Action for U.S. Appl. No. 11/351,104, dated Dec. 17, 2012.
Non-Final Office Action for U.S. Appl. No. 11/377,859, dated Jan. 8, 2008.
Office Action for Canadian Application No. 2,638,754, dated Oct. 3, 2011.
Office Action for U.S. Appl. No. 09/866,474, dated Nov. 30, 2004.
Office Action for U.S. Appl. No. 10/666,848, dated Mar. 22, 2007.
Office Action for U.S. Appl. No. 10/667,027, dated Jul. 29, 2005.
Office Action for U.S. Appl. No. 10/667,027, dated May 5, 2006.
Office Action for U.S. Appl. No. 10/667,136, dated Aug. 28, 2006.
Office Action for U.S. Appl. No. 10/667,136, dated Jan. 25, 2006.
Office Action for U.S. Appl. No. 11/648,359, dated Nov. 19, 2009.
Office Action for U.S. Appl. No. 11/845,029, dated Jul. 9, 2009.
Office Action for U.S. Appl. No. 11/845,029, dated May 14, 2010.
Office Action for U.S. Appl. No. 11/845,029, dated Sep. 27, 2011.
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. 20, 2012.
Office Action for U.S. Appl. No. 12/113,535, dated Apr. 21, 2011.
Office Action for U.S. Appl. No. 12/113,535, dated Nov. 1, 2012.
Office Action for U.S. Appl. No. 12/474,020, dated Jun. 3, 2010.
Office Action for U.S. Appl. No. 13/437,669, dated May 30, 2012.
Office Action for U.S. Appl. No. 13/437,673, dated May 30, 2012.
Office Action for U.S. Appl. No. 13/568,861, dated Oct. 24, 2012.
Office Action for U.S. Appl. No. 11/784,307, dated Sep. 22, 2009.
Office Action for U.S. Appl. No. 12/957,997, dated Aug. 28, 2012.
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.
Office Action for U.S. Appl. No. 11/094,987, dated Oct. 21, 2008.
Office Action for U.S. Appl. No. 11/326,966, dated Nov. 14, 2008.
Office Action for U.S. Appl. No. 11/330,877, dated Aug. 6, 2009.
Office Action for U.S. Appl. No. 11/330,877, dated Jan. 13, 2011.
Office Action for U.S. Appl. No. 11/330,877, dated Sep. 11, 2008.
Office Action for U.S. Appl. No. 11/331,789, dated Aug. 5, 2009.
Office Action for U.S. Appl. No. 11/331,789, dated Jun. 13, 2008.
Office Action for U.S. Appl. No. 11/351,104, dated Dec. 2, 2009.
Office Action for U.S. Appl. No. 11/351,104, dated Feb. 15, 2012.
Office Action for U.S. Appl. No. 11/351,104, dated Jul. 26, 2011.
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 Oct. 28, 2008.
Office Action for U.S. Appl. No. 11/400,165, dated Aug. 19, 2008.
Office Action for U.S. Appl. No. 11/417,830, dated Nov. 14, 2008.
Office Action for U.S. Appl. No. 11/417,993, dated Oct. 29, 2008.
Office Action for U.S. Appl. No. 11/437,387, dated Dec. 23, 2008.
Office Action for U.S. Appl. No. 11/437,538, dated Dec. 22, 2008.
Office Action for U.S. Appl. No. 11/437,582, dated Jan. 8, 2009.
Office Action for U.S. Appl. No. 11/487,722, dated Aug. 7, 2009.
Office Action for U.S. Appl. No. 11/592,891, dated Jan. 15, 2009.
Office Action for U.S. Appl. No. 11/595,119, dated Aug. 19, 2010.
Office Action for U.S. Appl. No. 11/595,119, dated Jul. 21, 2009.
Office Action for U.S. Appl. No. 11/604,075, dated May 3, 2010.
Office Action for U.S. Appl. No. 11/643,329, dated Jul. 9, 2010.
Office Action for U.S. Appl. No. 11/852,234, dated Apr. 27, 2011.
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 Jan. 21, 2010.
Office Action for U.S. Appl. No. 11/852,234, dated Jun. 29, 2009.
Office Action for U.S. Appl. No. 11/970,484, dated Jun. 20, 2012.
Office Action for U.S. Appl. No. 11/970,484, dated Nov. 24, 2010.
Office Action for U.S. Patent Application No. 111437,537, dated Dec. 23, 2008.
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/210,917, dated Dec. 5, 2011.
Office Action for U.S. Appl. No. 12/210,917, dated Nov. 15, 2010.
Office Action for U.S. Appl. No. 12/336,492, dated Sep. 15, 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. 12/370,562, dated Apr. 6, 2011.
Office Action for U.S. Appl. No. 12/370,562, dated Jan. 17, 2012.
Office Action for U.S. Appl. No. 12/370,562, dated Sep. 30, 2010.
Office Action for U.S. Appl. No. 12/401,073, dated Aug. 23, 2010.
Office Action for U.S. Appl. No. 12/401,073, dated Sep. 20, 2011.
Office Action for U.S. Appl. No. 12/489,295, dated Apr. 27, 2011.
Office Action for U.S. Appl. No. 12/500,392, dated Jun. 20, 2011.
Office Action for U.S. Appl. No. 12/683,281, dated Jan. 20, 2012.
Office Action for U.S. Appl. No. 12/785,362, dated Apr. 22, 2011.
Office Action for U.S. Appl. No. 13/396,124, dated May 7, 2012.
Office Action for U.S. Appl. No. 14/468,079, dated Aug. 25, 2014.
Okamoto and Xu, IEEE, “Multimedia Communications over Wireless LANs via the SWL Protocol” Proceedings of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63, Jan. 1997.
Pack, S. et al. “Fast-Handoff Support in IEEE 802.11 Wireless Networks,” IEEE Communications Surveys, IEEE, NY, NY, vol. 9, No. 1, First Quarter 2007, May 2007 (pp. 2-12) ISSN: 1553- 877X.
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, April 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.
Potter et al., 802.11 Security, O'Reilly Media Inc., Dec. 2002, 14 pages.
Prosecution History from U.S. Appl. No. 11/801,964, dated Aug. 8, 2007 through Aug. 2, 2014, 73 pp.
Prosecution History from U.S. Appl. No. 12/304,100, now issued U.S. Pat. No. 9,258,702, dated Jun. 17, 2011 through Dec. 14, 2015, 312 pp.
Prosecution History from U.S. Appl. No. 14/468,079, dated Feb. 11, 2015 through Sep. 2, 2015, 29 pp.
Prosecution History from U.S. Appl. No. 14/951,766, dated Jul. 12, 2017 through Jul. 13, 2020, 252 pp.
Prosecution History from U.S. Appl. No. 14/996,088, now issued U.S. Pat. No. 9,838,942, dated Jul. 26, 2016 through Aug. 10, 2017, 81 pp.
Prosecution History from U.S. Appl. No. 15/803,208, now issued U.S. Pat. No. 10,327,202, dated Jul. 27, 2018 through Feb. 7, 2019, 73 pp.
Prosecution History from U.S. Appl. No. 16/401,904, dated Feb. 6, 2020 through Jun. 4, 2020, 35 pp.
Prosecution History from U.S. Appl. No. 17/012,990, dated Dec. 3, 2021 through Mar. 8, 2023, 114 pp.
Prosecution History from U.S. Appl. No. 17/069,353, dated Nov. 3, 2021 through Apr. 27, 2022, 23 pp.
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.
Puttini, R., Percher, J., Me, L., and de Sousa, R. 2004. A fully distributed IDS for MANET. In Proceedings of the Ninth international Symposium on Computers and Communications 2004 Volume 2 (lscc''04)—vol. 02 (June 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washington, DC, 331-338.
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, Oct. 1996.
Summons for Oral Hearing Proceedings for European U.S. Appl. No. 02/770,460, Jan. 31, 2006.
Supplementary Partial European Search Report for European Application No. 02/770,460, dated Aug. 20, 2004.
Supplementary Partial European Search Report for European Application No. 02770,460, dated Dec. 15, 2004.
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.
U.S. Appl. No. 18/297,334, filed Apr. 7, 2023, naming inventors Murphy et al.
U.S. Appl. No. 09/866,474, filed May 29, 2001.
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. 13/006,950, filed Jan. 14, 2011.
Ullmo et al., “Wireless Propagation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
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).
Related Publications (1)
Number Date Country
20230007477 A1 Jan 2023 US
Provisional Applications (1)
Number Date Country
60812403 Jun 2006 US
Divisions (1)
Number Date Country
Parent 11801964 May 2007 US
Child 14468079 US
Continuations (3)
Number Date Country
Parent 17069353 Oct 2020 US
Child 17815039 US
Parent 14951766 Nov 2015 US
Child 17069353 US
Parent 14468079 Aug 2014 US
Child 14951766 US