AP-local dynamic switching

Information

  • Patent Grant
  • 11627461
  • Patent Number
    11,627,461
  • Date Filed
    Friday, September 4, 2020
    3 years ago
  • Date Issued
    Tuesday, April 11, 2023
    a year ago
Abstract
A technique for implementing AP-local dynamic switching involves Layer 2 switching. This may be accomplished by providing data associated with wireless stations to an AP sufficient to enable the AP to determine whether traffic from a particular wireless station should be locally switched. Alternatively, the wireless station may be able to determine whether to locally switch traffic based upon the traffic itself. For example, it may be desirable to AP-locally switch voice traffic to avoid latency, which is particularly detrimental to voice transmissions such as voiceover-IP. Traffic that is not to be switched locally is Layer 2 tunneled upstream.
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, switching is performed, as may be expected, by the switch. However, it is also possible to perform native switching at an AP. It is a non-trivial problem to coordinate AP-local switching with centralized control. It is also a non-trivial problem to provide hybrid switching, that is, AP-local switching combined with switching at the switch.


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

This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.


A technique for implementing AP-local dynamic switching involves Layer 2 switching. This may be accomplished by providing data associated with wireless stations to an AP sufficient to enable the AP to determine whether traffic from a particular wireless station should be locally switched. Alternatively, the wireless station may be able to determine whether to locally switch traffic based upon the traffic itself. For example, it may be desirable to AP-locally switch voice traffic to avoid latency, which is particularly detrimental to voice transmissions such as voice-overIP. Traffic that is not to be switched locally is Layer 2 tunneled upstream.


The proposed system can offer, among other advantages, efficient utilization of bandwidth, reduced latency, network efficiency, reliability. 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 claimed subject matter are illustrated in the figures. However, the embodiments and figures are illustrative rather than limiting; they provide examples of the claimed subject matter.



FIG. 1 depicts an example of a system including an untethered access point (UAP) mesh.



FIG. 2 depicts an example of a AP-local dynamic switching system.



FIGS. 3A to 3D depict by way of example but not limitation various factors that could be considered when determining whether to switch locally at an AP or at a switch.



FIG. 4 depicts an example of an AP capable of AP-local dynamic switching.



FIG. 5 depicts a flowchart of an example of a method for AP-local dynamic switching.





DETAILED DESCRIPTION

In the following description, several specific details are presented to provide a thorough understanding of embodiments of the claimed subject matter. One skilled in the relevant art will recognize, however, that the claimed subject matter 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 claimed subject matter.



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. It should be noted that while an overlay switching model is in some ways replaced by the techniques described herein, it may be desirable to prevent the implementation of local switching from removing any functionality of the overlay model.


An overlay switch model includes APs that tunnel to an upstream switch (e.g., an MX®), allowing the switch to perform complex policy and forwarding decisions locally. Centralizing switching to an upstream switch has allowed AP switching code to remain relatively simple (supporting the Thin-AP model). The AP at least knows it is on a subnet from which the upstream switch is reachable. The advantages of the overlay model include keeping the AP code and configuration simple; allowing a wireless network to be deployed over an arbitrary access network connecting the AP to the upstream switch (since client traffic is tunneled, it does not see the access network, so stations on the AP can be on completely different LANs than those available to the AP); and switches can form tunnels between themselves and send client traffic in those tunnels to further extend the choice of VLANs any given client on any AP may join. However, the overlay network suffers from the following: all traffic must pass through the upstream switch, which might be very far from the AP; complications involving MTU and other middle box issues when tunneling traffic; and not taking advantage of the distributed forwarding computational power available at the APs (in general, designs that push forwarding issues to the edge scale better).


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.


In the example of FIG. 1, 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 a non-limiting 802.11 implementation, each of the APs 106 supports switching packets from a radio interface to a wired interface as a standard 802.3 frame. The AP switching path may or may not support 802.1q tagged packets and may or may not support MAC or user-based ACLs. (Port, VLAN, or VPORT based ACLs may or may not be required.) It may be desirable for an AP to support local switching and overlay simultaneously. However, even if it does, it is not a requirement that packets should be switched locally and in overlay mode simultaneously. For example, a given VLAN on an AP may be switched either locally or in overlay mode.


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.


