Airtime-based packet scheduling for wireless networks

Information

  • Patent Grant
  • 9867167
  • Patent Number
    9,867,167
  • Date Filed
    Monday, August 22, 2016
    8 years ago
  • Date Issued
    Tuesday, January 9, 2018
    6 years ago
Abstract
Airtime usage may be used as a factor in controlling network traffic flow to and from client devices via a wireless network interface. Received packets or other data are assigned to a quality of service profile. Additionally, a cost value for communicating the received data is determined at least in part based on an actual or estimated airtime usage for the received packet. The cost value is used to allocate wireless network airtime to data. The allocation of wireless network airtime may be varied dynamically based on operating conditions. The cost value may be based on factors including the airtime used to communicate data; whether the data is a retransmission; and wireless network overhead. The cost value of data may also be different depending on whether the data is being sent from a client device or to a client device.
Description
BACKGROUND

This application is related to the field of wireless networking devices, and in particular to systems and methods for controlling network traffic to and from clients. Networking devices enable data communications between two or more devices, referred to generally as clients. Data communications may be conducted over wired and/or wireless network interfaces. Typically, data is partitioned into packets, which are then communicated via one or more networking devices to one or more destination clients.


Networking devices may handle packets generated by and directed to large numbers of clients over the same interface. The bandwidth or data communications capacity of networking devices limits the amount of data or the rate of network packets passing through network devices. The limits on bandwidth are particularly acute in network devices including wireless network interfaces. If the bandwidth limit of a networking device is reached or exceeded by its client's network traffic, packets may be delayed or dropped. Depending on the type of data being communicated over the network, these traffic disruptions caused by reaching or exceeding bandwidth limit of a networking device may adversely affect the performance of applications on a client. For example, clients receiving voice or streaming video data may be adversely affected by even small delays or losses of packets.


Because of the limits on network device bandwidth, many network devices include quality of service (QoS) functionality. Quality of service functionality allows network administrators to provide different priority for packets or other network data based on factors such as the associated client, user, client application, or data flow. Typically, users, clients, or applications are assigned to different quality of service profiles. Each quality of service profile specifies a quality of service parameters to associated packets or other network data. Networking devices use the scheduling weights to prioritize packet traffic and potentially guarantee a minimum level of performance to some or all of the network data flows.


However, typical quality of service functionality does not take into consideration performance issues unique to wireless network interfaces. For example, many wireless network interfaces support multiple wireless networking standards, such as IEEE 802.11a, 802.11b, 802.11g, and 802.11n. This allows the networking device to support legacy clients using slower (e.g. relatively low data-rate) standards, such as 802.11b, as well as newer clients capable of communicating via faster (e.g. relatively high data-rate) standards, such as 802.11n. When a networking device is operating in a mixed mode and communicating with clients via multiple standards, the clients using slower data rates, such as clients using older standards or newer standards at lower data rates, for example due to lower signal strength or radio interference, will consume a disproportionate amount of airtime from the wireless network interface. As a result of this disproportionate airtime usage, the performance of other clients attempting to utilize faster data rates will be degraded substantially.


SUMMARY

An embodiment of the invention includes airtime usage as a factor in controlling network traffic flow to and from client devices via a wireless network interface. In an embodiment, packets or other data received via a wired or wireless network interface and directed to a client device or received from a client via a wireless network interface are assigned to a quality of service profile. Additionally, a cost value for communicating the packet or other data is determined at least in part based on an actual or estimated airtime usage for the packet to be communicated to or from the client via a wireless network interface. The cost value is used to allocate wireless network airtime to clients. In a further embodiment, the consumption of wireless network airtime may be varied dynamically based on operating conditions.


In an embodiment, the cost value may be based on factors including the actual or estimated airtime used to communicate the packet via the wireless network interface; whether the packet or other data is a retransmission of a previous packet or other data; and actual or estimated wireless network overhead. The cost value of a packet may also be different depending on whether the packet is being sent from a client device or to a client device.


In an embodiment, a token bucket scheduling system is used to allocate wireless network bandwidth based on received packets' cost values and token balances associated with quality of service profiles. In a further embodiment, packets or other data received from a client device via a wireless network interface may be dropped or discarded if a queue associated with a quality of service is full.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a flowchart of an example of a method of scheduling downlink network traffic according to an embodiment of the invention.



FIG. 2 illustrates a diagram of an example computer system suitable for implementing an embodiment of the invention.





DETAILED DESCRIPTION


