Abstract: A novel method that dynamically changes the contention window of access points based on system load to improve performance in a dense Wi-Fi deployment is disclosed. A key feature is that no MAC protocol changes, nor client side modifications are needed to deploy the solution. Setting an optimal contention window can lead to throughput and latency improvements up to 155%, and 50%, respectively. Furthermore, an online learning method that efficiently finds the optimal contention window with minimal training data, and yields an average improvement in throughput of 53-55% during congested periods for a real traffic-volume workload replay in a Wi-Fi test-bed is demonstrated.

Abstract: A method for predicting network-traffic bursts includes identifying, in data received by a networking device, a plurality of network-traffic bursts, each of the plurality of network-traffic bursts occurring at a respective one of plurality of burst-times {tN, tN-1, . . . , t0}. The method includes determining a time-interval ?n of a next burst occurring at ?n after burst-time t1 by determining respective values of ?n, a parameter ?, and a parameter ?, that minimize, to within a tolerance, a quantity (fk(?,?,k)?(?n?tk)) for at least three values of a integer k. Parameters and ? are, respectively, a real and imaginary part of a power-law exponent of a power law relating predicted time-interval ?n to any of the plurality of burst-times. The method includes determining, from a cumulative distribution function of a normal distribution of previously-identified network-traffic bursts, a time-duration during which the networking device may reallocate bandwidth.

Abstract: A method for predicting network-traffic bursts includes identifying, in data received by a networking device, a plurality of network-traffic bursts, each of the plurality of network-traffic bursts occurring at a respective one of plurality of burst-times {tN, tN-1, . . . , t0}. The method includes determining a time-interval ?n of a next burst occurring at ?n after burst-time t1 by determining respective values of ?n, a parameter ?, and a parameter ?, that minimize, to within a tolerance, a quantity (fk (?, ?, k)?(?n?tk)) for at least three values of a integer k. Parameters ? and ? are, respectively, a real and imaginary part of a power-law exponent of a power law relating predicted time-interval ?n to any of the plurality of burst-times. The method includes determining, from a cumulative distribution function of a normal distribution of previously-identified network-traffic bursts, a time-duration during which the networking device may reallocate bandwidth.

Abstract: Methods, systems, and devices for a quantum Internet router are described. A first network node (e.g., a quantum Internet router) may receive a command from a second network node by a digital information channel indicating a destination network node, a Bell State Measurement (BSM), and a pair of entangled particles establishing a quantum entangled channel between the first and second network nodes. The first network node may determine a third network node to forward the command based on a forwarding table and generate a second BSM based on a QSR operation and a second pair of entangled particles establishing a quantum entangled channel between the first and third network nodes. The first network node may forward, to the third network node, a command indicating the destination network node, the second BSM, and the second pair of entangled particles.

Abstract: A system and method for data collection and aggregation using a distributed network of communications enabled sensors connected to another primary network to achieve a secondary out-of-band monitoring perspective, for example, in power grids. The data collection system includes an aggregation and processing server configured to collect data from a variety of sensors adjacent to the monitored network each sensor includes secondary power such that it can continue data transmission even during power grid outages. The data collection system includes a method for secure real-time data ingest, machine learning enabled analysis, risk assessment, and anomaly detection on a broad geographic scale irrespective of isolated network boundaries.

Abstract: The present disclosure generally relates to systems, methods and software for determining an optimal burst transmission time through a modem, such as a cable modem, a wireless access point, a node in a cable network, or a satellite communication link. Particularly, the present disclosure makes it possible for a burst of queued data, defined as data above a certain percentile of a monitored traffic rate, to be transmitted by the modem at a time that provides the best chance of avoiding a collision with a co-occurring burst of data from another user connected to the same modem. In an embodiment, the systems, methods and software disclosed herein use the optimal transmission time to replace a contention window transmission time, at least for bursty data, or they completely eliminate the need for contention windows, at least for bursty data.

Abstract: The present disclosure generally relates to apparatus, software and methods for predicting future network traffic. The disclosed apparatus, software and methods alleviate congestion and/or increase overall traffic flow by providing methods for reallocating future idle capacity.

Abstract: The present disclosure generally relates to apparatus, software and methods for predicting future network traffic. The disclosed apparatus, software and methods alleviate congestion and/or increase overall traffic flow by providing methods for reallocating future idle capacity.

Abstract: An ad-hoc wireless network is implemented by a plurality of wireless access points to detect and report failure of a concurrently implemented conventional network. The wireless access points collect and store network status information of the conventional network and send the network status information to a centralized emergency manager when failure of the conventional network is detected. The ad-hoc wireless network may also provide backhaul connectivity to a wireless access point of the failed conventional network for emergency communication.

Abstract: A method for dynamic allocation of communication resources includes (1) determining a risk-return characterization of a plurality of communication resource allocations across a plurality of communication channels in a communication system, (2) selecting a first allocation of the plurality of communication resource allocations from the risk-return characterization according to at least one predetermined criterium, and (3) automatically allocating communication resources among the plurality of communication channels according to the first allocation.

