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

31. 发明授权

US09021195B2 Batch entries sharing individual content-addressable memory entries 有权
标题翻译：批量条目共享单独的内容可寻址内存条目
公开(公告)号：US09021195B2
公开(公告)日：2015-04-28
申请号：US13594826
申请日：2012-08-26
申请人： Doron Shoham , Shimon Listman
发明人： Doron Shoham , Shimon Listman
IPC分类号： G06F12/00 , G11C15/00 , H04Q11/00 , H04L12/743
CPC分类号： G11C15/00 , H04L45/7457 , H04Q11/0005
摘要： In one embodiment, batch entries include multiple content-addressable memory (CAM) entries, and CAM entries are allowed to be shared among different batch entries. For example, two or more batch entries might have a common set of bits (e.g., representing an address, an address prefix, etc.). Rather than consuming bits of multiple CAM entries, a single CAM entry can be programmed with this common information. Other CAM entries associated with different batch entries are programmed with the distinguishing/different values. A batch lookup operation on a batch entry of two or more CAM entries requires multiple lookup operations on the CAM entries. One embodiment uses a batch mask vector to provide information to decode what CAM entries are shared among which batch entries during a series of lookup operations, which can be performed in one or both directions through the CAM entries.
摘要翻译：在一个实施例中，批条目包括多个可内容寻址存储器（CAM）条目，并且允许CAM条目在不同的批条目之间共享。例如，两个或更多个批次条目可能具有公共的一组位（例如，表示地址，地址前缀等）。而不是消耗多个CAM条目的位，可以使用该公共信息编程单个CAM条目。与不同批次条目关联的其他CAM条目用区别/不同的值进行编程。对两个或多个CAM条目的批项进行批量查找操作需要对CAM条目进行多次查找操作。一个实施例使用批处理掩码向量来提供信息来解码在一系列查找操作期间在哪个批处理条目之间共享哪些CAM条目的信息，这可以通过CAM条目在一个或两个方向上执行。

32. 发明申请

US20140059289A1 Content-addressable Memory Lookup Device Supporting Iterative Lookup Operations 有权
标题翻译：支持迭代查找操作的内容寻址内存查找设备
公开(公告)号：US20140059289A1
公开(公告)日：2014-02-27
申请号：US13594827
申请日：2012-08-26
申请人： Doron Shoham , Ilan Lisha , Yossi Socoletzky
发明人： Doron Shoham , Ilan Lisha , Yossi Socoletzky
IPC分类号： G06F12/00
CPC分类号： G11C15/00
摘要： In one embodiment, multiple content-addressable memory entries are associated with each other to effectively form a batch content-addressable memory entry that spans multiple physical entries of the content-addressable memory device. To match against this content-addressable memory entry, multiple lookup operations are required—i.e., one lookup operation for each combined physical entry. Further, one embodiment provides that a batch content-addressable memory entry can span one, two, three, or more physical content-addressable memory entries, and batch content-addressable memory entries of varying sizes could be programmed into a single content-addressable memory device. Thus, a lookup operation might take two lookup iterations on the physical entries of the content-addressable memory device, with a next lookup operation taking a different number of lookup iterations (e.g., one, three or more).
摘要翻译：在一个实施例中，多个可内容寻址的存储器条目彼此关联以有效地形成跨越可内容寻址的存储器件的多个物理条目的批处理内容可寻址存储器条目。为了匹配该内容可寻址内存条目，需要多次查找操作，即每个组合物理条目的一个查找操作。此外，一个实施例提供批量内容寻址存储器条目可以跨越一个，两个，三个或更多个物理内容可寻址存储器条目，并且不同大小的批量可内容寻址的存储器条目可以被编程到单个内容寻址存储器设备。因此，查找操作可能对可内容寻址的存储器件的物理条目进行两次查找迭代，下一个查找操作采用不同数量的查找迭代（例如，一个，三个或更多）。

33. 发明授权