FIG. 1 illustrates a flowchart 100 of an example of a method of scheduling downlink network traffic according to an embodiment of the invention. In this application, downlink network traffic refers to network traffic received by a network device via a wired or wireless network connection and directed to a client device via a wireless network connection. In step 105, a packet or other type of network data is received by a network device. In an embodiment, the packet is directed to a client device in direct or indirect communication with the network device via a wireless network connection. For example, the network device may be adapted to communicate the packet directly to the client device via a wireless network connection or to one or more additional network devices via the wireless network connection, which in turn communicate the packet to the client device via a wired or wireless network connection.


Step 110 determines a quality of service profile to be associated with the received packet. Embodiments of step 110 may assign a quality of service profile to packets based on the packet source, the packet destination, a user identity or user class associated with the packet source and/or packet destination, the contents or control data associated with a packet, a source or client application associated with a packet, and/or a data flow associated with the packet. The set of quality of service profiles may be specified by network administrators. As described in detail below, each quality of service profile is assigned a scheduling weight and a scheduling mode used to prioritize packets. In further embodiments, a quality of service profile may include a per-user rate limit.


Step 115 determines a token cost for the received packet based on factors including an estimated airtime for the packet and the quality of service profile. In an embodiment, packets are assigned a cost value, referred to as a token cost. The token cost represents the relative amount of network performance consumed by communicating the associated packet towards the intended destination by the network device.


Embodiments of step 115 take into account at least an estimated packet airtime to determine the token cost of the received packet. In an embodiment, step 115 estimates the airtime to communicate the received packet from the network device to the client based on the airtime required by previous packets to the same client, similar clients, and/or clients assigned to the same quality of service profile. For example, a running average of the airtime consumed by one or more of the most-recently sent packets to the same client may be used to determine at least a portion of the estimated packet airtime for the currently received packet.


In a further embodiment, the average airtime of recently sent packets is weighted or divided by their respective packet sizes to determine an average airtime consumed per data unit, such as average airtime consumed per byte. This average airtime consumed per data unit may then be scaled or weighted according the size of the received packet to determine at least a portion of the estimated airtime for the currently received packet. This enables the token cost of a packet to increase with the packet size, as larger packets consume more network bandwidth.


In addition to estimating the airtime consumed in transmitting the packet, an embodiment of step 115 may also include other factors in determining the token cost of a packet. The token cost or total estimated airtime may include an estimated airtime for transmitting a packet to the client, the actual, estimated, or prorated airtime used for retransmitting packets that were previously unsuccessfully transmitted, and/or some or all of the network overhead.


Optional decision block 117 may determine if the packet is associated with a critical quality of service profile. In an embodiment, users, user groups, and/or the types of applications associated with a packet may be assigned to a critical quality of service profile if any delay in forwarding the packet is unacceptable. For example, packets from voice-over IP (VOIP) and live video applications may be assigned to a critical quality of service profile. If a packet is associated with a critical quality of service profile, method 100 proceeds directly from decision block 117 to step 130 to forward the packet to its destination. However, as described in detail below, step 130 may deduct the token cost of this critical packet from a token bucket associated with the application, user group, or individual user. This has the effect of potentially limiting the airtime of any future non-critical packets from the same application, user group, or user.


Step 120 determines a token balance of a token bucket associated with the selected quality of service profile. In an embodiment, each quality of service profile is associated with its own token bucket. A token bucket is a data structure including a token balance value. The token balance value represents the unused proportion of the network bandwidth assigned to a quality of service profile. Token costs and token balance values may be expressed in arbitrary units.


In an embodiment, the token balance value of each token bucket is periodically increased or incremented, representing additional network bandwidth allocated to the associated quality of service profile for a period of time. In an embodiment, a scheduling weight associated with a quality of service profile is used to determine the rate or amount by which the token balance value of the token bucket is increased. For example, the token balance value of a token bucket associated with a higher priority quality of service profile may be incremented more frequently and/or by larger amounts. This has the effect of allocating more network bandwidth to packets associated with the high priority quality of service profile. In an alternate embodiment, each token bucket has its token balance value incremented by the same amount and at the same frequency.


In further embodiments, the range of the token balance value of each token bucket may be limited between a maximum token balance value and/or a minimum token balance value. The token increment value, token balance incrementing rate, and the minimum and maximum token balance limits of each token bucket may be specified based on the associated quality of service profile and optionally one or more other quality of service profiles. In a further embodiment, the token increment value, token balance incrementing rate, the minimum and maximum token balance limits of each token bucket, or any other factor affecting the allocation of wireless networking airtime may be dynamically specified based on the performance of the wireless network interface.