Abstract: Techniques for secure linking of attributes between a first node and a plurality of nodes are provided. In one aspect, the first node and the plurality of nodes maintain a distributed data set. The techniques may include encoding the attributes as integer values at the first node. The nodes of the plurality of nodes that include matching attributes may be determined using a secure list matching protocol.

Abstract: Example implementations relate to virtualized network function (VNF) placements. For example, VNF placements may include generating an initial mapping of a plurality of VNFs among a plurality of nodes of a network infrastructure, wherein the initial VNF mapping distributes each of a plurality of service chains associated with the plurality of VNFs to different top-of-rack switches. VNF placement may include generating an alternate VNF mapping of the plurality of VNFs among a portion of the plurality of nodes, wherein the alternate VNF mapping corresponds to a metric associated with node resource utilization and a particular amount of servers utilized by distributing the plurality of service chains according to the alternate VNF mapping. VNF placement may include placing the plurality of VNFs according to a selected placement from the initial VNF mapping and the alternate VNF mapping.

Abstract: Methods, systems, and devices for network maintenance are described. A controller may receive an indication that the performance of a network device has decreased. The indication may include case identification data associated with the network device. The controller may request proactive network maintenance (PNM) data associated with the network device based on receiving the case identification data. The controller may transmit the PNM data to a machine learning (ML) engine. The ML engine may transmit, to the controller, an indication of a predetermined operation predicted to improve the performance of the network device. The controller may transmit the predetermined operation to a client device based on receiving the indication of the predetermined operation. The ML engine may receive feedback indicating whether an execution of the predetermined operation improved the performance of the network device. The ML engine may a training data set based on the feedback.

Abstract: The present disclosure generally relates to apparatus, software and methods for managing multi-channel network traffic to alleviate congestion, improve service quality and make efficient use of channel capacity. The disclosed apparatus, software and methods alleviate congestion and improve service quality by minimizing variance within a channel and/or increase overall traffic flow by minimizing the variance between channels. One or both of these objectives can be accomplished using modern portfolio theory to optimize at least one network usage parameter based on the mean and variance of the parameter(s).

Abstract: A method for predicting network-traffic bursts includes identifying, in data received by a networking device, a plurality of network-traffic bursts, each of the plurality of network-traffic bursts occurring at a respective one of plurality of burst-times {tN, tN-1, . . . , t0}. The method includes determining a time-interval ?n of a next burst occurring at ?n after burst-time t1 by determining respective values of ?n, a parameter ?, and a parameter ?, that minimize, to within a tolerance, a quantity (fk (?, ?, k)?(?n?tk)) for at least three values of a integer k. Parameters ? and ? are, respectively, a real and imaginary part of a power-law exponent of a power law relating predicted time-interval ?n to any of the plurality of burst-times. The method includes determining, from a cumulative distribution function of a normal distribution of previously-identified network-traffic bursts, a time-duration during which the networking device may reallocate bandwidth.

Abstract: A wireless communication network includes a plurality of first electronic devices configured for wireless communication, at least one second electronic device configured for wireless communication, and at least one access point configured to wirelessly receive client data from, and transmit network data to, the plurality of first electronic devices and the at least one second electronic device. The wireless communication network further includes a virtual private wireless communication sub-network that includes the plurality of first electronic devices and excludes the at least one second electronic device. The virtual private wireless communication sub-network is configured to enable each of the plurality of first electronic devices to automatically connect with the wireless communication network.

Abstract: An ad-hoc wireless network is implemented by a plurality of wireless access points to detect and report failure of a concurrently implemented conventional network. The wireless access points collect and store network status information of the conventional network and send the network status information to a centralized emergency manager when failure of the conventional network is detected. The ad-hoc wireless network may also provide backhaul connectivity to a wireless access point of the failed conventional network for emergency communication.

Abstract: A computer-implemented method, system, and non-transitory computer readable medium for device pairing for content sharing are disclosed. An encoded URL is accessed in a first device, the encoded URL associated with a second device. A content group identifier is provided to the second device. The second device is notified that content is ready to be pushed to the second device from the first device through the content group. Content is pushed from the first device to the second device through the content group.

Abstract: In one example, a system for a data visualization includes a generation engine to link data to corresponding objects within a three-dimensional (3-D) visualization of an area, a level engine to display the corresponding objects at a selected level of detail, a data engine to alter a setting of the corresponding objects upon a selection of the corresponding objects, and a simulation engine to generate a simulation of the corresponding objects within the area based on the altered setting.

Abstract: Techniques for secure linking of attributes between a first node and a plurality of nodes are provided. In one aspect, the first node and the plurality of nodes maintain a distributed data set. The techniques may include encoding the attributes as integer values at the first node. The nodes of the plurality of nodes that include matching attributes may be determined using a secure list matching protocol.