Patent application number | Description | Published |
20110176418 | ADAPTIVE TRAFFIC MANAGEMENT VIA ANALYTICS BASED VOLUME REDUCTION - A method of managing traffic over a communication link between a transmitting node and a receiving node is provided herein. The method includes: determining momentary traffic shaping constraints; accumulating incoming messages at the transmitting node into a data queue, based on the momentary traffic shaping constraints; transmitting the messages from the data queue to the receiving node over the communication link based on the momentary traffic shaping constraints; estimating a desired amount of data that needs to be discarded from messages in the data queue, based on: (a) the size of the data queue and (b) the momentary traffic shaping constraints; sorting data in the data queue by an order of importance, based on analytic objects; discarding, based on the analytic objects, the desired amount of data from the messages in the queued data, such that the discarded data is ranked lowest by the order of importance. | 07-21-2011 |
20110181437 | DATA REDUCTION IN A MULTI-NODE SYSTEM - An advanced metering infrastructure comprises intermediate nodes. The intermediate nodes receive data from child nodes and relay a subset of the data that is not according to an expected value. The expected value may be determined based on a forecasting function computed based on past data. The expected value may be a spatial shape in an n-dimension space. A data not within the spatial shape may be considered not in accordance with the expected value. In some case, the spatial shape is defined by a centroid and a radius. The spatial shape may shift over time based on a consumption profile, such as low consumption at noon, and high consumption at evening. The consumption profiles may be determined in a learning phase, as well as shifting of spatial shapes of each group over time. | 07-28-2011 |
20110184676 | DATA REDUCTION IN A MULTI-NODE SYSTEM - An advanced metering infrastructure comprises intermediate nodes. The intermediate nodes receive data from child nodes and aggregate the data according to groups of child nodes. The aggregation provides for a reduced version of the data. The reduction is performed based on groups determined by clustering. The reduced version of the data comprises data describing a group of measurements over time, such as a centroid in an n-dimension space, number of customers in the group, radius of the group and the like. The centroid may shift over time based on a consumption profile, such as low consumption at noon, and high consumption at evening. The consumption profiles may be determined in a learning phase, as well as shifting of centroids of each group over time. | 07-28-2011 |
20110185079 | ACHIEVING DISTRIBUTED FLOW CONTROL VIA DATA CONFLATION - A distributed method that combines both flow control and smart volume reduction means in a communication network is provided herein. The stages of the method are applied by each node in the network in a distributed way, which adapts to the evolving state of the system. The operations performed by each node in the network are adapted dynamically in a way that adjusts itself to the changes that occur in various parameters of the network. Such parameters include both local node state and also the state of different nodes in the distributed infrastructure. The state of the nodes is characterized by parameters such as transmission rates, available buffer space and the state of data in buffer. The stages are carried out in parallel by the nodes and ordered such that the equality of the data flowing in the network, in terms of delay and specified attributes, is maximized. | 07-28-2011 |
20120300627 | APPLYING QUALITY AWARE VOLUME REDUCTION TO COMMUNICATION NETWORKS - A method of applying a quality-aware volume reduction to communication networks is provided herein. The method includes the following stages: deriving, from the network: a bandwidth capacity limit of the links of the network, and an initial flow rate for each flow transmitted via nodes through the network; obtaining from each one of the nodes, a gain value which corresponds to a quantitative data demand requested by the node and given in terms of data quality; and calculating, for each one of the nodes, a data reduction ratio, that achieves: (i) a maximal overall revenue associated with the network, wherein the revenue for a node is calculated with respect to the quality of the data that arrives to the node, and (ii) an optimal bandwidth allocation over the links with respect to the gains and the data quality at each node, and to the limited bandwidth capacity of the links. | 11-29-2012 |
20130176851 | DYNAMIC FLOW CONTROL IN MULTICAST SYSTEMS - Machines, systems and methods for enhancing performance in a multicasting system, the method comprising monitoring flow rates in a multicasting system as system characteristics change over time, wherein the multicasting system is operating based on a first mapping between a plurality of data flows and multicasting groups, wherein data is disseminated by way of the mapping to subscribers to one or more of the data flows; decreasing flow rate thresholds of satisfied flows so as to minimize the difference between the flow rate thresholds and respective target transmission rates of the satisfied flows, as the system's feasible data transmission workload is maintained with respect to subscriber reception rate capacities; and increasing flow rate thresholds of unsatisfied flows so as to minimize the difference between the flow rate threshold and respective target transmission rates for the unsatisfied flows. | 07-11-2013 |
20130176855 | DYNAMIC MAPPING IN A MULTICASTING ENVIRONMENT - Enhancing performance in a multicasting system comprising monitoring filtering costs in a multicasting system as system characteristics change over time, wherein the multicasting system is operating based on a first mapping, between a plurality of data flows and multicasting groups, to disseminate data to users that subscribe to one or more of the data flows; computing a second mapping in response to determining that overhead associated with filtering of unwanted flows at the user level has exceeded a threshold; and transitioning the multicasting system from using the first mapping to using the second mapping, in response to determining that the second mapping is feasible as applicable to one or more constraints associated with the multicasting system. | 07-11-2013 |
20130279327 | Locating Traffic Reduction Utilities in Communication Networks - A method of locating traffic reduction entities in a communication network, optionally where at least one reduction entity is located within each network path which allows traffic flow between endpoints and central stations. The method comprises assigning a plurality of allocation cost values each estimating cost of locating of one of a plurality of traffic reduction entities on one of a plurality of intermediate nodes of a communication network, calculating a plurality of excess load cost values each calculated according to excess load cost between two adjacent intermediate nodes of the plurality of intermediate nodes, identifying a node set selected from the plurality of intermediate nodes using a target function based on the plurality of cost values and the plurality of excess load cost values, and outputting instructions for locating the plurality of traffic reduction entities on the communication network according to the node set. | 10-24-2013 |
20140156811 | Object Oriented Networks - An approach is provided in which a system creates a network application model that includes network policy objects and connection rules corresponding to sending data between the network policy objects. The system converts the network application model to network configuration information, which links the network policy objects to the connection rules. In turn, a network control plane is configured based upon the network configuration information to map the network application model to a physical infrastructure. | 06-05-2014 |
20140156814 | Object Oriented Networks - An approach is provided in which a system creates a network application model that includes network policy objects and connection rules corresponding to sending data between the network policy objects. The system converts the network application model to network configuration information, which links the network policy objects to the connection rules. In turn, a network control plane is configured based upon the network configuration information to map the network application model to a physical infrastructure. | 06-05-2014 |
20150040121 | Bandwidth Control in Multi-Tenant Virtual Networks - Machines, systems and methods for managing quality of service (QoS) in a multi-tenant virtualized computing environment, the method comprising: collecting transmission rate statistics associated with data communicated in a virtual network, wherein at least one virtual switch monitors communications initiated by at least a virtual machine (VM) executed on a host machine serviced by the virtual switch; determining, by way of the virtual switch, profile parameters associated with a first communication initiated by the VM belonging to at least a first group, wherein a connection request is submitted by the virtual switch to a traffic controller to assist in establishing the first communication; classifying the connection request for establishing the first communication according to the profile parameters associated with the first communication; determining a first aggregated transmission rate associated with the VM that initiated the first communication based on the classifying. | 02-05-2015 |