Decision block 125 compares the token cost of the received packet with the token balance value of the associated token bucket. If the token cost of the received packet is less than the token balance of the token bucket corresponding with the assigned quality of service profile, then method 100 proceeds to step 130.


Step 130 deducts the token cost from the token balance of the associated token bucket and forwards the packet to the client via the wireless network interface. By deducting the token cost from the token balance of the token bucket, the token balance reflects the relative proportion of the wireless network interface's bandwidth that has been used by the assigned quality of service profile. The packet may be communicated to the client device using any wireless networking standard or technique known in the art. In a further embodiment, the network device may communicate with multiple clients using different wireless networking standards or techniques, depending on the client capabilities and/or operating conditions. Following step 130, flowchart 100 optionally proceeds back to step 105 to await the receipt of another packet directed to the same or a different client.


In a further embodiment, step 130 deducts the token cost from the token balance value of the associated token bucket in two phases. First, step 130 deducts the token cost based at least partly on an estimated airtime for the received packet. Step 130 then forwards the packet to the client device via the wireless network interface. Additionally, step 130 monitors the transmission of this packet towards the client to determine its actual airtime usage. Step 130 then uses this actual airtime usage to determine a revised token cost for the received packet. Step 130 then subtracts the difference between the revised token cost and the original token cost of the packet from the token balance value of the token bucket. This adjustment may increase or decrease the token balance value of the token bucket, depending on whether the actual airtime usage of the packet is less than or greater than the estimated airtime, respectively.


Returning to decision block 125, if the token cost of the received packet is greater than the token balance of the token bucket corresponding with the assigned quality of service profile, then method 100 proceeds to step 135. Step 135 queues the received packet associated with this quality of service profile until the token balance of its associated token bucket is increased. Following the increase of the token balance of the token bucket associated with the quality of service profile assigned to the received packet, an embodiment of method 100 proceeds back to step 120. Steps 120, 125, and step 135 may be repeated one or more times until the token cost of the queued packet is less than the token balance of the token bucket. In an embodiment, while a packet is queued in step 135, other packets may be received and processed according to flowchart 100.


Although described with reference to downlink network traffic from a network device to a client device, embodiments of the method of flowchart 100 may also be applied to scheduling uplink network traffic from a client device to a network device via a wireless network interface. In this embodiment, the method of flowchart 100 operates in a similar manner as described above. However, the actual airtime of the received uplink packet is already known, eliminating the need to use an estimated airtime to determine at least part of the token cost.


As described above, a packet may be assigned to a critical quality of service profile if any delay in forwarding the packet is unacceptable. In an embodiment, step 130 deducts the token cost of these packets from the token balance of the associated token bucket, similar to other packets associated with non-critical quality of service profiles. However, because packets assigned to critical quality of service profiles bypass steps 120, 125, and 135, the token balance of a token bucket may become negative due to packets in critical quality of service profiles. In an embodiment, a negative token balance will not block further communications of packets associated with critical quality of service profiles. However, other packets associated with the same token bucket, such as packets for the same user, user group, and/or application, will be queued until the token balance of the token bucket increases. In a further embodiment, a token bucket may have a negative limit. When the token balance reaches the negative limit, packets associated with this token bucket may be dropped.


Although the flowchart 100 includes token costs and token buckets for controlling network traffic based at least in part on airtime usage, embodiments of the invention can include airtime usage as a factor controlling network traffic using any other network traffic shaping, bandwidth throttling, rate limiting, or quality of service technique known in the art.



FIG. 2 illustrates a diagram 2000 of an example computer system suitable for implementing an embodiment of the invention. FIG. 2 is a block diagram of a computer system, such as a personal computer or other digital device, suitable for practicing an embodiment of the invention. Embodiments of computer system may include dedicated networking devices, such as wireless access points, network switches, hubs, routers, hardware firewalls, network traffic optimizers and accelerators, network attached storage devices, and combinations thereof.


The diagram 2000 includes a central processing unit (CPU) 2005 for running software applications and optionally an operating system. CPU 2005 may be comprised of one or more processing cores. Memory 2010 stores applications and data for use by the CPU 2005. Examples of memory 2010 include dynamic and static random access memory. Storage 2015 provides non-volatile storage for applications and data and may include fixed or removable hard disk drives, flash memory devices, ROM memory, and CD-ROM, DVD-ROM, Blu-ray, HD-DVD, or other magnetic, optical, or solid state storage devices.


