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: 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 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 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: 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 (ƒk(?,?,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: 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 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: 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: 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: 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: 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: 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: Embodiments of the present invention relate to a system and method facilitating selection of a portfolio of computational resources for a project. The system and method may comprise determining computational resource capacity characteristics from historical usage data relating to use of a heterogeneous inventory of computational resources, the computational resource capacity characteristics comprising a trace history representative of the availability of various components of the heterogeneous inventory of computational resources at various points in time. Additionally, embodiments of the present invention may comprise calculating a plurality of finishing times for a project by performing a plurality of simulation runs based on the computational resource capacity characteristics, wherein each of the plurality of simulation runs begins at a different time in the trace history.

Abstract: A method, apparatus, and system are disclosed for determining a size of a utility date center. In one embodiment, a computer system includes a bus, a computer-readable memory coupled to the bus, and a processor coupled to the memory via the bus. The processor executes code for calculating, based on historical usage data, resource usage for a plurality of different applications of a plurality of servers in the utility data center (UDC); calculating, for each server, penalties imposed against the UDC and penalties imposed against at least one user of resources of the servers; and calculating a number of servers required to make the UDC profitable.