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

1. 发明申请

WO2014167419A2 EXACT MATCH LOOKUP WITH VARIABLE KEY SIZES 审中-公开
标题翻译：具有可变关键尺寸的精确匹配
公开(公告)号：WO2014167419A2
公开(公告)日：2014-10-16
申请号：PCT/IB2014/001368
申请日：2014-04-11
申请人： MARVELL ISRAEL (M.I.S.L) LTD. , LEVY, Gil , ARAD, Carmi
发明人： LEVY, Gil , ARAD, Carmi
IPC分类号： G06F17/30
CPC分类号： H04L45/7453 , G06F17/3033 , G06F17/30424 , H04L45/60 , H04L49/3009
摘要： In a method for performing an exact match lookup in a network device, a network packet is received at the network device. A lookup key for the network packet is determined at least based on data included in a header of the received network packet. A hash function is selected, from among a plurality of possible hash functions, at least based on a size of the lookup key, and a hash operation is performed on the lookup key using the selected hash function to compute a hashed lookup key segment. A database is queried using the hashed lookup key segment to extract a value exactly corresponding to the lookup key.
摘要翻译：在网络设备中执行精确匹配查找的方法中，在网络设备处接收网络分组。至少基于包括在所接收的网络分组的报头中的数据来确定网络分组的查找密钥。至少基于查找密钥的大小从多个可能的散列函数中选择散列函数，并且使用所选择的散列函数对查找密钥执行散列操作以计算散列的查找关键段。使用散列查找键段查询数据库，以提取与查找键完全对应的值。

2. 发明申请

WO2012071454A1 SHARING ACCESS TO A MEMORY AMONG CLIENTS 审中-公开
标题翻译：共享客户端的记忆
公开(公告)号：WO2012071454A1
公开(公告)日：2012-05-31
申请号：PCT/US2011/061925
申请日：2011-11-22
申请人： MARVELL WORLD TRADE LTD. , MARVELL ISRAEL (M.I.S.L.) LTD. , LEVY, Gil , BISHARA, Nafea , ZIMERMAN, Yaron , ARAD, Carmi
发明人： LEVY, Gil , BISHARA, Nafea , ZIMERMAN, Yaron , ARAD, Carmi
IPC分类号： G06F13/16
CPC分类号： G06F13/16
摘要： In a memory device having a set of memory banks to store content data, at least two requests to perform respective memory operations in a first memory bank in the set of memory banks are received during a single clock cycle. It is determined that one or more of the at least two requests is blocked from accessing the first memory bank. In response to determining that the one or more of the at least two requests is blocked: redundancy data associated with the first memory bank and different from content data stored in the first memory bank is accessed, and, without accessing the first memory bank, at least a portion of the content data stored in the first memory bank is reconstructed based on the redundancy data associated with the first memory bank. A first requested memory operation is perfomied using the content data stored in the first memory bank, and a second requested memory operation is performed using content data reconstructed 1 ) without accessing the first memory bank and ii) based on the redundancy data associated with the first memory bank.
摘要翻译：在具有一组用于存储内容数据的存储器组的存储器件中，在单个时钟周期期间接收至少两个在该组存储器组中的第一存储体中执行相应存储器操作的请求。确定所述至少两个请求中的一个或多个被阻止访问第一存储体。响应于确定所述至少两个请求中的一个或多个被阻止：与第一存储体相关联并且不同于存储在第一存储体中的内容数据的冗余数据被访问，并且在不访问第一存储体的情况下，处于基于与第一存储体相关联的冗余数据，重建存储在第一存储体中的内容数据的至少一部分。使用存储在第一存储体中的内容数据执行第一请求存储器操作，并且使用重构的内容数据1执行第二请求存储器操作，而不访问第一存储体，以及ii）基于与第一存储器相关联的冗余数据记忆库。

3. 发明申请

WO2014167419A3 EXACT MATCH LOOKUP WITH VARIABLE KEY SIZES 审中-公开
标题翻译：具有可变关键尺寸的精确匹配
公开(公告)号：WO2014167419A3
公开(公告)日：2015-03-26
申请号：PCT/IB2014001368
申请日：2014-04-11
申请人： MARVELL ISRAEL MISL LTD , LEVY GIL , ARAD CARMI
发明人： LEVY GIL , ARAD CARMI
IPC分类号： H04L12/935
CPC分类号： H04L45/7453 , G06F17/3033 , G06F17/30424 , H04L45/60 , H04L49/3009
摘要： In a method for performing an exact match lookup in a network device, a network packet is received at the network device. A lookup key for the network packet is determined at least based on data included in a header of the received network packet. A hash function is selected, from among a plurality of possible hash functions, at least based on a size of the lookup key, and a hash operation is performed on the lookup key using the selected hash function to compute a hashed lookup key segment. A database is queried using the hashed lookup key segment to extract a value exactly corresponding to the lookup key.
摘要翻译：在网络设备中执行精确匹配查找的方法中，在网络设备处接收网络分组。至少基于包括在所接收的网络分组的报头中的数据来确定网络分组的查找密钥。至少基于查找密钥的大小从多个可能的散列函数中选择散列函数，并且使用所选择的散列函数对查找密钥执行散列操作以计算散列的查找关键段。使用散列查找键段查询数据库，以提取与查找键完全对应的值。