Optional user input devices 2020 communicate user inputs from one or more users to the computer system 2000, examples of which may include keyboards, mice, joysticks, digitizer tablets, touch pads, touch screens, still or video cameras, and/or microphones. In an embodiment, user input devices may be omitted and the computer system may present a user interface to a user over a network, for example using a web page or network management protocol and network management software applications.


The diagram 2000 includes one or more network interfaces 2025 that allow computer system to communicate with other computer systems via an electronic communications network, and may include wired or wireless communication over local area networks and wide area networks such as the Internet. The computer system may support a variety of networking protocols at one or more levels of abstraction. For example, the computer system may support networking protocols at one or more layers of the seven layer OSI network model. An embodiment of network interface 2025 includes one or more wireless network interfaces adapted to communicate with wireless clients and with other wireless networking devices using radio waves, for example using the 802.11 family of protocols, such as 802.11a, 802.11b, 802.11g, and 802.11n.


An embodiment of the computer system of the diagram 2000 may also include a wired networking interface, such as one or more Ethernet connections to communicate with other networking devices via local or wide-area networks. In a further embodiment, the computer system may be capable of receiving some or all of its required electrical power via the network interface 2025, for example using a wired networking interface power over Ethernet system.


The components of the computer system of the diagram 2000, including CPU 2005, memory 2010, data storage 2015, user input devices 2020, and network interface 2025 are connected via one or more data buses 2060. Additionally, some or all of the components of the computer system, including CPU 2005, memory 2010, data storage 2015, user input devices 2020, and network interface 2025 may be integrated together into one or more integrated circuits or integrated circuit packages. Furthermore, some or all of the components of the diagram 2000 may be implemented as application specific integrated circuits (ASICS) and/or programmable logic.


A power supply 2030 provides electrical power to the computer system of the diagram 2000. Power supply 2030 may be adapted to draw electrical power from a connection with an electrical power distribution grid. In an embodiment, power supply 2030 is connected with network interface 2025 to draw electrical power for the computer system from one or more wired network connections using a network power standard, such as IEEE 802.3af.


Further embodiments can be envisioned to one of ordinary skill in the art after reading the attached documents. For example, embodiments of the invention can be used with any number of network connections and may be added to any type of power supply in addition to the stacked network power supply illustrated above. In other embodiments, combinations or sub-combinations of the above disclosed invention can be advantageously made. The block diagrams of the architecture and flow charts are grouped for ease of understanding. However it should be understood that combinations of blocks, additions of new blocks, re-arrangement of blocks, and the like are contemplated in alternative embodiments of the present invention.


The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. It will, however, be evident that various modifications and changes may be made thereunto without departing from the broader spirit and scope of the invention as set forth in the claims.