US07609633B2 Bandwidth policer with compact data structure 有权
标题翻译：具有紧凑数据结构的带宽监视器
公开(公告)号：US07609633B2
公开(公告)日：2009-10-27
申请号：US11451849
申请日：2006-06-12
申请人： Doron Shoham , Rami Zemach
发明人： Doron Shoham , Rami Zemach
IPC分类号： H04L12/28 , G06F11/00 , H04Q7/00
CPC分类号： H04L47/32 , H04L43/00 , H04L43/106 , H04L43/50 , H04L47/10 , H04L47/20 , H04L47/2458
摘要： A method for controlling data transmission includes setting a respective rate criterion for each of a plurality of interfaces of a network element. Upon conveying a first data packet of a first size via a given interface of the network element at a first time, a time-stamp value is computed based on the first time, the first size and the respective rate criterion that is set for the given interface. A disposition of a second packet for conveyance via the given interface at a second time, subsequent to the first time, is determined responsively to the time-stamp value.
摘要翻译：一种用于控制数据传输的方法包括为网络单元的多个接口中的每一个设置相应的速率准则。在第一时间经由网络元件的给定接口传送第一尺寸的第一数据分组时，基于给定的第一时间，第一大小和相应的速率标准来计算时间戳值接口。响应于时间戳值确定在第一次之后的第二时间经由给定接口进行传送的第二分组的配置。

34. 发明授权

US07565496B2 Sharing memory among multiple information channels 有权
标题翻译：在多个信息通道之间共享内存
公开(公告)号：US07565496B2
公开(公告)日：2009-07-21
申请号：US11040797
申请日：2005-01-22
申请人： Doron Shoham , Rami Zemach , John J. Williams, Jr.
发明人： Doron Shoham , Rami Zemach , John J. Williams, Jr.
IPC分类号： G06F13/00 , G06F13/28 , G06F15/173
CPC分类号： H04L49/90 , H04L47/50 , H04L47/6255 , H04L49/9047
摘要： Memory is shared among multiple information channels, which may be of particular use for storing streams of packets. Memory allocation information is maintained which can be used to identify the current number of memory segments (e.g., some definable amount of memory) allocated for each of the multiple channels as well as the available number of shared memory segments. Items, such as, but not limited to data, packets, etc., are received and stored in the memory according to the memory allocation information. After a first processing stage for an item, the memory allocation information is updated to reflect an expected number of available memory segments to become available for the respective channel after a subsequent second processing stage. After the second processing stage is completed for an item, its number of memory segments are de-allocated based on the expected available data. In one embodiment, these memory segments are de-allocated one at a time.
摘要翻译：存储器在多个信息信道之间共享，这可能特别用于存储分组流。维持存储器分配信息，其可以用于识别为多个通道中的每一个分配的存储器段的当前数量（例如，一些可定义的存储量）以及可用数量的共享存储器段。诸如但不限于数据，分组等的项目根据存储器分配信息被接收并存储在存储器中。在项目的第一处理阶段之后，更新存储器分配信息以反映在随后的第二处理阶段之后可用于相应通道的可用存储器段的预期数量。在项目的第二处理阶段完成之后，基于预期的可用数据，其存储器段的数量被去分配。在一个实施例中，这些存储器段被一次一个地分配。

35. 发明授权

US07561589B2 Virtual address storage which may be of particular use in generating fragmented packets 有权
标题翻译：虚拟地址存储可能特别用于生成分段数据包
公开(公告)号：US07561589B2
公开(公告)日：2009-07-14
申请号：US11065118
申请日：2005-02-23
申请人： Doron Shoham , Rami Zemach , Alon Ratinsky , Sarig Livne
发明人： Doron Shoham , Rami Zemach , Alon Ratinsky , Sarig Livne
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/60 , H04L45/742
摘要： A virtual address storage system, which may be of particular used in generating fragmented packets, is implemented using a linked list of data segments. Multiple storage segments linked together in a linked list data structure are maintained to represent a virtual contiguous block of storage to be accessed based on a virtual address. Virtual address to corresponding data segment pointer associations are maintained for identifying a data segment corresponding to a particular address within the address space. In response to an identified address in the address space, a particular closest dynamic recently used association is identified and used to traverse to the desired data segment (e.g. rather than traversing from the beginning of the linked list), and one of the dynamic recently used associations is updated. A packet can be stored in this address space along with newly generated packet headers and tails for the multiple fragmented packets.
摘要翻译：可以特别用于生成分段分组的虚拟地址存储系统使用链接的数据段列表来实现。链接在一起的链接列表数据结构中的多个存储段被维护以基于虚拟地址来表示要访问的虚拟连续的存储块。保持对相应数据段指针关联的虚拟地址以识别对应于地址空间内的特定地址的数据段。响应于地址空间中的所识别的地址，识别特定最近的最近动态的最近使用的关联，并且用于遍历期望的数据段（例如，而不是从链表的开始遍历），并且使用最近使用的动态之一关联更新。数据包可以存储在该地址空间中，以及新生成的数据包头和尾部用于多个分段数据包。