4. 发明申请

WO2014132136A3 EFFICIENT LONGEST PREFIX MATCHING TECHNIQUES FOR NETWORK DEVICES 审中-公开
标题翻译：网络设备高效的前缀匹配技术
公开(公告)号：WO2014132136A3
公开(公告)日：2015-03-12
申请号：PCT/IB2014000989
申请日：2014-02-27
申请人： MARVELL WORLD TRADE LTD , ROITSHTEIN AMIR , LEVY GIL , ARAD CARMI
发明人： ROITSHTEIN AMIR , LEVY GIL , ARAD CARMI
IPC分类号： H04L12/745
CPC分类号： H04L61/103 , H04L45/7453 , H04L45/748
摘要： A network address associated with a packet is obtained at a search engine of a network device. The search engine includes a plurality of Bloom filters that represent prefixes of respective lengths in the routing table. Respective Bloom filters are applied to respective prefixes of the network address to determine a set of one or more prefixes for which a match potentially exists in the routing table. A number of accesses to the memory are performed using prefixes in set of prefixes, beginning with a longest prefix and continuing in decreasing order of prefix lengths until a matching entry is found in the routing table, and routing information for the packet is retrieved. If the number of performed memory accesses exceeds a threshold, the routing table is adapted to reduce a number of memory accesses to be performed for subsequent packets associated with the network address.
摘要翻译：在网络设备的搜索引擎处获取与分组相关联的网络地址。搜索引擎包括表示路由表中相应长度的前缀的多个布隆过滤器。相应的Bloom过滤器被应用于网络地址的相应前缀，以确定在路由表中可能存在匹配的一个或多个前缀的集合。使用前缀集合中的前缀，以最长前缀开头并以前缀长度的递减顺序继续进行对存储器的多次访问，直到在路由表中找到匹配的条目，并且检索分组的路由信息。如果执行的存储器访问次数超过阈值，则路由表适于减少对与网络地址相关联的后续分组执行的存储器访问次数。

5. 发明申请

WO2014132136A2 EFFICIENT LONGEST PREFIX MATCHING TECHNIQUES FOR NETWORK DEVICES 审中-公开
标题翻译：网络设备高效的前缀匹配技术
公开(公告)号：WO2014132136A2
公开(公告)日：2014-09-04
申请号：PCT/IB2014/000989
申请日：2014-02-27
申请人： MARVELL WORLD TRADE LTD. , ROITSHTEIN, Amir , LEVY, Gil , ARAD, Carmi
发明人： ROITSHTEIN, Amir , LEVY, Gil , ARAD, Carmi
IPC分类号： H04L12/745
CPC分类号： H04L61/103 , H04L45/7453 , H04L45/748
摘要： A network address associated with a packet is obtained at a search engine of a network device. The search engine includes a plurality of Bloom filters that represent prefixes of respective lengths in the routing table. Respective Bloom filters are applied to respective prefixes of the network address to determine a set of one or more prefixes for which a match potentially exists in the routing table. A number of accesses to the memory are performed using prefixes in set of prefixes, beginning with a longest prefix and continuing in decreasing order of prefix lengths until a matching entry is found in the routing table, and routing information for the packet is retrieved. If the number of performed memory accesses exceeds a threshold, the routing table is adapted to reduce a number of memory accesses to be performed for subsequent packets associated with the network address.
摘要翻译：在网络设备的搜索引擎处获得与分组相关联的网络地址。搜索引擎包括表示路由表中相应长度的前缀的多个布隆过滤器。相应的Bloom过滤器被应用于网络地址的相应前缀，以确定在路由表中可能存在匹配的一个或多个前缀的集合。使用前缀集合中的前缀，以最长前缀开头并以前缀长度的递减顺序继续进行对存储器的多次访问，直到在路由表中找到匹配的条目，并且检索分组的路由信息。如果执行的存储器访问次数超过阈值，则路由表适于减少对与网络地址相关联的后续分组执行的存储器访问次数。

6. 发明申请

