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

1. 发明授权

US08018940B2 Network address lookup based on bloom filters 有权
标题翻译：基于布隆过滤器的网络地址查找
公开(公告)号：US08018940B2
公开(公告)日：2011-09-13
申请号：US12190633
申请日：2008-08-13
申请人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
发明人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/745 , H04L45/7457
摘要： In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed using a Bloom filter that was programmed with the prefixes corresponding to all of the different prefix lengths without having to expand any of the prefixes programmed into the Bloom filter. Membership probes are performed into the Bloom filter using candidate prefix values of a given network address. The Bloom filter can be implemented in a distributed manner using Bloom sub-filters, where each Bloom sub-filter is hashed based on a set of hash functions, where each different hash function in the set corresponds to a different prefix length in the routing table. Each Bloom sub-filter can in turn be implemented using a plurality of practically realizable multi-port memory devices controlled by a port scheduler. False-positive matches can be detected and next-hop information for true-positive matches retrieved using an off-chip, hash-based prefix table.
摘要翻译：在一个实施例中，使用具有与所有不同前缀长度相对应的前缀编程的布隆过滤器来执行具有不同前缀长度的前缀的路由表的IP查找，而不必将编程到布隆过滤器中的任何前缀扩展。使用给定网络地址的候选前缀值对Bloom过滤器进行成员资格探测。 Bloom过滤器可以使用Bloom子过滤器以Bloom子过滤器实现，其中每个Bloom子过滤器基于一组散列函数进行散列，其中集合中的每个不同的散列函数对应于路由表中的不同的前缀长度。可以使用由端口调度器控制的多个实际可实现的多端口存储器件来实现每个Bloom子滤波器。可以检测到假阳性匹配，并使用片外基于散列的前缀表检索真正匹配的下一跳信息。

2. 发明申请

US20100040066A1 NETWORK ADDRESS LOOKUP BASED ON BLOOM FILTERS 有权
标题翻译：基于BLOOM过滤器的网络地址查找
公开(公告)号：US20100040066A1
公开(公告)日：2010-02-18
申请号：US12190633
申请日：2008-08-13
申请人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
发明人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/745 , H04L45/7457
摘要： In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed using a Bloom filter that was programmed with the prefixes corresponding to all of the different prefix lengths without having to expand any of the prefixes programmed into the Bloom filter. Membership probes are performed into the Bloom filter using candidate prefix values of a given network address. The Bloom filter can be implemented in a distributed manner using Bloom sub-filters, where each Bloom sub-filter is hashed based on a set of hash functions, where each different hash function in the set corresponds to a different prefix length in the routing table. Each Bloom sub-filter can in turn be implemented using a plurality of practically realizable multi-port memory devices controlled by a port scheduler. False-positive matches can be detected and next-hop information for true-positive matches retrieved using an off-chip, hash-based prefix table.
摘要翻译：在一个实施例中，使用具有与所有不同前缀长度相对应的前缀编程的布隆过滤器来执行具有不同前缀长度的前缀的路由表的IP查找，而不必将编程到布隆过滤器中的任何前缀扩展。使用给定网络地址的候选前缀值对Bloom过滤器进行成员资格探测。 Bloom过滤器可以使用Bloom子过滤器以Bloom子过滤器实现，其中每个Bloom子过滤器基于一组散列函数进行散列，其中集合中的每个不同的散列函数对应于路由表中的不同的前缀长度。可以使用由端口调度器控制的多个实际可实现的多端口存储器件来实现每个Bloom子滤波器。可以检测到假阳性匹配，并使用片外基于散列的前缀表检索真正匹配的下一跳信息。

3. 发明授权

