Network assignment based on priority

Information

  • Patent Grant
  • 8902904
  • Patent Number
    8,902,904
  • Date Filed
    Friday, September 7, 2007
    17 years ago
  • Date Issued
    Tuesday, December 2, 2014
    9 years ago
Abstract
Systems and methods for network assignment based on priority are described in this application. In one aspect, a technique for network assignment based on priority relates to establishing a connection between a client and a virtual local area network (VLAN), based on an explicit or implicit network priority preference of the client. In an embodiment, multiple VLANs can be combined into one network bundle, the network bundle being a unit network for priority specification. In addition, multiple network bundles may be available for network assignment on a particular network controller (e.g., network switch). For example, the preferred network of a client may be comprised of several individual VLANs. Thus, the client can be assigned to any of the constituent VLANs included in the preferred network bundle.
Description
BACKGROUND

Different networks may be provided by different physical sets of infrastructure. For example, in a local area network (LAN), workstations and/or computing devices are typically connected to a network and to each other via a router, a switch, a hub, and/or repeaters. The networks are typically supported and managed by different physical network controllers.


However, wireless technology has introduced the ability to provide different networks with logically distinct networks associated with one physical infrastructure. In addition, the logically distinct networks (e.g., VLANs) can also be comprised of groups of devices and/or users physically connected to different local area networks (LANs) thus enabling devices connected to physically distinct networks to communicate with one another, for example, as if they reside on the same physical network.


Each logical network can be maintained separately. For example, each VLAN can be updated with different data sets and has a different user access list detailing conditions for access. By allocating logical networks based on relevant users, complexity in hardware requirements can be relieved and overhead network traffic may be reduced and can be useful where network traffic is caused by large amounts of mass distributions and multi-casting since logical networks (e.g., VLANs) prevent data transmission via redundant routes and/or destinations. Furthermore, since VLANs utilize switches rather than routers to separate a network into multiple broadcast domains, the inefficiency introduced by routers is decreased.


The foregoing examples of the related art and limitations related therewith are intended to be illustrative and no 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 OF THE DESCRIPTION

One or more techniques for network assignment based on priority are described here. Some embodiments of the present disclosure are summarized in this section. The following embodiments and aspects thereof are described in conjunction with systems, tools, and methods that are meant to be examples of an illustrative, and not limiting in scope.


In one aspect, a technique for network assignment based on priority relates to establishing a connection between a client and a virtual local area network (VLAN), based on an explicit or implicit network priority preference of the client. In an embodiment, multiple VLANs can be combined into one network bundle, the network bundle being a unit network for priority specification. In addition, multiple network bundles may be available for network assignment on a particular network controller (e.g., network switch). For example, the preferred network of a client may be comprised of several individual VLANs. Thus, the client can be assigned to any of the constituent VLANs included in the preferred network bundle.


In another aspect, the present disclosure further relates to maintaining VLAN associations of a client across a group of network controllers, the group of network controllers are referred to herein as a ‘persistent group’, regardless of the availability of a higher ranked VLAN on the client's priority list across different network controllers in the persistent group. In one embodiment, the association of a client with a VLAN can be maintained when the client roams to a region within the access point of different network controller, as long as the VLAN is available for connection, regardless of the user's priority list. In one aspect, the present disclosure further relates to establishing a connection with a preferred VLAN that is not available on a local network controller via tunneling, to the preferred VLAN that is available for connection on another network controller within a tunnel group. The client (e.g., user) can specify, in the network priority preference data, for example, whether a connection to a particular VLAN is to be maintained via tunneling when the VLAN is not available for connection on a local network controller. Furthermore, the VLANs can be specified, by network administrators, for example whether or not tunneled connections are accepted for the VLANs.


The present disclosure includes methods and systems which perform these methods, including processing systems which perform these methods, and computer readable media which when executed on processing systems cause the systems to perform these methods. Other features of the present disclosure will be apparent from the accompanying drawings and from the detailed description which follows.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates an example of an implementation of a wireless local area network (WLAN) having multiple virtual local area networks (VLANs).



FIG. 2 illustrates an example of representations of network priority preference data of one or more clients in a user database.



FIG. 3 illustrates an example of an implementation of a wireless local area network (WLAN) having a plurality of bundles of virtual local area networks (VLANs).



FIG. 4A illustrates an example of an implementation of a wireless local area network (WLAN) having a plurality of virtual local area networks (VLANs) with a client device within a range of a first access point.



FIG. 4B illustrates an example of an implementation of a wireless local area network (WLAN) having a plurality of virtual local area networks (VLANs) with a client device within a range of a second access point.



FIG. 4C illustrates an example of an implementation of a wireless local area network (WLAN) having a plurality of virtual local area networks (VLANs) with a client device within a range of a third access point.



FIG. 5 depicts a flow chart illustrating an example of a process of establishing a connection between a client and a VLAN based on the client's priority preference.



FIG. 6 depicts a flow chart illustrating an example of a process of establishing a connection between a client and a VLAN based on the client's priority preference, in particular, establishing a connection in persistent network groups.



FIG. 7 depicts a flow chart illustrating an example of a process of establishing a connection between a client and a VLAN based on the client's priority preference, in particular, establishing a connection in tunneling-enabled network groups.





DETAILED DESCRIPTION

The following description and drawings are illustrative and are not to be construed as limiting. Numerous specific details are described to provide a thorough understanding of the disclosure. However, in certain instances, well-known or conventional details are not described in order to avoid obscuring the description. References to one or an embodiment in the present disclosure can be, but not necessarily are, references to the same embodiment; and, such references mean at least one of the embodiments.



FIG. 1 illustrates an example of an implementation of a wireless local area network (WLAN) 100 having multiple virtual local area networks (VLANs) 110A-N.


In the example of FIG. 1, the WLAN system 100 includes an authentication, authorization, and accounting (AAA) server 102, a network database 104, a network switch 106, an access point 108, and virtual local area networks (VLANs) 110A-N. The network switch 106, in the example of FIG. 1 manages a first set of VLANs 110A-N that is available for connection via the first access point 108. The network switch 106 can be, for example, operationally connected to an authentication server (e.g., the AAA server 102) and an access point 108. The AAA server 102 can in some instances, be coupled to the network database 104. In other embodiments, the network database 104 can be internal to the AAA server 102. The AAA server 102 can include data corresponding to a particular wireless station, or a number of wireless stations.


The AAA server 102 may also include data of authentication such as keys, authorization data such as access lists and VLAN association information (e.g., for network security), whether or not a user is permitted to connect to a particular switch and/or access point, and accounting data, such as a complete or incomplete session history including roams, total packets sent, error packets, etc. In some embodiments, AAA data corresponding to a wireless station can be stored at the network switch 106. Further, the AAA data can be transferred to other switches (not shown in the example of FIG. 1). This, the AAA server 102 may or may not be present for the implementation of the novel aspects of the art described herein.


RFC 2904 due to Vollbrecht, et al., which is incorporated herein by reference, shows frameworks for authorization in the typical context of AAA for a network. Thus authorization framework can be applied to both wired and wireless users. Further, in the case of wireless users, the operations described in RFC 2904 may be preceded by other operations specific to establishing a wireless connection. For instance, in 802.11 wireless networks, the preliminary operations may include an 802.11 association request from the wireless client device, identifying the client device by a hardware (e.g., MAC) address. The user's name, password, and/or other AAA parameters can be exchanged after the association request has been accepted.


The 802.11 association request may further include a Service Set ID (SSID) to identify a wireless service to which the client wishes to connect. If the service equipment supports multiple subnets of VLANs, a common (although not mandatory) implementation choice is to identify an SSID with the VLANs. The user's request to be associated through a given SSID may imply that the subsequent authorization processing can connect the user to the VLAN that corresponds to the particular SSID.


The WLAN system 100 may or may not include WLAN intelligence distributed in a known or other manner to efficiently utilize network resources. The intelligence may extend to the edge of the network for, by way of example, but not limitation, authentication, authorization, and traffic prioritization. In this example, the network switch 106 is external to the access point 108 and may be operatively configured to communicate with one or more access points. One network switch 106 is shown in the figure, however, in practice, implementation can be achieved with multiple network controllers. The network switch 106 may include, by way of example but not limitation, a TRAPEZE MOBILITY EXCHANGE® (MX®) switch.


In the example of FIG. 1, in operation, the access point 108 receives a request from a client device 112 to connect to a VLAN. The request can be facilitated in any convenient and/or known manner, manual or automatic, such as, logging into the network, connecting to the network via a wired or wireless connection, being detected by network components, attempting to use network resources, etc. The log-in request can be received by any convenient and/or known device on a network, including a switch, access point, router, computer, laptop, server, etc. The log-in request can be placed by the client device and/or any other device that is able to connect to a network. In an embodiment, the client device 112 can be wired or wireless and the network switch 106 can provide wired or wireless access.


In the example of FIG. 1, in operation, after the client device 112 attempts to log-on to a VLAN, the network switch 106, and/or the controller 116 (which may or may not be needed for operation) queries the network database 104 for VLAN information and/or user information. In some instances, the user information may be stored in a user database 114, which may be coupled to the network database 104, integrated with the network database as shown in the example FIG. 1, or coupled to the network switch 106. The network switch 106 and/or a controller 116 on the network switch perform a lookup in the network database 104 and/or the user database 114. The network database 104 and/or the user database 114 can relay the information to the network switch and/or the controller. The VLAN information may further provide that the VLAN is supported on the network switch and/or that the client device 112 is authorized on the VLAN. Based on the information received, such as the client's priority preference for connecting to networks, the network switch 106 establishes a connection between the connection of the client device 112 and a VLAN. In a further example, the VLAN information may provide that the tunnel affinity for VLAN A is higher than the tunnel affinity for VLAN B.