36. 发明申请

US20080123689A1 Oversubscription of guaranteed bandwidth 有权
标题翻译：过载保证带宽
公开(公告)号：US20080123689A1
公开(公告)日：2008-05-29
申请号：US11504208
申请日：2006-08-14
申请人： Eyal Oren , Doron Shoham , Dalit Sagi
发明人： Eyal Oren , Doron Shoham , Dalit Sagi
IPC分类号： H04J3/16
CPC分类号： H04L47/60 , H04L47/50 , H04L47/527 , H04L47/6225
摘要： A method for communication includes allocating target bandwidths to two or more packet sources and defining one or more of the packet sources as preferred sources. Quantum values defining maximum amounts of data to be sent during a single scheduling round are defined for the respective packet sources. Repetitive scheduling rounds are performed in order to determine a schedule for processing pending data packets produced by the packet sources. In each scheduling round, all pending packets that are produced by the preferred sources and are within the target bandwidths allocated to the preferred sources are scheduled. Pending packets produced by packet sources other than the preferred sources are scheduled in accordance with the quantum values, within the target bandwidths allocated to the packet sources other than the preferred sources. The pending packets are processed responsively to the schedule. The target bandwidths may comprise, for example, guaranteed bandwidths or excess bandwidths.
摘要翻译：一种用于通信的方法包括将目标带宽分配给两个或更多个分组源，并将一个或多个分组源定义为优选源。为相应的分组源定义定义在单个调度周期期间发送的最大数据量的量子值。执行重复调度循环以便确定用于处理由分组源产生的未决数据分组的调度。在每个调度循环中，调度由优选源产生并且在分配给优选源的目标带宽内的所有待处理分组。在分配给除了优选源之外的分组源的目标带宽内，根据量子值调度由除了优选源之外的分组源产生的等待分组。响应于时间表处理待处理的数据包。目标带宽可以包括例如保证带宽或超额带宽。

37. 发明授权

US07362762B2 Distributed packet processing with ordered locks to maintain requisite packet orderings 有权
标题翻译：使用有序锁定的分布式数据包处理来维护必要的数据包排序
公开(公告)号：US07362762B2
公开(公告)日：2008-04-22
申请号：US10892930
申请日：2004-07-16
申请人： John J. Williams, Jr. , John Andrew Fingerhut , Doron Shoham , Shimon Listman
发明人： John J. Williams, Jr. , John Andrew Fingerhut , Doron Shoham , Shimon Listman
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L45/10 , H04L47/34 , H04L47/50 , H04L47/624 , H04L49/9094 , Y10S707/99938
摘要： Sequences of items may be maintained using ordered locks. These items may correspond to anything, but using ordered locks to maintain sequences of packets, especially for maintaining requisite packet orderings when distributing packets to be processed to different packet processing engines, may be particularly useful. For example, in response to a particular packet processing engine completing processing of a particular packet, a gather instruction is attached to the particular identifier of a particular ordered lock associated with the particular packet. If no longer needed for further processing, the packet processing engine is immediately released to be able to process another packet or perform another function. The gather instruction is performed in response to the particular ordered lock being acquired by the particular identifier, with the gather instruction causing the processed particular packet to be sent.
摘要翻译：可以使用有序锁来维护物品的顺序。这些项目可以对应于任何东西，但是使用有序锁来维护分组的序列，特别是当将待处理的分组分发到不同的分组处理引擎时，特别是用于维持必需的分组顺序可能是特别有用的。例如，响应于特定分组处理引擎完成特定分组的处理，收集指令附加到与特定分组相关联的特定有序锁定的特定标识符。如果不再需要进一步处理，则分组处理引擎立即被释放以能够处理另一个分组或执行另一个功能。响应于由特定标识符获取的特定有序锁定执行收集指令，其中收集指令导致处理的特定分组被发送。

38. 发明授权