WO2014188277A3 TIME EFFICIENT COUNTERS AND METERS ARCHITECTURE 审中-公开
标题翻译：时间有效的计数器和仪表架构
公开(公告)号：WO2014188277A3
公开(公告)日：2015-01-22
申请号：PCT/IB2014001750
申请日：2014-05-04
申请人： MARVELL WORLD TRADE LTD , ARAD CARMI , BODEN KURT , LEVY GIL , CAROLSTROM JAKOB
发明人： ARAD CARMI , BODEN KURT , LEVY GIL , CAROLSTROM JAKOB
IPC分类号： H04L12/26 , H04L12/819
CPC分类号： H04L43/024 , H04L41/147 , H04L43/02 , H04L43/0876 , H04L43/16 , H04L47/215
摘要： A network device includes a plurality of interfaces configured to receive, from a network, packets to be processed by the network device. A load determination circuit of the network device is configured to determine whether a packet traffic load of the network device is above a traffic load threshold, and a dual-mode counter module is configured to (i) determine a count of quanta associated with the received packets using a first counting mode in response to the load determination unit determining that the packet traffic load is above the traffic load threshold, and (ii) determine a count of quanta associated with the received packets using a second counting mode, different than the first counting mode, in response to the load determination unit determining that the packet traffic load is not above the traffic load threshold.
摘要翻译：网络设备包括被配置为从网络接收要由网络设备处理的分组的多个接口。网络设备的负载确定电路被配置为确定网络设备的分组业务负载是否高于业务负载阈值，并且双模计数器模块被配置为（i）确定与所接收的相关联的量子的计数响应于负载确定单元确定分组业务负载高于业务负载阈值，并且（ii）使用与第一计数模式不同的第二计数模式来确定与所接收分组相关联的量化的计数，计数模式，响应于负载确定单元确定分组业务负载不高于业务负载阈值。

7. 发明申请

WO2014188277A2 TIME EFFICIENT COUNTERS AND METERS ARCHITECTURE 审中-公开
标题翻译：时间有效的计数器和仪表架构
公开(公告)号：WO2014188277A2
公开(公告)日：2014-11-27
申请号：PCT/IB2014/001750
申请日：2014-05-04
申请人： MARVELL WORLD TRADE LTD. , ARAD, Carmi , BODEN, Kurt , LEVY, Gil , CAROLSTROM, Jakob
发明人： ARAD, Carmi , BODEN, Kurt , LEVY, Gil , CAROLSTROM, Jakob
CPC分类号： H04L43/024 , H04L41/147 , H04L43/02 , H04L43/0876 , H04L43/16 , H04L47/215
摘要： A network device includes a plurality of interfaces configured to receive, from a network, packets to be processed by the network device. A load determination circuit of the network device is configured to determine whether a packet traffic load of the network device is above a traffic load threshold, and a dual-mode counter module is configured to (i) determine a count of quanta associated with the received packets using a first counting mode in response to the load determination unit determining that the packet traffic load is above the traffic load threshold, and (ii) determine a count of quanta associated with the received packets using a second counting mode, different than the first counting mode, in response to the load determination unit determining that the packet traffic load is not above the traffic load threshold.
摘要翻译：网络设备包括被配置为从网络接收要由网络设备处理的分组的多个接口。网络设备的负载确定电路被配置为确定网络设备的分组业务负载是否高于业务负载阈值，并且双模计数器模块被配置为（i）确定与所接收的相关联的量子的计数响应于负载确定单元确定分组业务负载高于业务负载阈值，并且（ii）使用与第一计数模式不同的第二计数模式来确定与所接收分组相关联的量化的计数，计数模式，响应于负载确定单元确定分组业务负载不高于业务负载阈值。

8. 发明申请

WO2013008220A1 SCALING OF VIRTUAL MACHINE ADDRESSES IN DATACENTERS 审中-公开
标题翻译：在DATACENTERS中的虚拟机地址的分级
公开(公告)号：WO2013008220A1
公开(公告)日：2013-01-17
申请号：PCT/IB2012/053619
申请日：2012-07-15
申请人： MARVELL ISRAEL (M.I.S.L) LTD. , ARAD, Carmi , MIZRAHI, Tal
发明人： ARAD, Carmi , MIZRAHI, Tal
IPC分类号： G06F15/173 , H04L12/26
CPC分类号： H04L61/103 , G06F9/45558 , G06F2009/45595
摘要： A device in a server having a processor and a storage. The device has a downstream communication unit configured to receive a data packet. The device also has a protocol blind network path indication unit configured to obtain an indicator corresponding to a predetermined path to a data communication unit in the network using a destination address of the data packet. The device, furthermore, has an upstream communication unit configured to transmit a network protocol blind packet including the data packet and the indicator corresponding to the predetermined data path to the data communication unit in the network. The device also includes a combiner configured to bind the indicator to the data packet received by the downstream communication unit. The device also includes a protocol blind correlation storage unit configured to provide information related to target addresses and indicators corresponding to a plurality of predetermined data paths in the network. The protocol blind network path indication unit obtains the indicator corresponding to a predetermined path by accessing the protocol blind correlation structure.
摘要翻译：具有处理器和存储器的服务器中的设备。该设备具有被配置为接收数据分组的下游通信单元。该设备还具有协议盲网路径指示单元，其被配置为使用数据分组的目的地地址获得与网络中的数据通信单元的预定路径对应的指示符。此外，该装置具有上游通信单元，被配置为将包括数据分组的网络协议盲分组和对应于预定数据路径的指示符发送到网络中的数据通信单元。该设备还包括组合器，其被配置为将指示符绑定到由下游通信单元接收的数据分组。该设备还包括协议盲相关存储单元，被配置为提供与目标地址相关的信息和对应于网络中的多个预定数据路径的指示符。协议盲网路径指示单元通过访问协议盲相关结构获取对应于预定路径的指示符。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式