The SSR may include any information available at an upstream switch. In a non-limiting embodiment, the data available to the switch following station association and authentication includes station MAC, VLAN number, VLAN name, a local switch flag, a tagging flag, radio port, radio tag (used to map the radio port to the VLAN), ACLs (e.g., ingress and egress ACLs to be mapped to the station MAC), and/or a proxy-ARP flag. (Note: the proxy-ARP might only be honored if local switching is enabled.) In an illustrative embodiment that enables local switching for a particular VLAN (other examples are described later with reference to FIGS. 3A to 3D), the local switch flag is set to TRUE if local switching is enabled for the AP and the AP is connected to the VLAN specified by VLAN name. The tagging flag is set to TRUE if the station's VLAN is reachable through a 0.1 q tag. When this flag is TRUE, the VLAN-number may be taken as the 0.1 q tag value. With this information, the AP can create a VLAN and add the specified radio ports and wired ports to the VLAN with the specified tag values. The AP then sends the packet of learning from its network port to potentially update any intermediate switches.


It will be appreciated in light of the description provided herein that although aspects of the claimed subject matter are described relative to IEEE 802.11 standards, and that certain embodiments have particular features that are implemented within the 802.11 context, the claimed subject matter 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 claimed subject matter 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 aU 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.


Reducing the amount of data that passes through a wireless node, such as a UAP, to a wired switch is advantageous at least in part because wireless resources are relatively scarce. There is less need to conserve wired resources. However, conservation of wired resources is nevertheless of value in many cases. Accordingly, the teachings described herein with reference to an AP may be applicable to a wired AP, such as the APs 106 (FIG. 1) or to a wireless AP, such the UAPs of the UAP mesh 108 (FIG. 1). For this reason, in subsequent figures, an AP may refer to a wired or wireless AP, unless specifically identified as a UAP, which is wireless by definition (i.e., a UAP is an “untethered” AP).



FIG. 2 depicts an example of a AP-local dynamic switching system 200. The system 200 includes a wireless switch 202, an AP 204 coupled to the switch 202, and two stations 206-1 and 206-2 (referred to collectively as wireless stations 206) wirelessly coupled to the AP 204. In an illustrative embodiment, the switch 202 provides the AP 204 with data in the form of an SSR, which may include various data about the wireless stations 206 (or, more generally, about wireless stations coupled to the switch 202 through the AP 204). The SSR may be any data structure that includes data sufficient to facilitate native switching at the AP 204 or switching at the wireless switch 202. The AP 204 decides whether to natively switch using, by way of example but not limitation, SSID, the class of data associated with the message, a VLAN associated with the station sending the message, authentication data associated with the user of the station sending the message, or some other factor.


In an illustrative embodiment, the wireless switch 202 knows that the AP 204 is to perform local switching and to which VLANs (if applicable) the AP is connected. However, this is not an absolute requirement.


In an illustrative embodiment, the AP 204 is a layer 2 switch. In an illustrative embodiment, the AP 204 is coupled to the wireless switch 202 via a tunnel 208. Thus, a message can be tunneled to the wireless switch 202 for layer 2 switching at the wireless switch 202. It should be noted that it may be difficult to support multiple layer 3 protocols. So, by keeping the switching at layer 2, the system 200 need not have a specific layer 3 protocol (e.g., IP). Moreover, if you have a layer 3 backbone with policy in the routers, switching may defeat the policy. Advantageously, layer 2 switching at least reduces or eliminates these problems.


Since the AP 204 is a switching device, in an illustrative embodiment, the wireless switch 202 does not need to perform packet replication for multicast. Hence, a single multicast packet is transmitted from the wireless switch 202 to the AP 204 where it is replicated by the AP 204 as needed.


In the example of FIG. 2, the station 206-2 sends messages 210,212 to the AP 204. The AP 204 treats the messages differently according to data available to the AP 204. In the example of FIG. 2, the AP 204 sends the message 210 to the switch 202 via the tunnel 208. In the example of FIG. 2, the AP 204 performs AP-local switching on the message 212 and sends the message 212 to the station 206-1. It should be noted that the message 210 could be switched at the switch 202 and sent to the station 206-1. Some examples of the various factors that could be considered when the AP 204 determines whether to switch locally or at the switch 202 (e.g., by tunneling) are explored by way of example but not limitation in the FIGS. 3A to 30.



FIG. 3A depicts an example of a system 300A performing AP-local dynamic switching per SSID. The system 300A includes an AP 302 and stations 304-1 to 304-3 (referred to collectively as the stations 304). For illustrative purposes only, the AP 302 includes two virtual APs (VAPs) 306-1 and 306-2 (referred to collectively as VAPs 306). As one of skill in the relevant arts would know, an AP can broadcast or otherwise handle multiple SSIDs. If the AP broadcasts or otherwise handles more than one SSID, the AP may be logically treated as multiple APs; each of the logical APs, associated with respective SSIDs may be referred to as a VAP. In the example of FIG. 3A, the AP 302 switches traffic through VAP 306-1 locally, if possible, and passes traffic through VAP 306-2 upstream for upstream switching. It may be noted that in a non-limiting embodiment, the AP 302 may perform AP-local dynamic switching per SSID, even if the AP 302 handles a single SSID; the determination is still dynamic even if only one outcome is possible.



FIG. 3B depicts an example of a system 300B performing AP-local dynamic switching per VLAN. The system 300B includes an AP 312 and stations 314-1 to 314-3 (referred to collectively as the stations 314). The stations are divided into VLANs 316-1 and 316-2 (referred to collectively as the VLANs 316). For illustrative purposes only, the stations 314-1 and 314-2 are part of the VLAN 316-1 and the station 314-3 is part of the VLAN 316-2. In the example of FIG. 3B, the AP 312 switches traffic from VLAN 316-1 locally, if possible, and passes traffic from VLAN 316-2 upstream for upstream switching.



FIG. 3C depicts an example of a system 300C performing AP-local dynamic switching per class. The system 300C includes an AP 322 and stations 324-1 to 324-2 (referred to collectively as the stations 324). For illustrative purposes only, the station 324-1 sends data traffic 326 and voice traffic 328 to the station 324-2. In the example of FIG. 3C, the AP 322 switches voice traffic 328 locally, if possible, and passes data traffic 326 upstream for upstream switching. Advantageously, this may enable faster transmission times for voice traffic, which tends to be more time-sensitive than data traffic, while maintaining centralized control of data traffic.



FIG. 3D depicts an example of a system 300D performing AP-local dynamic switching per user. The system 300D includes an AP 332 and stations 334-1 to 334-2 (referred to collectively as the stations 334). Each of the stations 334 has a respective associated user 336-1 to 336-3 (referred to collectively as the users 336). The users 336 and an AAA engine 338 are depicted for illustrative purposes only, to represent AP-local dynamic switching based on user authentication (e.g., AAA-driven switching). In the example of FIG. 3D, the AP 332 switches traffic from the station 334-1 locally, if possible, because the user 336-1 is allowed to do AP-local switching. However, the AP 332 passes traffic from the station 334-3 upstream for upstream switching because the user 336-3 is not allowed to do AP-local switching. Advantageously, this may enable faster transmission times for certain users, while maintaining centralized control of other users. By way of example but not limitation, the users allowed to do AP-local switching could be employees, while those not allowed to do AP-local switching could be guests. As another example, the users allowed to do AP-local switching could be employees of a first company, while those not allowed to do AP-local switching could be employees of a second company where the first company has superior (or at least different) access rights.


The examples of FIGS. 3A to 3D are intended to provide only a subset of the possible techniques for implementing AP-local dynamic switching. The techniques, whether illustrated in FIGS. 3A to 3D or not, could be used alone or in combination with other techniques, whether illustrated in FIGS. 3A to 3D or not.



FIG. 4 depicts an example of an AP 400 capable of AP-local dynamic switching. The AP 400 includes a processor 402, an optional Ethernet interface 404, a radio 406, a dynamic switching module 408, and a station switching record (SSR) database 410 coupled together via a bus 412. It may be noted that the various components could be coupled via some means other than the bus 412 without deviating from the scope of the teachings provided herein. The Ethernet interface 404 is optional because, for example, the AP 400 does not use Ethernet, the AP is a UAP that does not have a wired interface, or for some other reason. The radio may be an 802.11 radio, or some other wireless radio.


In an illustrative embodiment, the dynamic switching module 408 is implemented in a computer-readable medium, such as non-volatile storage and/or memory. The SSR database 410 is also implemented in a computer-readable medium, such as non-volatile storage and/or memory. In operation, portions of the dynamic switching module 408 maybe loaded from non-volatile storage into memory, and executed by the processor 402. In an alternative embodiment, the dynamic switching module 408 may have a dedicated processor (not shown). Whether the processor is shared or dedicated, the dynamic switching module 408 and the processor may be referred to collectively as a dynamic switching engine.


