Abstract: Aspects of the subject disclosure are directed towards retrieving advertisements relevant to application content based upon keywords extracted from the application content. In one aspect, a client-side component scrapes application page content to obtain keywords and feature-based weights for those keywords. The keywords are sent to an advertisement server, which returns an advertisement based upon one or more of the keywords. Also described is the hashing of keywords before sending to the advertisement server to protect client privacy, and the use of a Bloom filter to avoid sending keywords to the advertisement server that do not correspond to (e.g., popular) advertisement keywords.

Abstract: Methods and systems for reducing network usage of a computing device are provided herein. The method includes receiving a network call relating to a network transfer from an application at an application programming interface of the computing device. The method also includes determining whether the network transfer is relevant to a current state of the application and procrastinating the network transfer if it is not relevant to the current state of the application.

Abstract: Methods and systems for dynamically providing application analytic information are provided herein. The method includes inserting instrumentation points into an application file via an application analytic service and dynamically determining desired instrumentation points from which to collect application analytic data. The method also includes receiving, at the application analytic service, the application analytic data corresponding to the desired instrumentation points and analyzing the application analytic data to generate application analytic information. The method further includes sending the application analytic information to a client computing device.

Abstract: The claimed subject matter provides a method for operating a sleep management service. The method include identifying a set of guardians based on a local state for each of a plurality of compute nodes. The method also includes sending a wake request to all sleeping compute nodes in the identified set. The method further includes sending a request to become a guardian to all compute nodes in the identified set. Additionally, the method includes stopping a current guardian from being a guardian if the current guardian is less suitable than a threshold number of current guardians.

Abstract: The subject disclosure is directed towards configuring and controlling wireless flyways (e.g., communication links between server racks provisioned on demand in a data center) to operate efficiently and without interfering with one another. Control and flyway selection may be based upon steered antenna directionality, channel, location in the data center, transmit power, and measured and/or predicted (estimated) network traffic. Flyways also may be used to route indirect traffic to reduce traffic on a bottleneck (e.g., wired) link. A payload may be sent over a over a wireless flyway with acknowledgment via a wired backchannel so that wireless communication is in one direction. The lack of interference and communication in one direction facilitates flyway operation without a backoff function and/or without clear channel assessment.

Abstract: A method is provided, wherein the method comprises identifying nearby wireless communication access points (APs) to which a client computing environment can cooperate with to communicate and receive data through a subscription to a neighborcast group from indentified nearby cooperating access points such that illustratively the neighborcast group comprises a communications overlay between cooperating client computing environments employing the identified nearby wireless communications access points.

Abstract: A method is provided, wherein the method comprises identifying nearby wireless communication access points (APs) to which a client computing environment can cooperate with to communicate and receive data through a subscription to a neighborcast group from indentified nearby cooperating access points such that illustratively the neighborcast group comprises a communications overlay between cooperating client computing environments employing the identified nearby wireless communications access points.

Abstract: Systems and methods for routing packets by nodes in an ad hoc network in accordance with a link quality source routing protocol are disclosed. Route discovery, route maintenance, and metric maintenance are designed to propagate and keep current link quality measurements. Metric maintenance includes a reactive approach for links that a node is currently using to route packets, and a proactive mechanism for all links. Nodes are configured to include a send buffer, a maintenance buffer, a request table, link quality metric modules, and preferably a neighbor cache and a link cache. The invention allows for asymmetric links in the network. The invention may be implemented within a virtual protocol interlayer between the link and network layers. The invention may employ any particular link quality metrics, including metrics based on probing techniques as well as metrics based on knowledge gained in other ways.

Abstract: A system and method for using a wireless beacon broadcast to provide a media message is disclosed. A first beacon broadcast is provided from a wireless access point, the first beacon broadcast having a first beacon component with a first portion of media. A second beacon broadcast is provided from the wireless access point, the second beacon broadcast having a second beacon component with a second portion of media. The first portion of media and the second portion of media are combinable to provide a complete media message.

Abstract: An invention is disclosed whereby a wireless network node, equipped with two or more radio transceivers statically tuned to non-interfering frequency channels, can make decisions regarding which channel to use when communicating with a neighboring wireless node. A multi-radio unification protocol implemented in a wireless node coordinates the use of multiple wireless network interface cards and provides a virtual layer that hides the multiple physical network interfaces from higher layers of a node's network protocol stack. The invention is applicable to wireless networks generally, including those in which some nodes do not have multiple radios or do not recognize the multi-radio unification protocol. The invention makes possible simultaneous transmissions using available channels, thereby reducing interference and delay while increasing the overall capacity of the network.