Claims
  • 1. A method comprising: receiving a data packet as part of network traffic of a network destined for a wireless device accessing the network through a wireless connection;identifying airtimes to transmit previously sent data packets;applying airtimes to transmit the previously sent data packets to corresponding data sizes of the previously sent data packets to determine an average airtime consumed per data unit of data packet size;determining an estimated airtime for transmitting the data packet to the wireless device through the wireless connection by applying the average time consumed per data unit to a data size of the data packet;identifying a token cost of transmitting the data packet, the token cost based on a size of the data packet and the estimated airtime;selecting a quality of service profile associated with the data packet;determining a token balance of the quality of service profile associated with the data packet, the token balance being an amount of network bandwidth of the network allocated to the quality of service profile;comparing the token cost of transmitting the data packet with the token balance of the quality of service profile to determine if the token cost is less than the token balance;if it is determined that the token cost is less than the token balance, forwarding the data packet to the wireless device;if it is determined that the token cost is greater than the token balance, refraining from forwarding the data packet to the wireless device by queuing the data packet into a queue.
  • 2. The method of claim 1, wherein the quality of service profile is selected based on an identification of a user associated with the wireless device.
  • 3. The method of claim 1, wherein the quality of service profile is selected based on a client application associated with the data packet.
  • 4. The method of claim 1, wherein the quality of service profile is selected based on a source of the data packet.
  • 5. The method of claim 1, wherein the estimated airtime for transmitting the data packet to the wireless device is determined based on airtimes to previously send data packets to the wireless device.
  • 6. The method of claim 1, wherein the estimated airtime for transmitting the data packet to the wireless device is determined based on airtimes to previously send data packets to other wireless devices in the quality of service profile.
  • 7. The method of claim 1, further comprising: determining if the token balance has reached a negative limit;if it is determined that the token balance has reached the negative limit, dropping the data packet from queue.
  • 8. The method of claim 1, further comprising: checking the token balance to determine if the token balance has increased above the token cost;if it is determined that the token balance has increased above the token cost, removing the data packet from the queue and forwarding the data packet to the wireless device.
  • 9. The method of claim 1, wherein the estimated airtime is determined, at least in part, from an airtime to retransmit the data packet to the wireless device if an initial transmission of the data packet to the wireless device fails.
  • 10. A system comprising: a processor;memory storing instructions configured to instruct the processor to:receive a data packet as part of network traffic of a network destined for a wireless device accessing the network through a wireless connection;identifying airtimes to transmit previously sent data packets;applying airtimes to transmit the previously sent data packets to corresponding data sizes of the previously sent data packets to determine an average airtime consumed per data unit of data packet size;determining an estimated airtime for transmitting the data packet to the wireless device through the wireless connection by applying the average time consumed per data unit to a data size of the data packet;identify a token cost of transmitting the data packet, the token cost based on a size of the data packet and the estimated airtime;select a quality of service profile associated with the data packet;determine a token balance of the quality of service profile associated with the data packet, the token balance being an amount of network bandwidth of the network allocated to the quality of service profile;compare the token cost of transmitting the data packet with the token balance of the quality of service profile to determine if the token cost is less than the token balance;forward the data packet to the wireless device, if it is determined that the token cost is less than the token balance;refrain from forwarding the data packet to the wireless device by queuing the data packet into a queue, if it is determined that the token cost is greater than the token balance.
  • 11. The system of claim 10, wherein the quality of service profile is selected based on an identification of a user associated with the wireless device.
  • 12. The system of claim 10, wherein the quality of service profile is selected based on a client application associated with the data packet.
  • 13. The system of claim 10, wherein the quality of service profile is selected based on a source of the data packet.
  • 14. The system of claim 10, wherein the estimated airtime for transmitting the data packet to the wireless device is determined based on airtimes to previously send data packets to the wireless device.
  • 15. The system of claim 10, wherein the estimated airtime for transmitting the data packet to the wireless device is determined based on airtimes to previously send data packets to other wireless devices in the quality of service profile.
  • 16. The system of claim 10, wherein the instructions are further configured to instruct the processor to: determine if the token balance has reached a negative limit;drop the data packet from queue, if it is determined that the token balance has reached the negative limit.
  • 17. The system of claim 10, wherein the instructions are further configured to instruct the processor to: check the token balance to determine if the token balance has increased above the token cost;remove the data packet from the queue and forward the data packet to the wireless device, if it is determined that the token balance has increased above the token cost.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/250,294, filed on Apr. 10, 2014, which is a continuation of U.S. patent application Ser. No. 13/938,159, filed on Jul. 9, 2013, now U.S. Pat. No. 8,730,931, which is a continuation of U.S. patent application Ser. No. 12/356,886, filed on Jan. 21, 2009, now U.S. Pat. No. 8,483,194, all of which are incorporated by reference.