In one embodiment, the system further includes a second network switch associated with a second set of VLANs that are available for connection via a second access point coupled to the second network switch. The second network switch may be operationally coupled to an authentication server (e.g., an AAA server), and a database (e.g., a network database and/or a user database) that is operatively accessible by the second network switch. When the client 112 roams to within a range of the second access point, the client attempts to connect to a VLAN of the second set of VLANs, the network switch performs a lookup in the network database to identify a preferred VLAN of the second set of VLANs associated with the second network switch based on the network priority preference data of the client. Based on the identification, the client can be connected to the preferred VLAN of the second set of VLANs. In one embodiment, the preferred VLAN is a highest ranked VLAN that is available for connection via the second access point.



FIG. 2 illustrates an example of representations of network priority preference data of one or more users in a user database 214.


A network database may include information such as, but not limited to, VLAN information, tunnel affinity information, IP addresses for switches, clients on the WLAN, and/or the VLAN, MAC addresses for switches, clients on the WLAN, and/or the VLAN log-in information, network permissions, network priority preference data of clients, priority preference data of VLAN, and/or other related client and client device information, etc. In another embodiment, the network database can be a forwarding database, such as is described in co-pending U.S. application Ser. No. 11/351,104 entitled “System and Method for Network Integrity,” filed Feb. 8, 2006, which is incorporated herein by reference.


In the example of FIG. 2, the user database 214 includes network priority preference data of clients, in other words, the client's preferences to connect to different VLANs. The client's priority can be represented in a number of ways. In the embodiment shown in the figure, the priority for a VLAN can be represented in a priority list 206. In addition, the preference to connect to a VLAN can be represented quantitatively as in 208 by assigning a score to the VLANs that the client wishes to connect to. The network priority preference data can be entered by clients, network administrators, or automatically based on client information and attributes.


The user database 214 can be populated by relaying network information from switches over a WLAN, such as the WLAN 100, and storing the network information in the user database 214. In one embodiment, the user database 214 can be duplicatively stored on any number of switches in the network, for example. Additionally, the user database 214 may be distributed and shared among the switches in the network, as opposed to stored in a central location.


Since different user groups (e.g., clients) frequently have needs to access different sets of data and/or services on a network, network resources can be more efficiently allocated through VLANs for resource sharing and distribution. In one embodiment, a client can indicate data/service requests and preferences can be mapped to a particular VLAN accordingly. Thusly, the client's network priority preference may be implicit by way of the client's membership in a group or department. For example, a student enrolled in an advanced calculus class may automatically be assigned to the VLAN associated with the advanced calculus class, as indicated by network priority preference data, to provide controlled access to course materials. An employee in the accounting department may be assigned to a VLAN available for accessing auditing data, of which, another employee not in the accounting department would otherwise not have access to.


In the example of FIG. 2, a user's network priority preference data 210 can be implicitly indicated by the user's membership in a particular user group of department. As shown, user 5 is a student and is in the math class. Thus, if both math and student networks are available, and if only the math network is available, user 5 would be assigned to the math network. However, if only the student network is available, user 5 can be assigned to the student network.


In another embodiment, the client's network priority preference may be explicitly stated by way of indicating a preference for a particular network over another. For example, one may explicitly state the preference to connect to a VLAN to access a printer that is closer by, rather than further away. The network priority preference can include a list of one or more VLANs with a priority indicator that quantitatively represents the preference of a client to connect to a particular VLAN. The network priority preference can, in some embodiments, further include an indicator, such as a score, for the VLANs assigned by the client, a network administrator, a group manager, and/or automatically. The network priority preference may also, in some embodiments, be represented as a list of the VLANs in the order of preference for connection.


Network priority preference data can further be utilized to indicate a VLAN's preference to connect to users. For example, a VLAN may prefer connect to client devices coupled to a local switch via a local access point, rather than to connect to a client device coupled to a remote switch, via tunneling. Additionally, VLAN preference may be utilized to indicate an existing load on a particular network for the purposes of load balancing, to spread traffic between operative networks for optimal resource utilization. For example, a network with a light traffic load may be represented with a higher priority score than a network with a heavy traffic load. Thus, when assigning client devices to networks, the priority score of the networks may be added to the clients' preference scores to determine the final assignments. Other methods and/or algorithms for load balancing can be contemplated and implemented and do not deviate from the spirit of the novel art of this disclosure. In the example of FIG. 2, the priority list as represented in 208, user 3 is shown to have the same preference for VLAN B and VLAN E. In such a situation, for the purposes of load balancing, user 3 may be assigned to the network of VLAN B and VLAN E with a lower traffic load, if VLAN A is unavailable.



FIG. 3 illustrates an example of an implementation of a wireless local area network (WLAN) 300 having a plurality of bundles 315 and 325 of virtual local area networks (VLANs) 310A-N and 320A-N respectively.


Client preference for networks can be specified for individual VLANs, in one embodiment, as shown in priority lists 206 and 208 of FIG. 2. In addition, client preference for connection to networks can be specified for a VLAN bundle, such as the VLAN ‘Math Bundle’ 315 including VLANs 310A-N the VLAN ‘Student bundle’ 325 including VLANs 320A-320N. Since, there may be multiple VLANs with substantially similar priority rankings within a building or area and a VLAN bundle can be created, clients can be assigned to bundles rather than individual networks. A network bundle includes a sub-plurality of the plurality of VLANs. For example, the network bundle may include anywhere between two VLANs to the entire set of the plurality of VLANs. Thus, in other embodiments, the VLAN ‘Math Bundle’ 315 can include any sub-plurality of the VLANs 310A-N, including at least two of the VLANs 310A-N, up to all of the VLANs 310A-N.


In the example of FIG. 3, user 5 of the client device 312 is within range of the access point 308 and is thus coupled to the switch 306. Since user 5 is a student and a member of a math class, user 5 thus prefers the math network over the student network. User 5 can therefore be assigned to any one of the constituents (e.g., Math 310A-N) of the ‘Math Bundle’ 315. If the ‘Math Bundle’ 315 were not available, user 5 can then be assigned to any of the constituents (e.g., Student 320A-N) of the ‘Student Bundle’ 325. Further, since user 6 is an art student and that a network for art students is not available, the user 6 can be assigned to any of the constituents (e.g., Student 320A-N) of the ‘Student Bundle’ 325. The constituent VLANs (e.g., VLANs 320A-N) can be allocated to users based on load balancing. For example, each user to be assigned to the ‘Student Bundle’ 325 can be assigned, sequentially to each of the constituent networks 320A-N such that the load is evenly divided among the constituents. Other methods of load balancing within a bundle network is contemplated and do not deviate from the spirit of the novel art of the disclosure.



FIG. 4A illustrates an example of an implementation of a wireless local area network (WLAN) having a plurality of virtual local area networks (VLANs) with a client device within a range of a first access point.



FIG. 4B illustrates an example of an implementation of a wireless local area network (WLAN) having a plurality of virtual local area networks (VLANs) with a client device within a range of a second access point.



FIG. 4C illustrates an example of an implementation of a wireless local area network (WLAN) having a plurality of virtual local area networks (VLANs) with a client device within a range of a third access point.


In general, roaming refers to the extension service to a subscriber in a location that is beyond the home location for which the service was originally registered for. For example, a client device can travel outside of a region of a first access point of a wireless switch and detected by a second access point. The client device can access an associated VLAN, for example, through a second access point, when an authentication procedure can be processed on the second switch to which the second access point is coupled to. The example below illustrates how network assignment based on priority can be achieved when a client device roams from one access point to another access point.


For example, a company physically spanning multiple floors of a building may utilize a number of network switches to provide connectivity to all floors. If an employee in the accounting department roams from a floor supported by one network switch to a second floor supported by another network switch, the membership of the employee in the VLAN for the accounting department can be maintained, in some instances, even if the network switch on the second floor provides a VLAN that is higher ranked on the employee's network priority preference list that is available for connection. In one embodiment, when a connection to a network switch that does not belong to the persistent group is established, the VLAN membership is assigned based on the network priority preference data of the client.


In one embodiment, a request from a client to connect to a first VLAN of a plurality of VLANs available for connection on a second network controller is received, where the client has roamed to within a range of an access point of the second network controller from an access point of a first network controller from a first access point where the client is currently coupled to the first VLAN associated with the first network controller. A persistent group of network controllers comprising a subset of network controllers of a set of network controllers can then be identified. If the persistent group of network controllers includes a first network controller through which the client is connected to the first VLAN, it is determined whether the second network controller is included in the persistent group as well.


If it is determined that the second network controller is comprised in the persistent group, a connection between the client and the first VLAN when the first VLAN is available for connection on the second network controller is established. If, however, the second network controller is not comprised in the persistent group, a connection between the client and a preferred VLAN based on the network priority preference data that is available for connection on the second network controller is established, when the first VLAN is unavailable for connection on the second network controller. Similarly, in response to determining that the second network controller is comprised in the persistent group and identifying that the first VLAN is not available for connection on the second network controller, a connection between the client and a preferred VLAN that is available for connection on the second network controller can be established, based on the priority preference data.