US07990973B2 Hash functions for applications such as network address lookup 有权
标题翻译：用于诸如网络地址查找等应用程序的哈希功能
公开(公告)号：US07990973B2
公开(公告)日：2011-08-02
申请号：US12190684
申请日：2008-08-13
申请人： Fang Hao , Muralidharan S. Kodialam , Haoyu Song
发明人： Fang Hao , Muralidharan S. Kodialam , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/745 , H04L45/7453 , H04L45/7457
摘要： In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed by hashing a candidate prefix value to generate a plurality of hash values, where m seed hash values are generated by applying m seed hash functions and one or more additional hash values are generated by combining two or more of the seed hash values in different ways, e.g., using a bit-wise XOR function. The hash values are used to perform membership probes into a Bloom filter programmed with the prefixes corresponding to all of the different prefix lengths in the routing table without having to expand any of the prefixes programmed into the Bloom filter.
摘要翻译：在一个实施例中，通过对候选前缀值进行散列来生成多个散列值来执行对具有不同前缀长度的前缀的路由表的IP查找，其中通过应用m个种子散列函数和一个或多个附加值来生成m个种子散列值通过以不同的方式组合两个或多个种子散列值来产生散列值，例如使用逐位XOR函数。散列值用于对布隆过滤器执行成员资格探测，该过滤器使用与路由表中所有不同前缀长度相对应的前缀进行编程，而无需扩展编程到布隆过滤器中的任何前缀。

4. 发明申请

US20100040067A1 HASH FUNCTIONS FOR APPLICATIONS SUCH AS NETWORK ADDRESS LOOKUP 有权
标题翻译：应用程序的HASH功能，如网络地址查询
公开(公告)号：US20100040067A1
公开(公告)日：2010-02-18
申请号：US12190684
申请日：2008-08-13
申请人： Fang Hao , Muralidharan S. Kodialam , Haoyu Song
发明人： Fang Hao , Muralidharan S. Kodialam , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/745 , H04L45/7453 , H04L45/7457
摘要： In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed by hashing a candidate prefix value to generate a plurality of hash values, where m seed hash values are generated by applying m seed hash functions and one or more additional hash values are generated by combining two or more of the seed hash values in different ways, e.g., using a bit-wise XOR function. The hash values are used to perform membership probes into a Bloom filter programmed with the prefixes corresponding to all of the different prefix lengths in the routing table without having to expand any of the prefixes programmed into the Bloom filter.
摘要翻译：在一个实施例中，通过对候选前缀值进行散列来生成多个散列值来执行对具有不同前缀长度的前缀的路由表的IP查找，其中通过应用m个种子散列函数和一个或多个附加值来生成m个种子散列值通过以不同的方式组合两个或多个种子散列值来产生散列值，例如使用逐位XOR函数。散列值用于对布隆过滤器执行成员资格探测，该过滤器使用与路由表中所有不同前缀长度相对应的前缀进行编程，而无需扩展编入Bloom过滤器的任何前缀。

5. 发明申请

US20130212710A1 Data Leakage Prevention for Cloud and Enterprise Networks 有权
标题翻译：数据泄漏预防云和企业网络
公开(公告)号：US20130212710A1
公开(公告)日：2013-08-15
申请号：US13369475
申请日：2012-02-09
申请人： Krishna P. Puttaswamy Naga , Fang Hao , Muralidharan S. Kodialam , T.V. Lakshman
发明人： Krishna P. Puttaswamy Naga , Fang Hao , Muralidharan S. Kodialam , T.V. Lakshman
IPC分类号： G06F21/20
CPC分类号： H04L63/0245 , H04L9/3247 , H04L63/123
摘要： Apparatuses, methods and articles of manufacture for performing data leakage prevention are provided. Data leakage prevention may be performed by determining a signature of a transmitted document, the transmitted document being in transit to a location beyond a network boundary. The signature of the transmitted document is compared with one or more signatures of documents authorized to be transmitted beyond the network boundary. The transmitted document is prevented from being transmitted beyond the network boundary if the signature of the document does not correspond to a signature of a document authorized to be transmitted beyond the network boundary.
摘要翻译：提供了用于执行防止数据泄漏的设备，方法和制造。可以通过确定所发送的文档的签名，所发送的文档正在转移到超出网络边界的位置来执行数据泄露防止。将所发送的文档的签名与授权发送超出网络边界的文档的一个或多个签名进行比较。如果文档的签名不对应于被授权在网络边界之外被发送的文档的签名，则防止传输的文档被超出网络边界的传输。

