Source: http://www.google.com/patents/US7724704?dq=6004266
Timestamp: 2016-07-24 01:34:49
Document Index: 671139447

Matched Legal Cases: ['art 600', 'art 600', 'art 600', 'art 600', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'art 800', 'arts 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 1100', 'art 1100', 'art 1100', 'art 1100', 'art 1100', 'art 1100', 'art 1200', 'art 1200', 'art 1200', 'art 1200', 'art 1200', 'art 1200', 'art 1200', 'art 1200', 'art 1200', 'art 11']

Patent US7724704 - Wireless VLAN system and method - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsThis specification describes a system and method that can offer, among other advantages, a technique for resource assignment that involves obtaining a group of resources, repeatedly selecting a resource from the group of resources until a resource that is available is selected, and associating a client...http://www.google.com/patents/US7724704?utm_source=gb-gplus-sharePatent US7724704 - Wireless VLAN system and methodAdvanced Patent SearchPublication numberUS7724704 B2Publication typeGrantApplication numberUS 11/487,722Publication dateMay 25, 2010Filing dateJul 17, 2006Priority dateJul 17, 2006Fee statusPaidAlso published asUS20080013481, WO2008010894A2, WO2008010894A3Publication number11487722, 487722, US 7724704 B2, US 7724704B2, US-B2-7724704, US7724704 B2, US7724704B2InventorsMichael Terry Simons, David Bradburn AragonOriginal AssigneeBeiden Inc.Export CitationBiBTeX, EndNote, RefManPatent Citations (220), Non-Patent Citations (48), Referenced by (37), Classifications (13), Legal Events (5) External Links: USPTO, USPTO Assignment, EspacenetWireless VLAN system and method
US 7724704 B2Abstract
This specification describes a system and method that can offer, among other advantages, a technique for resource assignment that involves obtaining a group of resources, repeatedly selecting a resource from the group of resources until a resource that is available is selected, and associating a client or process with that resource. An example of a method according to the technique includes obtaining a group of VLANs for assignment to a client based on client identity, selecting a first choice from the group of VLANs, selecting a next choice from the group of VLANs if the first choice is unavailable, and connecting the client to the selected VLAN. The client identity may include, by way of example but not limitation, a MAC address, an SSID, or some other known or convenient way to identify the client. A system constructed according to the technique may include, by way of example but not limitation, memory, a resource group name decoder, a value calculator, an index calculator, and a selector. The memory may include, for example, a resource name buffer, an identity buffer, a result buffer, a resource count buffer, a resource name array, and a selected resource buffer.
memory, including:
a resource name buffer;
an identity buffer;
a result buffer;
a virtual local area network (VLAN) resource count buffer;
a VLAN resource name array;
a selected VLAN resource buffer;
a VLAN resource group name decoder coupled to the resource name buffer, VLAN resource count buffer, and VLAN resource name array;
a value calculator coupled to the identity buffer and the result buffer;
an index calculator coupled to the VLAN resource count buffer;
a selector coupled to the index calculator, VLAN resource name array, and selected VLAN resource buffer;
wherein, in operation, one or more processors are employed such that:
an encoded resource name is stored in the resource name buffer;
an identity parameter is stored in the identity buffer;
the VLAN resource group name decoder reads the encoded resource name, decodes the name to obtain decoded list elements, writes a count of the list elements to the VLAN resource count buffer, and writes the decoded list elements to the VLAN resource name array;
the value calculator processes the identity parameter stored in the identity buffer to produce a value that is stored in the result buffer;
the index calculator takes the value stored in the result buffer modulo the count of the list elements stored in the VLAN resource count buffer;
the selector uses the result of the index calculator as an array index to select a VLAN resource name from the VLAN resource name array and stores the VLAN resource name in the selected VLAN resource buffer;
a wireless station is associated with the VLAN resource identified in the selected VLAN resource buffer.
2. The system of claim 1, wherein, in operation, the resource name buffer stores a VLAN name.
3. The system of claim 1, wherein, in operation, the identity buffer stores a MAC address.
4. The system of claim 1, wherein, in operation, the value calculator processes the identity parameter stored in the identity buffer to produce an integer.
5. The system of claim 1, wherein, the value calculator includes a hash calculator.
6. The system of claim 1, wherein the identity parameter includes one or more portions, and wherein, in operation, the value calculator:
sets a partial result, R, to an initial value;
loops until each of the one or more portions of the identity parameter have been processed, during which the value calculator:
sets R to R times a multiplier;
sets R to R plus a next portion of the identity parameter;
sets R to R modulo a modulus;
obtaining a result that is equal to R after a last iteration of the loop.
7. The system of claim 1, wherein, the VLAN resource name array is a one-dimensional array.
8. The system of claim 1, wherein the decoded list elements are associated with network resources to which a user of the wireless station is authorized access.
9. The system of claim 1, wherein the VLAN resource count buffer includes a single integer value.
10. The system of claim 1, wherein the VLAN resource count buffer is decremented by one if the index calculator generates a result that causes the selector to select a VLAN resource that is not currently available.
The field relates to communications networks in which subnetworks are employed.
If the number of users of a network is very large, the performance may be degraded by broadcast traffic, such as ARP and DHCP requests. Each device on the network generates a certain amount of broadcast traffic, which every other device must receive and examine to at least some degree, whereby the burden of broadcast processing rises as the square of the number of devices on the network. The degradation due to this effect can become significant even when the network traffic is well within the capacity of the physical transmission medium.
A common solution, described by Mogul and Postel (RFC 950, which is incorporated by reference) is to divide the network into subnets. Subnets can be implemented physically by using separate local-area networks (LANs), or logically by partitioning into virtual LANs (VLANs) as in IEEE 801.1Q, or by a combination of the two techniques. Any particular user's impact is then limited to the specific subnetwork to which the user is assigned. However, in the context of administering a large network, this solution still poses problems, related to the method of assigning users to subnets.
A simple method would be to use the same technique for wireless users as has historically been used for wired users, namely, determining the subnet from the physical location or port through which the user accesses the network. A known disadvantage of this method is that a mobile user who moves across a subnet boundary will lose connectivity at the network layer (Layer 3 of the OSI model). This method may therefore not be optimal for applications that require continuous connectivity while a user moves, e.g. IP telephones. Even if the user is not in motion, location-based subnet assignment may not be optimal if the user is close to a boundary between two wireless coverage areas that use different subnets, because fluctuations in the radio signal could cause the user's equipment to alternate between the coverage areas, losing connectivity each time.
Although location-based subnet assignment can (with the above-noted disadvantages) accomplish one purpose of subnets by reducing the number of users per subnet, it thwarts another important purpose of subnets, namely the separation of traffic by access privilege.
An alternative to location-based subnet assignment is to base the subnet assignment on the user's identity. Identity-based VLAN assignment is implemented in current products from, e.g., Trapeze Networks. The user's VLAN assignment is considered to be an authorization attribute of the user, and so an administrator configures it as part of the user's AAA information in an AAA server, which is typically a Radius server. This administrative effort is justified, and identity-based authorization is especially advantageous, if there is a managerial or security motivation for placing particular users into particular subnets. However, if the number of users is so large as to motivate dividing the network into subnetworks, then the administrative burden of assigning a subnet to each user will also be proportionately large.
RFC 2904 due to Vollbrecht, et al., which is incorporated herein by reference, shows frameworks for authorization in the typical context of AAA (Authentication, Authorization, and Accounting) for a network. This authorization framework is applicable to wireless or wired users. However, in the case of wireless users, the operations described in RFC 2904 must be preceded by other operations specific to establishing a wireless connection. For instance, in 802.11 wireless networks, these preliminary operations include an 802.11 association request from the wireless client device, identifying the client device by hardware (MAC) address. Typically the user's name, password, and/or other AAA parameters are exchanged after the association request has been accepted.
The 802.11 association request also includes a Service Set ID (SSID) that names a wireless service to which the client wishes to connect. If the service equipment supports multiple subnets or VLANs, a common (although not mandatory) implementation choice is to identify an SSID with each VLAN. In that method, the user's request to associate through a given SSID implies that the subsequent authorization processing should connect the user to the VLAN corresponding to that SSID. In that case there is no explicit authorization request from the user, although again, authorization parameters can be obtained from the AAA server as a side effect of authentication.
These and other issues are addressed, resolved, and/or ameliorated using techniques described herein.
A technique for resource assignment involves obtaining a group of resources, repeatedly selecting a resource from the group of resources until a resource that is available is selected, and associating a client or process with that resource. An example of a method according to the technique includes obtaining a group of VLANs for assignment to a client based on client identity, selecting a first choice from the group of VLANs, selecting a next choice from the group of VLANs if the first choice is unavailable, and connecting the client to the selected VLAN. In this example, the resources are VLANs and the client or process is a client. The client identity may include, by way of example but not limitation, a MAC address, an SSID, or some other known or convenient way to identify the client. A specific example of a method for selecting and assigning resources may include, for example, calculating a hash function based on a client or process identity parameter.
A system constructed according to the technique may include, by way of example but not limitation, memory, a resource group name decoder, a value calculator, an index calculator, and a selector. The memory may include, for example, a resource name buffer, an identity buffer, a result buffer, a resource count buffer, a resource name array, and a selected resource buffer. In operation, the system may employ one or more processors such that an encoded resource name is stored in the resource name buffer; an identity parameter is stored in the identity buffer; the resource group name decoder reads the encoded resource name, decodes the name to obtain decoded list elements, writes a count of the list elements to the resource count buffer, and writes the decoded list elements to the resource name array; the value calculator processes the identity parameter stored in the identity buffer to produce a value that is stored in the result buffer; the index calculator takes the value stored in the result buffer modulo the count of the list elements stored in the resource count buffer; the selector uses the result of the index calculator as an array index to select a resource name from the resource name array and stores the resource name in the selected resource buffer; and a client or process is associated with the resource identified in the selected resource buffer.
The resource name buffer of the system may or may not store a VLAN name. The identity buffer may or may not store a MAC address. The value calculator may or may not process the identity parameter stored in the identity buffer to produce an integer. The value calculator may or may not include a hash calculator.
Embodiments of the present invention are illustrated in the figures. However, the embodiments and figures are illustrative rather than limiting; they provide examples of the invention.
FIG. 1 depicts an example of a system for persistent VLAN association.
FIG. 2 depicts an example of a system for persistent VLAN association across domains.
FIG. 3 depicts an example of a computer system for use in the system of FIG. 2.
FIG. 4 depicts a specific implementation of a system 400 compatible with the techniques described herein.
FIG. 5 depicts an example of subnet roaming.
FIG. 6 depicts a flowchart of an example of a method for assigning wireless clients to subnetworks.
FIG. 7 depicts an example of a system that includes multiple controllers.
FIG. 8 depicts a flowchart of an example of a method for user authentication and association with a VLAN.
FIGS. 9A and 9B depict flowcharts of an example of an alternative method for user authentication and association with a VLAN.
FIG. 10 depicts a conceptual diagram of an example of VLAN selection.
FIG. 11 depicts a flowchart of an example of a method for processing a MAC address for a hash result.
FIG. 12 depicts a flowchart of an example of a method for identity-based connection of a client to a VLAN.
FIG. 1 depicts an example of a system 100 for persistent VLAN association. The system 100 includes a controller 102, a switch 104, access points (APs) 106-1 and 106-2 (referred to collectively as access points 106), and a wireless client 108. For illustrative purposes, the wireless client 108 is depicted as moving from AP 106-1 to AP 106-2. The system 100 may include by way of example but not limitation wireless LAN (WLAN) intelligence distributed in a known or convenient manner to efficiently use network resources. The intelligence may extend to the edge of a network for authentication, authorization, and traffic prioritization. The controller 102 may provide, for example, centralized management of tunnel set up between APs on an as needed basis. In an embodiment, the system 100 eliminates or reduces bottlenecks caused by tunneling all traffic through a central controller.
In the example of FIG. 1, the controller 102 is a device distinct from an AP and is coupled to and capable of controlling multiple APs. The controller 102 may be a network controller, or include one or more network controllers. The controller 102 may be, by way of example but not limitation, a network switch such as a Trapeze Mobility Exchange™ switch. Thus, for example, the controller 102 and the switch 104 could include common components, or could be a single physical or logical device.
In operation, the controller 102 controls the APs 106 to make the wireless client 108 appear as though it never leaves a VLAN, even if the wireless client 108 roams to an AP that is not in some way connected to that VLAN. The wireless client may be, by way of example but not limitation, a Wi-Fi client. Advantageously, the wireless client 108 can roam across VLANs potentially without interruption. In an embodiment, highly latency sensitive applications such as Voice over Wi-Fi calls seamlessly roam across VLANs.
The controller 102 keeps track of which clients are associated with each AP and shares that information with the APs 106 to enable them to set up tunnels between each other as required to enable VLAN roaming. In the example of FIG. 1, the wireless client 108 is associated with the AP 106-1. When the wireless client 108 associates to the AP 106-2, the AP 106-2 tells the controller 102 about the association. If the VLAN to which the wireless client was connected before it roamed is not available to the AP 106-2, then the controller 102 instructs the AP 106-2 and AP 106-1 to establish a tunnel 110 between each other. In an embodiment, all traffic to the wireless client 108 would be sent across the tunnel 110 from the AP 106-1 to the AP 106-2, and all traffic from the wireless client 108 would be tunneled from the AP 106-2 to the AP 106-1.
Advantageously, the system 100 can extend an existing network. For example, APs can be deployed where desired without rearchitecting the network (e.g., an existing Ethernet network). This can potentially eliminate complicated VLAN configuration, provide scalability from branch offices to large enterprises, facilitate maintaining investment in existing layer 2/3 switches, upgrade existing WLAN installations, etc.
FIG. 2 depicts an example of a system 200 for persistent VLAN association across wireless access areas. The system 200 includes a computer system 202, a network 204, and a wireless access domain 206. The system 200 may or may not include multiple wireless access domains. In an embodiment that includes multiple wireless access domains, techniques that will be apparent to those of skill in the art with this reference before them, can be used to ensure persistent VLAN association across the wireless access domains.
In the example of FIG. 2, the computer system 202 may be practically any type of device that is capable of communicating with a communications network, such as, by way of example but not limitation, a workstation. The network 204 may be practically any type of communications network, such as, by way of example but not limitation, the Internet. The term “Internet” as used herein refers to a network of networks which uses certain protocols, such as the TCP/IP protocol, and possibly other protocols such as the hypertext transfer protocol (HTTP) for hypertext markup language (HTML) documents that make up the World Wide Web (the web). The physical connections of the Internet and the protocols and communication procedures of the Internet are well known to those of skill in the art.
In a non-limiting embodiment, the computer system 202 may be running a program such as, by way of example but not limitation, ethereal, to decode, by way of example but not limitation, IEEE 802.11 standard packets encapsulated in TZSP that are received from the wireless access domain 106. In a non-limiting embodiment, the computer system 102 is connected to a wireless backbone network (not shown), either directly or indirectly through a wireless network.
In a non-limiting embodiment, the network 204 provides a Layer 2 path for Layer 3 traffic, preserving IP addresses, sessions, and other wired Layer 3 attributes as users roam throughout the wireless access domain 106. The network may or may not include a wireless backbone network, or be connected directly or indirectly to a wireless backbone network. Communications between the computer system 202 and the wireless access domain 206 are, therefore, Layer 3 traffic tunneled through Layer 2. Advantageously, by tunneling Layer 3 traffic at Layer 2, users stay connected with the same IP address and keep the same security and Quality of Service (QoS) policies from the wired network while they roam the wireless side. Since Layer 3 attributes are maintained, mobile devices that are connected to the wireless access domain 206 can retain persistent identities.
In non-limiting embodiments, the wireless access domain 206 may be referred to as, by way of example but not limitation, a Local Area Network (LAN), virtual LAN (VLAN), and/or wireless LAN (WLAN). The wireless access domain 206 gives each user a persistent identity that can be tracked and managed, no matter where they roam. In an embodiment, the wireless access domain 206 may include one or more radios.
In the example of FIG. 2, the wireless access domain 206 includes access areas 208-1 to 208-N (hereinafter collectively referred to as access areas 208). The access areas 208 have characteristics that depend upon, among other things, a radio profile. A radio profile is a group of parameters such as, by way of example but not limitation, beacon interval, fragmentation threshold, and security policies. In an embodiment, the parameters may be configurable in common across a set of radios in one or more access areas 208. In another embodiment, a few parameters, such as the radio name and channel number, must be set separately for each radio. An example of the implementation of a wireless access domain, provided by way of example but not limitation, includes a Trapeze Networks “identity-aware” Mobility Domain™.
In the example of FIG. 2, the following elements are associated with each of the access areas 208: Wireless exchange switches 210-1 to 210-N (hereinafter collectively referred to as wireless exchange switches 210), networks 212-1 to 212-N (hereinafter collectively referred to as networks 212), and APs 214-1 to 214-N (hereinafter collectively referred to as APs 214).
In an embodiment, the wireless exchange switches 210 swap topology data and client information that details each user's identity, location, authentication state, VLAN membership, permissions, roaming history, bandwidth consumption, and/or other attributes assigned by, by way of example but not limitation, an Authentication, Authorization, and Accounting (AAA) backend (not shown). RFC 2904 “AAA Authorization Framework” by Vollbrecht et al. is incorporated herein by reference. In an embodiment, the wireless exchange switches 210 provide forwarding, queuing, tunneling, and/or some security services for the information the wireless exchange switches 210 receive from their associated APs 214. In another embodiment, the wireless exchange switches 210 coordinate, provide power to, and/or manage the configuration of the associated APs 214. An implementation of a wireless exchange switch, provided by way of example but not limitation, includes a Trapeze Networks Mobility Exchange™ switch. The Trapeze Networks Mobility Exchange™ switches may, in another implementation, be coordinated by means of the Trapeze AP Access (TAPA) protocol.
In an embodiment, the networks 212 are simply wired connections from the wireless exchange switches 210 to the APs 214. The networks 212 may or may not be part of a larger network. In a non-limiting embodiment, the networks 212 provides a Layer 2 path for Layer 3 traffic, preserving IP addresses, sessions, and other wired Layer 3 attributes as users roam throughout the wireless access domain 206. Advantageously, by tunneling Layer 3 traffic at Layer 2, users stay connected with the same IP address and keep the same security and Quality of Service (QoS) policies from the wired network while they roam the wireless side.
In a non-limiting embodiment, the APs 214 are hardware units that act as a communication hub by linking wireless mobile 802.11 stations such as PCs to a wired backbone network. In an embodiment, the APs 214 connect users to other users within the network and, in another embodiment, can serve as the point of interconnection between a WLAN and a fixed wire network. The number of users and size of a network help to determine how many APs are desirable for a given implementation. An implementation of an AP, provided by way of example but not limitation, includes a Trapeze Networks Mobility System™ Mobility Point™ (MP™) AP.
The APs 214 are stations that transmit and receive data (and may therefore be referred to as transceivers) using one or more radio transmitters. For example, an AP may have two associated radios, one which is configured for IEEE 802.11a standard transmissions, and the other which is configured for IEEE 802.11b standard transmissions. In a non-limiting embodiment, an AP transmits and receives information as radio frequency (RF) signals to and from a wireless client over a 10/100BASE-T Ethernet connection. The APs 214 transmit and receive information to and from their associated wireless exchange switches 210. Connection to a second wireless exchange switch provides redundancy.
A station, as used herein, may be referred to as a device with a media access control (MAC) address and a physical layer (PHY) interface to the wireless medium that comply with the IEEE 802.11 standard. As such, in a non-limiting embodiment, the APs 214 are stations. Similarly, the wireless client 216 may be implemented as a station. In alternative embodiments, a station may comply with a different standard than IEEE 802.11, and may have different interfaces to a wireless or other medium.
In operation, a wireless client 216 can roam from one of the access areas 208 to another of the access areas 208. For example, in the example of FIG. 1 the wireless client 216 moves from the access area 208-1 to the access area 208-N. In an embodiment, the wireless client 216 can maintain a single IP address and associated data sessions. The ability of the wireless client 216 to roam across the access areas 208 while maintaining a single IP address and associated data sessions may be referred to as subnet mobility. The ability of the wireless client 216 to roam across the access areas 208, or from one AP to another within a particular access area (see, e.g., FIG. 1), while appearing to remain associated with a particular VLAN may be referred to persistent VLAN association. Advantageously, the system 200 may be implemented using identity-based networking, which is a technique that enforces network authorization attributes to the wireless client 216 based on client identity rather than the port or device through which the wireless client 216 connects to the network. This technique enables both a single persistent login and passport free roaming which permits the introduction of services such as voice to a WLAN.
FIG. 3 depicts an example of a computer system 300 for use in the system 200 (FIG. 2). The computer system 300 may be a conventional computer system that can be used as a client computer system, such as a wireless client or a workstation, or a server computer system. The computer system 300 includes a computer 302, I/O devices 304, and a display device 306. The computer 302 includes a processor 308, a communications interface 310, memory 312, display controller 314, non-volatile storage 316, and I/O controller 318. The computer 302 may be coupled to or include the I/O devices 304 and display device 306.
The computer 302 interfaces to external systems through the communications interface 310, which may include a modem or network interface. It will be appreciated that the communications interface 310 can be considered to be part of the computer system 300 or a part of the computer 302. The communications interface 310 can be an analog modem, ISDN modem, cable modem, token ring interface, satellite transmission interface (e.g. “direct PC”), or other interfaces for coupling a computer system to other computer systems.
The non-volatile storage 316 is often a magnetic hard disk, an optical disk, or another form of storage for large amounts of data. Some of this data is often written, by a direct memory access process, into memory 312 during execution of software in the computer 302. One of skill in the art will immediately recognize that the terms “machine-readable medium” or “computer-readable medium” includes any type of storage device that is accessible by the processor 208 and also encompasses a carrier wave that encodes a data signal.
Network computers are another type of computer system that can be used in conjunction with the teachings provided herein. Network computers do not usually include a hard disk or other mass storage, and the executable programs are loaded from a network connection into the memory 312 for execution by the processor 308. A Web TV system, which is known in the art, is also considered to be a computer system, but it may lack some of the features shown in FIG. 3, such as certain input or output devices. A typical computer system will usually include at least a processor, memory, and a bus coupling the memory to the processor.
In addition, the computer system 300 is controlled by operating system software which includes a file management system, such as a disk operating system, which is part of the operating system software. One example of operating system software with its associated file management system software is the family of operating systems known as Windows� from Microsoft Corporation of Redmond, Wash., and their associated file management systems. Another example of operating system software with its associated file management system software is the Linux operating system and its associated file management system. The file management system is typically stored in the non-volatile storage 316 and causes the processor 308 to execute the various acts required by the operating system to input and output data and to store data in memory, including storing files on the non-volatile storage 316.
Embodiments of the invention may also relate to apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
FIG. 4 depicts a specific implementation of a system 400 compatible with the techniques described herein. It should be noted that the system 400 may or may not include all of the techniques described herein, and is not to be interpreted as “the invention.” The system 400 is intended to serve as a non-limiting example of a specific implementation that is useful for understanding one or more of the disclosed techniques.
Enterprise networks that deploy, for example, a Trapeze Mobility System™ might use several Mobility Exchanges™ (MXs™) to deliver WLAN service in areas where mobility is required. In the example of FIG. 4, the deployed MXs include an MX-16, MX-200, MX-216, and MX-400. Currently, MXs are available in a variety of form factors the MXR-2, MX-8, MX-200, MX-216 and MX-400, each of which is compatible with Identity-Based Networking, multiple users per port, multiple private groups per MX, and AAA offload. MXs may implement an IEEE 802.1X protocol to authenticate users and control access to a network. In the example of FIG. 4, the MXs are installed in a wiring closet and a data center, though this is not intended to be a limitation as to the placement of the MX(s). The MXs that form the Mobility Domain authenticate each user and enforce their network authorizations wherever they roam. These network authorizations include the user's VLAN membership, ACLs, and Mobility Profiles that were learned from AAA during the authentication process. In addition, the Mobility Domain moves statistics, session history, and security-related information to hosting MXs as the user moves through the Mobility Domain.
These MXs communicate with each other and with Trapeze Mobility Points™ (MPs™) to create a Mobility Domain™ and deliver Identity-Based Networking. Identity-Based Networking provides user-specific services based on a user's identity. MXs also control MPs and APs, configuring and managing them whether the MXs directly link to them or use the existing wired infrastructure to connect to them. In the example of FIG. 4, the depicted MPs include a MP-52 and MP-200. The example of FIG. 4 also depicts a plurality of third party APs. It should be noted that the term AP may be used generally to include both MPs and third party APs.
In a specific implementation provided by way of example but not limitation, Trapeze Mobility System Software™ may be used with the system 400 to allow any port on an MX to be configured as either a “network” or “user” port. Network ports connect to the network backbone. User ports permit authenticated network access on a per-user basis. Network ports are roughly analogous to the “trusted” ports of a firewall or access server while the user ports are roughly analogous to a firewall's “untrusted” ports. Network ports determine the VLANs that are locally available to users connected to a particular MX. In this specific implementation, user ports are further categorized by access medium to include users with a wired connection and users who connect through a MP attached to a port.
In operation, the username and password that the user enters to log into the network (including by way of example but not limitation, NT Domain, Active Directory, etc.) is used by the MX to authenticate the user against an AAA back-end. Remote access dial-in user service (RADIUS) is currently a common type of AAA server. In the example of FIG. 4, the AAA server is located at the data center, though this is not intended to be a limitation as to the placement of the AAA server. During the authentication process, the system learns a user's network authorization attributes. User network authorization attributes may include VLAN membership, ACLs, and Mobility Profiles which may limit where the user is allowed to roam.
When users roam, they will associate with an AP that is attached to a different port on a different switch and router subnet. For this reason, in this specific implementation, permissions should follow users on a WLAN network as they roam. When the user authenticates to or roams to an AP, the hosting MX learns which VLAN to put the user on based on their identity and authorizations in the AAA server. If the network port of the MX is directly connected to the user's VLAN, for example through its gigabit port(s), the user is joined to it automatically. If the network ports of the MX are not directly connected to that VLAN, then the user has just roamed across a subnet boundary.
FIG. 5 depicts an example of subnet roaming in a system 500. Subnet roaming occurs when the user roams to an AP hosted by a MX whose network port is not directly connected to the user's VLAN. The Trapeze Mobility System supports subnet roaming with Identity-Based Networking. Identity-Based Networking allows the Trapeze Mobility System to enforce network authorizations based on the user's identity even when they roam across subnets. FIG. 5 is intended to show how Identity-Based Networking leverages Layer 2 VLAN technology to support subnet roaming.
In the example of FIG. 5, Amy is a member of the “red” VLAN and roams to an AP hosted by a MX whose network port is directly connected to the “blue” VLAN and not the red VLAN. The hosting MX attached to the blue VLAN will automatically search its local Mobility Domain database of MXs to find an MX whose network port is directly attached to the red VLAN. Once it is found, the MX hosting the roaming client forms an IP tunnel to the MX hosting “red.” If multiple MXs are hosting red, a ‘tunnel affinity’ parameter can be used to influence choice.
It may be noted that the client configuration of Amy and Bob in the example of FIG. 5 could be identical. One consideration for deploying large WLAN systems is to minimize or eliminate configuration elements and differences on client devices. Advantageously, in an embodiment, the system 400 allows for the presentation of a single 802.11 service set identifier (SSID) to all wireless users, regardless of their 802.1X/EAP type, their VLAN membership, or other authorization credentials. The client machine sees only one SSID throughout the enterprise. Users are authenticated, then authorized and connected to various VLANs or subnets all using the same SSID.
By using a single SSID, the client is configured only once and all clients are configured the same way. SSIDs are not a determinant of security credentials or network capabilities—only the AAA process is. It is still possible to join the subnet or VLAN of interest and to restrict roaming capabilities based on physical location. The management task of managing an array of SSIDs on the clients and in the network can be eliminated.
In the example of FIG. 5, to the rest of the network, including intervening switches and routers, the tunnel looks like simple IP unicast traffic between two MXs. The user's traffic that is carried in the tunnel between the MXs is not required to be IP traffic. It is a Layer 2 tunnel from the MX on the blue VLAN to the MX on the red VLAN. The tunnel is equivalent to putting an additional user onto an unused port of a switch that is part of the red VLAN.
Advantageously, no new subnets need to be added to the network to implement the system 500. If you are currently a user of the red subnet, you can remain a user of the red subnet. Any ACLs that you have currently implemented remain effective. If there are firewalls or highly restrictive ACLs between subnets, the only impact to network configuration is to allow the MXs (not clients) to exchange data. The firewalls still remain effective for user data.
Advantageously, the Layer 2 approach combined with tunneling scales extensively. For instance, in the example of FIG. 5: If additional users of the red VLAN roam to the MX that is attached to the blue VLAN, their traffic also traverse the existing tunnel that was initially setup for Amy rather than creating a new tunnel for each roaming user. If Amy and those same additional users send traffic to each other, that traffic is switched locally on the MX attached to the blue VLAN rather than being transmitted across the tunnel. Logically, the red VLAN is instantiated on the MX that is connected to the blue VLAN.
Advantageously, an existing tunnel can be used for any number of users or subnets in any direction. For instance, in the example of FIG. 5: If users of the blue VLAN roam to the MX that is attached to the red VLAN, their traffic is tunneled back to the MX on the blue VLAN through the existing tunnel that was setup for Amy. If the MX that attaches to the red VLAN is also attached to a “green” VLAN (not shown), then the one tunnel will carry traffic from users who roam to the MX attached to the blue VLAN.
Tunnels are “lightweight” and there aren't very many of them in a Mobility Domain. When needed, they provide a path over which the MX can dynamically instantiate “virtual ports” for the VLANs of interest. Each MX would never have more than (N minus 1) tunnels, where N is the total number of MXs in the Mobility Domain.
For existing routers in an enterprise, an MX-to-MX connection means additional IP unicast traffic is being routed between MXs when users roam away from their native subnet. The existing routers do not participate in any tunneling overhead and they do not need to run any additional protocols such as Mobile IP. In fact, in an embodiment, no additional router configuration is necessary.
The additional routed traffic can be weighed against the cost and difficulty of extending subnets to new areas—the difficulty depends entirely upon the enterprise backbone architecture. To assist in this analysis, the Trapeze Mobility System Software provides extensive information on tunnel usage including traffic statistics, what VLANs are being used and what users are utilizing them.
FIG. 6 depicts a flowchart 600 of an example of a method for assigning wireless clients to subnetworks. FIG. 6 is intended to illustrate an example of how to assign clients to subnetworks, but it is to be understood that other methods may be utilized and fall within the scope of the teachings provided herein. Advantageously, the method facilitates assigning a large number of users in a balanced manner among several subnetworks such that a given user will consistently be assigned to the same subnetwork and thus will maintain connectivity when roaming, yet does not require administrators to assign a subnetwork to each user. An additional advantage is that should a subnetwork be unavailable (e.g., malfunctioning), its users will be re-assigned in a balanced and consistent manner among the remaining networks. An additional advantage of the method is to reduce administrative effort of specifying subnet assignments by providing for automatic calculation. An additional advantage of the method is to provide improved fault tolerance by systematically generating fallback assignments if a subnet is found to be unusable.
In the example of FIG. 6, the flowchart 600 starts with calculating a hash function of a client's identity. An example of a hash function is described later with reference to FIGS. 10 and 11, but a known or convenient hash function may be used instead. In the example of FIG. 6, the flowchart 600 continues with using the result of the hash calculation to select a permutation of the list of VLANs. In the example of FIG. 6, the flowchart 600 ends with selecting, from the permuted list of VLANs, the first VLAN that is available.
FIG. 7 depicts an example of a system 700 that includes multiple controllers. The system 700 includes an AAA server 702, controllers 704-1 to 704-N (hereinafter referred to collectively as the controllers 704), APs 706-1 to 706-N (collectively referred to hereinafter as the APs 706), and user devices 708-1 to 708-N (collectively referred to hereinafter as the user devices 708). The system 700 further includes a management LAN 710, and a plurality of other LANs 712-1 to 712-N (collectively referred to hereinafter as the LANs 712). For illustrative purposes only, the management LAN 710 and the LANs 712 are depicted as busses.
In the example of FIG. 7, the AAA server 702 is coupled to the management LAN 710. The controllers 704 are coupled to the management LAN 710 and the LANs 712. The APs 706 are coupled to the controllers 704. For illustrative purposes only, APs 706-1 to 706-4 are depicted as coupled to the controller 704-1, and the APs 706-5 to 706-N are depicted as coupled to the controller 704-N. The user devices 708 are wirelessly coupled to the APs 706. In an embodiment, the user devices 708 do not have access to the management LAN 710. The management LAN 710 may be, for example, for facilitating operation and configuration of the controllers 704 by, for example, an administrator. Moreover, the management LAN 710 may facilitate communication between the controllers 704 and with the back-end AAA server 702.
In operation, the controllers 704 facilitate forwarding traffic from the user devices 708 to the LANs 712 and vice versa. User devices 708 can be portable devices equipped with, by way of example but not limitation, 802.11 interfaces. For example, user devices 708 can be portable computers or wireless VoIP telephones. The user devices 708 might associate to any of the APs 706 on the respective one of the controllers 704, or to other equivalent APs (not shown). Once having associated to an AP, a user device might roam to another AP, on the same or a different one of the controllers 704. In an embodiment, the controllers 704 include software, firmware, and/or hardware that facilitates assigning the user devices 708 to subnetworks.
The management LAN 710 and the LANs 712 may be implemented as physically separate media or as virtual networks (VLANs) or by a combination; they may be referred to herein as VLANs regardless of the specific implementation.
FIG. 8 depicts a flowchart 800 of an example of a method for user authentication and association with a VLAN. In the example of FIG. 8, the flowchart 800 starts at decision point 802 where it is determined whether a user can be authenticated. This may involve, by way of example but not limitation, determining and validating the user's identity. Authentication methods are well known and can be, for example, 802.1X using PEAP and MS-CHAP. In an embodiment, the identity is validated using an AAA server. In another embodiment, a list stored locally within controller can be used to authenticate the user. Alternatively, some other known or convenient validation technique may be used.
If at decision point 802, it is determined that the user cannot be authenticated (802-N), then the association fails and the flowchart 800 ends. If, on the other hand, it is determined that the user can be authenticated (802-Y), then the flowchart 800 continues to module 804 where user authorization parameters are obtained.
In the example of FIG. 8, the flowchart 800 continues to decision point 806 where it is determined whether the user is authorized. If the user is not authorized (806-N), then the association fails and the flowchart 800 ends. By way of example but not limitation, authorization may fail if the authorization attributes specify restrictions on the time of day when the user is allowed to connect, and the user is attempting to connect at a time that is not allowed. There are almost limitless reasons why authorization could fail, so an exhaustive list will not be attempted.
If, on the other hand, it is determined that the user is authorized (806-Y), then the flowchart 800 continues to decision point 808 where it is determined whether a VLAN name specifics a VLAN group. The decision may involve, by way of example but not limitation, detecting the presence of specific characters in the VLAN name attribute.
In the example of FIG. 8, if it is determined that a VLAN name specifies a VLAN group (808-Y), then the flowchart 800 continues to module 810 where VLAN group membership is decoded. By way of example but not limitation, if the VLAN attribute specifies a VLAN group, the VLAN name attribute may be parsed to make a list of individual VLANs that are members of the group. The flowchart 800 continues to module 812 where a VLAN is chosen from the group. Another example of how to decode VLAN group membership and choose a VLAN from the group, as in modules 810 and 812, is described later with reference to FIG. 10.
In the example of FIG. 8, after module 812, or if it is determined that a VLAN name does not specify a VLAN group (808-N), the flowchart 800 continues to decision point 814 where it is determined whether a VLAN is instantiated. By way of example but not limitation, a VLAN may be considered instantiated if a controller has a connection to that VLAN. The connection might be a physical port, a software tunnel, or some other known or convenient technique for forming a connection. If it is determined that a VLAN is not instantiated (814-N), then the flowchart 800 continues to module 816 where a tunnel is built to the VLAN. For example, if the controller does not already have a connection to the VLAN, but is capable of creating a software tunnel to a controller that is physically connected to the VLAN, then the software tunnel is established.
In the example of FIG. 8, after module 816, or if it is determined that a VLAN is instantiated (814-Y), the flowchart 800 continues to decision point 818, where it is determined whether VLAN status is OK. VLAN status will be OK, for example, if the VLAN specified in the authorization attributes is usable.
If it is determined that VLAN status is not OK (818-N), then the flowchart continues to decision point 820 where it is determined whether more VLANs are in the group. In an embodiment, if a VLAN that is part of a group should fail (e.g., Status is not OK), users that would ordinarily have been assigned to that VLAN are allocated evenly and deterministically among the remaining VLANs. Failure of a VLAN may be detected by any of several methods known in the art; for example, absence of carrier at a physical Ethernet port, or inability to contact a server or gateway in the VLAN, or software detection that tunnel creation has failed.
If it is determined that more VLANs are in the group (820-Y), then the flowchart continues to module 822 where VLAN group membership is recalculated excluding the failed VLAN(s), and the flowchart 800 continues from module 812 as described previously. The recalculation may include testing whether there are VLANs remaining in the group (e.g., whether a VLAN count maintained in a numeric buffer is greater than one—see, e.g., FIG. 10). The recalculation may further include deleting the failed VLAN from an array of VLANs in the group (see, e.g., FIG. 10). Advantageously, the decision point 820 and module 822 provide for a recovery path after failure, making this method relatively robust. When the flowchart 800 advances to module 812, the VLAN array will be shortened, due to the deletion of the failed VLAN, and, at least in some embodiments, the indexes should be shifted accordingly for ease of referencing the VLAN array.
If, on the other hand, it is determined that no more VLANs are in the group (820-N), then the association fails, and the flowchart 800 ends. The failure may occur, for example, after multiple iterations of the flowchart 800 from module 812 to module 822, at which point it may be assumed that VLAN status is not OK for any of the VLANs in the group.
Eventually, when a VLAN is found with a status that is OK (818-Y), the flowchart 800 continues to module 824 where the user is connected to the VLAN, and the flowchart 800 ends with a successful association.
FIGS. 9A and 9B depict flowcharts 900A and 900B, respectively, of an example of an alternative method for user authentication and association with a VLAN. Several of the modules and decision points are similar to those of FIG. 8, and are therefore not described in any detail with reference to FIGS. 9A and 9B. There are two points at which the processing path illustrated in FIG. 8 may need to communicate with external servers: The AAA operations (modules 802-806), and building a VLAN tunnel (module 816). FIGS. 9A and 9B are intended to illustrate an example of a method that allows these two potential bottlenecks to execute in parallel, potentially reducing total time to connect the user to a VLAN.
The description associated with FIG. 8 accomplishes VLAN assignment based on the user's identity. However, it is also possible to configure the controller so that a VLAN group corresponds to the wireless network ID (SSID) through which the user associates. An advantage of using SSID-based VLAN groups is that the SSIDs in a network are fewer than the users, so the administrative effort to specify the VLAN assignments may be lower. FIGS. 9A and 9B are also intended to illustrate that SSID-based VLAN group assignment.
In the example of FIG. 9A, the flowchart 900A starts at decision point 902 where it is determined whether a user can be authenticated. (An SSID thread may spawn at any time at or after the flowchart 900A starts; the SSID thread is described later with reference to FIG. 9B). If at decision point 902, it is determined that the user cannot be authenticated (902-N), then the association fails and the flowchart 900A ends. If, on the other hand, it is determined that the user can be authenticated (902-Y), then the flowchart 900A continues to module 904 where user authorization parameters are obtained. In the example of FIG. 9A, the flowchart 900 continues to decision point 906 where it is determined whether the user is authorized. If the user is not authorized (906-N), then the association fails and the flowchart 900A ends.
If, on the other hand, it is determined that the user is authorized (906-Y), then the flowchart 900A continues to decision point 908 where it is determined whether a VLAN is specified for the user. In an embodiment, decision point 908 is associated with a test to determine whether the authorization parameters include an identity-based VLAN assignment. If it is determined that a VLAN is specified for the user (908-Y), then the flowchart 900A continues to module 910 where the VLAN is selected and instantiated.
If, on the other hand, it is determined that a VLAN is not specified for the user (908-N), then the flowchart 900A continues to decision point 912 where it is determined whether the SSID thread is done. For example, if it is determined that there is no identity-based VLAN parameter, then the VLAN assignment is instead based on the SSID. If it is determined that the SSID thread is not done (912-N), then the flowchart 900A continues to module 914 where the main thread waits for the SSID thread to end (see FIG. 9B).
In any case, the flowchart 900A continues to decision point 916 where it is determined whether VLAN status is OK. If it is determined that VLAN status is not OK (916-N), then the association fails, and the flowchart 900A ends. If, on the other hand, it is determined that the VLAN status is OK (916-Y), then the flowchart 900A continues to module 918 where the user is connected to the VLAN, and the flowchart 900A ends. It should be noted that the calculation of a fallback VLAN in case of failure of the first VLAN need not be done in a loop. For example, all the permutations could be calculated in advance and stored in an array. For four VLANs in a group, for example, the array would have 4!=24 entries, each entry being a list of four VLANs showing the order in which the system should attempt to connect to them. In an alternative, a resource other than VLANs could be selected for the purpose of balancing between users or processes. For example, the method could be implemented to select radio devices or channels, instead of VLANs. The benefits would be similar to that provided with respect to VLANs because bandwidth can be allocated among users while minimizing disruption to any one user or process.
FIG. 9B is intended to illustrate an example of a subsidiary thread that may begin approximately at the same time as the flowchart 900A, or some time after. Authentication and authorization (such as at modules 902-906) may involve communication with an external AAA server, or some other process that entails at least a small delay. Not until the authorization parameters are obtained at can it be known whether a user has an identity-based VLAN or VLAN group assignment. However, an SSID thread's operations do not depend on the user's authorization parameters, and can therefore proceed without waiting for the AAA operations. The exact point at which the subsidiary thread begins may vary depending upon implementation, embodiment, and/or environment. Indeed, the process need not even be parallel. However, since one of the purposes of FIG. 9B is to illustrate the potential for a parallel process, it is assumed that the SSID thread is executed in parallel with the main thread.
In the example of FIG. 9B, the SSID thread starts at decision point 920 where it is determined whether a VLAN (or, e.g., a VLAN group) is specified for the SSID. If a VLAN is specified for the SSID (920-Y), then the flowchart 900B continues to module 922 where the VLAN is selected and instantiated. Selection and instantiation in this case is similar to that described with reference to module 910, but the input includes the VLAN (or VLAN group) specified for the SSID, while at module 910 the VLAN (or VLAN group) is specified for the user.
If, on the other hand, it is determined that a VLAN is not specified for the SSID (920-N), or after the module 922, the flowchart 900B continues to module 924 where the VLAN selection and status are stored. Thus, whether success or failure, the results are stored. For example, if no VLAN (or VLAN group) is specified for the SSID, this is recorded as a failure. Then the SSID thread ends.
FIG. 10 depicts a conceptual diagram 1000 of an example of VLAN selection. The conceptual diagram 1000 includes memory 1002, a VLAN group name decoder 1004, a MAC hash calculator 1006, an index calculator 1008, and a selector 1010. Additional components, such as one or more processors, are omitted to improve clarity. In the example of FIG. 10, the memory 1002 includes a VLAN name buffer 1012 that stores a VLAN name attribute, a MAC address buffer 1014 that stores the client's hardware address (which may be known, for example, from the client's initial association request), a hash result buffer 1016, a VLAN count buffer 1018, a VLAN name array 1020, and a selected VLAN buffer 1022.
The VLAN name buffer 1012 can store, by way of example but not limitation, a conventional VLAN name string, or a name string containing special characters to guide the VLAN group name decoder 1004 in creating a VLAN list. In the example of FIG. 10, the VLAN name buffer 1012 includes, for illustrative purposes only, the VLAN name CAMPUS {A,B,C,D} which uses the UNIX “C” shell convention to indicate a group. In the UNIX “C” shell convention, the curly braces indicate that a list is to be constructed by successively appending the each of the comma separated elements A, B, C, D to the root CAMPUS. Although a specific syntax (Unix “C” shell) is used in this example, it should be appreciated that a known or convenient method of representing and/or parsing string expressions and of expanding encoded lists could be used, and the VLAN group name decoder 1004 can implement a known or convenient syntax for the application. It may be preferable (though it is not required) to choose group delimiters that are not common in VLAN names, but that are permitted by the interface rules governing the VLAN name attribute in an AAA server.
In operation, the VLAN group name decoder 1004 reads an encoded name from the VLAN name buffer 1012, and decodes the name to obtain decoded list elements. The group name decoder 1004 writes a count of the VLAN list elements into the VLAN count buffer 1018, and the decoded list elements to the VLAN name array 1020.
The MAC hash calculator 1006 processes the MAC address stored in the MAC address buffer 1014 to produce, by way of example but not limitation, an integer, which is stored in the hash result buffer 1016. An example of operation of a hash calculator, such as the MAC hash calculator 1006, is described later in more detail with reference to FIG. 11. It should be noted that a different hash function of the hardware address can be used. Indeed, a function that returns only the last byte of the MAC address could be used in the alternative. If desired, the hash function for an identity-based VLAN assignment can be based on the user's name rather than on the hardware address.
The index calculator 1008 takes the value stored in the hash result buffer 1016 modulo the list length in the VLAN count buffer 1018. In the example of FIG. 10, the value in the hash result buffer 1016 is, for illustrative purposes only, 25535. The list length in the VLAN count buffer 1018 is, for illustrative purposes only, 4. The result from the index calculator 1008 is used as an array index by the selector 1010 to select a name from the VLAN name array 1020. Since 25535% 4=3, the value 3 is used as an array index. This result indicates the fourth list element (numbering array indices from zero). Therefore, the fourth element of the VLAN name array 1020 is selected and copied to the selected VLAN buffer 1022. The components shown in FIG. 10 thus together accomplish the steps of decoding VLAN group membership and choosing a VLAN from the group.
Because the operations are deterministic functions of the user's identity and hardware MAC address, they give the same result regardless of the AP through which the user associates, and the same result even on different controllers running the same software. Therefore, the user maintains the same VLAN assignment while roaming in the wireless network.
FIG. 11 depicts a flowchart 1100 of an example of a method for processing a MAC address for a hash result. The result is formed in a loop by adding the bytes of the MAC address successively to a partial result.
In the example of FIG. 1, the flowchart 1100 starts at module 1102 with setting R to 0. The flowchart 1100 continues to module 1104 where a loop starts (and continues until each of the bytes of the MAC address have been processed). At module 1106, R is set to R times a MULTIPLIER. The MULTIPLIER may be a preset value (by way of example but not limitation, ‘31’). At module 1108, R is set to R plus the next byte of the MAC address. At module 1110, R is set to R modulo a MODULUS. The MODULUS may be a preset value (by way of example but not limitation, ‘216’). It may be noted that an alternative limiting operation could as well be performed implicitly, by using a 16-bit register for the partial result R, so that overflow past 16 bits is discarded at modules 1106 and 1108.
In the example of FIG. 11, the flowchart 1100 continues to decision point 1112, where it is determined whether each byte of the MAC address has been processed. If it is determined that each byte of the MAC address has not yet been processed (1112-N), then the flowchart 1100 continues at module 1106 for another iteration, as described previously. If, on the other hand, it is determined that each byte of the MAC address has been processed (1112-Y), then the flowchart 1100 ends at module 1114, where the result of the function is output. The result of the output should equal R after the last iteration (at module 1110).
Although specific values for the constants MULTIPLIER and MODULUS are described here, other values could also perform well. For instance, MULTIPLIER could be 65599. The algorithm is not particularly sensitive to the choice of MODULUS, but it may be advantageous to use a MODULUS that is at least several times the number of VLANs in a group.
Table 1 is intended to illustrate values at each loop pass for the loop index j, the input MAC byte MAC[j], and the partial results at modules 1106 to 1110, for the same example MAC address shown, for illustrative purposes only, in FIG. 10 (00:0b:0e:01:02:03). The value of R after module 1110 (25535 in this example) is the result that is the output of, for example, the MAC hash calculator 1006 (FIG. 10).
Values at Each Loop Pass
MAC = 00:0b:0e:01:02:03; MULTIPLIER = 31; MODULUS = 65536
MAC[j]
In practice, the MAC hashing and VLAN selection procedure distributes users among VLANs evenly and deterministically. This effect is illustrated in Table 2, which shows results for several consecutive MAC addresses. For illustrative purposes only, there are assumed to be four VLANs in the VLAN group (CampusA, CampusB, CampusC, and CampusD, with array indexes 0, 1, 2, and 3, respectively). It may be noted that the first row corresponds to the MAC address of Table 1, and other rows correspond to MAC addresses calculated using the same procedure. Consecutive addresses are shown for simplicity and may or may not represent a worst-case scenario, perhaps resulting from a single large purchase of network devices from a single vendor. Those skilled in the relevant art will appreciate that a more random distribution of MAC addresses would be more realistic, but that a more random distribution will merely reinforce a tendency to map different users to different VLANs.
In Table 2, the VLAN (2nd choice) column includes the list of VLANs minus the first choice, which presumably was unavailable. Since one VLAN is removed from the list of available VLANs, the Hash Result colunm associated with the VLAN (2nd choice) is modulo 3 (i.e., the number of remaining available VLANs). In practice, the balance of users among VLANs is maintained even when a VLAN (any of the VLANs) fails.
VLAN Distributions
(1st Result
00:0b:0e:01:02:01
00:0b:0e:01:02:02
CampusC
00:0b:0e:01:02:03
CampusD
00:0b:0e:01:02:04
00:0b:0e:01:02:05
00:0b:0e:01:02:06
00:0b:0e:01:02:07
00:0b:0e:01:02:08
00:0b:0e:01:02:09
The first MAC address in Table 2, 00:0b:0e:01:02:01, hashes to 25533 and division mod 4 gives 1, so that initially the VLAN at array index 1 (CampusB) is chosen. On the second pass the same value 25533 is divided modulo 3 giving 0, so the VLAN at array index 0 (CampusA) is chosen. The fifth MAC address in the table, 00:0b:0e:01:02:05, hashes to 25537. On the first pass CampusB is selected. On the second pass, 25537 modulo 3 gives 1. However, since CampusB has been removed from the list and the remaining entries have been shifted to close the gap, array index 1 now contains CampusC. The last MAC address in the table, 00:0b:0e:01:02:09, hashes to 25541, which also results in choosing CampusB on the first pass. On the second pass, 25541 modulo 3 gives 2. Array index 2 was formerly CampusC but, because of compaction of the array after removing CampusB, array index 2 on the second pass contains CampusD. Thus the three users that would ordinarily have been assigned to CampusB are now assigned to CampusA, CampusC and CampusD respectively.
FIG. 12 depicts a flowchart 1200 of an example of a method for identity-based connection of a client to a VLAN. In the example of FIG. 12, the flowchart 1200 starts at module 1202 with obtaining a group of VLANs for assigning to a client based on client identity. The group of VLANs may be obtained as described above, or using any known or convenient method. In the example of FIG. 12, the flowchart 1200 continues to module 1204 with selecting a first choice from the group of VLANs. The selection may be as described above, or using any known or convenient method. In the example of FIG. 12, the flowchart 1200 continues to module 1206 where it is determined whether the selected VLAN is available. If the selected VLAN is unavailable (1206-N), then the flowchart 1200 continues to module 1208 with selecting a next VLAN from the group of VLANs, and the flowchart 1200 loops back to decision point 1206. The selection of the next VLAN from the group may be as described above, or according to any known or convenient technique. For illustrative purposes only, the flowchart 1200 includes an inherent assumption that a VLAN is eventually available (1206-Y), at which point the flowchart 1200 continues to module 1210 with connecting the client to the selected VLAN, and the flowchart 1200 ends.
Terms and examples described above serve illustrative purposes only and are not intended to be limiting. As used herein, the term “embodiment” means an embodiment that serves to illustrate by way of example but not limitation.
It may be noted that the term VLAN maybe used interchangeably with the term subnet. The term VLAN (or subnet) refers to an identified domain that is associated with a user. In some implementations, VLANs are identified system wide using a name string or number. These VLAN names are typically independent of 802.1Q tag values, when used. It should be noted that in an embodiment where VLANs are specified as numbers, a numeric range can be used in place of an encoded list of names.
Authentication methods are well known in the art and can be, for example, 802.1X using PEAP and MS-CHAP. However, any known or convenient method or protocol may be used.
Techniques described herein can be used not only in wireless networks, but also in wired networks, and in networks with both wireless and wired users. For wired users, operations described as based on SSID can be made to depend instead on the physical or logal port, tag, or other identifier showing how the user accessed the network.
Techniques described herein can be used with Ethernet protocols, or other protocols could be used. When other protocols are used, a device serial number, phone number, or other numeric or string value could be used in place of, for example, a MAC address.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS3641433Jun 9, 1969Feb 8, 1972Us Air ForceTransmitted reference synchronization systemUS4168400Mar 16, 1978Sep 18, 1979Compagnie Europeenne De Teletransmission (C.E.T.T.)Digital communication systemUS4176316Mar 30, 1953Nov 27, 1979International Telephone & Telegraph Corp.Secure single sideband communication system using modulated noise subcarrierUS4247908Dec 8, 1978Jan 27, 1981Motorola, Inc.Re-linked portable data terminal controller systemUS4291401Nov 21, 1979Sep 22, 1981Ebauches Bettlach S.A.Device for securing a watch dial to a watch-movement plateUS4291409Jul 18, 1978Sep 22, 1981The Mitre CorporationSpread spectrum communications method and apparatusUS4409470Jan 25, 1982Oct 11, 1983Symbol Technologies, Inc.Narrow-bodied, single-and twin-windowed portable laser scanning head for reading bar code symbolsUS4460120Aug 1, 1983Jul 17, 1984Symbol Technologies, Inc.Narrow bodied, single- and twin-windowed portable laser scanning head for reading bar code symbolsUS4475208Jan 18, 1982Oct 2, 1984Ricketts James AWired spread spectrum data communication systemUS4494238Jun 30, 1982Jan 15, 1985Motorola, Inc.Multiple channel data link systemUS4500987Nov 23, 1982Feb 19, 1985Nippon Electric Co., Ltd.Loop transmission systemUS4503533Aug 20, 1981Mar 5, 1985Stanford UniversityLocal area communication network utilizing a round robin access scheme with improved channel utilizationUS4550414Apr 12, 1983Oct 29, 1985Charles Stark Draper Laboratory, Inc.Spread spectrum adaptive code trackerUS4562415Jun 22, 1984Dec 31, 1985Motorola, Inc.Universal ultra-precision PSK modulator with time multiplexed modes of varying modulation typesUS4630264Sep 21, 1984Dec 16, 1986Wah Benjamin WEfficient contention-resolution protocol for local multiaccess networksUS4635221Jan 18, 1985Jan 6, 1987Allied CorporationFrequency multiplexed convolver communication systemUS4639914Dec 6, 1984Jan 27, 1987At&T Bell LaboratoriesWireless PBX/LAN system with optimum combiningUS4644523Mar 23, 1984Feb 17, 1987Sangamo Weston, Inc.System for improving signal-to-noise ratio in a direct sequence spread spectrum signal receiverUS4672658Oct 23, 1986Jun 9, 1987At&T Company And At&T Bell LaboratoriesSpread spectrum wireless PBXUS4673805Aug 1, 1983Jun 16, 1987Symbol Technologies, Inc.Narrow-bodied, single- and twin-windowed portable scanning head for reading bar code symbolsUS4707839Sep 26, 1983Nov 17, 1987Harris CorporationSpread spectrum correlator for recovering CCSK data from a PN spread MSK waveformUS4730340Oct 31, 1980Mar 8, 1988Harris Corp.Programmable time invariant coherent spread symbol correlatorUS4736095Feb 20, 1986Apr 5, 1988Symbol Technologies, Inc.Narrow-bodied, single- and twin-windowed portable laser scanning head for reading bar code symbolsUS4740792Aug 27, 1986Apr 26, 1988Hughes Aircraft CompanyVehicle location systemUS4758717Jul 10, 1986Jul 19, 1988Symbol Technologies, Inc.Narrow-bodied, single-and twin-windowed portable laser scanning head for reading bar code symbolsUS4760586Dec 27, 1985Jul 26, 1988Kyocera CorporationSpread spectrum communication systemUS4789983Mar 5, 1987Dec 6, 1988American Telephone And Telegraph Company, At&T Bell LaboratoriesWireless network for wideband indoor communicationsUS4829540Oct 29, 1987May 9, 1989Fairchild Weston Systems, Inc.Secure communication system for multiple remote unitsUS4850009May 31, 1988Jul 18, 1989Clinicom IncorporatedPortable handheld terminal including optical bar code reader and electromagnetic transceiver means for interactive wireless communication with a base communications stationUS4872182Mar 8, 1988Oct 3, 1989Harris CorporationFrequency management system for use in multistation H.F. communication networkUS4894842Oct 15, 1987Jan 16, 1990The Charles Stark Draper Laboratory, Inc.Precorrelation digital spread spectrum receiverUS4901307Oct 17, 1986Feb 13, 1990Qualcomm, Inc.Spread spectrum multiple access communication system using satellite or terrestrial repeatersUS4933952Apr 4, 1989Jun 12, 1990Lmt RadioprofessionnelleAsynchronous digital correlator and demodulators including a correlator of this typeUS4933953Sep 1, 1988Jun 12, 1990Kabushiki Kaisha KenwoodInitial synchronization in spread spectrum receiverUS4995053Apr 25, 1990Feb 19, 1991Hillier Technologies Limited PartnershipRemote control system, components and methodsUS5008899Jun 29, 1990Apr 16, 1991Futaba Denshi Kogyo Kabushiki KaishaReceiver for spectrum spread communicationUS5029183Jun 29, 1989Jul 2, 1991Symbol Technologies, Inc.Packet data communication networkUS5103459Jun 25, 1990Apr 7, 1992Qualcomm IncorporatedSystem and method for generating signal waveforms in a cdma cellular telephone systemUS5103461Dec 19, 1990Apr 7, 1992Symbol Technologies, Inc.Signal quality measure in packet data communicationUS5109390Nov 7, 1989Apr 28, 1992Qualcomm IncorporatedDiversity receiver in a cdma cellular telephone systemUS5142550Dec 28, 1990Aug 25, 1992Symbol Technologies, Inc.Packet data communication systemUS5151919Dec 17, 1990Sep 29, 1992Ericsson-Ge Mobile Communications Holding Inc.Cdma subtractive demodulationUS5157687Dec 19, 1990Oct 20, 1992Symbol Technologies, Inc.Packet data communication networkUS5187675Sep 18, 1991Feb 16, 1993Ericsson-Ge Mobile Communications Holding Inc.Maximum search circuitUS5231633Jul 11, 1990Jul 27, 1993Codex CorporationMethod for prioritizing, selectively discarding, and multiplexing differing traffic type fast packetsUS5280498Nov 27, 1991Jan 18, 1994Symbol Technologies, Inc.Packet data communication systemUS5285494Jul 31, 1992Feb 8, 1994Pactel CorporationNetwork management systemUS5329531Jun 18, 1993Jul 12, 1994Ncr CorporationMethod of accessing a communication mediumUS5418812Jun 26, 1992May 23, 1995Symbol Technologies, Inc.Radio network initialization method and apparatusUS5448569Apr 12, 1994Sep 5, 1995International Business Machines CorporationHandoff monitoring in cellular communication networks using slow frequency hoppingUS5450615Dec 22, 1993Sep 12, 1995At&T Corp.Prediction of indoor electromagnetic wave propagation for wireless indoor systemsUS5465401Dec 15, 1992Nov 7, 1995Texas Instruments IncorporatedCommunication system and methods for enhanced information transferUS5479441Jan 18, 1994Dec 26, 1995Symbol TechnologiesPacket data communication systemUS5483676Feb 2, 1994Jan 9, 1996Norand CorporationMobile radio data communication system and methodUS5488569Dec 20, 1993Jan 30, 1996At&T Corp.Application-oriented telecommunication system interfaceUS5491644Sep 7, 1993Feb 13, 1996Georgia Tech Research CorporationCell engineering tool and methodsUS5517495Dec 6, 1994May 14, 1996At&T Corp.Fair prioritized scheduling in an input-buffered switchUS5519762Dec 21, 1994May 21, 1996At&T Corp.Adaptive power cycling for a cordless telephoneUS5528621Apr 8, 1993Jun 18, 1996Symbol Technologies, Inc.Packet data communication systemUS5561841Jan 21, 1993Oct 1, 1996Nokia Telecommunication OyMethod and apparatus for planning a cellular radio network by creating a model on a digital map adding properties and optimizing parameters, based on statistical simulation resultsUS5568513May 11, 1993Oct 22, 1996Ericsson Inc.Standby power savings with cumulative parity check in mobile phonesUS5584048Oct 26, 1994Dec 10, 1996Motorola, Inc.Beacon based packet radio standby energy saverUS5598532Oct 21, 1993Jan 28, 1997Optimal NetworksMethod and apparatus for optimizing computer networksUS5630207Jun 19, 1995May 13, 1997Lucent Technologies Inc.Methods and apparatus for bandwidth reduction in a two-way paging systemUS5640414Apr 11, 1994Jun 17, 1997Qualcomm IncorporatedMobile station assisted soft handoff in a CDMA cellular communications systemUS5649289Jul 10, 1995Jul 15, 1997Motorola, Inc.Flexible mobility management in a two-way messaging system and method thereforUS5668803Nov 23, 1994Sep 16, 1997Symbol Technologies, Inc.Protocol for packet data communication systemUS5793303Jun 20, 1996Aug 11, 1998Nec CorporationRadio pager with touch sensitive display panel inactive during message receptionUS5794128Sep 20, 1995Aug 11, 1998The United States Of America As Represented By The Secretary Of The ArmyApparatus and processes for realistic simulation of wireless information transport systemsUS5812589May 18, 1995Sep 22, 1998Symbol Technologies, Inc.Radio network initialization method and apparatusUS5815811Oct 27, 1995Sep 29, 1998Symbol Technologies, Inc.Preemptive roaming in a cellular local area wireless networkUS5828960Mar 31, 1995Oct 27, 1998Motorola, Inc.Method for wireless communication system planningUS5838907Feb 20, 1996Nov 17, 1998Compaq Computer CorporationConfiguration manager for network devices and an associated method for providing configuration information theretoUS5844900Sep 23, 1996Dec 1, 1998Proxim, Inc.Method and apparatus for optimizing a medium access control protocolUS5872968Apr 3, 1997Feb 16, 1999International Business Machines CorporationData processing network with boot process using multiple serversUS5875179Oct 29, 1996Feb 23, 1999Proxim, Inc.Method and apparatus for synchronized communication over wireless backbone architectureUS5896561Dec 23, 1996Apr 20, 1999Intermec Ip Corp.Communication network having a dormant polling protocolUS5915214Feb 23, 1995Jun 22, 1999Reece; Richard W.Mobile communication service provider selection systemUS5920821Dec 4, 1995Jul 6, 1999Bell Atlantic Network Services, Inc.Use of cellular digital packet data (CDPD) communications to convey system identification list data to roaming cellular subscriber stationsUS5933607Jun 7, 1994Aug 3, 1999Telstra Corporation LimitedDigital communication system for simultaneous transmission of data from constant and variable rate sourcesUS5949988Apr 3, 1997Sep 7, 1999Lucent Technologies Inc.Prediction system for RF power distributionUS5953669Dec 11, 1997Sep 14, 1999Motorola, Inc.Method and apparatus for predicting signal characteristics in a wireless communication systemUS5960335Jul 18, 1996Sep 28, 1999Kabushiki Kaisha ToshibaDigital radio communication apparatus with a RSSI information measuring functionUS5982779Sep 4, 1997Nov 9, 1999Lucent Technologies Inc.Priority access for real-time traffic in contention-based networksUS5987062Dec 15, 1995Nov 16, 1999Netwave Technologies, Inc.Seamless roaming for wireless local area networksUS5987328Apr 24, 1997Nov 16, 1999Ephremides; AnthonyMethod and device for placement of transmitters in wireless networksUS6005853Oct 2, 1997Dec 21, 1999Gwcom, Inc.Wireless network access schemeUS6011784Dec 18, 1996Jan 4, 2000Motorola, Inc.Communication system and method using asynchronous and isochronous spectrum for voice and dataUS6078568Feb 25, 1997Jun 20, 2000Telefonaktiebolaget Lm EricssonMultiple access communication network with dynamic access controlUS6088591Jun 28, 1996Jul 11, 2000Aironet Wireless Communications, Inc.Cellular system hand-off protocolUS6118771Mar 13, 1997Sep 12, 2000Kabushiki Kaisha ToshibaSystem and method for controlling communicationUS6119009Sep 18, 1997Sep 12, 2000Lucent Technologies, Inc.Method and apparatus for modeling the propagation of wireless signals in buildingsUS6160804Nov 13, 1998Dec 12, 2000Lucent Technologies Inc.Mobility management for a multimedia mobile networkUS6188694Dec 23, 1997Feb 13, 2001Cisco Technology, Inc.Shared spanning tree protocolUS6199032Jul 22, 1998Mar 6, 2001Edx Engineering, Inc.Presenting an output signal generated by a receiving device in a simulated communication systemUS6208629Mar 10, 1999Mar 27, 20013Com CorporationMethod and apparatus for assigning spectrum of a local area networkUS6208841May 3, 1999Mar 27, 2001Qualcomm IncorporatedEnvironmental simulator for a wireless communication deviceUS6218930Mar 7, 2000Apr 17, 2001Merlot CommunicationsApparatus and method for remotely powering access equipment over a 10/100 switched ethernet networkUS6240078Aug 13, 1998May 29, 2001Nec Usa, Inc.ATM switching architecture for a wireless telecommunications networkUS6240083Feb 25, 1997May 29, 2001Telefonaktiebolaget L.M. EricssonMultiple access communication network with combined contention and reservation mode accessUS6256300Apr 11, 2000Jul 3, 2001Lucent Technologies Inc.Mobility management for a multimedia mobile networkUS6256334Sep 22, 1997Jul 3, 2001Fujitsu LimitedBase station apparatus for radiocommunication network, method of controlling communication across radiocommunication network, radiocommunication network system, and radio terminal apparatusUS6262988May 12, 2000Jul 17, 2001Cisco Technology, Inc.Method and system for subnetting in a switched IP networkUS6285662May 14, 1999Sep 4, 2001Nokia Mobile Phones LimitedApparatus, and associated method for selecting a size of a contention window for a packet of data systemUS6304596Nov 23, 1999Oct 16, 2001Broadcom Homenetworking, Inc.Method and apparatus for reducing signal processing requirements for transmitting packet-based data with a modemUS6317599May 26, 1999Nov 13, 2001Wireless Valley Communications, Inc.Method and system for automated optimization of antenna positioning in 3-DUS6336035Nov 19, 1998Jan 1, 2002Nortel Networks LimitedTools for wireless network planningUS6336152Oct 4, 1999Jan 1, 2002Microsoft CorporationMethod for automatically configuring devices including a network adapter without manual intervention and without prior configuration informationUS6347091Nov 6, 1998Feb 12, 2002Telefonaktiebolaget Lm Ericsson (Publ)Method and apparatus for dynamically adapting a connection state in a mobile communications systemUS6356758Dec 31, 1997Mar 12, 2002Nortel Networks LimitedWireless tools for data manipulation and visualizationUS6393290Jun 30, 1999May 21, 2002Lucent Technologies Inc.Cost based model for wireless architectureUS6404772Jul 27, 2000Jun 11, 2002Symbol Technologies, Inc.Voice and data wireless communications network and methodUS6473449Jan 18, 2000Oct 29, 2002Proxim, Inc.High-data-rate wireless local-area networkUS6493679May 26, 1999Dec 10, 2002Wireless Valley Communications, Inc.Method and system for managing a real time bill of materialsUS6496290Dec 17, 1998Dec 17, 2002Lg Telecom, Inc.Optic repeater system for extending coverageUS6512916Aug 10, 2000Jan 28, 2003America Connect, Inc.Method for selecting markets in which to deploy fixed wireless communication systemsUS6580700Dec 29, 1998Jun 17, 2003Symbol Technologies, Inc.Data rate algorithms for use in wireless local area networksUS6587680Nov 23, 1999Jul 1, 2003Nokia CorporationTransfer of security association during a mobile terminal handoverUS6614787Mar 30, 1999Sep 2, 20033Com CorporationSystem and method for efficiently handling multicast packets by aggregating VLAN contextUS6624762 *Apr 11, 2002Sep 23, 2003Unisys CorporationHardware-based, LZW data compression co-processorUS6625454Aug 4, 2000Sep 23, 2003Wireless Valley Communications, Inc.Method and system for designing or deploying a communications network which considers frequency dependent effectsUS6631267Nov 4, 1999Oct 7, 2003Lucent Technologies Inc.Road-based evaluation and interpolation of wireless network parametersUS6659947Jul 13, 2000Dec 9, 2003Ge Medical Systems Information Technologies, Inc.Wireless LAN architecture for integrated time-critical and non-time-critical services within medical facilitiesUS6687498Jan 8, 2001Feb 3, 2004Vesuvius Inc.Communique system with noncontiguous communique coverage areas in cellular communication networksUS6725260May 10, 2000Apr 20, 2004L.V. Partners, L.P.Method and apparatus for configuring configurable equipment with configuration information received from a remote locationUS6747961Apr 11, 2000Jun 8, 2004Lucent Technologies Inc.Mobility management for a multimedia mobile networkUS6839338Mar 20, 2002Jan 4, 2005Utstarcom IncorporatedMethod to provide dynamic internet protocol security policy serviceUS6839348Apr 30, 1999Jan 4, 2005Cisco Technology, Inc.System and method for distributing multicasts in virtual local area networksUS6879812Sep 17, 2002Apr 12, 2005Networks Associates Technology Inc.Portable computing device and associated method for analyzing a wireless local area networkUS6957067Sep 24, 2002Oct 18, 2005Aruba NetworksSystem and method for monitoring and enforcing policy within a wireless networkUS6973622Sep 25, 2000Dec 6, 2005Wireless Valley Communications, Inc.System and method for design, tracking, measurement, prediction and optimization of data communication networksUS6978301Mar 6, 2001Dec 20, 2005IntellidenSystem and method for configuring a network deviceUS7020773Jul 17, 2000Mar 28, 2006Citrix Systems, Inc.Strong mutual authentication of devicesUS7062566Oct 24, 2002Jun 13, 20063Com CorporationSystem and method for using virtual local area network tags with a virtual private networkUS7068999Aug 2, 2002Jun 27, 2006Symbol Technologies, Inc.System and method for detection of a rogue wireless access point in a wireless communication networkUS7110756Aug 2, 2004Sep 19, 2006Cognio, Inc.Automated real-time site survey in a shared frequency band environmentUS7146166Feb 18, 2004Dec 5, 2006Autocell Laboratories, IncTransmission channel selection programUS7155518Jan 8, 2001Dec 26, 2006Interactive People Unplugged AbExtranet workgroup formation across multiple mobile virtual private networksUS7221927Feb 13, 2004May 22, 2007Trapeze Networks, Inc.Station mobility between access pointsUS7280495Dec 28, 2000Oct 9, 2007Nortel Networks LimitedReliable broadcast protocol in a wireless local area networkUS7317914Jan 31, 2005Jan 8, 2008Microsoft CorporationCollaboratively locating disconnected clients and rogue access points in a wireless networkUS7324468Feb 2, 2004Jan 29, 2008Broadcom CorporationSystem and method for medium access control in a power-save networkUS7376080May 11, 2004May 20, 2008Packeteer, Inc.Packet load sheddingUS7489648Mar 11, 2004Feb 10, 2009Cisco Technology, Inc.Optimizing 802.11 power-save for VLANUS7509096Sep 12, 2003Mar 24, 2009Broadcom CorporationWireless access point setup and management within wireless local area networkUS7529925Mar 15, 2006May 5, 2009Trapeze Networks, Inc.System and method for distributing keys in a wireless networkUS7551619Apr 5, 2006Jun 23, 2009Trapeze Networks, Inc.Identity-based networkingUS20020052205Jan 26, 2001May 2, 2002Vyyo, Ltd.Quality of service scheduling scheme for a broadband wireless access systemUS20020080752Dec 22, 2000Jun 27, 2002Fredrik JohanssonRoute optimization technique for mobile IPUS20020095486Jan 12, 2001Jul 18, 2002Paramvir BahlSystems and methods for locating mobile computer users in a wireless networkUS20020101868Sep 18, 2001Aug 1, 2002David ClearVlan tunneling protocolUS20020191572Jan 30, 2002Dec 19, 2002Nec Usa, Inc.Apparatus for public access mobility lan and method of operation thereofUS20030014646Jul 3, 2002Jan 16, 2003Buddhikot Milind M.Scheme for authentication and dynamic key exchangeUS20030018889Sep 20, 2001Jan 23, 2003Burnett Keith L.Automated establishment of addressability of a network device for a target network enviromentUS20030055959 *Jul 3, 2002Mar 20, 2003Kazuhiko SatoMethod and system for managing computer network and non-network activitiesUS20030107590Nov 6, 2002Jun 12, 2003Phillippe LevillainPolicy rule management for QoS provisioningUS20030174706Mar 4, 2003Sep 18, 2003Broadcom CorporationFastpath implementation for transparent local area network (LAN) services over multiprotocol label switching (MPLS)US20030227934Jun 10, 2003Dec 11, 2003White Eric D.System and method for multicast media access using broadcast transmissions with multiple acknowledgements in an Ad-Hoc communications networkUS20040003285Jun 28, 2002Jan 1, 2004Robert WhelanSystem and method for detecting unauthorized wireless access pointsUS20040019857 *Jan 31, 2002Jan 29, 2004Steven TeigMethod and apparatus for specifying encoded sub-networksUS20040025044Jul 30, 2002Feb 5, 2004Day Christopher W.Intrusion detection systemUS20040047320Sep 9, 2002Mar 11, 2004Siemens Canada LimitedWireless local area network with clients having extended freedom of movementUS20040053632Sep 18, 2002Mar 18, 2004Nikkelen Vincent Johannes WilhelmusDistributing shared network access information in a shared network mobile communications systemUS20040062267Jun 5, 2003Apr 1, 2004Minami John ShigetoGigabit Ethernet adapter supporting the iSCSI and IPSEC protocolsUS20040064560Sep 26, 2002Apr 1, 2004Cisco Technology, Inc., A California CorporationPer user per service traffic provisioningUS20040068668Aug 4, 2003Apr 8, 2004Broadcom CorporationEnterprise wireless local area network switching systemUS20040095914May 27, 2003May 20, 2004Toshiba America Research, Inc.Quality of service (QoS) assurance system using data transmission controlUS20040095932Nov 7, 2003May 20, 2004Toshiba America Information Systems, Inc.Method for SIP - mobility and mobile - IP coexistenceUS20040120370Aug 7, 2003Jun 24, 2004Agilent Technologies, Inc.Mounting arrangement for high-frequency electro-optical componentsUS20040143428Mar 13, 2003Jul 22, 2004Rappaport Theodore S.System and method for automated placement or configuration of equipment for obtaining desired network performance objectivesUS20040208570Apr 18, 2003Oct 21, 2004Reader Scot A.Wavelength-oriented virtual networksUS20040221042Apr 30, 2003Nov 4, 2004Meier Robert C.Mobile ethernetUS20040230370May 12, 2003Nov 18, 2004Assimakis TzamaloukasEnhanced mobile communication device with extended radio, and applicationsUS20040236702May 21, 2003Nov 25, 2004Fink Ian M.User fraud detection and prevention of access to a distributed network communication systemUS20040259555Apr 23, 2004Dec 23, 2004Rappaport Theodore S.System and method for predicting network performance and position location using multiple table lookupsUS20050030929Jul 8, 2004Feb 10, 2005Highwall Technologies, LlcDevice and method for detecting unauthorized, "rogue" wireless LAN access pointsUS20050054326Sep 8, 2004Mar 10, 2005Todd RogersMethod and system for securing and monitoring a wireless networkUS20050058132Oct 5, 2004Mar 17, 2005Fujitsu LimitedNetwork repeater apparatus, network repeater method and network repeater programUS20050059405Sep 17, 2003Mar 17, 2005Trapeze Networks, Inc.Simulation driven wireless LAN planningUS20050059406Sep 17, 2003Mar 17, 2005Trapeze Networks, Inc.Wireless LAN measurement feedbackUS20050064873Jun 24, 2004Mar 24, 2005Jeyhan KaraoguzAutomatic quality of service based resource allocationUS20050068925Sep 12, 2003Mar 31, 2005Stephen PalmWireless access point setup and management within wireless local area networkUS20050073980Sep 17, 2003Apr 7, 2005Trapeze Networks, Inc.Wireless LAN managementUS20050128989Oct 15, 2004Jun 16, 2005Airtight Networks, IncMethod and system for monitoring a selected region of an airspace associated with local area networks of computing devicesUS20050157730Oct 31, 2003Jul 21, 2005Grant Robert H.Configuration management for transparent gateways in heterogeneous storage networksUS20050180358Feb 13, 2004Aug 18, 2005Trapeze Networks, Inc.Station mobility between access pointsUS20050181805Mar 31, 2005Aug 18, 2005Gallagher Michael D.Method and system for determining the location of an unlicensed mobile access subscriberUS20050193103Oct 8, 2003Sep 1, 2005John DrabikMethod and apparatus for automatic configuration and management of a virtual private networkUS20050223111Nov 4, 2004Oct 6, 2005Nehru BhandaruSecure, standards-based communications across a wide-area networkUS20050239461Jun 20, 2003Oct 27, 2005The Regents Of The Unviersity Of CaliforniaRegistration of a wlan as a umts routing area for wlan-umts interworkingUS20050240665Mar 2, 2005Oct 27, 2005Microsoft CorporationDynamic self-configuration for ad hoc peer networkingUS20050245269Apr 30, 2004Nov 3, 2005Intel CorporationChannel scanning in wireless networksUS20050259597Jul 20, 2005Nov 24, 2005Benedetto Marco DMultiple instance spanning tree protocolUS20050273442May 23, 2005Dec 8, 2005Naftali BennettSystem and method of fraud reductionUS20050276218Jul 3, 2003Dec 15, 2005AlcatelResource admission control in an access networkUS20060045050Nov 10, 2004Mar 2, 2006Andreas FlorosMethod and system for a quality of service mechanism for a wireless networkUS20060104224Oct 13, 2004May 18, 2006Gurminder SinghWireless access point with fingerprint authenticationUS20060161983Jan 20, 2005Jul 20, 2006Cothrell Scott AInline intrusion detectionUS20060174336Sep 8, 2003Aug 3, 2006Jyshyang ChenVPN and firewall integrated systemUS20060200862Mar 3, 2005Sep 7, 2006Cisco Technology, Inc.Method and apparatus for locating rogue access point switch ports in a wireless network related patent applicationsUS20060245393Apr 27, 2005Nov 2, 2006Symbol Technologies, Inc.Method, system and apparatus for layer 3 roaming in wireless local area networks (WLANs)US20060248331Mar 15, 2006Nov 2, 2006Dan HarkinsSystem and method for distributing keys in a wireless networkUS20060276192May 18, 2006Dec 7, 2006Ashutosh DuttaSeamless handoff across heterogeneous access networks using a handoff controller in a service control pointUS20070064718Sep 19, 2005Mar 22, 2007Ekl Randy LMethod of reliable multicastingUS20070083924Oct 8, 2005Apr 12, 2007Lu Hongqian KSystem and method for multi-stage packet filtering on a networked-enabled deviceUS20070086378Jan 14, 2006Apr 19, 2007Matta Sudheer P CSystem and method for wireless network monitoringUS20070091889Oct 25, 2005Apr 26, 2007Xin XiaoMethod and apparatus for group leader selection in wireless multicast serviceUS20070189222Apr 5, 2007Aug 16, 2007Trapeze Networks, Inc.Station mobility between access pointsUS20070260720May 3, 2006Nov 8, 2007Morain Gary EMobility domainUS20080013481Jul 17, 2006Jan 17, 2008Michael Terry SimonsWireless VLAN system and methodUS20080096575Oct 16, 2007Apr 24, 2008Trapeze Networks, Inc.Load balancingUS20080107077Nov 3, 2006May 8, 2008James MurphySubnet mobility supporting wireless handoffUS20080114784Nov 10, 2006May 15, 2008James MurphySharing data between wireless switches system and methodUS20080117822Nov 22, 2006May 22, 2008James MurphyWireless routing selection system and methodUS20080151844Dec 20, 2006Jun 26, 2008Manish TiwariWireless access point authentication system and methodUS20080162921Dec 28, 2007Jul 3, 2008Trapeze Networks, Inc.Application-aware wireless network system and methodUS20090198999Mar 10, 2009Aug 6, 2009Trapeze Networks, Inc.System and method for distributing keys in a wireless networkWO2003085544A1Mar 28, 2003Oct 16, 2003Airmagnet, Inc.Detecting an unauthorized station in a wireless local area networkWO2004095192A2Apr 21, 2004Nov 4, 2004Airdefense, Inc.Systems and methods for securing wireless computer networksWO2004095800A1Apr 16, 2004Nov 4, 2004Cisco Technology, Inc802.11 using a compressed reassociation exchange to facilitate fast handoff* Cited by examinerNon-Patent CitationsReference1Acampora and Winters, IEEE Communications Magazine, 25(8):11-20 (1987).2Acampora and Winters, IEEE Journal on selected Areas in Communications. SAC-5:796-804 (1987).3Bing and Subramanian, IEEE, 1318-1322 (1997).4Durgin, 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.5Fortune et al., IEEE Computational Science and Engineering, "Wise Design of Indoor Wireless Systems: Practical Computation and Optimization", p. 58-68 (1995).6Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, 1980.7Geier, 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.8Ho 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.9Kim 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.10Kleinrock 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).11LAN/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).12Okamoto and Xu, IEEE, Proceeding so of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).13Panjwani 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.14Perram and Martinez, "Technology Developments for Low-Cost Residential Alarm Systems", Proceedings 1977 Carnahan Conference on Crime Countermeasures, Apr. 6-8, 1977, pp. 45-50.15Piazzi et al., "Achievable Accuracy of Site-Specific Path-Loss Predictions in Residential Environments", IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.16Puttini, 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. 2 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washington, DC, 331-338.17Puttini, 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. 2 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washington, DC, 331-338.18Seidel 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.19Skidmore 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).20U.S. Appl. No. 11/326,966, filed Jan. 5, 2006, Taylor.21U.S. Appl. No. 11/330,877, filed Jan. 11, 2006, Matta.22U.S. Appl. No. 11/331,789, filed Jan. 14, 2006, Matta, et al.23U.S. Appl. No. 11/351,104, filed Feb. 8, 2006, Tiwari.24U.S. Appl. No. 11/377,859, filed Mar. 15, 2006, Harkins.25U.S. Appl. No. 11/417,830, filed May 30, 2006, Morain.26U.S. Appl. No. 11/417,993, filed May 3, 2006, Jar et al.27U.S. Appl. No. 11/437,387, filed May 19, 2006, Zeldin et al.28U.S. Appl. No. 11/437,537, filed May 19, 2006, Freund et al.29U.S. Appl. No. 11/437,538, filed May 19, 2006, Zeldin.30U.S. Appl. No. 11/437,582, filed May 19, 2006, Bugwadia et al.31U.S. Appl. No. 11/445,750, filed May 3, 2006, Matta.32U.S. Appl. No. 11/451,704, filed Jun. 12, 2006, Riley.33U.S. Appl. No. 11/487,722, filed Jul. 2006, Simons et al.34U.S. Appl. No. 11/592,891, filed Nov. 2006, Murphy, James.35U.S. Appl. No. 11/595,119, filed Nov. 2006, Murphy, James.36U.S. Appl. No. 11/604,075, filed Nov. 2006, Murphy et al.37U.S. Appl. No. 11/643,329, filed Dec. 2006, Towari, Manish.38U.S. Appl. No. 11/648,359, filed Dec. 2006, Gast et al.39U.S. Appl. No. 11/690,654, filed Mar. 2007, Keenly et al.40U.S. Appl. No. 11/801,964, filed May 2007, Simone et al.41U.S. Appl. No. 11/845,029, filed Aug. 2007, Gast, Mathew S.42U.S. Appl. No. 11/852,234, filed Sep. 2007, Gast et al.43U.S. Appl. No. 11/944,346, filed Nov. 2007, Gast, Mathew S.44U.S. Appl. No. 11/966,912, filed Dec. 2007, Chesnutt et al.45U.S. Appl. No. 11/970,484, filed Jan. 2008, Gast, Mathew S.46U.S. Appl. No. 11/975,134, filed Oct. 2007, Aragon et al.47U.S. Appl. No. 12/077,051, filed Mar. 2008, Gast, Mathew S.48Ullmo et al., "Wireless Propagation in Buildings: A Statistic Scattering Approach", IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Referenced byCiting PatentFiling datePublication dateApplicantTitleUS7873061Jan 18, 2011Trapeze Networks, Inc.System and method for aggregation and queuing in a wireless networkUS7912982Nov 22, 2006Mar 22, 2011Trapeze Networks, Inc.Wireless routing selection system and methodUS8116275May 21, 2010Feb 14, 2012Trapeze Networks, Inc.System and network for wireless network monitoringUS8150357Mar 28, 2008Apr 3, 2012Trapeze Networks, Inc.Smoothing filter for irregular update intervalsUS8161278Apr 17, 2012Trapeze Networks, Inc.System and method for distributing keys in a wireless networkUS8213800 *Jul 3, 2012Tellabs Operations, Inc.Wireless backhaul communication using passive optical networkUS8218449Jul 10, 2012Trapeze Networks, Inc.System and method for remote monitoring in a wireless networkUS8238298Aug 7, 2012Trapeze Networks, Inc.Picking an optimal channel for an access point in a wireless networkUS8238942Aug 7, 2012Trapeze Networks, Inc.Wireless station location detectionUS8248416 *Aug 21, 2012Mental Images GmbhEfficient ray tracing without acceleration data structureUS8320949Nov 27, 2012Juniper Networks, Inc.Wireless load balancing across bandsUS8340110Aug 24, 2007Dec 25, 2012Trapeze Networks, Inc.Quality of service provisioning for wireless networksUS8446890May 21, 2013Juniper Networks, Inc.Load balancingUS8457031Jan 11, 2006Jun 4, 2013Trapeze Networks, Inc.System and method for reliable multicastUS8509128Jan 7, 2008Aug 13, 2013Trapeze Networks, Inc.High level instruction convergence functionUS8514827Feb 14, 2012Aug 20, 2013Trapeze Networks, Inc.System and network for wireless network monitoringUS8542836Dec 1, 2010Sep 24, 2013Juniper Networks, Inc.System, apparatus and methods for highly scalable continuous roaming within a wireless networkUS8635444Apr 16, 2012Jan 21, 2014Trapeze Networks, Inc.System and method for distributing keys in a wireless networkUS8638762Feb 8, 2006Jan 28, 2014Trapeze Networks, Inc.System and method for network integrityUS8670383Jan 14, 2011Mar 11, 2014Trapeze Networks, Inc.System and method for aggregation and queuing in a wireless networkUS8693482 *Jan 3, 2007Apr 8, 2014Alcatel LucentApparatus, and associated method, for facilitating multi-media service in an ethernet networkUS8818322May 11, 2007Aug 26, 2014Trapeze Networks, Inc.Untethered access point mesh system and methodUS8902904Sep 7, 2007Dec 2, 2014Trapeze Networks, Inc.Network assignment based on priorityUS8964747Feb 12, 2009Feb 24, 2015Trapeze Networks, Inc.System and method for restricting network access using forwarding databasesUS8966018Jan 6, 2010Feb 24, 2015Trapeze Networks, Inc.Automated network device configuration and network deploymentUS8978105Dec 16, 2008Mar 10, 2015Trapeze Networks, Inc.Affirming network relationships and resource access via related networksUS9025770 *Jun 28, 2007May 5, 2015Trend Micro IncorporatedDynamic encryption arrangement with a wireless device and methods thereforUS9191799Nov 10, 2006Nov 17, 2015Juniper Networks, Inc.Sharing data between wireless switches system and methodUS9258702Jun 11, 2007Feb 9, 2016Trapeze Networks, Inc.AP-local dynamic switchingUS20070189222 *Apr 5, 2007Aug 16, 2007Trapeze Networks, Inc.Station mobility between access pointsUS20080159304 *Jan 3, 2007Jul 3, 2008Alcatel LucentApparatus, and Associated Method, for Facilitating Multi-Media Service in an Ethernet NetworkUS20080159319 *Dec 28, 2006Jul 3, 2008Matthew Stuart GastSystem and method for aggregation and queuing in a wireless networkUS20090073905 *Jan 7, 2008Mar 19, 2009Trapeze Networks, Inc.High level instruction convergence functionUS20090225081 *Apr 9, 2009Sep 10, 2009Alexander KellerEfficient ray tracing without acceleration data structureUS20090287816 *Jul 11, 2008Nov 19, 2009Trapeze Networks, Inc.Link layer throughput testingUS20110119390 *Jul 31, 2008May 19, 2011Leech Phillip ASelectively re-mapping a network topologyEP2961131A1 *Jun 24, 2015Dec 30, 2015Mitel Networks CorporationElectronic communication systems and methods* Cited by examinerClassifications U.S. Classification370/329, 370/338International ClassificationH04W12/06, H04W12/08, H04L1/00, H04W4/00Cooperative ClassificationH04L63/104, H04L63/0272, H04W12/06, H04L63/08, H04W12/08European ClassificationH04L63/10C, H04W12/08Legal EventsDateCodeEventDescriptionJul 17, 2006ASAssignmentOwner name: TRAPEZE NETWORKS, INC., CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SIMONS, MICHAEL TERRY;ARAGON, DAVID BRADBURN;REEL/FRAME:018112/0555Effective date: 20060713Owner name: TRAPEZE NETWORKS, INC.,CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SIMONS, MICHAEL TERRY;ARAGON, DAVID BRADBURN;REEL/FRAME:018112/0555Effective date: 20060713Feb 25, 2010ASAssignmentOwner name: BELDEN INC.,MISSOURIFree format text: CHANGE OF NAME;ASSIGNOR:TRAPEZE NETWORKS, INC.;REEL/FRAME:023985/0751Effective date: 20091221Owner name: BELDEN INC., MISSOURIFree format text: CHANGE OF NAME;ASSIGNOR:TRAPEZE NETWORKS, INC.;REEL/FRAME:023985/0751Effective date: 20091221Oct 5, 2010CCCertificate of correctionNov 8, 2010ASAssignmentOwner name: TRAPEZE NETWORKS, INC., CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BELDEN INC.;REEL/FRAME:025327/0302Effective date: 20101108Nov 25, 2013FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services