In the example of FIG. 4A-4C, a client device 412 is initially connected to switch 406 via access point 408 and connected to VLAN A, because VLAN A is the client's preferred network that is available for connection associated with switch 406. In some instances, when the client device 412 roams to another region within its presence is detectable by the access point 418 coupled to another switch (e.g., switch 416), maintaining an existing session on the same network (e.g., VLAN A) may be preferred, regardless if, a higher ranked network associated with switch 416 is available for connection, for example, to prevent service interruption from occurring. For example, if the client prefers VLAN D over VLAN A, and is available for connection on switch 416, the client device 412 connectivity can, in one embodiment, be maintained on VLAN A, since switch 406 and 416 belong in a persistent group 450.


If, however, the client device 412 moves to switch 426, as shown in the example of FIG. 4C, which is not a member of the persistent group 450, the client's priority preference for connecting to networks takes precedence. For example, if VLAN E is ranked higher than VLAN A, upon transfer to switch 426, the client device may be transferred to VLAN E, rather than VLAN A.


In another scenario, a VLAN may be highly preferred by a client. However, connection is not to be maintained via tunneling. In one embodiment, the network database and/or user database can be used to record whether persistent association is to be maintained via tunneling for a particular VLAN, and the circumstances under which tunnels are to be used for persistence association. In one embodiment, if it is determined that a preferred first VLAN is not available on the second network controller, where the client is within access range of, it is determined whether the preferred first VLAN is available for tunneling. If the preferred first VLAN is available for tunneling, a connection between the client and the preferred first VLAN can be established by VLAN tunneling to a network controller of which the preferred first VLAN is available. If the preferred first VLAN is not available for tunneling, a connection between the client and a preferred second VLAN based on the network priority preference data that is available for local connection on the second network controller can be established.


For example, if the client device is originally connected to VLAN E associated with switch 426 and roams to a region detectable by access point 408 associated with the switch 406, for which VLAN E is not available for connection. If, VLAN E is indicated as not to be available for tunneling connections, the client device then may connect to a preferred VLAN of VLANs A, B, and C, based on, for example, the client's network priority preference data.


In other embodiments, other precedence and rules can be applied for VLAN membership assignment without deviating from the spirit of the disclosure. Suppose that the client device is initially connected to VLAN C of the switch 406 and roams to a region within the detection range of access point 418 of the switch 416, VLAN C is no longer available for connection. Thus, in one embodiment, to prevent service disruptions, tunneling can be utilized to provide a connection to VLAN C managed by switch 406, while the user is coupled to switch 416, on which VLAN C is not available for local connection.


Tunneling can be available between various switches, within a persistent group, external to a persistent group, or across different persistent groups. A technique for achieving tunneling can be demonstrated in one example, by a system having a WAN, a first VLAN, a second VLAN, and a network database. The first VLAN, the second VLAN, and the network database are coupled to the WAN. The network database includes VLAN information. The network database may include VLAN information. Thus, then a client that is authorized on the second VLAN attempts to connect to the first VLAN, a network switch in the WAN can perform a lookup in the network database and determine that the client is authorized on the second VLAN. Since the second VLAN is associated with a switch different from the switch the client is currently connected to, the client can be connected to the second VLAN via tunneling.


VLAN tunneling (e.g., via tunnels 460 and 462) can be accomplished by using any convenient and/or known technique. For example, tunneling can be executed on the application layer, presentation layer, session layer, transport layer, network layer and/or data link layer in a data network system. Tunneling can be achieved using a variety of protocols, based on the network layer utilized. For example the DNA, TLS/SSL, TFTP, FTP, HTTP, IMAP, IRC, NNTP, POP3, SIP, SMTP, SNMP, SSH, TELNET, BitTorrent, RTP, rlogin, ENRP, TCP, UDP, DCCP, SCTP, IL, RUDP, IPv4, IPv6, ICMP, IGMP, ARP, RARP, Wi-Fi, Token ring, PPP, SLIP, FDDI, ATM, Frame Relay, and/or SMDS protocols. In other embodiments, additional layers and protocols can be used that facilitate VLAN tunneling.



FIG. 5 depicts a flow chart 500 illustrating an example of a process of establishing a connection between a client and a VLAN based on the client's priority preference.


In process 502, a request from a client to connect to a VLAN is received. The request can be identified by one of many mechanisms including, but not limited to, the user of the client device submitting a logon request by entering logon credentials, which may be correct or incorrect. The request may also be detected by an access point of an associated switch sensing the presence of a client device located within an operational range of the access point. In one embodiment, logon credentials may not be needed and the request for the client to connect to the VLAN can be processed upon detection of the client, within the range of one or more access points.


In process 504, the client's priority preference for connecting to the VLANs is identified. For example, once the request for connection is received, the client can be identified including various other user attributes such as user type, user preferences, client device type, etc. In one embodiment, the client information can be relayed from a network database and/or user database. Further, the network database may include, or the client may provide, the managing switch with the client's preference to connect to one or more VLANs. The client's preference can be specified in one or more of many ways that can be contemplated without deviating from the spirit of the novelty of this disclosure. For example, the client's preference may be placed on a list in a non-quantitative manner, or the preferences may be specified in a quantitative manner by assigning the one or more VLANs a score that is proportional to client preference.


In process 506, a preferred VLAN of the client that is available for connection is determined. In some embodiments, the preferred VLAN is determined based on the combination of preferences of the client to connect to a VLAN and the VLAN to connect to a client. The preference of the VLAN to establish connectivity to different clients may a preference for clients that can be connected locally rather than via tunneling. The preference of VLANs for connection to clients can further be utilized to distribute clients on different VLANS for the purposes of balancing the network traffic loads on the set of VLANs available for connection. For example, the rank that determines connectivity may, in some embodiments, be determined by the sum of the preference scores of a client to connect to a VLAN and a VLAN to connect to a client. In process 508, a connection is established between the client device and the preferred VLAN, based on a predetermined algorithm. In some instances, the preferred VLAN is the highest ranked VLAN by the client, which is available for connection, locally, or via tunneling.



FIG. 6 depicts a flow chart 600 illustrating an example of a process of establishing a connection between a client and a VLAN based on the client's priority preference, in particular, establishing a connection in persistent network groups.


In one embodiment, a set of network controllers that are members of a persistent group can be initially identified. In a persistent group, VLAN associations can be maintained, across different access points that are coupled with different switches when a client roams from an access region of a first access point to an access region of a second access point. By maintaining VLAN associations, wireless service interruptions can be circumvented when a client roams between different access points for different switches for which different VLANs may be available for connection. In process 602, a request to connect to the first VLAN is received from the client and the client is thus operationally connected to a first VLAN on a first network controller, which is a member of the persistent group. The client is then, in process 604, associated with a first VLAN of the first controller. The request can be identified by one of many mechanisms including, but not limited to, the user of the client device submitting a logon request by submitting logon credentials, which may be correct or incorrect. The request may also be identified by an access point of an associated switch detecting the presence of the client device located within the range of the access point. In one embodiment, logon credentials may not be needed and the request for the client to connect to the VLAN can be processed upon detection of the client.


The client's priority preference for connecting to the VLANs can then be identified. For example, when the request for connection is received, the client can be identified including various other user attributes such as user type, user preferences, client device type, etc. In one embodiment, the client information can be relayed from a network database. Further, the network database may include, or the client may provide, the managing switch with the client's preference to connect to one or more VLANs. The client's preference can be specified in one or more of many ways that can be contemplated without deviating from the spirit of this disclosure. For example, the client's preference may be placed on a list in a non-quantitative manner, or the preferences may be specified in a quantitative manner by assigning the one or more VLANs a score that is proportional to client preference.


In process 606, the client roams to within range of a second access point operationally connected to a second controller. Similarly, the client can be detected one of many mechanisms including, but not limited to, the user of the client device submitting a logon request by submitting logon credentials, which may be correct or incorrect. The presence of the client may also be identified by the access point of the associated second controller detecting the presence of the client device located within the range of the access point. In one embodiment, logon credentials may not be needed and the request for the client to connect to the VLAN can be processed upon detection of the client, within the range of one or more access points.


In process 608, membership of the second network controller in the persistence group is determined. If the second network controller is a member of the persistence group, availability of the first VLAN on the second network controller is determined, in process 610. If the first VLAN is available for connection on the second network controller, a connection between the client and the first VLAN is established in process 612. If, instead, the first VLAN is not available for connection on the second network controller, as determined in process 610, the preferred VLAN that is available for connection on the second network controller is determined, in process 614. In process 616, a connection between the client and the preferred VLAN available is established.


If, in process 608, the second network controller is determined to not be a member of the persistent group, the preferred VLAN that is available for connection on the second network controller is determined, in process 618. In process 620, a connection between the client and the preferred VLAN is established. The preferred VLAN, can in some instances be the highest ranked VLAN by the client on the network priority preference list that is available for connection. The preferred VLAN, can, in some embodiments, be further determined by VLAN traffic load, where the client may be assigned to VLANs of similar (or same) rankings to balance the traffic load of one or more VLANs.



FIG. 7 depicts a flow chart 700 illustrating an example of a process of establishing a connection between a client and a VLAN based on the client's priority preference, in particular, establishing a connection in tunneling-enabled network groups.


