会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Scalable methods for detecting significant traffic patterns in a data network
    • 用于检测数据网络中重要流量模式的可扩展方法
    • US07779143B2
    • 2010-08-17
    • US11770430
    • 2007-06-28
    • Tian BuJin CaoAiyou ChenPak-Ching Lee
    • Tian BuJin CaoAiyou ChenPak-Ching Lee
    • G06F15/16
    • H04L43/028H04L43/0876H04L45/745H04L49/552H04L63/1408H04L63/1458
    • Methods and apparatuses are provided for detecting traffic patterns in a data network. A sequential hashing scheme can be utilized that has D hash arrays. Each hash array i, wherein 1≦i≦D, includes Mi independent hash tables each having K buckets, with each of the buckets having an associated traffic total. Each of the keys corresponds with a single bucket of each of the Mi independent hash tables of each hash array i. The keys of the data network are partitioned into D words. As traffic is received for a key, a traffic total of each bucket that corresponds with a key is updated. The hash arrays can then be utilized to identify high traffic buckets of the independent hash tables having a traffic total greater than a threshold value. The high traffic buckets can be used to detect significant traffic patterns of the data network.
    • 提供了用于检测数据网络中的流量模式的方法和装置。 可以使用具有D个散列数组的顺序散列方案。 每个散列数组i,其中1≦̸ i≦̸ D包括每个具有K个桶的独立的独立哈希表,其中每个桶具有相关联的业务量。 每个密钥对应于每个散列数组i的每个Mi独立哈希表的单个桶。 数据网络的密钥分为D个字。 当一个密钥接收到流量时,更新与密钥对应的每个桶的流量总和。 然后可以使用散列数组来识别具有大于阈值的流量总和的独立散列表的高流量桶。 高流量桶可用于检测数据网络的重要流量模式。
    • 2. 发明申请
    • EFFICIENT PROBABILISTIC COUNTING SCHEME FOR STREAM-EXPRESSION CARDINALITIES
    • 流动表达方式的有效概念计数方案
    • US20090268623A1
    • 2009-10-29
    • US12110380
    • 2008-04-28
    • Tian BuJin CaoAiyou Chen
    • Tian BuJin CaoAiyou Chen
    • G06F11/00
    • H04L41/142H04L43/026
    • In one embodiment, a method of monitoring a network. The method includes, at each node of a fixed set, constructing a corresponding vector of M components based on data packets received at the node during a time period, M being an integer greater than 1, the fixed set being formed of some nodes of the network; and, based on the constructed vectors, estimating how many of the received data packets have been received by all of the nodes of the set or estimating how many flows of the received data packets have data packets that have passed through all of the nodes of the set. The constructing includes updating a component of the vector of one of the nodes in response to the one of the nodes receiving a data packet. The updating includes selecting the component for updating by hashing a property of the data packet received by the one of the nodes.
    • 在一个实施例中,一种监视网络的方法。 该方法包括:在固定集合的每个节点处,基于在一段时间内在节点处接收到的数据分组来构造M个分量的相应向量,M是大于1的整数,该固定集合由 网络; 并且基于所构建的向量,估计所集合的所有节点已经接收到多少接收到的数据分组,或者估计接收到的数据分组的多少流具有已经通过所有节点的数据分组 组。 所述构造包括响应于接收到数据分组的所述节点之一更新所述节点之一的向量的分量。 该更新包括通过对由该节点之一接收到的数据分组的属性进行哈希来选择用于更新的分量。
    • 4. 发明授权
    • Method and apparatus for incremental tracking of multiple quantiles
    • 多个分位数增量跟踪的方法和装置
    • US08589329B2
    • 2013-11-19
    • US12546255
    • 2009-08-24
    • Tian BuJin CaoAiyou ChenLi Li
    • Tian BuJin CaoAiyou ChenLi Li
    • G06F17/00G06F7/00G06F7/60G06Q10/00
    • G06F17/18
    • A capability for incremental tracking of multiples quantiles is provided. A method for performing an incremental quantile update using a data value of a received data record includes determining an initial distribution function, updating the initial distribution function to form a new distribution function based on the received data value, generating an approximation of the new distribution function, and determining new quantile estimates from the approximation of the new distribution function. The initial distribution function includes a plurality of initial quantile estimates and a respective plurality of initial probabilities. The new distribution function includes a plurality of quantile points identifying the respective initial quantile estimates and a respective plurality of new probabilities associated with the initial quantile estimates. The approximation of the new distribution function is generated by connecting pairs of adjacent quantile points using linear approximations of regions between the pairs of adjacent quantile points.
    • 提供了增量跟踪多个分位数的能力。 使用接收到的数据记录的数据值来执行增量分位数更新的方法包括确定初始分布函数,基于接收到的数据值更新初始分布函数以形成新的分布函数,生成新分布函数的近似值 ,并根据新分布函数的近似来确定新的分位数估计。 初始分布函数包括多个初始分位数估计和相应的多个初始概率。 新的分布函数包括多个分位点,其分别标识相应的初始分位数估计和与初始分位数估计相关联的相应多个新概率。 通过使用相邻分位点对之间的区域的线性近似来连接相邻分位点对来产生新分布函数的近似。
    • 5. 发明申请
    • METHOD AND APPARATUS FOR INCREMENTAL QUANTILE TRACKING OF MULTIPLE RECORD TYPES
    • 用于多记录类型的增量数量跟踪的方法和装置
    • US20110010337A1
    • 2011-01-13
    • US12546344
    • 2009-08-24
    • Tian BuJin CaoAiyou ChenLi Li
    • Tian BuJin CaoAiyou ChenLi Li
    • G06F17/30G06F17/10
    • G06F17/18
    • A method and apparatus are provided for incrementally tracking quantiles in the presence of multiple record types. A method for performing incremental quantile tracking includes receiving a first data record of a first record type having a first data value, determining whether a second data record of a second record type is received, determining an initial distribution function, updating the initial distribution function to form a new distribution function based on the first data value and whether a second data record is received, generating an approximation of the new distribution function, determining at least one new quantile estimate associated with at least one new probability of the new distribution function using the approximation of the new distribution function, and storing the at least one new quantile estimate and the at least one new probability associated with the at least one new quantile estimate.
    • 提供了一种用于在存在多种记录类型的情况下递增跟踪分位数的方法和装置。 一种用于执行增量分位数跟踪的方法包括接收具有第一数据值的第一记录类型的第一数据记录,确定是否接收到第二记录类型的第二数据记录,确定初始分布函数,将初始分布函数更新为 基于第一数据值形成新的分配函数,以及是否接收到第二数据记录,生成新分布函数的近似,使用所述新分布函数确定与新分布函数的至少一个新概率相关联的至少一个新的分位数估计值 并且存储至少一个新的分位数估计和与该至少一个新的分位数估计相关联的至少一个新概率。
    • 7. 发明授权
    • Efficient probabilistic counting scheme for stream-expression cardinalities
    • 流表示基数的有效概率计数方案
    • US08400933B2
    • 2013-03-19
    • US12110380
    • 2008-04-28
    • Tian BuJin CaoAiyou Chen
    • Tian BuJin CaoAiyou Chen
    • H04J1/16
    • H04L41/142H04L43/026
    • In one embodiment, a method of monitoring a network. The method includes, at each node of a fixed set, constructing a corresponding vector of M components based on data packets received at the node during a time period, M being an integer greater than 1, the fixed set being formed of some nodes of the network; and, based on the constructed vectors, estimating how many of the received data packets have been received by all of the nodes of the set or estimating how many flows of the received data packets have data packets that have passed through all of the nodes of the set. The constructing includes updating a component of the vector of one of the nodes in response to the one of the nodes receiving a data packet. The updating includes selecting the component for updating by hashing a property of the data packet received by the one of the nodes.
    • 在一个实施例中,一种监视网络的方法。 该方法包括:在固定集合的每个节点处,基于在一段时间内在节点处接收到的数据分组来构造M个分量的相应向量,M是大于1的整数,该固定集合由 网络; 并且基于所构建的向量,估计所集合的所有节点已经接收到多少接收到的数据分组,或者估计接收到的数据分组的多少流具有已经通过所有节点的数据分组 组。 所述构造包括响应于接收到数据分组的所述节点之一更新所述节点之一的向量的分量。 该更新包括通过对由该节点之一接收到的数据分组的属性进行哈希来选择用于更新的分量。
    • 8. 发明申请
    • METHOD AND APPARATUS FOR INCREMENTAL TRACKING OF MULTIPLE QUANTILES
    • 用于增量跟踪多个量子的方法和装置
    • US20110010327A1
    • 2011-01-13
    • US12546255
    • 2009-08-24
    • Tian BuJin CaoAiyou ChenLi Li
    • Tian BuJin CaoAiyou ChenLi Li
    • G06N5/02
    • G06F17/18
    • A method and apparatus for incremental tracking of multiples quantiles is provided. A method for performing an incremental quantile update using a data value of a received data record includes determining an initial distribution function, updating the initial distribution function to form a new distribution function based on the received data value, generating an approximation of the new distribution function, and determining new quantile estimates from the approximation of the new distribution function. The initial distribution function includes a plurality of initial quantile estimates and a respective plurality of initial probabilities. The initial distribution function is updated to form the new distribution function based on the received data value. The new distribution function includes a plurality of quantile points identifying the respective initial quantile estimates and a respective plurality of new probabilities associated with the respective initial quantile estimates. The approximation of the new distribution function is generated by, for each pair of adjacent quantile points in the new distribution function, connecting the adjacent quantile points using a linear approximation of a region between the adjacent quantile points. The new quantile estimates and the new probabilities associated with the new quantile estimates may then be stored.
    • 提供了一种用于增量跟踪多个分位数的方法和装置。 使用接收到的数据记录的数据值来执行增量分位数更新的方法包括确定初始分布函数,基于所接收的数据值更新初始分布函数以形成新的分布函数,生成新分布函数的近似值 ,并根据新分布函数的近似来确定新的分位数估计。 初始分布函数包括多个初始分位数估计和相应的多个初始概率。 基于收到的数据值更新初始分配函数以形成新的分布函数。 新的分布函数包括多个分位点,其识别相应的初始分位数估计以及与各自的初始分位数估计相关联的相应的多个新概率。 新分布函数的近似由新分布函数中的每对相邻分位数点产生,使用相邻分位点之间的区域的线性近似来连接相邻的分位数点。 然后可以存储新的分位数估计值和与新分位数估计值相关联的新概率。
    • 9. 发明申请
    • SCALABLE METHODS FOR DETECTING SIGNIFICANT TRAFFIC PATTERNS IN A DATA NETWORK
    • 用于检测数据网络中重要交通模式的可扩展方法
    • US20090006607A1
    • 2009-01-01
    • US11770430
    • 2007-06-28
    • Tian BuJin CaoAiyou ChenPak-Ching Lee
    • Tian BuJin CaoAiyou ChenPak-Ching Lee
    • G06F15/173G06F17/30
    • H04L43/028H04L43/0876H04L45/745H04L49/552H04L63/1408H04L63/1458
    • Methods and apparatuses are provided for detecting traffic patterns in a data network. A sequential hashing scheme can be utilized that has D hash arrays. Each hash array i, wherein 1≦i≦D, includes Mi independent hash tables each having K buckets, with each of the buckets having an associated traffic total. Each of the keys corresponds with a single bucket of each of the Mi independent hash tables of each hash array i. The keys of the data network are partitioned into D words. As traffic is received for a key, a traffic total of each bucket that corresponds with a key is updated. The hash arrays can then be utilized to identify high traffic buckets of the independent hash tables having a traffic total greater than a threshold value. The high traffic buckets can be used to detect significant traffic patterns of the data network.
    • 提供了用于检测数据网络中的流量模式的方法和装置。 可以使用具有D个散列数组的顺序散列方案。 每个散列数组i,其中1 <= i <= D,包括各自具有K个桶的独立于Mi的哈希表,其中每个桶具有相关联的业务量。 每个密钥对应于每个散列数组i的每个Mi独立哈希表的单个桶。 数据网络的密钥分为D个字。 当一个密钥接收到流量时,更新与密钥对应的每个桶的流量总和。 然后可以使用散列数组来识别具有大于阈值的流量总和的独立散列表的高流量桶。 高流量桶可用于检测数据网络的重要流量模式。
    • 10. 发明申请
    • System and method for estimating network tomography
    • 网络断层扫描的系统和方法
    • US20070091937A1
    • 2007-04-26
    • US11256122
    • 2005-10-21
    • Tian BuJin CaoAiyou Chen
    • Tian BuJin CaoAiyou Chen
    • H04J3/06
    • H04L41/00H04L43/0852
    • There is provided a system and method for estimating network tomography. More specifically, there is provided a computer system configured to measure the transmission delay along a path from a source endpoint of a computer network to a plurality of destination endpoints of the computer network, wherein the path includes at least two data links and wherein at least one of the data links is shared by the plurality of destination endpoints for transmissions from the source endpoint, to calculate a characteristic function of the measured transmission delay, and to calculate a performance parameter of one of the data links based on the characteristic function.
    • 提供了一种用于估计网络层析成像的系统和方法。 更具体地,提供了一种被配置为测量沿着从计算机网络的源端点到计算机网络的多个目的地端点的路径的传输延迟的计算机系统,其中该路径包括至少两个数据链路,并且其中至少 数据链接中的一个由多个目的地端点共享用于来自源端点的传输,以计算所测量的传输延迟的特征函数,并且基于特征函数来计算数据链路之一的性能参数。