US07212535B2 Scheduling items using mini-quantum values 有权
标题翻译：使用微量子值计划项目
公开(公告)号：US07212535B2
公开(公告)日：2007-05-01
申请号：US11395191
申请日：2006-03-31
申请人： Doron Shoham , Amir Michaeli , David J. Tsiang , Chandrashekhar Appanna
发明人： Doron Shoham , Amir Michaeli , David J. Tsiang , Chandrashekhar Appanna
IPC分类号： H04L12/28
CPC分类号： H04L47/6225 , H04L47/50 , H04L47/527
摘要： Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, and mechanisms, for scheduling items in a system, such as, but not limited to a computer or communications system. For example, in one implementation, each of the items in a set of items has an associated deficit and mini-deficit. A next particular item is selected from the set of items currently having enough deficit to process the particular item. One or more entities associated with the particular item is processed a commensurate amount corresponding to the mini-deficit associated with the particular item. This processing is repeatedly performed until there are no more entities associated with the particular item or until the deficit associated with the particular item does not allow any further processing at the current time.
摘要翻译：公开了用于在诸如但不限于计算机或通信系统的系统中调度项目的方法，装置，数据结构，计算机可读介质和机制。例如，在一个实现中，一组项目中的每个项目具有相关的赤字和小的缺陷。从当前具有足够的缺陷的一组项目中选择下一个特定项目来处理该特定项目。处理与特定项目相关联的一个或多个实体对应于与特定项目相关联的小缺陷的相应数量。重复执行该处理，直到没有与特定项目相关联的更多实体，或者直到与特定项目相关联的缺陷不允许在当前时间进行任何进一步的处理。

39. 发明申请

US20060168405A1 Sharing memory among multiple information channels 有权
公开(公告)号：US20060168405A1
公开(公告)日：2006-07-27
申请号：US11040797
申请日：2005-01-22
申请人： Doron Shoham , Rami Zemach , John Williams
发明人： Doron Shoham , Rami Zemach , John Williams
IPC分类号： G06F12/00 , G06F13/28
CPC分类号： H04L49/90 , H04L47/50 , H04L47/6255 , H04L49/9047
摘要： Memory is shared among multiple information channels, which may be of particular use for storing streams of packets. Memory allocation information is maintained which can be used to identify the current number of memory segments (e.g., some definable amount of memory) allocated for each of the multiple channels as well as the available number of shared memory segments. Items, such as, but not limited to data, packets, etc., are received and stored in the memory according to the memory allocation information. After a first processing stage for an item, the memory allocation information is updated to reflect an expected number of available memory segments to become available for the respective channel after a subsequent second processing stage. After the second processing stage is completed for an item, its number of memory segments are de-allocated based on the expected available data. In one embodiment, these memory segments are de-allocated one at a time.

40. 发明申请

US20060080498A1 Error protection for lookup operations performed on ternary content-addressable memory entries 有权
标题翻译：对三进制内容可寻址内存条目执行查找操作的错误保护
公开(公告)号：US20060080498A1
公开(公告)日：2006-04-13
申请号：US11280792
申请日：2005-11-16
申请人： Doron Shoham , Earl Cohen
发明人： Doron Shoham , Earl Cohen
IPC分类号： G06F12/00
CPC分类号： G11C15/00 , G06F11/1064
摘要： Lookup operations are performed on ternary content-addressable memory (TCAM) entries, with error protection provided. Groups of TCAM entries are programmed such that each of its entries differ by more than a predetermined calculated count of ones distance of k bits, where k>0. Lookup operations are performed on these entries using a lookup word in a manner to detect k or less differences in entries within groups to identify a matching entry or no matching entry from each group. These matching entries are then verified using a corresponding error code to identify which entries are a full hit, a suspected hit, or a miss. One of the full and suspected hits is determined in a predetermined manner and identified as the lookup result (or a miss is the lookup result if there are no such entries).
摘要翻译：在三进制内容可寻址存储器（TCAM）条目上执行查找操作，并提供错误保护。对TCAM条目组进行编程，使得每个条目的k个比特大于预定计算的k比特距离的计数，其中k> 0。使用查找字对这些条目执行查找操作，以便检测组内的条目中的k个或更少的差异以识别匹配的条目或者不具有来自每个组的匹配条目。然后使用相应的错误代码来验证这些匹配条目，以确定哪些条目是完整命中，可疑命中或错过。以预定的方式确定完整和可疑的命中之一，并将其识别为查找结果（或者如果没有这样的条目，则错过是查找结果）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式