会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Locating traffic reduction utilities in communication networks
    • 在通信网络中查找流量减少实用程序
    • US08797851B2
    • 2014-08-05
    • US13449328
    • 2012-04-18
    • Liane Lewin-EytanJoseph Naor
    • Liane Lewin-EytanJoseph Naor
    • G01R31/08
    • H04L47/10H04L45/125
    • 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.
    • 一种在通信网络中定位业务量减少实体的方法,可选地,其中至少一个减少实体位于允许端点和中心站之间的业务流的每个网络路径内。 该方法包括:分配多个分配成本值,每个分配成本值估计在通信网络的多个中间节点之一上的多个业务量减少实体中的一个的定位成本,计算多个根据超量计算的超额负载成本值 在所述多个中间节点的两个相邻中间节点之间的负载成本,基于所述多个成本值和所述多个成本值以及所述多个过剩负载成本值,使用目标函数来识别从所述多个中间节点中选择的节点集合,以及输出用于定位的指令 所述通信网络上的所述多个业务量减少实体根据所述节点集合。
    • 2. 发明申请
    • Locating Traffic Reduction Utilities in Communication Networks
    • 查找通信网络中的流量减少实用程序
    • US20130279327A1
    • 2013-10-24
    • US13449328
    • 2012-04-18
    • Liane Lewin-EytanJoseph Naor
    • Liane Lewin-EytanJoseph Naor
    • H04L12/56
    • H04L47/10H04L45/125
    • 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.
    • 一种在通信网络中定位业务量减少实体的方法,可选地,其中至少一个减少实体位于允许端点和中心站之间的业务流的每个网络路径内。 该方法包括:分配多个分配成本值,每个分配成本值估计在通信网络的多个中间节点之一上的多个业务量减少实体中的一个的定位成本,计算多个根据超量计算的超额负载成本值 在所述多个中间节点的两个相邻中间节点之间的负载成本,基于所述多个成本值和所述多个成本值以及所述多个过剩负载成本值,使用目标函数来识别从所述多个中间节点中选择的节点集合,以及输出用于定位的指令 所述通信网络上的所述多个业务量减少实体根据所述节点集合。
    • 7. 发明授权
    • Adaptive traffic management via analytics based volume reduction
    • 通过基于分析的量减少的自适应流量管理
    • US08797864B2
    • 2014-08-05
    • US13008918
    • 2011-01-19
    • Gidon GershinskyLiane Lewin-EytanKonstantin Shagin
    • Gidon GershinskyLiane Lewin-EytanKonstantin Shagin
    • H04L12/56
    • H04L47/22H04L47/12H04L47/32
    • 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.
    • 本文提供了一种在发送节点和接收节点之间的通信链路上管理业务的方法。 该方法包括:确定瞬时流量整形约束; 基于瞬时流量整形约束将发送节点处的进入消息累加到数据队列中; 基于瞬时流量整形约束,通过通信链路将消息从数据队列发送到接收节点; 基于:(a)数据队列的大小和(b)瞬时流量整形约束,从数据队列中的消息估计需要丢弃的数据量; 基于分析对象,按照重要性顺序对数据队列中的数据进行排序; 基于分析对象,从排队数据中的消息中丢弃期望的数据量,使得丢弃的数据按重要程度排列最低。
    • 9. 发明申请
    • APPLYING QUALITY AWARE VOLUME REDUCTION TO COMMUNICATION NETWORKS
    • 将质量注意量减少到通信网络
    • US20120300627A1
    • 2012-11-29
    • US13114075
    • 2011-05-24
    • Miriam AllaloufGidon GershinskyLiane Lewin-Eytan
    • Miriam AllaloufGidon GershinskyLiane Lewin-Eytan
    • H04L12/26
    • H04L41/145H04L41/0823H04L41/0826H04L41/083H04L41/0896H04L47/762Y04S40/162
    • 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.
    • 本文提供了将质量感知体积减小应用于通信网络的方法。 该方法包括:从网络导出网络链路的带宽容量限制,以及通过网络通过节点传输的每个流的初始流速; 从每个节点获得对应于节点请求的定量数据需求并且根据数据质量给出的增益值; 以及为每个所述节点计算数据缩减比率,其实现:(i)与所述网络相关联的最大总收入,其中针对到达所述节点的数据的质量来计算节点的收入 节点,以及(ii)关于每个节点处的增益和数据质量的链路上的最佳带宽分配以及链路的有限带宽容量。