In the example of FIG. 4, in operation, the AP 400 receives from an upstream switch an SSR associated with a downstream station. The SSR is stored in the SSR database 410. The downstream station may be operationally connected to the AP 400 through a wireless link, either directly or indirectly through intervening nodes of a wireless mesh. The dynamic switching engine uses the SSR to determine whether to perform AP-local switching for traffic received from the downstream station at the AP 400, or to send the traffic upstream toward the upstream switch.



FIG. 5 depicts a flowchart 500 of an example of a method for AP-local dynamic switching. In the example of FIG. 5, the flowchart 500 starts at optional module 502 where data associated with a wireless station is received. The data may be received at, for example, an AP. The module 502 is optional because instead (or in addition), it may be possible to use data associated with traffic to make determinations regarding whether to AP-locally switch the traffic, as is described shortly.


In the example of FIG. 5, the flowchart 500 continues to module 504 where Layer 2 traffic is received from the wireless station. Advantageously, since the traffic is Layer 2, the system may operate using any Layer 3 protocols (e.g., IP), or even multiple Layer 3 protocols.


In the example of FIG. 5, the flowchart 500 continues to decision point 506 where it is determined whether to Layer 2 switch the traffic locally. The determination as to whether to switch the traffic locally may be made using data associated with the wireless station (see, e.g., module 502) or data associated with the traffic itself. For example, the wireless station may be authorized for AP-local switching because the wireless station is associated with a particular VLAN. As a second example, the traffic may have a relatively high priority, such as voice traffic often has. If the traffic has a relatively high priority, the determination may be made to switch locally to get the traffic to its destination more quickly. It may be noted that in the second example, the module 502 is optional.


In the example of FIG. 5, if it is determined that the traffic is to be Layer 2 switched locally (506-Y), the flowchart 500 continues to module 508 where the traffic is Layer 2 switched locally, and to module 510 where the traffic is sent toward its destination. Having switched and sent the traffic, the flowchart 500 ends.


In the example of FIG. 5, if it is determined that the traffic is not to be Layer 2 switched locally (506-N), the flowchart 500 continues to module 512 where the traffic is Layer 2 tunneled upstream. Presumably, the traffic is switched further upstream. Having Layer 2 tunneled traffic upstream that is not to be switched locally, the flowchart 500 ends.


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.


Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

Claims
  • 1. A method, comprising: receiving, at an access point (AP), a data signal from a first wireless station, the data signal including one of voice traffic or data traffic;determining, based on whether the data signal includes voice traffic or data traffic, whether to locally switch the data signal to a second wireless station or tunnel the data signal to an upstream switch via Layer 2 tunneling;when the data signal is determined to include voice traffic, locally switching the data signal by the AP to the second wireless station via Layer 2 switching; andwhen the data signal is determined to include data traffic, tunneling the data signal by the AP to the upstream switch via Layer 2 tunneling for switching to the second wireless station at the upstream switch.
  • 2. The method of claim 1, wherein: the voice traffic has a higher priority for data transmission than the data traffic.
  • 3. The method of claim 1, wherein: the determining is based on a station switching record (SSR) including data associated with the first wireless station.
  • 4. The method of claim 1, further comprising: receiving a station switching record (SSR) from an upstream source,wherein the determining is based on data in the SSR associated with the first wireless station.
  • 5. The method of claim 1, wherein: locally switching the data signal to the second wireless station is via an Ethernet interface.
  • 6. The method of claim 1, wherein: the second wireless station is an upstream destination.
  • 7. The method of claim 1, wherein: the second wireless station is a downstream destination.
  • 8. The method of claim 1, wherein: the upstream switch is configured to switch, after the data signal is tunneled to the upstream switch, the data signal to the second wireless station via Layer 2 tunneling.
  • 9. A non-transitory computer-readable medium comprising instructions that when to be executed by at least one processor cause the at least one processor to: receive a data signal from a first wireless station, the data signal including one of voice traffic or data traffic;determine, based on whether the data signal includes voice traffic or data traffic, whether to locally switch the data signal to a second wireless station or tunnel the data signal to an upstream switch via Layer 2 tunneling;when the data signal is determined to include voice traffic, locally switch the data signal to the second wireless station via Layer 2 switching; andwhen the data signal is determined to include data traffic, tunnel the data signal to the upstream switch via Layer 2 tunneling for switching to the second wireless station at the upstream switch.
  • 10. The non-transitory computer-readable medium of claim 9, wherein: the voice traffic has a higher priority for data transmission than the data traffic.
  • 11. The non-transitory computer-readable medium of claim 9, wherein: locally switching the data signal to the second wireless station is via an Ethernet interface.
  • 12. An apparatus, comprising: a memory; anda processor operatively coupled to the memory; the processor configured to: receive a data signal from a first wireless station, the data signal including one of voice traffic or data traffic;determine, based on whether the data signal includes voice traffic or data traffic, whether to locally switch the data signal to a second wireless station or tunnel the data signal to an upstream switch via Layer 2 tunneling;when the data signal is determined to include voice traffic, locally switch the data signal to the second wireless station via Layer 2 switching; andwhen the data signal is determined to include data traffic, tunneling the data signal to the upstream switch via Layer 2 tunneling for switching to the second wireless station at the upstream switch.