US Referenced Citations (236)
Number Name Date Kind
5471671 Wang et al. Nov 1995 A
5697059 Carney Dec 1997 A
5726984 Kubler et al. Mar 1998 A
5956643 Benveniste Sep 1999 A
6061799 Eldridge et al. May 2000 A
6112092 Benveniste Aug 2000 A
6154655 Borst et al. Nov 2000 A
6201792 Lahat Mar 2001 B1
6314294 Benveniste Nov 2001 B1
6473413 Chiou et al. Oct 2002 B1
6496699 Benveniste Dec 2002 B2
6519461 Andersson et al. Feb 2003 B1
6628623 Noy Sep 2003 B1
6628938 Rachabathuni et al. Sep 2003 B1
6636498 Leung Oct 2003 B1
6775549 Benveniste Aug 2004 B2
6865393 Baum et al. Mar 2005 B1
6957067 Iyer et al. Oct 2005 B1
7002943 Bhagwat et al. Feb 2006 B2
7057566 Theobold Jun 2006 B2
7085224 Oran Aug 2006 B1
7085241 O'Neill et al. Aug 2006 B1
7130629 Leung et al. Oct 2006 B1
7154874 Bhagwat et al. Dec 2006 B2
7164667 Rayment et al. Jan 2007 B2
7174170 Steer et al. Feb 2007 B2
7177646 O'Neill et al. Feb 2007 B2
7181530 Halasz et al. Feb 2007 B1
7216365 Bhagwat et al. May 2007 B2
7224697 Banerjea et al. May 2007 B2
7251238 Joshi et al. Jul 2007 B2
7336670 Calhoun Feb 2008 B1
7339914 Bhagwat et al. Mar 2008 B2
7346338 Calhoun et al. Mar 2008 B1
7366894 Kalimuthu et al. Apr 2008 B1
7370362 Olson et al. May 2008 B2
7440434 Chaskar et al. Oct 2008 B2
7512379 Nguyen Mar 2009 B2
7536723 Bhagwat et al. May 2009 B1
7562384 Huang Jul 2009 B1
7593356 Friday et al. Sep 2009 B1
7656822 AbdelAziz et al. Feb 2010 B1
7706789 Qi et al. Apr 2010 B2
7716370 Devarapalli May 2010 B1
7751393 Chaskar et al. Jul 2010 B2
7768952 Lee Aug 2010 B2
7793104 Zheng et al. Sep 2010 B2
7804808 Bhagwat et al. Sep 2010 B2
7843907 Abou-Emara et al. Nov 2010 B1
7844057 Meier et al. Nov 2010 B2
7856209 Rawat Dec 2010 B1
7921185 Chawla et al. Apr 2011 B2
7949342 Cuffaro et al. May 2011 B2
7961725 Nagarajan et al. Jun 2011 B2
7970894 Patwardhan Jun 2011 B1
8000308 Dietrich et al. Aug 2011 B2
8069483 Matlock Nov 2011 B1
8219688 Wang Jul 2012 B2
8249606 Neophytou et al. Aug 2012 B1
8493918 Karaoguz et al. Jul 2013 B2
8789191 Bhagwat et al. Jul 2014 B2
8824448 Narayana et al. Sep 2014 B1
8948046 Kang et al. Feb 2015 B2
9003527 Bhagwat et al. Apr 2015 B2
20010006508 Pankaj et al. Jul 2001 A1
20020012320 Ogier et al. Jan 2002 A1
20020021689 Robbins et al. Feb 2002 A1
20020071422 Amicangioli Jun 2002 A1
20020091813 Lamberton et al. Jul 2002 A1
20020116463 Hart Aug 2002 A1
20020128984 Mehta et al. Sep 2002 A1
20030005100 Barnard et al. Jan 2003 A1
20030039212 Lloyd et al. Feb 2003 A1
20030087629 Juitt May 2003 A1
20030104814 Gwon et al. Jun 2003 A1
20030129988 Lee et al. Jul 2003 A1
20030145091 Peng et al. Jul 2003 A1
20030179742 Ogier et al. Sep 2003 A1
20040003285 Whelan et al. Jan 2004 A1
20040013118 Borella Jan 2004 A1
20040022222 Clisham Feb 2004 A1
20040054774 Barber et al. Mar 2004 A1
20040064467 Kola et al. Apr 2004 A1
20040077341 Chandranmenon et al. Apr 2004 A1
20040103282 Meier et al. May 2004 A1
20040109466 Van Ackere et al. Jun 2004 A1
20040162037 Shpak Aug 2004 A1
20040185876 Groenendaal et al. Sep 2004 A1
20040192312 Li et al. Sep 2004 A1
20040196977 Johnson et al. Oct 2004 A1
20040236939 Watanabe et al. Nov 2004 A1
20040255028 Chu et al. Dec 2004 A1
20050053003 Cain et al. Mar 2005 A1
20050074015 Chari et al. Apr 2005 A1
20050099983 Nakamura et al. May 2005 A1
20050122946 Won Jun 2005 A1
20050154774 Giaffreda et al. Jul 2005 A1
20050207417 Ogawa et al. Sep 2005 A1
20050259682 Yosef et al. Nov 2005 A1
20050262266 Wiberg et al. Nov 2005 A1
20050265288 Liu et al. Dec 2005 A1
20050266848 Kim Dec 2005 A1
20060010250 Eisl et al. Jan 2006 A1
20060013179 Yamane Jan 2006 A1
20060026289 Lyndersay et al. Feb 2006 A1
20060062250 Payne, III Mar 2006 A1
20060107050 Shih May 2006 A1
20060117018 Christiansen et al. Jun 2006 A1
20060140123 Conner et al. Jun 2006 A1
20060146748 Ng et al. Jul 2006 A1
20060146846 Yarvis et al. Jul 2006 A1
20060165015 Melick et al. Jul 2006 A1
20060187949 Seshan et al. Aug 2006 A1
20060221920 Gopalakrishnan et al. Oct 2006 A1
20060233128 Sood et al. Oct 2006 A1
20060234701 Wang et al. Oct 2006 A1
20060245442 Srikrishna et al. Nov 2006 A1
20060251256 Asokan et al. Nov 2006 A1
20060268802 Faccin Nov 2006 A1
20060294246 Stieglitz et al. Dec 2006 A1
20070004394 Chu et al. Jan 2007 A1
20070010231 Du Jan 2007 A1
20070025274 Rahman et al. Feb 2007 A1
20070025298 Jung Feb 2007 A1
20070049323 Wang et al. Mar 2007 A1
20070077937 Ramakrishnan et al. Apr 2007 A1
20070078663 Grace Apr 2007 A1
20070082656 Stieglitz et al. Apr 2007 A1
20070087756 Hoffberg Apr 2007 A1
20070091859 Sethi et al. Apr 2007 A1
20070115847 Strutt et al. May 2007 A1
20070116011 Lim et al. May 2007 A1
20070121947 Sood et al. May 2007 A1
20070133407 Choi et al. Jun 2007 A1
20070140191 Kojima Jun 2007 A1
20070150720 Oh et al. Jun 2007 A1
20070153741 Blanchette et al. Jul 2007 A1
20070156804 Mo Jul 2007 A1
20070160017 Meier et al. Jul 2007 A1
20070171885 Bhagwat et al. Jul 2007 A1
20070192862 Vermeulen et al. Aug 2007 A1
20070195761 Tatar et al. Aug 2007 A1
20070247303 Payton Oct 2007 A1
20070249324 Jou et al. Oct 2007 A1
20070263532 Mirtorabi et al. Nov 2007 A1
20070280481 Eastlake et al. Dec 2007 A1
20070288997 Meier et al. Dec 2007 A1
20080002642 Borkar et al. Jan 2008 A1
20080022392 Karpati et al. Jan 2008 A1
20080037552 Dos Remedios et al. Feb 2008 A1
20080080369 Sumioka Apr 2008 A1
20080080377 Sasaki et al. Apr 2008 A1
20080090575 Barak et al. Apr 2008 A1
20080095094 Innami Apr 2008 A1
20080095163 Chen et al. Apr 2008 A1
20080107027 Allan et al. May 2008 A1
20080109879 Bhagwat et al. May 2008 A1
20080130495 Dos Remedios et al. Jun 2008 A1
20080146240 Trudeau Jun 2008 A1
20080151751 Ponnuswamy Jun 2008 A1
20080159128 Shaffer Jul 2008 A1
20080170527 Lundsgaard et al. Jul 2008 A1
20080194271 Bedekar et al. Aug 2008 A1
20080207215 Chu et al. Aug 2008 A1
20080212562 Bedekar et al. Sep 2008 A1
20080219286 Ji et al. Sep 2008 A1
20080225857 Lange Sep 2008 A1
20080229095 Kalimuthu et al. Sep 2008 A1
20080240128 Elrod Oct 2008 A1
20080253370 Cremin et al. Oct 2008 A1
20080273520 Kim et al. Nov 2008 A1
20080279161 Stirbu et al. Nov 2008 A1
20090019521 Vasudevan Jan 2009 A1
20090028052 Strater et al. Jan 2009 A1
20090040989 da Costa et al. Feb 2009 A1
20090043901 Mizikovsky et al. Feb 2009 A1
20090082025 Song Mar 2009 A1
20090088152 Orlassino Apr 2009 A1
20090097436 Vasudevan et al. Apr 2009 A1
20090111468 Burgess et al. Apr 2009 A1
20090113018 Thomson et al. Apr 2009 A1
20090141692 Kasslin et al. Jun 2009 A1
20090144740 Gao Jun 2009 A1
20090168645 Tester et al. Jul 2009 A1
20090172151 Davis Jul 2009 A1
20090197597 Kotecha Aug 2009 A1
20090207806 Makela et al. Aug 2009 A1
20090239531 Andreasen et al. Sep 2009 A1
20090240789 Dandabany Sep 2009 A1
20090247170 Balasubramanian et al. Oct 2009 A1
20090303883 Kucharczyk et al. Dec 2009 A1
20090310557 Shinozaki Dec 2009 A1
20100046368 Kaempfer et al. Feb 2010 A1
20100057930 DeHaan Mar 2010 A1
20100067379 Zhao et al. Mar 2010 A1
20100112540 Gross et al. May 2010 A1
20100115278 Shen et al. May 2010 A1
20100115576 Hale et al. May 2010 A1
20100132040 Bhagwat et al. May 2010 A1
20100208614 Harmatos Aug 2010 A1
20100228843 Ok et al. Sep 2010 A1
20100240313 Kawai Sep 2010 A1
20100254316 Sendrowicz Oct 2010 A1
20100260091 Seok Oct 2010 A1
20100290397 Narayana et al. Nov 2010 A1
20100304738 Lim et al. Dec 2010 A1
20100311420 Reza et al. Dec 2010 A1
20100322217 Jin et al. Dec 2010 A1
20100325720 Etchegoyen Dec 2010 A1
20110004913 Nagarajan et al. Jan 2011 A1
20110040867 Kalbag Feb 2011 A1
20110051677 Jetcheva et al. Mar 2011 A1
20110055326 Michaelis et al. Mar 2011 A1
20110055928 Brindza Mar 2011 A1
20110058524 Hart et al. Mar 2011 A1
20110064065 Nakajima et al. Mar 2011 A1
20110085464 Nordmark et al. Apr 2011 A1
20110182225 Song et al. Jul 2011 A1
20110185231 Balestrieri et al. Jul 2011 A1
20110258641 Armstrong et al. Oct 2011 A1
20110292897 Wu et al. Dec 2011 A1
20120014386 Xiong et al. Jan 2012 A1
20120290650 Montuno et al. Nov 2012 A1
20130003729 Raman et al. Jan 2013 A1
20130003739 Raman et al. Jan 2013 A1
20130003747 Raman et al. Jan 2013 A1
20130028158 Lee et al. Jan 2013 A1
20130059570 Hara et al. Mar 2013 A1
20130086403 Jenne et al. Apr 2013 A1
20130103833 Ringland et al. Apr 2013 A1
20130227306 Santos et al. Aug 2013 A1
20130230020 Backes Sep 2013 A1
20130250811 Vasseur et al. Sep 2013 A1
20140269327 Fulknier et al. Sep 2014 A1
20140298467 Bhagwat et al. Oct 2014 A1
20150120864 Unnimadhavan et al. Apr 2015 A1
Foreign Referenced Citations (8)
Number Date Country
0940999 Sep 1999 EP
1732276 Dec 2006 EP
1771026 Apr 2007 EP
1490773 Jan 2013 EP
0059251 Oct 2000 WO
2004042971 May 2004 WO
2006129287 Dec 2006 WO
2009141016 Nov 2009 WO
Non-Patent Literature Citations (13)
Entry
Chirumamilla, Mohan K. et al., “Agent Based Intrustion Detection and Response System for Wireless LANs,” CSE Conference and Workshop Papers, Paper 64, Jan. 1, 2003.
Clausen, T., et al., “Optimized Link State Routing Protocol (OLSR),” Network Working Group, pp. 1-71, Oct. 2003.
Craiger, J. Philip, “802.11, 802.1x, and Wireless Security,” SANS Institute InfoSec Reading Room, Jun. 23, 2002.
Finlayson, Ross et al., “A Reverse Address Resolution Protocol,” Nework Working Group, Request for Comments: 303 (RFC 903), Jun. 1984.
He, Changhua et al., “Analysis of the 802.11i 4-Way Handshake,” Proceedings of the 3rd ACM Workshop on Wireless Security, pp. 43-50, Oct. 2004.
Lee, Jae Woo et al, “z2z: Discovering Zeroconf Services Beyond Local Link,” 2007 IEEE Globecom Workshops, pp. 1-7, Nov. 26, 2007.
Perkins, C., et al., “Ad hoc On-Demand Distance Vector (AODV) Routing,” Network Working Group, pp. 1-35, Oct. 2003.
Wu, Haitao et al., “Layer 2.5 SoftMAC: End-System Based Media Streaming Support on Home Networks,” IEEE Global Telecommunications Conference (GLOBECOM '05), vol. 1, pp. 235-239, Nov. 2005.
European Patent Application No. 11823931.8, Search Report dated Aug. 29, 2016.
European Patent Application No. 12879114.2, Search Report dated Jan. 21, 2016.
International Application No. PCT/US2008/061674, International Search Report and Written Opinion dated Oct. 14, 2008.
International Application No. PCT/US2011/047591, International Search Report and Written Opinion dated Dec. 19, 2011.
International Application No. PCT/US2012/059093, International Search Report and Written Opinion dated Jan. 4, 2013.
Related Publications (1)
Number Date Country
20160359751 A1 Dec 2016 US
Continuations (3)
Number Date Country
Parent 14250294 Apr 2014 US
Child 15243720 US
Parent 13938159 Jul 2013 US
Child 14250294 US
Parent 12356886 Jan 2009 US
Child 13938159 US