专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07746808B2 Algorithms and estimators for summarization of unaggregated data streams 失效
标题翻译：用于汇总未分类数据流的算法和估计
公开(公告)号：US07746808B2
公开(公告)日：2010-06-29
申请号：US12136725
申请日：2008-06-10
申请人： Nicholas Duffield , Edith Cohen , Haim Kaplan , Carsten Lund , Mikkel Thorup
发明人： Nicholas Duffield , Edith Cohen , Haim Kaplan , Carsten Lund , Mikkel Thorup
IPC分类号： H04L12/26
CPC分类号： H04L43/024
摘要： The invention relates to streaming algorithms useful for obtaining summaries over unaggregated packet streams and for providing unbiased estimators for characteristics, such as, the amount of traffic that belongs to a specified subpopulation of flows. Packets are sampled from a packet stream and aggregated into flows and counted by implementation of Adaptive Sample-and-Hold (ASH) or Adaptive NetFlow (ANF), adjusting the sampling rate based on a quantity of flows to obtain a sketch having a predetermined size, the sampling rate being adjusted in steps; and transferring the count of aggregated packets from SRAM to DRAM and initializing the count in SRAM following adjustment of the sampling rate.
摘要翻译：本发明涉及用于在未分组的分组流上获得摘要的用于提供用于特征的无偏估计器的流式传输算法，例如属于指定的流量子群的业务量。分组从分组流中采样并聚合成流，并通过实施自适应采样保持（ASH）或自适应净流（ANF）进行计数，根据流量调整采样率，以获得具有预定尺寸的草图采样率逐步调整; 并将汇总数据包从SRAM传输到DRAM，并在采样率调整后初始化SRAM中的计数。

2. 发明申请

US20110153554A1 Method for summarizing data in unaggregated data streams 有权
标题翻译：用于汇总未分组数据流中的数据的方法
公开(公告)号：US20110153554A1
公开(公告)日：2011-06-23
申请号：US12653831
申请日：2009-12-18
申请人： Edith Cohen , Nicholas Duffield , Haim Kaplan , Carsten Lund , Mikkel Thorup
发明人： Edith Cohen , Nicholas Duffield , Haim Kaplan , Carsten Lund , Mikkel Thorup
IPC分类号： G06F17/30
CPC分类号： H04L43/028 , H04L43/04
摘要： A method for producing a summary A of data points in an unaggregated data stream wherein the data points are in the form of weighted keys (a, w) where a is a key and w is a weight, and the summary is a sample of k keys a with adjusted weights wa. A first reservoir L includes keys having adjusted weights which are additions of weights of individual data points of included keys and a second reservoir T includes keys having adjusted weights which are each equal to a threshold value τ whose value is adjusted based upon tests of new data points arriving in the data stream. The summary combines the keys and adjusted weights of the first reservoir L with the keys and adjusted weights of the second reservoir T to form the sample representing the data stream upon which further analysis may be performed. The method proceeds by first merging new data points in the stream into the reservoir L until the reservoir contains k different keys and thereafter applying a series of tests to new arriving data points to determine what keys and weights are to be added to or removed the reservoirs L and T to provide a summary with a variance that approaches the minimum possible for aggregated data sets. The method is composable, can be applied to high speed data streams such as those found on the Internet, and can be implemented efficiently.
摘要翻译：一种用于产生未聚集数据流中的数据点的摘要A的方法，其中数据点是加权密钥（a，w）的形式，其中a是密钥，w是权重，并且摘要是k的样本键a与调整权重wa。第一储存器L包括具有调整权重的密钥，这些密钥是附加密钥的各个数据点的加权的加法，而第二储存器T包括具有调整的权重的密钥，其各自等于基于新数据的测试来调整其值的阈值τ 到达数据流的点。总结将第一储层L的密钥和调整的权重与密钥和第二储存器T的调整权重组合，以形成表示可以进行进一步分析的数据流的样本。该方法通过首先将流中的新数据点合并到储存器L中，直到储存器包含k个不同的密钥，然后对新的到达数据点应用一系列测试，以确定要添加到或移除存储器的哪些密钥和权重 L和T提供一个总结，其方差接近汇总数据集的最小可能性。该方法是可组合的，可以应用于诸如在因特网上发现的高速数据流，并且可以有效地实现。

3. 发明申请

US20100138529A1 Variance-Optimal Sampling-Based Estimation of Subset Sums 失效
标题翻译：子集合的方差最优采样估计
公开(公告)号：US20100138529A1
公开(公告)日：2010-06-03
申请号：US12325340
申请日：2008-12-01
申请人： Nicholas Duffield , Carsten Lund , Mikkel Thorup , Edith Cohen , Haim Kaplan
发明人： Nicholas Duffield , Carsten Lund , Mikkel Thorup , Edith Cohen , Haim Kaplan
IPC分类号： G06F17/18 , G06F15/16
CPC分类号： G06F17/18 , H04L41/142 , H04L43/024 , H04L43/16
摘要： The present invention relates to a method of obtaining a generic sample of an input stream. The method is designated as VAROPTk. The method comprises receiving an input stream of items arriving one at a time, and maintaining a sample S of items i. The sample S has a capacity for at most k items i. The sample S is filled with k items i. An nth item i is received. It is determined whether the nth item i should be included in sample S. If the nth item i is included in sample S, then a previously included item i is dropped from sample S. The determination is made based on weights of items without distinguishing between previously included items i and the nth item i. The determination is implemented thereby updating weights of items i in sample S. The method is repeated until no more items are received.
摘要翻译：本发明涉及一种获得输入流的通用样本的方法。该方法被指定为VAROPTk。该方法包括一次接收一个物品的输入流，并且保持项目i的样本S. 样本S具有最多k个项目i的容量。样本S填充有k个项目i。收到第n项。确定第n个项目i是否应该包含在样本S中。如果第n个项目i包括在样本S中，则先前包括的项目i从样本S中丢弃。根据项目的权重进行确定，而不区分以前包括项目i和第n项目i。由此实现确定，从而更新样本S中的项目i的权重。重复该方法，直到不再收到项目。

4. 发明申请

US20090303901A1 Algorithms and Estimators for Summarization of Unaggregated Data Streams 失效
标题翻译：用于汇总未分类数据流的算法和估计器
公开(公告)号：US20090303901A1
公开(公告)日：2009-12-10
申请号：US12136725
申请日：2008-06-10
申请人： Nicholas Duffield , Edith Cohen , Haim Kaplan , Carsten Lund , Mikkel Thorup
发明人： Nicholas Duffield , Edith Cohen , Haim Kaplan , Carsten Lund , Mikkel Thorup
IPC分类号： H04L12/26
CPC分类号： H04L43/024
摘要： The invention relates to streaming algorithms useful for obtaining summaries over unaggregated packet streams and for providing unbiased estimators for characteristics, such as, the amount of traffic that belongs to a specified subpopulation of flows. Packets are sampled from a packet stream and aggregated into flows and counted by implementation of Adaptive Sample-and-Hold (ASH) or Adaptive NetFlow (ANF), adjusting the sampling rate based on a quantity of flows to obtain a sketch having a predetermined size, the sampling rate being adjusted in steps; and transferring the count of aggregated packets from SRAM to DRAM and initializing the count in SRAM following adjustment of the sampling rate.
摘要翻译：本发明涉及用于在未分组的分组流上获得摘要的用于提供用于特征的无偏估计器的流式传输算法，例如属于指定的流量子群的业务量。分组从分组流中采样并聚合成流，并通过实施自适应采样保持（ASH）或自适应净流（ANF）进行计数，根据流量调整采样率，以获得具有预定尺寸的草图采样率逐步调整; 并将汇总数据包从SRAM传输到DRAM，并在采样率调整后初始化SRAM中的计数。

5. 发明申请

US20090303879A1 Algorithms and Estimators for Summarization of Unaggregated Data Streams 失效
标题翻译：用于汇总未分类数据流的算法和估计器
公开(公告)号：US20090303879A1
公开(公告)日：2009-12-10
申请号：US12136705
申请日：2008-06-10
申请人： Nicholas Duffield , Edith Cohen , Haim Kaplan , Carsten Lund , Mikkel Thorup
发明人： Nicholas Duffield , Edith Cohen , Haim Kaplan , Carsten Lund , Mikkel Thorup
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L43/024 , H04L43/026 , H04L43/045 , H04L47/22 , H04L47/41 , Y02D50/30
摘要： The invention relates to streaming algorithms useful for obtaining summaries over unaggregated packet streams and for providing unbiased estimators for characteristics, such as, the amount of traffic that belongs to a specified subpopulation of flows. Packets are sampled from a packet stream and aggregated into flows and counted by implementation of: (a) Adaptive Sampled NetFlow (ANF), and adjusted weight (AANF) of a flow (f) is calculated as follows: AANF(f)=i(f)/p′; i(f) being the number of packets counted for a flow f, and p′ being the sampling rate at end of a measurement period; or (b) Adaptive Sample-and-Hold (ASH), and adjusted weight (AASH) of a flow (f) is calculated as follows: AASH(f)=i(f)+(1−p′)/p′; i(f) being the number of packets counted for a flow f, and p′ being the sampling rate at end of a measurement period.
摘要翻译：本发明涉及用于在未分组的分组流上获得摘要的用于提供用于特征的无偏估计器的流式传输算法，例如属于指定的流量子群的业务量。分组从分组流中采样并聚合成流，并通过实现计算：（a）自适应采样NetFlow（ANF）和流（f）的调整权重（AANF）计算如下：AANF（f）= i （f）/ p'; i（f）是流f计数的分组数，p'是测量周期结束时的采样率; 或（b）自适应采样保持（ASH）和流（f）的调整权重（AASH）如下计算：AASH（f）= i（f）+（1-p'）/ p' ; i（f）是流f计数的分组数，p'是测量周期结束时的采样率。

6. 发明授权

US06606645B1 Method for preconnecting to a server on a network 有权
标题翻译：预先连接到网络上的服务器的方法
公开(公告)号：US06606645B1
公开(公告)日：2003-08-12
申请号：US10021459
申请日：2001-10-29
申请人： Edith Cohen , Haim Kaplan , Uri Zwick
发明人： Edith Cohen , Haim Kaplan , Uri Zwick
IPC分类号： G06F1300
CPC分类号： H04L29/06 , H04L67/02 , H04L67/10 , H04L67/14 , H04L69/329
摘要： A method is disclosed for reducing user-perceived latency due to the time required to establish a connection to a server in a network. In accordance with the present invention, an open connection is established to a set of servers, there being some probability the user will contact one of the servers in the near future. This is referred to as preconnecting or prefetching the connection. In the context of a Web client-server network, a list of likely servers can be deduced from links on a current Web page a user is looking at or from a more sophisticated analysis of the user's browsing habits. When the user requests a resource from one of the identified servers, the network connection has already been established, thereby reducing latency and improving service quality, especially for higher bandwidth clients for whom the delay is most noticeable. In contrast to conventional document prefetching, preconnecting does not hog network bandwidth or consume cache space, and hence can be used with much less scrutiny. Moreover, the technique can be implemented in Web browsers without protocol modifications or changes to Web server code.
摘要翻译：公开了一种用于由于建立到网络中的服务器的连接所需的时间而减少用户感知等待时间的方法。根据本发明，对一组服务器建立开放连接，在不久的将来用户将有可能联系其中一个服务器的概率。这被称为预连接或预取连接。在Web客户端 - 服务器网络的上下文中，可以从用户正在查看的当前网页上的链接或从用户浏览习惯的更复杂的分析中推出可能的服务器列表。当用户从所识别的服务器之一请求资源时，网络连接已经建立，从而减少延迟并提高服务质量，特别是对于延迟最明显的较高带宽客户端。与传统文档预取相反，预连接不会占用网络带宽或消耗高速缓存空间，因此可以使用较少的检查。此外，该技术可以在Web浏览器中实现，无需协议修改或对Web服务器代码的更改。

7. 发明授权

US08166047B1 Systems, devices, and/or methods for managing data 有权
标题翻译：用于管理数据的系统，设备和/或方法
公开(公告)号：US08166047B1
公开(公告)日：2012-04-24
申请号：US12186873
申请日：2008-08-06
申请人： Edith Cohen , Haim Kaplan
发明人： Edith Cohen , Haim Kaplan
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30424 , G06Q30/02
摘要： Certain exemplary embodiments can provide a method, which can comprise automatically storing and computing a sketch of a dataset that supports an automatically determined estimator of properties of a dataset. The dataset can be related to any population. For example, the dataset can comprise data flows through a network node (e.g., a router), sales data, and/or marketing data, etc. The estimator can be based upon a sketch of the dataset.
摘要翻译：某些示例性实施例可以提供一种方法，其可以包括自动存储和计算支持数据集的属性的自动确定的估计器的数据集的草图。数据集可以与任何人口有关。例如，数据集可以包括通过网络节点（例如，路由器），销售数据和/或营销数据等的数据流。估计器可以基于数据集的草图。

8. 发明授权

US08005949B2 Variance-optimal sampling-based estimation of subset sums 失效
标题翻译：基于方差最优采样的子集合估计
公开(公告)号：US08005949B2
公开(公告)日：2011-08-23
申请号：US12325340
申请日：2008-12-01
申请人： Nicholas Duffield , Carsten Lund , Mikkel Thorup , Edith Cohen , Haim Kaplan
发明人： Nicholas Duffield , Carsten Lund , Mikkel Thorup , Edith Cohen , Haim Kaplan
IPC分类号： G06F15/173
CPC分类号： G06F17/18 , H04L41/142 , H04L43/024 , H04L43/16
摘要： The present invention relates to a method of obtaining a generic sample of an input stream. The method is designated as VAROPTk. The method comprises receiving an input stream of items arriving one at a time, and maintaining a sample S of items i. The sample S has a capacity for at most k items i. The sample S is filled with k items i. An nth item i is received. It is determined whether the nth item i should be included in sample S. If the nth item i is included in sample S, then a previously included item i is dropped from sample S. The determination is made based on weights of items without distinguishing between previously included items i and the nth item i. The determination is implemented thereby updating weights of items i in sample S. The method is repeated until no more items are received.
摘要翻译：本发明涉及一种获得输入流的通用样本的方法。该方法被指定为VAROPTk。该方法包括一次接收一个物品的输入流，并且保持项目i的样本S. 样本S具有最多k个项目i的容量。样本S填充有k个项目i。收到第n项。确定第n个项目i是否应该包含在样本S中。如果第n个项目i包括在样本S中，则先前包括的项目i从样本S中丢弃。根据项目的权重进行确定，而不区分以前包括项目i和第n项目i。由此实现确定，从而更新样本S中的项目i的权重。重复该方法，直到不再收到项目。

9. 发明授权

US07764625B2 Algorithms and estimators for summarization of unaggregated data streams 失效
标题翻译：用于汇总未分类数据流的算法和估计
公开(公告)号：US07764625B2
公开(公告)日：2010-07-27
申请号：US12136705
申请日：2008-06-10
申请人： Nicholas Duffield , Edith Cohen , Haim Kaplan , Carsten Lund , Mikkel Thorup
发明人： Nicholas Duffield , Edith Cohen , Haim Kaplan , Carsten Lund , Mikkel Thorup
IPC分类号： H04L12/26
CPC分类号： H04L47/10 , H04L43/024 , H04L43/026 , H04L43/045 , H04L47/22 , H04L47/41 , Y02D50/30
摘要： The invention relates to streaming algorithms useful for obtaining summaries over unaggregated packet streams and for providing unbiased estimators for characteristics, such as, the amount of traffic that belongs to a specified subpopulation of flows. Packets are sampled from a packet stream and aggregated into flows and counted by implementation of: (a) Adaptive Sampled NetFlow (ANF), and adjusted weight (AANF) of a flow (f) is calculated as follows: AANF(f)=i(f)/p′; i(f) being the number of packets counted for a flow f, and p′ being the sampling rate at end of a measurement period; or (b) Adaptive Sample-and-Hold (ASH), and adjusted weight (AASH) of a flow (f) is calculated as follows: AASH(f)=i(f)+(1−p′)/p′; i(f) being the number of packets counted for a flow f, and p′ being the sampling rate at end of a measurement period.
摘要翻译：本发明涉及用于在未分组的分组流上获得摘要的用于提供用于特征的无偏估计器的流式传输算法，例如属于指定的流量子群的业务量。分组从分组流中采样并聚合成流，并通过实现计算：（a）自适应采样NetFlow（ANF）和流（f）的调整权重（AANF）计算如下：AANF（f）= i （f）/ p'; i（f）是流f计数的分组数，p'是测量周期结束时的采样率; 或（b）自适应采样保持（ASH）和流（f）的调整权重（AASH）如下计算：AASH（f）= i（f）+（1-p'）/ p' ; i（f）是流f计数的分组数，p'是测量周期结束时的采样率。

10. 发明申请

US20100169360A1 METHOD AND APPARATUS FOR PROCESSING OF TOP-K QUERIES FROM SAMPLES 失效
标题翻译：用于从样品处理前K个查询的方法和装置
公开(公告)号：US20100169360A1
公开(公告)日：2010-07-01
申请号：US12347474
申请日：2008-12-31
申请人： Edith Cohen , Nadav Grossaug , Haim Kaplan
发明人： Edith Cohen , Nadav Grossaug , Haim Kaplan
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G06F17/30536 , H04L41/12
摘要： A method and apparatus for processing top-k queries are disclosed. For example, the method receives a top-k query with a value for a number of samples and a value of a confidence parameter. The method samples in accordance to the number of samples, and determines a top-k weight of a sample top-k set. The method bounds the top-k weight in an interval having an upper bound and a lower bound such that the top-k weight is in the interval with a probability equal to one minus the value of the confidence parameter, and provides a response to the top-k query in accordance with the upper and lower bounds.
摘要翻译：公开了一种用于处理top-k查询的方法和装置。例如，该方法接收具有多个样本的值和置信度参数的值的top-k查询。该方法根据采样数量采样，并确定样本top-k集合的顶部k个权重。该方法限制了具有上限和下限的间隔中的top-k权重，使得top-k权重在等于1的概率等于减去置信参数的值的间隔中，并且向 top-k查询按照上下界。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式