6. 发明授权

US08856960B2 Data leakage prevention for cloud and enterprise networks 有权
标题翻译：云和企业网络的数据泄漏预防
公开(公告)号：US08856960B2
公开(公告)日：2014-10-07
申请号：US13369475
申请日：2012-02-09
申请人： Krishna P. Puttaswamy Naga , Fang Hao , Muralidharan S. Kodialam , T.V. Lakshman
发明人： Krishna P. Puttaswamy Naga , Fang Hao , Muralidharan S. Kodialam , T.V. Lakshman
IPC分类号： G06F7/16 , H04L29/06
CPC分类号： H04L63/0245 , H04L9/3247 , H04L63/123
摘要： Apparatuses, methods and articles of manufacture for performing data leakage prevention are provided. Data leakage prevention may be performed by determining a signature of a transmitted document, the transmitted document being in transit to a location beyond a network boundary. The signature of the transmitted document is compared with one or more signatures of documents authorized to be transmitted beyond the network boundary. The transmitted document is prevented from being transmitted beyond the network boundary if the signature of the document does not correspond to a signature of a document authorized to be transmitted beyond the network boundary.
摘要翻译：提供了用于执行防止数据泄漏的设备，方法和制造。可以通过确定所发送的文档的签名，所发送的文档正在转移到超出网络边界的位置来执行数据泄露防止。将所发送的文档的签名与授权发送超出网络边界的文档的一个或多个签名进行比较。如果文档的签名不对应于被授权在网络边界之外被发送的文档的签名，则防止传输的文档被超出网络边界的传输。

7. 发明授权

US07460487B2 Accelerated per-flow traffic estimation 有权
标题翻译：加速每流量流量估计
公开(公告)号：US07460487B2
公开(公告)日：2008-12-02
申请号：US10947072
申请日：2004-09-22
申请人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman
IPC分类号： H04L12/26
CPC分类号： H04L41/14 , H04L43/024 , H04L43/026 , H04L63/145
摘要： A method of estimating per-flow traffic in a network of nodes interconnected by links splits the incoming traffic stream to a node into a number of parallel sub-streams by flow assignment using a hash function. Since each flow in the incoming traffic stream constitutes a larger fraction of the traffic in its sub-stream, the probability of obtaining two-runs increases. The number of two-runs per flow is then employed to generate an estimate of the traffic of the flow.
摘要翻译：通过链路互连的节点网络估计每流量流量的方法通过使用散列函数的流分配将输入业务流分解成多个并行子流。由于进入业务流中的每个流量构成其子流中流量的较大部分，所以获得两次运行的概率增加。然后使用每个流的两次运行的数量来生成流量的流量的估计。

8. 发明授权

US07359384B2 Scheduling of guaranteed-bandwidth low-jitter traffic in input-buffered switches 失效
标题翻译：在输入缓冲交换机中调度保证带宽低抖动流量
公开(公告)号：US07359384B2
公开(公告)日：2008-04-15
申请号：US10348385
申请日：2003-01-21
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Dimitrios Stiliadis
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Dimitrios Stiliadis
IPC分类号： H04L12/56
CPC分类号： H04L47/521 , H04L47/28 , H04L47/50 , H04L47/56 , H04L49/254
摘要： A switch schedules guaranteed-bandwidth, low-jitter-traffic characterized by a guaranteed rate table (GRT) method. A rate matrix generated from collected provisioning information is decomposed into schedule tables by a low jitter (LJ) decomposition method. The LJ decomposition method imposes a set of constraints for the schedule tables: schedule tables are partial permutation matrices, weighted sum of the partial permutation matrices is greater than or equal to the weighted sum of the rate matrix, and each entry in the rate matrix belongs to one element of the LJ decomposition schedule matrices. An integer LJ decomposition programming problem is employed to generate the schedule tables that are scheduled for each time slot of the period of the switch. Schedule tables are selected in turn based upon selecting eligible tables having the earliest finishing time. If necessary, the rate matrix is updated prior to decomposition for a subsequent period.
摘要翻译：交换机调度保证带宽，低抖动流量，其特征在于保证速率表（GRT）方法。从收集的配置信息生成的速率矩阵通过低抖动（LJ）分解方法分解为调度表。 LJ分解方法对调度表施加一组约束：调度表是部分置换矩阵，部分置换矩阵的加权和大于或等于速率矩阵的加权和，并且速率矩阵中的每个条目都属于到LJ分解调度矩阵的一个元素。采用整数LJ分解编程问题来生成为交换周期的每个时隙调度的调度表。根据选择具有最早完成时间的合格表，依次选择计划表。如果需要，速率矩阵在分解之前在随后的时间段内被更新。