Abstract: Implementation of opportunistic use of stations in a wireless network as repeaters is described. In one implementation, a station detects the existence of rate anomaly in a wireless network. In response to the rate anomaly, the station may transform into a software repeater for certain other neighboring stations. The repeater function allows for the relaying of packets sent by these neighboring stations to the access point and vice versa. The other neighboring stations, owing to their relative proximity to the repeater station, transmit data at a higher rate to the repeater station. Thus, the removal of the slower stations reduces clogging of the access point and increases the overall data rate within the wireless network. Further, a zero-overhead network coding protocol may be implemented in conjunction with the repeater function to increase capacity of the wireless network.

Abstract: Described herein is an implementation that reduces the battery consumption of an energy-constrained computing device that is capable of communicating over a wireless network. As conditions and circumstances warrant, the implementation selects one of multiple radios (e.g., two)—with each having a unique combination of characteristics (in terms of power-consumption, data-rate, range and/or frequency band of operation) for wireless communications to and from a wireless device. The implementation selects one radio to minimize power-consumption while maintaining effective wireless data communication. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Abstract: Wireless communication techniques are described in which control and data are separated. In an implementation, a method is described which includes sending data packets on one or more wireless channels and sending control data relating to the data packets on at least one other wireless channel having a data rate that is lower than a data rate of the one or more wireless channels.

Abstract: Disclosed is a general model and method for computing performance bounds in multi-hop wireless networks. Rather than focusing on computing asymptotic performance bounds under assumptions of homogeneity or randomness in the network topology and/or workload, the present invention accommodates any given network, technology, interference model, routing paradigm, and workload. Using a conflict graph to formally characterize the impact of wireless interference on the performance of multi-hop wireless networks, methods for computing upper and lower bounds on the capacity of a given wireless network are detailed. Besides computing network capacity, the model and method disclosed can also enable or benefit other applications including maximizing fairness and minimizing maximum link utilization.

Abstract: A new system and method of available bandwidth estimation applies even where the narrow link and tight link in a network path are in different locations. In embodiments of the invention, a unique packet probe series structure and processing is employed to estimate available bandwidth. In an embodiment of the invention, the spacing between probe packets is adjusted at the source to account for dilation caused by links leading to the tight link, so that the spacing is appropriate when the probes arrive at the tight link. Moreover, the multi-packet probe comprises a large packet followed by two much smaller packets. The large packet is then dropped once it has traversed the tight link. The two small packets, which are impacted little by subsequent narrow links, preserve the spacing set by the tight link, encoding the delay induced by the tight link, all the way to the destination.

Abstract: Disclosed is a Neighbor Location Discovery Protocol (NLDP) that determines the relative locations of the nodes in a mesh network. In one embodiment, NLDP can be implemented for an ad-hoc wireless network where the nodes are equipped with directional antennas and are not able to use GPS. While NLDP relies on nodes having at least two RF transceivers, it offers significant advantages over previously proposed protocols that employ only one RF transceiver. In NLDP antenna hardware is simple, easy to implement, and readily available. Further, NLDP exploits the host node's ability to operate simultaneously over non-overlapping channels to quickly converge on the neighbor's location. NLDP is limited by the range of the control channel, which operates in a omni-directional fashion. However, by choosing a low frequency band, high power, and low data rate, the range of the control channel can be increased to match the range on the data channel.

Abstract: Measurement systems according to embodiments of the invention allow accurate bandwidth estimation even in non-FIFO scheduling and frame-level contention environments. In an embodiment of the invention, the approximate fraction of time that a link is idle is found by probing for idle periods (“gaps”). The fraction of idle time is then multiplied by the capacity to obtain an estimate of the available bandwidth. Gap time is estimated in an embodiment of the invention fraction by gathering samples of one-way delay (OWD) over the link in question. After the OWD is normalized and plotted, the knee in the cumulative distribution function (CDF) of OWD samples is used to identify the fraction of time that the channel is idle.

Abstract: End hosts share network performance and reliability information with their peers over a peer-to-peer network. The aggregated information from multiple end hosts is shared in the peer-to-peer network in order for each end host to process the aggregated information so as to profile network performance. A set of attributes defines hierarchies associated with end hosts and their network connectivity. Information on the network performance and failures experienced by end hosts is then aggregated along these hierarchies, to identify patterns (e.g., shared attributes) that are indicative of the source of the problem. In some cases, such sharing of information also enables end hosts to resolve problems by themselves.

Abstract: An invention is disclosed whereby a wireless network node, equipped with two or more radio transceivers statically tuned to non-interfering frequency channels, can make decisions regarding which channel to use when communicating with a neighboring wireless node. A multi-radio unification protocol implemented in a wireless node coordinates the use of multiple wireless network interface cards and provides a virtual layer that hides the multiple physical network interfaces from higher layers of a node's network protocol stack. The invention is applicable to wireless networks generally, including those in which some nodes do not have multiple radios or do not recognize the multi-radio unification protocol. The invention makes possible simultaneous transmissions using available channels, thereby reducing interference and delay while increasing the overall capacity of the network.

Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel.