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

1. 发明授权

US08028050B2 Restoration for virtual private networks 有权
标题翻译：虚拟专用网络的恢复
公开(公告)号：US08028050B2
公开(公告)日：2011-09-27
申请号：US10462215
申请日：2003-06-13
申请人： Giuseppe F. Italiano , Rajeev Rastogi , Bulent Yener
发明人： Giuseppe F. Italiano , Rajeev Rastogi , Bulent Yener
IPC分类号： G06F15/177 , G06F15/173
CPC分类号： H04L63/0272 , H04L12/4641 , H04L45/22 , H04L45/28 , H04L45/48
摘要： Restoration is provided in a communication system having two or more VPN endpoints coupled together through a network comprising a number of nodes interconnected through edges. VPN endpoints coupled through the network are adapted to communicate through a single connection with multiple other VPN endpoints. The single connection may be a VPN hose connection. A restoration topology, comprising backup edges corresponding to primary edges in the network, is determined for the network. A given primary edge is replaced with one or more backup edges if the given primary edge fails. A graph may represent the network and a tree may represent the connections in the network for VPNs connecting the VPN endpoints. The graph can be reduced to a second graph by determining shortest paths between each node in the tree and creating the backup edges from the shortest paths. The second graph can be reduced to a third graph by adding additional backup edges from tree nodes having non-tree edges to least common ancestor nodes. The third graph can be used to create a two-edge connected tree.
摘要翻译：在具有通过包括通过边缘互连的多个节点的网络的网络耦合在一起的两个或更多个VPN端点的通信系统中提供恢复。通过网络耦合的VPN端点适于通过与多个其他VPN端点的单个连接进行通信。单个连接可能是VPN软件连接。为网络确定包括与网络中的主边缘相对应的备份边缘的恢复拓扑。如果给定的主边缘发生故障，给定的主边缘将被一个或多个备用边替换。图表可以表示网络，并且树可以表示网络中连接VPN端点的VPN的连接。通过确定树中每个节点之间的最短路径并从最短路径创建备份边，可将图形简化为第二个图。通过从具有非树形边缘的树节点向最不常见的祖先节点添加额外的备份边，可以将第二个图形简化为第三个图形。第三个图可用于创建一个双边连接的树。

2. 发明授权

US08010121B2 Channel allocation for wireless mesh networks 有权
标题翻译：无线网状网络的信道分配
公开(公告)号：US08010121B2
公开(公告)日：2011-08-30
申请号：US11797562
申请日：2007-05-04
申请人： Partha Dutta , Sharad Jaiswal , Rajeev Rastogi
发明人： Partha Dutta , Sharad Jaiswal , Rajeev Rastogi
IPC分类号： H04W4/00
CPC分类号： H04W84/18 , H04W16/28 , H04W72/04
摘要： An example embodiment includes determining a cut of a graph to obtain a bi-partite sub-graph, where the graph represents a plurality of nodes and links between the plurality of nodes in a wireless mesh network. A channel is assigned to the bi-partite graph, and the obtained bi-partite subgraph is removed from the graph. The determining, assigning and removing steps are repeated until the graph has been divided into k bi-partite subgraphs, where k is the number of channels being used for scheduling.
摘要翻译：示例实施例包括确定图形的切割以获得双分子图，其中图表示无线网状网络中的多个节点之间的多个节点和链路。将通道分配给双分图，并从图中除去获得的双分子图。重复确定，分配和删除步骤，直到该图被划分为k个双分子子图，其中k是用于调度的信道数。

3. 发明申请

US20080159316A1 Channel allocation for wireless mesh networks 有权
标题翻译：无线网状网络的信道分配
公开(公告)号：US20080159316A1
公开(公告)日：2008-07-03
申请号：US11797562
申请日：2007-05-04
申请人： Partha Dutta , Sharad Jaiswal , Rajeev Rastogi
发明人： Partha Dutta , Sharad Jaiswal , Rajeev Rastogi
IPC分类号： H04L12/28
CPC分类号： H04W84/18 , H04W16/28 , H04W72/04
摘要： An example embodiment includes determining a cut of a graph to obtain a bi-partite sub-graph, where the graph represents a plurality of nodes and links between the plurality of nodes in a wireless mesh network. A channel is assigned to the bi-partite graph, and the obtained bi-partite subgraph is removed from the graph. The determining, assigning and removing steps are repeated until the graph has been divided into k bipartite subgraphs, where k is the number of channels being used for scheduling.
摘要翻译：示例实施例包括确定图形的切割以获得双分子图，其中图表示无线网状网络中的多个节点之间的多个节点和链路。将通道分配给双分图，并从图中除去获得的双分子图。重复确定，分配和删除步骤，直到图被划分为k个二分图，其中k是用于调度的信道数。

4. 发明申请

US20080059439A1 Query Translation from XPath to SQL in the Presence of Recursive DTDs 审中-公开
标题翻译：在递归DTD的存在下，从XPath到SQL的查询翻译
公开(公告)号：US20080059439A1
公开(公告)日：2008-03-06
申请号：US11468533
申请日：2006-08-30
申请人： Wenfei Fan , Rajeev Rastogi
发明人： Wenfei Fan , Rajeev Rastogi
IPC分类号： G06F17/30
CPC分类号： G06F17/2205 , G06F16/8358 , G06F16/86 , G06F17/2229 , G06F17/2247
摘要： The invention provides a system and method for translating XPATH queries into SQL queries with a simple least fixpoint (LFP) operator, which is already supported by most commercial RDBMS. The method comprises the steps of (a) rewriting an input query into a regular query, which is capable of capturing both DTD recursion and XPATH queries in a uniform framework; and (b) translating the regular query to an SQL query with LFP. The invention further provides optimization techniques for reducing the use of the LFP operator. As a result, the invention is capable of answering a large class of XPATH queries by means of only low-end RDBMS features already available in most RDBMS.
摘要翻译：本发明提供了一种用于将 XPATH 查询转换为 SQL 查询的系统和方法，该查询具有简单的最低修正点（ LFP ）运算符，它已被最商业的 RDBMS 。该方法包括以下步骤：（a）将输入查询重写为常规查询，其能够在统一框架中捕获 DTD 递归和 XPATH 查询; 和（b）使用 LFP 将常规查询转换为 SQL 查询。本发明还提供了用于减少 LFP 运算符的使用的优化技术。因此，本发明能够通过仅在大多数 RDBMS中已经提供的低端 RDBMS 功能来回答大量 XPATH 查询。

5. 发明授权

US07328220B2 Sketch-based multi-query processing over data streams 有权
标题翻译：基于草图的数据流多查询处理
公开(公告)号：US07328220B2
公开(公告)日：2008-02-05
申请号：US11025211
申请日：2004-12-29
申请人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
发明人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
IPC分类号： G06F17/00
CPC分类号： G06F17/30516 , G06F17/3046 , Y10S707/99936 , Y10S707/99942
摘要： A method of efficiently providing estimated answers to workloads of aggregate, multi-join SQL-like queries over a number of input data-streams. The method only examines each data elements once and uses a limited amount of computer memory. The method uses join graphs and atomic sketches that are essentially pseudo-random summaries formed using random binary variables. The estimated answer is the product of all the atomic sketches for all the vertices in the query join graph. A query workload is processed efficiently by identifying and sharing atomic sketches common to distinct queries, while ensuring that the join graphs remain well formed. The method may automatically minimize either the average query error or the maximum query error over the workload.
摘要翻译：一种有效提供对多个输入数据流的聚合，多连接SQL类查询的工作负载的估计答案的方法。该方法仅检查每个数据元素一次并使用有限数量的计算机存储器。该方法使用连接图和原子素描，它们本质上是使用随机二进制变量形成的伪随机摘要。估计答案是查询连接图中所有顶点的所有原子草图的乘积。通过识别和共享不同查询共同的原子草图，同时确保连接图形式保持良好，可以有效地处理查询工作负载。该方法可以自动最小化平均查询错误或工作负载上的最大查询错误。

6. 发明申请

US20070136285A1 Method and apparatus for globally approximating quantiles in a distributed monitoring environment 有权
标题翻译：用于在分布式监控环境中全局近似分位数的方法和装置
公开(公告)号：US20070136285A1
公开(公告)日：2007-06-14
申请号：US11301387
申请日：2005-12-13
申请人： Graham Cormode , Minos Garofalakis , Shanmugavelayutham Muthukrishnan , Rajeev Rastogi
发明人： Graham Cormode , Minos Garofalakis , Shanmugavelayutham Muthukrishnan , Rajeev Rastogi
IPC分类号： G06F7/00
CPC分类号： H04L41/147 , H04L43/00 , H04L43/0894 , H04L43/16
摘要： The invention comprises a method and apparatus for determining a rank of a query value. Specifically, the method comprises receiving a rank query request, determining, for each of the at least one remote monitor, a predicted lower-bound rank value and upper-bound rank value, wherein the predicted lower-bound rank value and upper-bound rank value are determined according to at least one respective prediction model used by each of the at least one remote monitor to compute the at least one local quantile summary, computing a predicted average rank value for each of the at least one remote monitor using the at least one predicted lower-bound rank value and the at least one predicted upper-bound rank value associated with the respective at least one remote monitor, and computing the rank of the query value using the at least one predicted average rank value associated with the respective at least one remote monitor.
摘要翻译：本发明包括一种用于确定查询值的等级的方法和装置。具体地说，该方法包括：接收秩查询请求，为所述至少一个远程监视器中的每一个确定预测的下限秩值和上限秩值，其中预测的下限秩值和上限秩根据由所述至少一个远程监视器中的每一个使用的至少一个相应的预测模型来确定所述值，以计算所述至少一个本地分位数概要，使用所述至少一个远程监视器至少计算所述至少一个远程监视器中的每一个的预测平均等级值一个预测的下限秩值和与相应的至少一个远程监视器相关联的至少一个预测的上限秩值，以及使用与各自的至少一个远程监视器相关联的至少一个预测平均等级值来计算查询值的等级至少一个远程监视器。

7. 发明申请

US20060085592A1 Method for distinct count estimation over joins of continuous update stream 有权
标题翻译：连续更新流连接的不同计数估计方法
公开(公告)号：US20060085592A1
公开(公告)日：2006-04-20
申请号：US10957185
申请日：2004-09-30
申请人： Sumit Ganguly , Minos Garofalakis , Amit Kumar , Rajeev Rastogi
发明人： Sumit Ganguly , Minos Garofalakis , Amit Kumar , Rajeev Rastogi
IPC分类号： G06F12/14
CPC分类号： G06F17/30498 , G11C16/0416 , Y10S707/99943
摘要： The invention provides methods and systems for summarizing multiple continuous update streams using corresponding multiple (parallel) JD Sketch data structures such that, for example, an approximate answer to a query requiring a join operation followed by a duplicate elimination step may be rapidly provided.
摘要翻译：本发明提供了使用对应的多个（并行）JD Sketch数据结构来概括多个连续更新流的方法和系统，使得例如可以快速地提供需要连接操作的跟踪操作的近似答案。

8. 发明申请

US20060075489A1 Streaming algorithms for robust, real-time detection of DDoS attacks 有权
标题翻译：用于强大，实时检测DDoS攻击的流式算法
公开(公告)号：US20060075489A1
公开(公告)日：2006-04-06
申请号：US10954901
申请日：2004-09-30
申请人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi , Krishan Sabnani
发明人： Sumit Ganguly , Minos Garofalakis , Rajeev Rastogi , Krishan Sabnani
IPC分类号： G06F12/14
CPC分类号： H04L29/06027 , H04L63/1458 , H04L65/607
摘要： A distinct-count estimate is obtained in a guaranteed small footprint using a two level hash, distinct count sketch. A first hash fills the first-level hash buckets with an exponentially decreasing number of data-elements. These are then uniformly hashed to an array of second-level-hash tables, and have an associated total-element counter and bit-location counters. These counters are used to identify singletons and so provide a distinct-sample and a distinct-count. An estimate of the total distinct-count is obtained by dividing by the distinct-count by the probability of mapping a data-element to that bucket. An estimate of the total distinct-source frequencies of destination address can be found in a similar fashion. By further associating the distinct-count sketch with a list of singletons, a total singleton count and a heap containing the destination addresses ordered by their distinct-source frequencies, a tracking distinct-count sketch may be formed that has considerably improved query time.
摘要翻译：使用两级散列，不同的计数草图在保证的小尺寸中获得不同的计数估计。第一个散列填充了数据元素数量级数下降的第一级哈希桶。然后将它们均匀地散列到二级哈希表的阵列，并具有关联的全元计数器和位位计数器。这些计数器用于识别单例，因此提供了不同的样本和不同的数字。通过将distinct-count除以将数据元素映射到该存储桶的概率，可以获得总区分计数的估计。可以以类似的方式找到目的地地址的不同源频率的总体估计。通过进一步将不同数量的草图与单例列表相关联，总共单例数和包含由其不同源频率排序的目的地地址的堆，可以形成具有显着改进的查询时间的跟踪不同计划草图。

9. 发明申请

US20050081116A1 System and method for monitoring link delays and faults in an IP network 有权
标题翻译：用于监控IP网络中的链路延迟和故障的系统和方法
公开(公告)号：US20050081116A1
公开(公告)日：2005-04-14
申请号：US10672204
申请日：2003-09-26
申请人： Yigal Bejerano , Rajeev Rastogi
发明人： Yigal Bejerano , Rajeev Rastogi
IPC分类号： G06F11/00 , H04L12/24 , H04L12/26
CPC分类号： H04L43/0852 , H04L41/0213 , H04L41/0677 , H04L41/5003 , H04L41/5009 , H04L41/5045 , H04L43/0888 , H04L43/10 , H04L43/12
摘要： A system for, and method of, monitoring link delays and faults in an IP network. In one embodiment, the system includes: (1) a monitoring station identifier that computes a set of monitoring stations that covers links in at least a portion of the network and (2) a probe message identifiers coupled to the monitoring station identifier, that computes a set of probe messages to be transmitted by at least ones of the set of monitoring stations such that the delays and faults can be determined.
摘要翻译：用于监控IP网络中的链路延迟和故障的系统和方法。在一个实施例中，系统包括：（1）监测站标识符，其计算覆盖网络的至少一部分中的链路的一组监视站;以及（2）耦合到监视站标识符的探测消息标识符，其计算要由所述一组监视站中的至少一个发送的一组探测消息，使得可以确定延迟和故障。

10. 发明授权

US06760724B1 Approximate query processing using wavelets 有权
标题翻译：使用小波的近似查询处理
公开(公告)号：US06760724B1
公开(公告)日：2004-07-06
申请号：US09624115
申请日：2000-07-24
申请人： Kaushik Chakrabarti , Minos N. Garofalakis , Rajeev Rastogi , Kyuseok Shim
发明人： Kaushik Chakrabarti , Minos N. Garofalakis , Rajeev Rastogi , Kyuseok Shim
IPC分类号： G06F1730
CPC分类号： G06F17/30536 , G06F17/30592 , Y10S707/99931 , Y10S707/99934 , Y10S707/99943
摘要： A method for querying electronic data. The query method comprises creating wavelet-coefficient synopses of the electronic data and then querying the synopses in the wavelet-coefficient domain to obtain a wavelet-coefficient query result. The wavelet-coefficient query result is then rendered to provide an approximate result.
摘要翻译：一种用于查询电子数据的方法。查询方法包括创建电子数据的小波系数概要，然后查询小波系数域中的概要，以获得小波系数查询结果。然后渲染小波系数查询结果以提供近似结果。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式