CROSS-REFERENCE TO RELATED PATENT APPLICATIONS

This patent application is a Continuation of U.S. patent application Ser. No. 16/401,904, entitled “AP-LOCAL DYNAMIC SWITCHING,” filed May 2, 2019 (now U.S. Pat. No. 10,798,650), which is a Continuation of U.S. patent application Ser. No. 15/803,208, entitled “AP-LOCAL DYNAMIC SWITCHING,” filed Nov. 3, 2017 (now U.S. Pat. No. 10,327,202), which is a Continuation of U.S. patent application Ser. No. 14/996,088, entitled “AP-LOCAL DYNAMIC SWITCHING,” filed Jan. 14, 2016 (now U.S. Pat. No. 9,838,942), which is a Continuation of and claims priority to and the benefit of U.S. patent application Ser. No. 12/304,100, titled “AP-LOCAL DYNAMIC SWITCHING,” filed Aug. 6, 2010 (now U.S. Pat. No. 9,258,702), which is the National Stage of International Patent Application Number PCT/US2007/013757, filed June 11, 2007, which claims the benefit of U.S. Provisional Patent Application Ser. No. 60/812,403, filed June 9, 2006, and which is a Continuation-in-Part of U.S. patent application Ser. No. 11/801,964, filed May 11, 2007 (now U.S. Pat. No. 8,818,322), the disclosures of each of which are hereby incorporated by reference in their entireties.