In process 702, a set of network controllers belonging in a tunneling group is identified. Within a tunneling group, when a client device migrates (e.g., roams) from an access point associated with a first network switch to another access point associated with a network switch, a tunneling connection, can be made, in some instances from the second access point to a VLAN that is available for connection associated with the first access point of the first network switch. For example, if a first VLAN that the client is connected to on the first network switch is indicated (e.g., by the network database) to be available for receiving tunneled connections, when the client roams to a region of a second access point coupled to a network switch for which the first VLAN is not available, the client device may tunnel to the first VLAN from the second access point, such that service interruption instances are mitigated.


In process 704, a client's priority preference for connecting to the VLANs is determined. For example, once the request for connection is received, the client can be identified including various other user attributes such as user type, user preferences, client device type, etc. In one embodiment, the client information can be relayed from a network database. Further, the network database may include, or the client may provide, the managing switch with the client's preference to connect to one or more VLANs. The client's preference can be specified in one or more of many ways that can be contemplated without deviating from the spirit of the novel art of this disclosure. For example, the client's preference may be placed on a list in a non-quantitative manner, or the preferences may be specified in a quantitative manner by assigning the one or more VLANs a score that is proportional to client preference.


In process 706, a request to log-on to a VLAN associated with a first network controller is received from the client. The request can be identified via one of many mechanisms including, but not limited to, the user of the client device submitting a logon request by submitting logon credentials, which may be correct or incorrect. The request may also be identified by an access point of an associated switch detecting the presence of the client device located within the range of the access point. In one embodiment, logon credentials may not be needed and the request for the client to connect to the VLAN can be processed upon detection of the client, within the range of one or more access points.


In process 708, the preferred VLAN that is available for connection in the set of network controllers in determined. The preferred VLAN, can in some instances be the highest ranked VLAN by the client on the network priority preference list that is available for connection. The preferred VLAN, can, in some embodiments, be further determined by VLAN traffic load, where the client may be assigned to VLANs of similar (or same) rankings to balance the traffic load of one or more VLANs. In process 710, the availability of the preferred VLAN identified in process 708 on the first network controller is determined. If available, in process 712, a connection between the client and the preferred VLAN on the first network controller is established.


If, instead, the preferred VLAN is not available for connection on the first network controller as determined in process 710, the availability of the preferred VLAN for receiving a tunneled connection is determined, in process 714. If the VLAN is available to receive tunneling connections, a connection between the client and the preferred VLAN is established on another network controller that provides connectivity to the preferred VLAN. In process 718, if the preferred VLAN is not available for receiving a tunneled connection, a connection is established between the client and the preferred VLAN that is locally available for connection on the first network controller.


Although embodiments have been described with reference to specific embodiments, it will be evident that the various modification and changes can be made to these embodiments. Accordingly, the specification and drawings are to be regarded in an illustrative sense rather than in a restrictive sense. The foregoing specification provides a description with reference to specific embodiments. It will be evident that various modifications may be made thereto without departing from the broader spirit and scope as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.


Reference in this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the disclosure. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Moreover, various features are described which may be exhibited by some embodiments and not by others. Similarly, various requirements are described which may be requirements for some embodiments but not other embodiments.


The terms used in this specification generally have their ordinary meanings in the art, within the context of the disclosure, and in the specific context where each term is used. Certain terms that are used to describe the disclosure are discussed below, or elsewhere in the specification, to provide additional guidance to the practitioner regarding the description of the disclosure. For convenience, certain terms may be highlighted, for example using italics and/or quotation marks. The use of highlighting has no influence on the scope and meaning of a term; the scope and meaning of a term is the same, in the same context, whether or not it is highlighted. It will be appreciated that same thing can be said in more than one way.


Consequently, alternative language and synonyms may be used for any one or more of the terms discussed herein, nor is any special significance to be placed upon whether or not a term is elaborated or discussed herein. Synonyms for certain terms are provided. A recital of one or more synonyms does not exclude the use of other synonyms. The use of examples anywhere in this specification including examples of any terms discussed herein is illustrative only, and in no way limits the scope and meaning of the disclosure or of any exemplified term. Likewise, the disclosure is not limited to various embodiments given in this specification.


Without intent to limit the scope of the disclosure, examples of instruments, apparatus, methods and their related results according to the embodiments of the present disclosure are given below. Note that titles or subtitles may be used in the examples for convenience of a reader, which in no way should limit the scope of the invention. Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains. In the case of conflict, the present document, including definitions will control.

Claims
  • 1. A method, comprising: receiving, from a client being (1) operationally connected to a second virtual local area network (VLAN) via a first access point, and (2) roaming from the first access point to a second access point, a request to operationally connect to a VLAN from a plurality of VLANs, the plurality of VLANs including a first VLAN and the second VLAN;identifying network priority preference data of the client authorized to connect to both of the first VLAN the second VLAN, the network priority preference data indicating a preference of the client to connect to the first VLAN, the first VLAN being a highest preferred VLAN indicated by the network priority preference data that is available; andif the first VLAN is available and the second VLAN is available, maintaining an operational connection between the client and the second VLAN.
  • 2. The method of claim 1, further comprising establishing (1) a first network bundle comprising the first VLAN and (2) a second network bundle comprising the second VLAN.
  • 3. A system, comprising: a means for receiving a request from a client to operationally connect to a virtual local area network (VLAN) of a plurality of VLANs, the client having roamed to within a range of a second access point of the second network controller from a first access point of a first network controller, where the client is coupled to a first VLAN via the first access point of the first network controller when roaming within the range of the second access point;a means for identifying network priority preference data associated with the client to operationally connect to one or more VLANs of the plurality of VLANs where a second VLAN has a higher priority than the first VLAN;a means for identifying a persistent group of network controllers including the first network controller;a means for determining whether the persistent group of network controllers includes the second network controller; anda means for maintaining connectivity from the second network controller to the first network controller between the client and the first VLAN, despite the second VLAN having higher priority than the first VLAN for the client, when connectivity to the first VLAN is available through the second network controller.
  • 4. The system of claim 3, further comprising, a means for maintaining connectivity between the client and the first VLAN when the first VLAN is available at the second network controller, in response to determining that the second network controller is comprised in the persistent group.
  • 5. The system of claim 3, further comprising a means for establishing an operational connection between the client and a preferred VLAN, based on the network priority preference data, that is available at the second network controller when the first VLAN is unavailable at the second network controller, in response to determining that the second network controller is not comprised in the persistent group.
  • 6. The system of claim 3, further comprising a means for in response to determining that the second network controller is comprised in the persistent group and identifying that the first VLAN is not available at the second network controller, establishing an operational connection between the client and a preferred VLAN that is available at the second network controller, based on the priority preference data.
  • 7. The system of claim 3, further comprising a means for, in response to determining that the first VLAN is not available at the second network controller, determining whether the first VLAN is available for tunneling.
  • 8. The system of claim 3, further comprising a means for, in response to determining that the first VLAN is not available at the second network controller, and determining that the first VLAN is available for tunneling, establishing an operational connection between the client and the first VLAN by VLAN tunneling to a network controller of which the first VLAN is available for tunneling.
  • 9. The system of claim 3, further comprising a means for, in response to determining that the first VLAN is not available at the second network controller, and determining that the first VLAN is not available for tunneling, establishing an operational connection between the client and a preferred VLAN based on the network priority preference data that is available at the second network controller.
  • 10. The system of claim 3, wherein the second VLAN is the highest ranked VLAN that is available based on the network priority preference data.
  • 11. The system of claim 3, wherein the first network controller includes a network switch and the second network controller includes a network switch.
  • 12. A system, comprising: a network switch configured to be operatively coupled to a network database storing network priority preference data of a client that is authorized to connect to (1) a first VLAN, (2) a second VLAN, and (3) a third VLAN, and authorized to roam from the first access point to a second access point;the network switch is configured to lookup the network priority preference data of the client in the network database; the network priority preference data indicating a preference to connect to the first VLAN before connecting to either the second VLAN or the third VLAN;if the first VLAN is available and the second VLAN is available, the network switch is configured to maintain an operational connection between the client and the second VLAN.
  • 13. The system of claim 12, wherein the network switch is a first network switch, further comprising a second network switch configured to be operatively coupled to the network database, the client is configured to be authorized to connect to both of a third VLAN a fourth VLAN.
  • 14. The system of claim 13, wherein, in operation, if the client roams to within range of an access point associated with the second network switch, the second network switch is configured to lookup the network priority preference data of the client in the network database; the network priority preference data indicating a preference to connect to the third VLAN.
  • 15. The system of claim 13, wherein the network switch is configured to maintain the operational connection between the client and the second VLAN via tunneling.