9. 发明申请

US20080074238A1 Anonymous tracking using a set of wireless devices 有权
标题翻译：匿名跟踪使用一组无线设备
公开(公告)号：US20080074238A1
公开(公告)日：2008-03-27
申请号：US11824469
申请日：2007-06-29
申请人： Muralidharan S. Kodialam , Wing Cheong Lau , Thyagarajan Nandagopal
发明人： Muralidharan S. Kodialam , Wing Cheong Lau , Thyagarajan Nandagopal
IPC分类号： H04B7/00
CPC分类号： H04W24/00 , H04L41/0896 , H04L43/0882 , H04W74/08
摘要： In one embodiment, a method for estimating the number of tags in a set of tags in a system of tags and readers. The method includes, during each of a plurality of time intervals: (i) transmitting a command requesting that each tag that receives the command determine whether to transmit a reply; and (ii) receiving, in one or more timeslots of a frame corresponding to the time interval, replies from one or more tags. The method further includes providing an estimate of the number of tags in the set of one or more tags based on (i) timeslots in each of the plurality of time intervals that are zero timeslots, i.e., timeslots having no received reply, and (ii) the total number of timeslots in each frame.
摘要翻译：在一个实施例中，一种用于估计标签和读取器系统中的一组标签中的标签的数量的方法。该方法包括在多个时间间隔的每一个期间：（i）发送请求每个接收到该命令的标签的命令确定是否发送回复; 以及（ii）在与所述时间间隔对应的帧的一个或多个时隙中接收从一个或多个标签的答复。该方法还包括：基于（i）作为零时隙的多个时间间隔中的每一个中的时隙，即没有接收到的回复的时隙，提供一组或多个标签中的标签数量的估计，）每帧中的时隙总数。

10. 发明授权

US06996065B2 Dynamic backup routing of network tunnel paths for local restoration in a packet network 有权
标题翻译：网络隧道路径的动态备份路由，用于分组网络中的本地恢复
公开(公告)号：US06996065B2
公开(公告)日：2006-02-07
申请号：US09899508
申请日：2001-07-05
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman
IPC分类号： G01R31/08
CPC分类号： H04L45/28 , H04L45/12 , H04L45/123 , H04L45/22
摘要： A packet network of interconnected nodes employing dynamic backup routing of a Network Tunnel Path (NTP) allocates an active and backup path to the NTP based upon detection of a network failure. Dynamic backup routing employs local restoration to determine the allocation of, and, in operation, to switch between, a primary/active path and a secondary/backup path. Switching from the active path is based on a backup path determined with iterative shortest-path computations with link weights assigned based on the cost of using a link to backup a given link. Costs may be assigned based on single-link failure or single element (node or link) failure. Link weights are derived by assigning usage costs to links for inclusion in a backup path, and minimizing the costs with respect to a predefined criterion.
摘要翻译：采用网络隧道路径（NTP）的动态备份路由的互连节点的分组网络基于网络故障的检测，为NTP分配活动和备用路径。动态备份路由使用本地恢复来确定主/主路径和辅助/备用路径之间的切换和运行。从活动路径切换基于通过迭代最短路径计算确定的备份路径，其中链路权重基于使用链接备份给定链路的成本而分配。可以基于单链路故障或单个元件（节点或链路）故障分配成本。链路权重是通过将使用成本分配给用于包含在备份路径中的链接而导致的，并且使得相对于预定义准则最小化成本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式