US Referenced Citations (738)
Number Name Date Kind
3641433 Mifflin et al. Feb 1972 A
3906166 Cooper et al. Sep 1975 A
4168400 De Couasnon et al. Sep 1979 A
4176316 DeRoas et al. Nov 1979 A
4247908 Lockart 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 Simpson et al. Feb 1991 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
5187575 Lim Feb 1993 A
5231633 Hluchy 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 Jul 1994 A
5339316 Diepstraten Aug 1994 A
5371783 Rose et al. Dec 1994 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 Nov 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
5584048 Wieczorek Dec 1996 A
5598532 Liron Jan 1997 A
5630207 Gitlin et al. May 1997 A
5640414 Blakeney et al. Jun 1997 A
5649289 Wang et al. Jul 1997 A
5668803 Tymes et al. Sep 1997 A
5670964 Dent 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
5734699 Lu et al. Mar 1998 A
5740533 Lin Apr 1998 A
5742592 Scholefield et al. Apr 1998 A
5745481 Phillips 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
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
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 Bosch 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
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 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
6130896 Lueker et al. 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 Birukawa 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 Ulfongene 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
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 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
6636524 Chen 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
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
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 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
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 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 Forslow 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
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 et al. Nov 2007 B1
7310664 Merchant et al. Dec 2007 B1
7313111 Hietalahti et al. Dec 2007 B2
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
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
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
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 et al. Sep 2009 B1
7603119 Durig et al. Oct 2009 B1
7603710 Harvey et al. Oct 2009 B2
7633909 Jones et al. 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 et al. 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 et al. 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 et al. Jan 2011 B2
7876704 Bims et al. 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 et al. 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
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 et al. May 2012 B2
8190750 Balachandran et al. May 2012 B2
8238942 Gast Aug 2012 B2
8270384 Cheng et al. Sep 2012 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
8804732 Hepting et al. Aug 2014 B1
8818322 Murphy et al. Aug 2014 B2
9043792 Xu May 2015 B1
9232451 Murphy et al. Jan 2016 B2
9258702 Murphy et al. Feb 2016 B2
9838942 Murphy et al. Dec 2017 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
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
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 et al. Dec 2003 A1
20030227934 White et al. Dec 2003 A1
20040001467 Cromer 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 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
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 et al. Apr 2004 A1
20040066757 Molteni et al. 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
20040120370 Lupo Jun 2004 A1
20040132438 White Jul 2004 A1
20040143428 Rappaport et al. Jul 2004 A1
20040143755 Whitaker et al. Jul 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
20040221042 Meier Nov 2004 A1
20040228319 Melville et al. Nov 2004 A1
20040230370 Tzamaloukas Nov 2004 A1
20040233234 Chaudhry et al. Nov 2004 A1
20040236702 Fink et al. Nov 2004 A1
20040236851 Kuan 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
20040253969 Nguyen et al. Dec 2004 A1
20040255167 Knight Dec 2004 A1
20040259552 Ihori 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
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
20050059405 Thomson 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 et al. 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 Nov 2005 A1
20050256963 Proctor et al. Nov 2005 A1
20050259597 Benedetto et al. Nov 2005 A1
20050259611 Bhagwat et al. Nov 2005 A1
20050259654 Faulk, Jr. Nov 2005 A1
20050268335 Le et al. Dec 2005 A1
20050270992 Sanzgiri et al. Dec 2005 A1
20050273442 Bennett et al. 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 Floros 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 et al. 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 et al. Jul 2006 A1
20060152344 Mowery Jul 2006 A1
20060153122 Hinman et al. Jul 2006 A1
20060160540 Strutt et al. Jul 2006 A1
20060161983 Cothrell 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 et al. Oct 2006 A1
20060245393 Bajic Nov 2006 A1
20060248229 Saunderson et al. Nov 2006 A1
20060248331 Harkins Nov 2006 A1
20060251021 Nakano et al. Nov 2006 A1
20060268696 Konstantinov et al. Nov 2006 A1
20060268749 Rahman et al. Nov 2006 A1
20060268756 Wang et al. 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 et al. Jan 2007 A1
20070002833 Bajic Jan 2007 A1
20070008884 Tang 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 et al. 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 Shim et al. 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 Donald Hart 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
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
20070160046 Matta Jul 2007 A1
20070171909 Pignatelli Jul 2007 A1
20070183375 Tiwari Aug 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 et al. Oct 2007 A1
20070248009 Petersen Oct 2007 A1
20070253369 Abhishek et al. Nov 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
20080013481 Simons et al. 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
20080069018 Gast 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
20080117822 Murphy et al. May 2008 A1
20080130523 Fridman et al. Jun 2008 A1
20080151844 Tiwari Jun 2008 A1
20080159319 Gast et al. Jul 2008 A1
20080162921 Chesnutt 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
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
20090067436 Gast Mar 2009 A1
20090073905 Gast Mar 2009 A1
20090129386 Rune May 2009 A1
20090131082 Gast May 2009 A1
20090198999 Harkins Aug 2009 A1
20090247103 Aragon Oct 2009 A1
20090252120 Kim et al. Oct 2009 A1
20090257437 Tiwari Oct 2009 A1
20090260083 Szeto et al. Oct 2009 A1
20090274060 Taylor Nov 2009 A1
20090287816 Matta et al. Nov 2009 A1
20090293106 Gray 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
20100130212 So et al. 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 Delves Oct 2010 A1
20100261475 Kim et al. Oct 2010 A1
20100271188 Nysen Oct 2010 A1
20100329177 Murphy et al. Dec 2010 A1
20110013588 Jeon et al. Jan 2011 A1
20110047474 Sung et al. 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 et al. Sep 2015 A1
20160088551 Murphy et al. Mar 2016 A1
20180063673 Jang et al. Mar 2018 A1
Foreign Referenced Citations (19)
Number Date Country
0992921 Apr 2000 EP
1542409 Jun 2005 EP
2329801 Mar 1999 GB
2429080 Feb 2007 GB
2000-215169 Aug 2000 JP
2003-234751 Aug 2003 JP
2003-274454 Sep 2003 JP
2004-032525 Jan 2004 JP
WO 9403986 Feb 1994 WO
WO 9911003 Mar 1999 WO
WO 0006271 Feb 2000 WO
WO 0018148 Mar 2000 WO
WO 2002089442 Nov 2002 WO
WO 2003085544 Oct 2003 WO
WO 2004013986 Feb 2004 WO
WO 2004095192 Nov 2004 WO
WO 2004095800 Nov 2004 WO
WO 2006014512 Feb 2006 WO
WO 2010130133 Nov 2010 WO
Non-Patent Literature Citations (207)
Entry
Acampora et al., “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 et al., “System Applications for Wireless Indoor Communications” IEEE Communications Magazine, vol. 25, No. 8, Aug. 1987, pp. 11-20.
Bing et al., “A New Multiaccess Technique for Multimedia Wireless LANs” IEEE Global Telecommunications Conference, Nov. 3-8, 1997, pp. 1318-1322.
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.
Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, 1980, IEEE, pp. 69.7.1-69.7.4.
Fortune et al., “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, IEEE Computational Science and Engineering, p. 58-68 (1995).
Geier, J., Wireless Lans Implementing Interoperable Networks, Chapters (pp. 89-125) Chapter 4 (pp. 129-157) Chapters (pp. 159-189) and Chapter6 (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 Measurementsand 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 et al., “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, Jun. 12-15, Chicago Illinois (1977).
LAN/MAN Standards 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).
Okamoto et al., IEEE, “Multimedia Communications over Wireless LANs via the SWL Protocol” Proceedings 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 et al., “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.
Puttini, R. et al., “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, pp. 331-338.
Martinez, P. et al., “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://sern.uccalgary.ca˜lawa/SENG60921/arch/SDP.htm> [retrieved Aug. 12, 2004] (15 pages).
Bahl, P. 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.
Bahl, P. et al., A Software System for Locating Mobile Users: Design, Evaluation, and Lessons, Microsoft Research, Feb. 1999, 13 pages.
Chen, Y-C 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, M., “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. et al., 802.11 Security, O'Reilly Media Inc., Dec. 2002, 14pages.
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, A., 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, D. 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.
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.
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.
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 (pp. 2-12) ISSN: 1553-877X.
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, 17 pages.
Final Office Action for U.S. Appl. No. 12/304,100, dated Feb. 2, 2012.
Office Action for U.S. Appl. No. 12/304,100, dated May 29, 2012.
Office Action for U.S. Appl. No. 12/304,100, dated Dec. 11, 2012, 21 pages.
Office Action for U.S. Appl. No. 12/304,100, dated Feb. 13, 2014, 33 pages.
Office Action for U.S. Appl. No. 12/304,100, dated Apr. 20, 2015.
Office Action for U.S. Appl. No. 12/304,100, dated Aug. 28, 2015.
Office Action for U.S. Appl. No. 14/468,079, dated Aug. 25, 2014.
International Search Report and Written Opinion for International Application No. PCT/US07/013758, dated Apr. 3, 2008.
First Office Action for Chinese Application No. 200780029623.X, dated Dec. 31, 2010.
Second Office Action for Chinese Application No. 200780029623.X, dated Mar. 7, 2012.
Third Office Action for Chinese Application No. 200780029623.X, dated Sep. 29, 2012.
Fourth Office Action for Chinese Application No. 200780029623.X, dated Apr. 2, 2013.
Fifth Chinese Office Action for Chinese Application No. 200780029623.X, dated Sep. 3, 2013.
Extended Supplementary European Search Report for Application No. 07796005.2, dated Feb. 14, 2012.
European Examination Report for Application No. 07796005.2, dated Sep. 4, 2012.
International Search Report and Written Opinion for International Application No. PCT/US07/013757, dated Jan. 22, 2008.
Office Action for U.S. Appl. No. 14/951,766, dated Jul. 12, 2017, 25 pages.
Office Action for U.S. Appl. No. 14/951,766, dated Dec. 22, 2017, 25 pages.
Office Action for U.S. Appl. No. 14/996,088, dated Jul. 26, 2016, 36 pages.
Office Action for U.S. Appl. No. 14/996,088, dated Mar. 23, 2017, 17 pages.
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.
Office Action for U.S. Appl. No. 12/957,997, dated Aug. 28, 2012.
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.
Final Office Action for U.S. Appl. No. 12/489,295, dated Jan. 18, 2012.
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/351,104, dated Feb. 15, 2012.
Final Office Action for U.S. Appl. No. 11/351,104, dated Aug. 14, 2012.
Non-Final Office Action for U.S. Appl. No. 11/351,104, dated Dec. 17, 2012.
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. 13/396,124, dated May 7, 2012.
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. 12/370,562, dated Jan. 17, 2012.
Final Office Action for U.S. Appl. No. 12/370,562, dated Jul. 26, 2012.
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/595,119, dated Jul. 21, 2009.
Final Office Action for U.S. Appl. No. 11/595,119, dated Jan. 5, 2010.
Office Action for U.S. Appl. No. 11/595,119, dated Aug. 19, 2010.
Final Office Action for U.S. Appl. No. 11/595,119, dated Aug. 2, 2011.
Office Action for U.S. Appl. No. 11/604,075, dated May 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. 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. 12/683,281, dated Jan. 20, 2012.
Final Office Action for U.S. Appl. No. 12/683,281, dated Sep. 21, 2012.
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. 13/568,861, dated Oct. 24, 2012.
Office Action for U.S. Appl. No. 12/077,051, dated Dec. 28, 2010.
Final Office Action for U.S. Appl. No. 12/077,051, dated Oct. 25, 2011.
Office Action for U.S. Appl. No. 12/113,535, dated Apr. 21, 2011.
Final Office Action for U.S. Appl. No. 12/113,535, dated Jan. 3, 2012.
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 Nov. 1, 2012.
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.
Final Office Action for U.S. Appl. No. 11/852,234, dated Jan. 20, 2012.
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. 11/970,484, dated Jun. 20, 2012.
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/172,195, dated Feb. 14, 2013.
Office Action for U.S. Appl. No. 12/336,492, dated Sep. 15, 2011.
Final Office Action for U.S. Appl. No. 12/336,492, dated Jun. 15, 2012.
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/210,917, dated Dec. 5, 2011.
Office Action for U.S. Appl. No. 12/350,927, dated Aug. 17, 2011.
Final Office Action for U.S. Appl. No. 12/350,927, dated Jan. 18, 2012.
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.
Extended Search Report for European Application No. 11188566.1, dated Jan. 30, 2012.
International Search Report and Written Opinion for International Application No. PCT/US05/004702, dated Aug. 10, 2006.
International Search Report and Written Opinion for International Application No. PCT/US2006/009525, dated Sep. 13, 2007.
International Search Report and Written Opinion for International Application No. PCT/US06/40500, dated Aug. 17, 2007.
International Search Report and Written Opinion for International Application No. PCT/US06/40498, dated Dec. 28, 2007.
International Search Report and Written Opinion for International Application No. PCT/US2007/012194 dated Feb. 4, 2008.
International Search Report and Written Opinion for International Application No. PCT/US06/40499, dated Dec. 13, 2007.
International Search Report and Written Opinion for International Application No. PCT/US2007/19696, dated Feb. 29, 2008.
International Search Report and Written Opinion for International Application No. PCT/US2007/12016, dated Jan. 4, 2008.
International Search Report and Written Opinion for International Application No. PCT/US2007/012195, dated Mar. 19, 2008.
International Search Report and Written Opinion for International Application No. PCT/US07/14847, dated Apr. 1, 2008.
International Search Report and Written Opinion for International Application No. PCT/US07/089134, dated Apr. 10, 2008.
International Search Report and Written Opinion for International Application No. 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, mailed Jan. 31, 2006.
International Search Report for International Application No. International Application No. PCT/US02/28090, dated Aug. 13, 2003.
International Preliminary Examination Report for International Application No. 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 International Application No. PCT/US04/30769, dated Oct. 4, 2005.
International Search Report and Written Opinion for International Application No. PCT/US04/30683, dated Feb. 10, 2006.
International Search Report and Written Opinion for International Application No. PCT/US04/30684, dated Feb. 10, 2006.
Related Publications (1)
Number Date Country
20200404498 A1 Dec 2020 US
Provisional Applications (1)
Number Date Country
60812403 Jun 2006 US
Continuations (4)
Number Date Country
Parent 16401904 May 2019 US
Child 17012990 US
Parent 15803208 Nov 2017 US
Child 16401904 US
Parent 14996088 Jan 2016 US
Child 15803208 US
Parent 12304100 US
Child 14996088 US
Continuation in Parts (1)
Number Date Country
Parent 11801964 May 2007 US
Child 12304100 US