US Referenced Citations (615)
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 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 Brockhoven 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
5187675 Dent et al. Feb 1993 A
5231633 Hluchyj et al. Jul 1993 A
5280498 Tymes et al. Jan 1994 A
5285494 Sprecher et al. Feb 1994 A
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
5488569 Kaplan 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
5742592 Scholefield et al. Apr 1998 A
5774460 Schiffel et al. Jun 1998 A
5793303 Koga Aug 1998 A
5794128 Brockel et al. Aug 1998 A
5812589 Sealander et al. Sep 1998 A
5815811 Pinard et al. Sep 1998 A
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
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 Jul 2000 A
6101539 Kennelly et al. Aug 2000 A
6115390 Chuah Sep 2000 A
6118771 Tajika et al. Sep 2000 A
6119009 Baranger et al. Sep 2000 A
6122520 Want et al. Sep 2000 A
6144638 Obenhuber et al. Nov 2000 A
6148199 Hoffman et al. Nov 2000 A
6154776 Martin Nov 2000 A
6160804 Ahmed et al. Dec 2000 A
6177905 Welch Jan 2001 B1
6188694 Fine et al. Feb 2001 B1
6199032 Anderson Mar 2001 B1
6208629 Jaszewski et al. Mar 2001 B1
6208841 Wallace et al. Mar 2001 B1
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 Watanabe Sep 2001 B1
6304596 Yamano et al. Oct 2001 B1
6304906 Bhatti et al. Oct 2001 B1
6317599 Rappaport et al. Nov 2001 B1
6326918 Stewart Dec 2001 B1
6336035 Somoza et al. Jan 2002 B1
6336152 Richman et al. Jan 2002 B1
6347091 Wallentin et al. Feb 2002 B1
6356758 Almeida et al. Mar 2002 B1
6393290 Ufongene May 2002 B1
6397040 Titmuss et al. May 2002 B1
6404772 Beach et al. Jun 2002 B1
6421714 Rai et al. Jul 2002 B1
6429879 Sturgeon et al. Aug 2002 B1
6446206 Feldbaum Sep 2002 B1
6456239 Werb et al. Sep 2002 B1
6470025 Wilson et al. Oct 2002 B1
6473449 Cafarella et al. Oct 2002 B1
6493679 Rappaport et al. Dec 2002 B1
6496290 Lee Dec 2002 B1
6512916 Forbes, Jr. Jan 2003 B1
6526275 Calvert Feb 2003 B1
6535732 McIntosh et al. Mar 2003 B1
6564380 Murphy May 2003 B1
6567146 Hirakata et al. May 2003 B2
6567416 Chuah May 2003 B1
6574240 Tzeng Jun 2003 B1
6580700 Pinard et al. Jun 2003 B1
6587680 Ala-Laurila et al. Jul 2003 B1
6587835 Treyz et al. Jul 2003 B1
6603970 Huelamo Platas et al. Aug 2003 B1
6614787 Jain et al. Sep 2003 B1
6615276 Mastrianni et al. Sep 2003 B1
6624762 End, III Sep 2003 B1
6625454 Rappaport et al. Sep 2003 B1
6631267 Clarkson et al. Oct 2003 B1
6650912 Chen et al. Nov 2003 B2
6658389 Alpdemir Dec 2003 B1
6659947 Carter et al. Dec 2003 B1
6661787 O'Connell et al. Dec 2003 B1
6674403 Gray et al. Jan 2004 B2
6677894 Sheynblat et al. Jan 2004 B2
6678516 Nordman et al. Jan 2004 B2
6678802 Hickson Jan 2004 B2
6687498 McKenna et al. Feb 2004 B2
6697415 Mahany Feb 2004 B1
6721334 Ketcham Apr 2004 B1
6721548 Mohindra et al. Apr 2004 B1
6725260 Philyaw Apr 2004 B1
6738629 McCormick et al. May 2004 B1
6747961 Ahmed et al. Jun 2004 B1
6756940 Oh et al. Jun 2004 B2
6760324 Scott et al. Jul 2004 B1
6785275 Boivie et al. Aug 2004 B1
6798788 Viswanath et al. Sep 2004 B1
6801782 McCrady et al. Oct 2004 B2
6826399 Hoffman et al. Nov 2004 B1
6839338 Amara et al. Jan 2005 B1
6839348 Tang et al. Jan 2005 B2
6839388 Vaidyanathan Jan 2005 B2
6847620 Meier Jan 2005 B1
6847892 Zhou et al. Jan 2005 B2
6856800 Henry et al. Feb 2005 B1
6879812 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
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
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
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
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
7592906 Hanna et al. Sep 2009 B1
7603119 Durig et al. Oct 2009 B1
7636363 Chang et al. Dec 2009 B2
7680501 Sillasto et al. Mar 2010 B2
7693526 Qian et al. Apr 2010 B2
7715432 Bennett May 2010 B2
7716379 Ruan et al. May 2010 B2
7724703 Matta et al. May 2010 B2
7724704 Simons et al. May 2010 B2
7729278 Chari et al. Jun 2010 B2
7733868 Van Zijst Jun 2010 B2
7746897 Stephenson et al. Jun 2010 B2
7788475 Zimmer et al. Aug 2010 B2
7805529 Galluzzo et al. Sep 2010 B2
7817554 Skog et al. Oct 2010 B2
7844298 Riley Nov 2010 B2
7865713 Chesnutt et al. Jan 2011 B2
7873061 Gast et al. Jan 2011 B2
7894852 Hansen Feb 2011 B2
7912982 Murphy Mar 2011 B2
7920548 Lor et al. Apr 2011 B2
7929922 Kubo Apr 2011 B2
7945399 Nosovitsky et al. May 2011 B2
7986940 Lee et al. Jul 2011 B2
8000724 Rayburn et al. Aug 2011 B1
8019082 Wiedmann et al. Sep 2011 B1
8019352 Rappaport et al. Sep 2011 B2
8116275 Matta et al. Feb 2012 B2
8150357 Aragon Apr 2012 B2
8161278 Harkins Apr 2012 B2
20010024953 Balogh Sep 2001 A1
20020021701 Lavian et al. Feb 2002 A1
20020052205 Belostotsky et al. May 2002 A1
20020060995 Cervello et al. May 2002 A1
20020062384 Tso May 2002 A1
20020069278 Forslow Jun 2002 A1
20020078361 Giroux et al. Jun 2002 A1
20020080790 Beshai Jun 2002 A1
20020087699 Karagiannis et al. Jul 2002 A1
20020094824 Kennedy et al. Jul 2002 A1
20020095486 Bahl Jul 2002 A1
20020101868 Clear et al. Aug 2002 A1
20020116655 Lew et al. Aug 2002 A1
20020157020 Royer Oct 2002 A1
20020174137 Wolff et al. Nov 2002 A1
20020176437 Busch et al. Nov 2002 A1
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
20030120764 Laye et al. Jun 2003 A1
20030133450 Baum Jul 2003 A1
20030134642 Kostic et al. Jul 2003 A1
20030135762 Macaulay Jul 2003 A1
20030156586 Lee et al. Aug 2003 A1
20030174706 Shankar et al. Sep 2003 A1
20030193910 Shoaib et al. Oct 2003 A1
20030204596 Yadav Oct 2003 A1
20030227934 White et al. Dec 2003 A1
20040002343 Brauel et al. Jan 2004 A1
20040003285 Whelan et al. Jan 2004 A1
20040019857 Teig et al. Jan 2004 A1
20040025044 Day Feb 2004 A1
20040029580 Haverinen et al. Feb 2004 A1
20040030777 Reedy et al. Feb 2004 A1
20040038687 Nelson Feb 2004 A1
20040044749 Harkin Mar 2004 A1
20040047320 Eglin Mar 2004 A1
20040053632 Nikkelen et al. Mar 2004 A1
20040054569 Pombo et al. Mar 2004 A1
20040054774 Barber et al. Mar 2004 A1
20040054926 Ocepek et al. Mar 2004 A1
20040062267 Minami et al. Apr 2004 A1
20040064560 Zhang et al. Apr 2004 A1
20040068668 Lor et al. Apr 2004 A1
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
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
20040143428 Rappaport et al. Jul 2004 A1
20040143755 Whitaker et al. Jul 2004 A1
20040165545 Cook Aug 2004 A1
20040174900 Volpi et al. Sep 2004 A1
20040184475 Meier Sep 2004 A1
20040208570 Reader Oct 2004 A1
20040214572 Thompson et al. Oct 2004 A1
20040221042 Meier Nov 2004 A1
20040230370 Tzamaloukas Nov 2004 A1
20040233234 Chaudhry et al. Nov 2004 A1
20040236702 Fink et al. Nov 2004 A1
20040246937 Duong et al. Dec 2004 A1
20040246962 Kopeikin et al. Dec 2004 A1
20040248557 Muratsu Dec 2004 A1
20040252656 Shiu et al. Dec 2004 A1
20040255167 Knight Dec 2004 A1
20040259542 Viitamaki et al. Dec 2004 A1
20040259555 Rappaport et al. Dec 2004 A1
20040259575 Perez-Breva et al. Dec 2004 A1
20050015592 Lin Jan 2005 A1
20050021979 Wiedmann et al. Jan 2005 A1
20050025105 Rue Feb 2005 A1
20050026611 Backes Feb 2005 A1
20050030894 Stephens Feb 2005 A1
20050030929 Swier 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 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
20050154933 Hsu et al. Jul 2005 A1
20050157730 Grant et al. Jul 2005 A1
20050159154 Goren Jul 2005 A1
20050163078 Oba et al. Jul 2005 A1
20050163146 Ota et al. Jul 2005 A1
20050175027 Miller et al. Aug 2005 A1
20050180345 Meier Aug 2005 A1
20050180358 Kolar et al. Aug 2005 A1
20050181805 Gallagher Aug 2005 A1
20050190714 Gorbatov et al. Sep 2005 A1
20050193103 Drabik Sep 2005 A1
20050207336 Choi et al. Sep 2005 A1
20050213519 Relan et al. Sep 2005 A1
20050220033 DelRegno et al. Oct 2005 A1
20050223111 Bhandaru et al. Oct 2005 A1
20050239461 Verma et al. Oct 2005 A1
20050240665 Gu et al. Oct 2005 A1
20050243737 Dooley et al. Nov 2005 A1
20050245258 Classon et al. Nov 2005 A1
20050245269 Demirhan et al. Nov 2005 A1
20050259597 Benedetto et al. Nov 2005 A1
20050259611 Bhagwat et al. Nov 2005 A1
20050270992 Sanzgiri et al. Dec 2005 A1
20050273442 Bennett Dec 2005 A1
20050276218 Ooghe et al. Dec 2005 A1
20050286466 Tagg et al. Dec 2005 A1
20060030290 Rudolf et al. Feb 2006 A1
20060035662 Jeong et al. Feb 2006 A1
20060039395 Perez-Costa et al. Feb 2006 A1
20060041683 Subramanian et al. Feb 2006 A1
20060045050 Floros et al. Mar 2006 A1
20060046744 Dublish et al. Mar 2006 A1
20060050742 Grandhi et al. Mar 2006 A1
20060073847 Pirzada et al. Apr 2006 A1
20060094440 Meier et al. May 2006 A1
20060098607 Zeng et al. May 2006 A1
20060104224 Singh et al. May 2006 A1
20060114872 Hamada Jun 2006 A1
20060117174 Lee Jun 2006 A1
20060128415 Horikoshi et al. Jun 2006 A1
20060143496 Silverman Jun 2006 A1
20060152344 Mowery Jul 2006 A1
20060160540 Strutt et al. Jul 2006 A1
20060161983 Cothrell et al. Jul 2006 A1
20060165103 Trudeau et al. Jul 2006 A1
20060168383 Lin Jul 2006 A1
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
20060200862 Olson et al. Sep 2006 A1
20060206582 Finn Sep 2006 A1
20060215601 Vieugels et al. Sep 2006 A1
20060217131 Alizadeh-Shabdiz et al. Sep 2006 A1
20060245393 Bajic Nov 2006 A1
20060248229 Saunderson et al. Nov 2006 A1
20060248331 Harkins Nov 2006 A1
20060268696 Konstantinov 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
20060292992 Tajima et al. Dec 2006 A1
20070002833 Bajic Jan 2007 A1
20070008884 Tang Jan 2007 A1
20070010248 Dravida et al. Jan 2007 A1
20070011318 Roth Jan 2007 A1
20070025265 Porras et al. Feb 2007 A1
20070025306 Cox et al. Feb 2007 A1
20070027964 Herrod et al. Feb 2007 A1
20070054616 Culbert Mar 2007 A1
20070058598 Ling Mar 2007 A1
20070064673 Bhandaru et al. Mar 2007 A1
20070064718 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
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
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
20070230457 Kodera et al. Oct 2007 A1
20070248009 Petersen Oct 2007 A1
20070253380 Jollota et al. Nov 2007 A1
20070255116 Mehta et al. Nov 2007 A1
20070258448 Hu Nov 2007 A1
20070260720 Morain Nov 2007 A1
20070268506 Zeldin Nov 2007 A1
20070268514 Zeldin et al. Nov 2007 A1
20070268515 Freund et al. Nov 2007 A1
20070268516 Bugwadia et al. Nov 2007 A1
20070286208 Kanada et al. Dec 2007 A1
20070287390 Murphy et al. Dec 2007 A1
20070291689 Kapur et al. Dec 2007 A1
20070297329 Park et al. Dec 2007 A1
20080002588 McCaughan et al. Jan 2008 A1
20080008117 Alizadeh-Shabdiz Jan 2008 A1
20080013481 Simons et al. Jan 2008 A1
20080014916 Chen Jan 2008 A1
20080031257 He Feb 2008 A1
20080039114 Phatak 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
20090031044 Barrack et al. Jan 2009 A1
20090046688 Volpi et al. Feb 2009 A1
20090059930 Ryan et al. Mar 2009 A1
20090073905 Gast Mar 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 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
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
20100261475 Kim et al. Oct 2010 A1
20100271188 Nysen Oct 2010 A1
20100329177 Murphy et al. Dec 2010 A1
20110128858 Matta et al. Jun 2011 A1
20110158122 Murphy et al. Jun 2011 A1
20120140705 Matta et al. Jun 2012 A1
20120144462 Pochop Jun 2012 A1
Foreign Referenced Citations (19)
Number Date Country
0 992 921 Apr 2000 EP
1542 409 Jun 2005 EP
2 329 801 Mar 1999 GB
2429080 Feb 2007 GB
2000-215169 Aug 2000 JP
2003-234751 Aug 2003 JP
2003274454 Sep 2003 JP
2004-032525 Jan 2004 JP
WO9403986 Feb 1994 WO
WO9911003 Mar 1999 WO
WO 0006271 Feb 2000 WO
WO 0018148 Mar 2000 WO
WO 02089442 Nov 2002 WO
WO 03085544 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 (225)
Entry
U.S. Appl. No. 11/487,722, filed Jul. 2006, Simons et al.
U.S. Appl. No. 11/592,891, filed Nov. 2006, Murphy, James.
U.S. Appl. No. 11/595,119, filed Nov. 2006, Murphy, James.
U.S. Appl. No. 11/604,075, filed Nov. 2006, Murphy et al.
U.S. Appl. No. 11/643,329, filed Dec. 2006, Towari, Manish.
U.S. Appl. No. 11/648,359, filed Dec. 2006, Gast et al.
U.S. Appl. No. 11/690,654, filed Mar. 2007, Keenly et al.
U.S. Appl. No. 11/801,964, filed May 2007, Simone et al.
U.S. Appl. No. 11/845,029, filed Aug. 2007, Gast, Mathew S.
U.S. Appl. No. 11/944,346, filed Nov. 2007, Gast, Mathew S.
U.S. Appl. No. 11/966,912, filed Dec. 2007, Chestnutt et al.
U.S. Appl. No. 11/970,484, filed Jan. 2008, Gast, Mathew S.
U.S. Appl. No. 11/975,134, filed Oct. 2007, Aragon et al.
U.S. Appl. No. 12/077,051, filed Mar. 2008, Gast, Mathew S.
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 vol. 2 (Iscc″04)—vol. 02 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washington, DC, 331-338.
U.S. Appl. No. 11/326,966, filed Jan. 2006, Taylor.
U.S. Appl. No. 11/330,877, filed Jan. 2006, Matta.
U.S. Appl. No. 11/331,789, filed Jan. 2006, Matta et al.
U.S. Appl. No. 11/351,104, filed Feb. 2006, Tiwari.
U.S. Appl. No. 11/377,859, filed Mar. 2006, Harkins.
U.S. Appl. No. 11/400,165, filed Apr. 2006, Tiwari.
U.S. Appl. No. 11/445.750, filed May 2006, Matta.
U.S. Appl. No. 11/417,840, filed May 2006, Morain.
U.S. Appl. No. 11/417,993, filed May 2006, Jar et al.
U.S. Appl. No. 11/437,537, filed May 2006, Freund et al.
U.S. Appl. No. 11/437,538, filed May 2006, Zeldin.
U.S. Appl. No. 11/437,387 filed May 2006, Zeldin et al.
U.S. Appl. No. 11/437,582, filed May 2006, Bugwadia et al.
U.S. Appl. No. 11/451,704, filed Jun. 2006, Riley.
Acampora and Winters, IEEE Communications Magazine, 25(8):11-20 (1987).
Acampora and Winters, IEEE Journal on selected Areas in Communications. SAC-5:796-804 (1987).
Bing and Subramanian, IEEE, 1318-1322 (1997).
Durgin, et al., “Measurements and Models for Radio Path Loss and Penetration Loss in and Around Homes and Trees at 5.85 GHz”, IEEE Transactions on Communications, vol. 46, No. 11, Nov. 1998.
Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, 1980.
Fortune et al., IEEE Computational Science and Engineering, “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, p. 58-68 (1995).
Geier, Jim, Wireless Lans Implementing Interoperable Networks, Chapter 3 (pp. 89-125) Chapter 4 (pp. 129-157) Chapter 5 (pp. 159-189) and Chapter 6 (pp. 193-234), 1999, United States.
Ho et al., “Antenna Effects on Indoor Obstructed Wireless Channels and a Deterministic Image-Based Wide-Based Propagation Model for In-Building Personal Communications Systems”, International Journal of Wireless Information Networks, vol. 1, No. 1, 1994.
Kim et al., “Radio Propagation Measurements and Prediction Using Three-Dimensional Ray Tracing in Urban Environments at 908 MHz and 1.9 GHz”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
Kleinrock and Scholl, Conference record 1977 ICC vol. 2 of 3, Jun. 12-15 Chicago Illinois “Packet Switching in radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of data Useres”, (1977).
LAN/MAN Standars Committee of the IEEE Computer Society, Part 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 and Xu, IEEE, Proceeding so of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).
Panjwani et al., “Interactive Computation of Coverage Regions for Wireless Communication in Multifloored Indoor Environments”, IEEE Journal on Selected Areas in Communications, vol. 14, No. 3, Apr. 1996.
Perram and Martinez, “Technology Developments for Low-Cost Residential Alarm Systems”, Proceedings 1977 Carnahan Conference on Crime Countermeasures, Apr. 6-8, pp. 45-50 (1977).
Piazzi et al., “Achievable Accuracy of Site-Specific Path-Loss Predictions in Residential Environments”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
Seidel et al., “Site-Specific Propagation Prediction for Wireless In-Building Personal Communications System Design”, IEEE Transactions on Vehicular Technology, vol. 43, No. 4, Nov. 1994.
Skidmore et al., “Interactive Coverage Region and System Design Simulation for Wireless Communication Systems in Multi-floored Indoor Environments, SMT Plus” IEEE ICUPC '96 Proceedings (1996).
Ullmo et al., “Wireless Propagation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
International Search Report PCT/US2007/19696 dated Feb. 29, 2008; p. 1.
International Search Report PCT/US2008/010708 dated May 18, 2009; p. 1-2.
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] the whole document.
Non-Final Office Action Mailed Jun. 1, 2010, in Co-pending U.S. Appl. No. 12/172,195, filed Jul. 11, 2008.
Notice of Allowance mailed Jun. 23, 2010, in Co-pending U.S Appl. No. 11/648,359, filed Dec. 28, 2006.
Non-Final Office Action Mailed May 14, 2010, in Co-pending U.S. Appl. No. 11/845,029, filed Aug. 24, 2007.
Co-pending U.S. Appl. No. 11/648,359, filed Dec. 28, 2006.
Co-pending U.S. Appl. No. 11/845,029, filed Aug. 24, 2007.
Co-pending U.S. Appl. No. 11/970,484, filed Jan. 7, 2008.
Co-pending U.S. Appl. No. 12/077,051, filed Mar. 14, 2008.
Co-pending U.S. Appl. No. 12/113,535, filed May 1, 2008.
Co-pending U.S. Appl. No. 12/172,195, filed Jul. 11, 2008.
Co-pending U.S. Appl. No. 12/210,917, filed Sep. 15, 2008.
Final Office Action Mailed Jan. 25, 2010, in Co-pending U.S. Appl. No. 11/845,029, filed Aug. 24, 2007.
P. Martinez, M. Brunner, J. Quittek, F. Straus, J. Schonwlder, S. Mertens, T. Klie “Using the Script MIB for Policy-based Configuration Management”, Technical University Braunschweig, Braunschweig, Germany, 2002.
Law, A., “New Service Discovery Protocol,” Internet Citation [Online] XP002292473 Retrieved from the Internet: <URL: http://sern.uccalgary.ca˜lawa/SENG60921/arch/SDP.htm> [retrieved Aug. 12, 2004] (15 pages).
P. Bahl et al., RADAR: An In-Building RF-based User Location and Tracking System, Microsoft Research, Mar. 2000, 10 pages.
Latvala J. et al., Evaluation of RSSI-Based Human Tracking, Proceedings for the 2000 European Signal Processing Conference, Sep. 2000, 9 pages.
Bahl P. et al. “User Location and Tracking in an In-Building Radio Network,” Microsoft Research, Feb. 1999, 13 pages.
P. Bahl et al., A Software System for Locating Mobile Users: Design, Evaluation, and Lessons, Microsoft Research, Feb. 1999, 13 pages.
Chen, Yen-Chen et al., “Enabling Location-Based Services on Wireless LANs”, Networks, 2003. ICON2003. The 11th IEEE International Conference, Sep. 28-Oct. 1, 2003, pp. 567-572.
Erten, Y. Murat, “A Layered Security Architecture for Corporate 802.11 Wireless Networks”, Wireless Telecommunications Symposium, May 14-15, 2004, pp. 123-128.
Kleine-Ostmann, T., et al., “A Data Fusion Architecture for Enhanced Position Estimation in Wireless Networks,” IEEE Communications Letters , vol. 5(8), Aug. 2001, p. 343-345.
Pulson, Time Domain Corporation, Ultra wideband (UWB) Radios for Precision Location, Third IEEE Workshop on Wireless Local Area Networks, Sep. 27-28, 2001, 8 pages.
Barber, S., Monitoring 802.1 Networks, IEEE 802.11, Sydney, NSW, May 13-17, 2002.
Latvala, J. et al. “Patient Tracking in a Hospital Environment Using Extended Kalman-filtering,” Proceedings of the 1999 Middle East Conference on Networking, Nov. 1999, 5 pages.
Myllymaki, P. et al., “A Probabilistic Approach to WLAN User Location Estimation,” Third IEEE Workshop on Wireless Local Area Networks, Sep. 27-28, 2001, 12 pages.
Potter, B., and Fleck, B., 802.11 Security, O'Reilly Media Inc., Dec. 2002, 14 pages.
McCann, S., et al., “Emergency Services for 802,” IEEE 802.11-07/0505r1, Mar. 2007, 27 pages.
Di Sorte, D., et al., “On the Performance of Service Publishing in IEEE 802.11 Multi-Access Environment,” IEEE Communications Letters, vol. 11, No. 4, Apr. 2007, 3 pages.
Microsoft Computer Dictionary, Fifth Edition, Microsoft Corporation, 2002, 2 pages.
Thomson, Allan, Cisco Systems, AP Power Down Notification, Power Point slide show; IEEE standards committee meeting Jul. 15, 2008; doc.: IEEE 802.11-08/0759r0, 14 pages.
3COM, Wireless LAN Mobility System: Wireless LAN Switch and Controller Configuration Guide, 3COM, Revision A, Oct. 2004, 476 pages.
3COM, Wireless LAN Switch Manager (3WXM), 3COM, Revision C, Oct. 2004, 8 pages.
3COM, Wireless LAN Switch and Controller; Quick Start Guide, 3COM, Revision B, Nov. 2004, 10 pages.
3COM, Wireless LAN Mobility System; Wireless LAN Switch and Controller Installation and Basic Configuration Guide, Revision B, Apr. 2005, 496 pages.
Johnson, David B, et al., “DSR The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks,” Computer Science Department, Carnegie Mellon University, Nov. 3, 2005 (http://monarch.cs.rice.edu/monarch-papers/dsr-chapter00.pdf).
Information Sciences Institute, RFC-791—Internet Protocol, DARPA, Sep. 1981.
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.
U.S. Appl. No. 09/866,474, filed May 29, 2001.
U.S. Appl. No. 13/017,801, filed Jan. 31, 2011.
Office Action for U.S. Appl. No. 11/784,307, mailed Sep. 22, 2009.
Final Office Action for U.S. Appl. No. 11/784,307, mailed Jun. 14, 2010.
Non-Final Office Action for U.S. Appl. No. 11/377,859, mailed Jan. 8, 2008.
Final Office Action for U.S. Appl. No. 11/377,859, mailed Aug. 27, 2008.
Office Action for U.S. Appl. No. 12/401,073, mailed Aug. 23, 2010.
Final Office Action for U.S. Appl. No. 12/401,073, mailed Apr. 1, 2011.
Office Action for U.S. Appl. No. 12/401,073, mailed Sep. 20, 2011.
Office Action for U.S. Appl. No. 11/326,966, mailed Nov. 14, 2008.
Office Action for U.S. Appl. No. 12/500,392, mailed Jun. 20, 2011.
Office Action for U.S. Appl. No. 11/400,165, mailed Aug. 19, 2008.
Office Action for U.S. Appl. No. 12/489,295, mailed Apr. 27, 2011.
Office Action for U.S. Appl. No. 11/330,877, mailed Sep. 11, 2008.
Final Office Action for U.S. Appl. No. 11/330,877, mailed Mar. 13, 2009.
Office Action for U.S. Appl. No. 11/330,877, mailed Aug. 6, 2009.
Final Office Action for U.S. Appl. No. 11/330,877, mailed Apr. 22, 2010.
Office Action for U.S. Appl. No. 11/330,877, mailed Jan. 13, 2011.
Final Office Action for U.S. Appl. No. 11/330,877, mailed May 27, 2011.
Office Action for U.S. Appl. No. 11/351,104, mailed Oct. 28, 2008.
Office Action for U.S. Appl. No. 11/351,104, mailed Dec. 2, 2009.
Final Office Action for U.S. Appl. No. 11/351,104, mailed Jun. 10, 2009.
Office Action for U.S. Appl. No. 11/351,104, mailed May 26, 2010.
Office Action for U.S. Appl. No. 11/351,104, mailed Nov. 29, 2010.
Office Action for U.S. Appl. No. 11/351,104, mailed Jul. 26, 2011.
Office Action for U.S. Appl. No. 11/437,537, mailed Dec. 23, 2008.
Final Office Action for U.S. Appl. No. 11/437,537, mailed Jul. 16, 2009.
Office Action for U.S. Appl. No. 11/331,789, mailed Jun. 13, 2008.
Final Office Action for U.S. Appl. No. 11/331,789, mailed Oct. 23, 2008.
Office Action for U.S. Appl. No. 11/331,789, mailed Aug. 5, 2009.
Office Action for U.S. Appl. No. 12/785,362, mailed Apr. 22, 2011.
Office Action for U.S. Appl. No. 11/417,830, mailed Nov. 14, 2008.
Final Office Action for U.S. Appl. No. 11/417,830, mailed May 28, 2009.
Office Action for U.S. Appl. No. 11/417,993, mailed Oct. 29, 2008.
Office Action for U.S. Appl. No. 12/370,562, mailed Sep. 30, 2010.
Office Action for U.S. Appl. No. 12/370,562, mailed Apr. 6, 2011.
Office Action for U.S. Appl. No. 11/592,891, mailed Jan. 15, 2009.
Final Office Action for U.S. Appl. No. 11/592,891, mailed Jul. 20, 2009.
Office Action for U.S. Appl. No. 11/595,119, mailed Jul. 21, 2009.
Final Office Action for U.S. Appl. No. 11/595,119, mailed Jan. 5, 2010.
Office Action for U.S. Appl. No. 11/595,119, mailed Aug. 19, 2010.
Final Office Action for U.S. Appl. No. 11/595,119, mailed Aug. 2, 2011.
Office Action for U.S. Appl. No. 11/604,075, mailed May 3, 2010.
Office Action for U.S. Appl. No. 11/845,029, mailed Jul. 9, 2009.
Final Office Action for U.S. Appl. No. 11/845,029, mailed Jan. 25, 2010.
Final Office Action for U.S. Appl. No. 11/845,029, mailed Dec. 9, 2010.
Office Action for U.S. Appl. No. 11/845,029, mailed Sep. 27, 2011.
Office Action for U.S. Appl. No. 11/437,538, mailed Dec. 22, 2008.
Final Office Action for U.S. Appl. No. 11/437,538, mailed Jun. 10, 2009.
Office Action for U.S. Appl. No. 11/437,387, mailed Dec. 23, 2008.
Final Office Action for U.S. Appl. No. 11/437,387, mailed Jul. 15, 2009.
Office Action for U.S. Appl. No. 11/437,582, mailed Jan. 8, 2009.
Final Office Action for U.S. Appl. No. 11/437,582, mailed Jul. 22, 2009.
Office Action for U.S. Appl. No. 11/801,964, mailed Sep. 17, 2010.
Final Office Action for U.S. Appl. No. 11/801,964, mailed May 11, 2011.
Office Action for U.S. Appl. No. 12/304,100, mailed Jun. 17, 2011.
Office Action for U.S. Appl. No. 11/487,722, mailed Aug. 7, 2009.
Office Action for U.S. Appl. No. 11/643,329, mailed Jul. 9, 2010.
Office Action for U.S. Appl. No. 11/648,359, mailed Nov. 19, 2009.
Office Action for U.S. Appl. No. 11/944,346, mailed Nov. 23, 2010.
Office Action for U.S. Appl. No. 12/077,051, mailed Dec. 28, 2010.
Office Action for U.S. Appl. No. 12/113,535, mailed Apr. 21, 2011.
Office Action for U.S. Appl. No. 11/970,484, mailed Nov. 24, 2010.
Final Office Action for U.S. Appl. No. 11/970,484, mailed Jul. 22, 2011.
Office Action for U.S. Appl. No. 12/172,195, mailed Nov. 12, 2010.
Office Action for U.S. Appl. No. 12/336,492, mailed Sep. 15, 2011.
Office Action for U.S. Appl. No. 12/210,917, mailed Nov. 15, 2010.
Final Office Action for U.S. Appl. No. 12/210,917, mailed May 13, 2011.
Office Action for U.S. Appl. No. 12/350,927, mailed Aug. 17, 2011.
Office Action for U.S. Appl. No. 12/365,891, mailed Aug. 29, 2011.
Office Action for U.S. Appl. No. 10/235,338, mailed Jan. 8, 2003.
Office Action for U.S. Appl. No. 11/094,987, mailed Dec. 27, 2007.
Final Office Action for U.S. Appl. No. 11/094,987, mailed May 23, 2008.
Office Action for U.S. Appl. No. 11/094,987, mailed Oct. 21, 2008.
Office Action for U.S. Appl. No. 12/474,020, mailed Jun. 3, 2010.
Final Office Action for U.S. Appl. No. 12/474,020, mailed Oct. 4, 2010.
Office Action for U.S. Appl. No. 09/866,474, mailed Nov. 30, 2004.
Final Office Action for U.S. Appl. No. 09/866,474, mailed Jun. 10, 2005.
Office Action for U.S. Appl. No. 10/667,027, mailed Jul. 29, 2005.
Final Office Action for U.S. Appl. No. 10/667,027, mailed Mar. 10, 2006.
Office Action for U.S. Appl. No. 10/667,027, mailed May 5, 2006.
Final Office Action for U.S. Appl. No. 10/667,027, mailed Feb. 26, 2007.
Office Action for U.S. Appl. No. 10/666,848, mailed Mar. 22, 2007.
Office Action for U.S. Appl. No. 10/667,136, mailed Jan. 25, 2006.
Office Action for U.S. Appl. No. 10/667,136, mailed Aug. 28, 2006.
Final Office Action for U.S. Appl. No. 10/667,136, mailed Mar. 9, 2007.
International Search Report and Written Opinion for PCT/US05/004702, mailed Aug. 10, 2006.
International Search Report and Written Opinion for PCT/US2006/009525, mailed Sep. 13, 2007.
International Search Report and Written Opinion for PCT/US06/40500, mailed Aug. 17, 2007.
International Search Report and Written Opinion for PCT/US06/40498, mailed Dec. 28, 2007.
International Search Report and Written Opinion for PCT/US2007/012194 dated Feb. 4, 2008.
International Search Report and Written Opinion for PCT/US06/40499, mailed Dec. 13, 2007.
International Search Report and Written Opinion for PCT/US2007/12016, mailed Jan. 4, 2008.
International Search Report and Written Opinion for PCT/US2007/012195, mailed Mar. 19, 2008.
International Search Report and Written Opinion for PCT/US07/013758 mailed Apr. 3, 2008.
First Office Action for Chinese Application No. 2007800229623.X , mailed Dec. 31, 2010.
International Search Report and Written Opinion for PCT/US07/013757, mailed Jan. 22, 2008.
International Search Report and Written Opinion for PCT/US07/14847, mailed Apr. 1, 2008.
International Search Report and Written Opinion for PCT/US07/089134, mailed Apr. 10, 2008.
International Search Report and Written Opinion for PCT/US2008/010708, mailed May 18, 2009.
Office Action for Canadian Application No. 2,638,754, mailed Oct. 3, 2011.
Supplementary Partial European Search Report for European Application No. 02770460, mailed Aug. 20, 2004.
Supplementary Partial European Search Report for European Application No. 02770460, mailed Dec. 15, 2004.
Examination Report for European Application No. 02770460, Mar. 18, 2005.
Summons for Oral Hearing Proceedings for European Application No. 02770460, Jan. 31, 2006.
International Search Report for PCT/US02/28090, mailed Aug. 13, 2003.
International Preliminary Examination Report for PCT/US02/28090, mailed Oct. 29, 2003.
Examination Report for European Application No. 06006504, mailed Oct. 10, 2006.
English Translation of Office Action for Japanese Application No. 2006-088348, mailed Jan. 4, 2011.
International Search Report and Written Opinion for PCT/US04/30769, mailed Oct. 4, 2005.
International Search Report and Written Opinion for PCT/US04/30683, mailed Feb. 10, 2006.
International Search Report and Written Opinion for PCT/US04/30684, mailed Feb. 10, 2006.
Aerohive Blog, posted by Devin Akin, Cooperative Control: Part 3, [Online] Retrieved from the Internet: <URL: http://blog.aerohive.com/blog/?p=71> Mar. 1, 2010 (3 pages).
Wikipedia, Wireless LAN, 2 definitions for wireless LAN roaming, [Online] [retrieved Oct. 4, 2010] Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Wireless—LAN> (1 page).
Sangheon Pack et al. “Fast-handoff support in IEEE 802.11 wireless networks,” IEEE Communications Surveys, IEEE, NY, NY, vol. 9, No. 1, Jan. 1, 2007 (pp. 2-12) ISSN: 1553-877X.
U.S. Appl. No. 13/447,656, filed Apr. 16, 2012.
U.S. Appl. No. 13/396,124, filed Feb. 14, 2012.
U.S. Appl. No. 13/437,669, filed Apr. 2, 2012.
U.S. Appl. No. 13/437,673, filed Apr. 2, 2012.
Final Office Action for U.S. Appl. No. 12/489,295, mailed Jan. 18, 2012.
Office Action for U.S. Appl. No. 11/351,104, mailed Feb. 15, 2012.
Office Action for U.S. Appl. No. 13/396,124, mailed May 7, 2012.
Office Action for U.S. Appl. No. 12/370,562, mailed Jan. 17, 2012.
Office Action for U.S. Appl. No. 13/437,669, mailed May 30, 2012.
Office Action for U.S. Appl. No. 13/437,673, mailed May 30, 2012.
Office Action for U.S. Appl. No. 12/683,281, mailed Jan. 20, 2012.
Final Office Action for U.S. Appl. No. 12/304,100, mailed Feb. 2, 2012.
Office Action for U.S. Appl. No. 12/304,100, mailed May 29, 2012.
Final Office Action for U.S. Appl. No. 12/077,051, mailed Oct. 25, 2011.
Final Office Action for U.S. Appl. No. 12/113,535, mailed Jan. 3, 2012.
Office Action for U.S. Appl. No. 12/113,535, mailed Apr. 20, 2012.
Office Action for U.S. Appl. No. 11/970,484, mailed Jun. 20, 2012.
Final Office Action for U.S. Appl. No. 12/336,492, mailed Jun. 15, 2012.
Office Action for U.S. Appl. No. 12/210,917, mailed Dec. 5, 2011.
Extended Search Report for European Application No. 11188566.1, mailed Jan. 30, 2012.
Second Office Action for Chinese Application No. 200780029623.X, mailed Mar. 7, 2012.
Extended Supplementary European Search Report for Application No. 07796005.2, mailed Feb. 14, 2012.
Related Publications (1)
Number Date Country
20090067436 A1 Mar 2009 US