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

1. 发明授权

US07275129B1 Accessing multiple copies of RAM distributed throughout an ASIC/FPGA and maintaining their content consistency 有权
标题翻译：访问分布在整个ASIC / FPGA中的多个RAM副本，并保持其内容的一致性
公开(公告)号：US07275129B1
公开(公告)日：2007-09-25
申请号：US10768925
申请日：2004-01-30
申请人： Quang Cao Phung , John Sandoval , Kent Wayne Wendorf
发明人： Quang Cao Phung , John Sandoval , Kent Wayne Wendorf
IPC分类号： G06F12/00
CPC分类号： G06F13/1663 , G06F11/167
摘要： A system and method for writing the same data field to multiple RAM copies during a single write cycle that fans out write data, address data, and control data to multiple RAMs. The multiple copies of data held at the same address in the multiple RAM copies are also read during a single write cycle and the data from each RAM copy is concatenated into a single word that is read during a single read cycle.
摘要翻译：一种用于在单个写入周期内将相同数据字段写入多个RAM副本的系统和方法，用于将写数据，地址数据和控制数据写入多个RAM。保持在多个RAM副本中的相同地址的数据的多个副本也将在单个写周期期间被读取，并且来自每个RAM副本的数据被连接成在单个读取周期期间读取的单个字。

2. 发明授权

US08775727B2 Lookup engine with pipelined access, speculative add and lock-in-hit function 有权
标题翻译：具有流水线访问的查找引擎，推测添加和锁定命中功能
公开(公告)号：US08775727B2
公开(公告)日：2014-07-08
申请号：US13600464
申请日：2012-08-31
申请人： Leonid Baryudin , Earl T. Cohen , Kent Wayne Wendorf
发明人： Leonid Baryudin , Earl T. Cohen , Kent Wayne Wendorf
IPC分类号： G06F13/10
CPC分类号： G11C15/00 , G06F3/0619 , G06F3/0659 , G06F3/0671
摘要： Described embodiments provide a lookup engine that receives lookup requests including a requested key and a speculative add requestor. Iteratively, for each one of the lookup requests, the lookup engine searches each entry of a lookup table for an entry having a key matching the requested key of the lookup request. If the lookup table does not include an entry having a key matching the requested key, the lookup engine sends a miss indication corresponding to the lookup request to the control processor. If the speculative add requestor is set, the lookup engine speculatively adds the requested key to a free entry in the lookup table. Speculatively added keys are searchable in the lookup table for subsequent lookup requests to maintain coherency of the lookup table without creating duplicate key entries, comparing missed keys with each other or stalling the lookup engine to insert missed keys.
摘要翻译：描述的实施例提供了一种查找引擎，其接收包括所请求的密钥和推测添加请求者的查找请求。迭代地，对于每个查找请求，查找引擎搜索查找表的每个条目，以获得具有与查找请求的请求密钥匹配的密钥的条目。如果查找表不包括具有与所请求的密钥匹配的密钥的条目，则查找引擎向控制处理器发送对应于查找请求的未命中指示。如果设置了推测性添加请求者，则查找引擎推测性地将请求的密钥添加到查找表中的空闲条目。在查找表中可以搜索用于后续查找请求的推测加密密钥，以维护查找表的一致性，而不创建重复密钥条目，将错过的密钥彼此进行比较，或者阻止查找引擎插入错过的密钥。

3. 发明申请

US20140068176A1 LOOKUP ENGINE WITH PIPELINED ACCESS, SPECULATIVE ADD AND LOCK-IN-HIT FUNCTION 有权
标题翻译： LOOKUP发动机具有管道接入，调节增加和锁定功能
公开(公告)号：US20140068176A1
公开(公告)日：2014-03-06
申请号：US13600464
申请日：2012-08-31
申请人： Leonid Baryudin , Earl T. Cohen , Kent Wayne Wendorf
发明人： Leonid Baryudin , Earl T. Cohen , Kent Wayne Wendorf
IPC分类号： G06F12/12 , G06F12/00
CPC分类号： G11C15/00 , G06F3/0619 , G06F3/0659 , G06F3/0671
摘要： Described embodiments provide a lookup engine that receives lookup requests including a requested key and a speculative add requestor. Iteratively, for each one of the lookup requests, the lookup engine searches each entry of a lookup table for an entry having a key matching the requested key of the lookup request. If the lookup table does not include an entry having a key matching the requested key, the lookup engine sends a miss indication corresponding to the lookup request to the control processor. If the speculative add requestor is set, the lookup engine speculatively adds the requested key to a free entry in the lookup table. Speculatively added keys are searchable in the lookup table for subsequent lookup requests to maintain coherency of the lookup table without creating duplicate key entries, comparing missed keys with each other or stalling the lookup engine to insert missed keys.
摘要翻译：描述的实施例提供了一种查找引擎，其接收包括所请求的密钥和推测添加请求者的查找请求。迭代地，对于每个查找请求，查找引擎搜索查找表的每个条目，以获得具有与查找请求的请求密钥匹配的密钥的条目。如果查找表不包括具有与所请求的密钥匹配的密钥的条目，则查找引擎向控制处理器发送对应于查找请求的未命中指示。如果设置了推测性添加请求者，则查找引擎推测性地将请求的密钥添加到查找表中的空闲条目。在查找表中可以搜索用于后续查找请求的推测加密密钥，以维护查找表的一致性，而不创建重复密钥条目，将错过的密钥彼此进行比较，或者阻止查找引擎插入错过的密钥。

4. 发明授权

US07450503B1 System and method to multicast guaranteed and best-effort traffic in a communications network 有权
标题翻译：在通信网络中组播保证和尽力流量的系统和方法
公开(公告)号：US07450503B1
公开(公告)日：2008-11-11
申请号：US10330615
申请日：2002-12-24
申请人： Hariprasada Rao Ginjpalli , Kent Wayne Wendorf
发明人： Hariprasada Rao Ginjpalli , Kent Wayne Wendorf
IPC分类号： H04L12/28 , H04L12/66
CPC分类号： H04L47/10 , H04L12/18 , H04L47/15 , H04L47/2441 , H04L47/283
摘要： A system and method to multicast guaranteed and best-effort traffic in a communications network are disclosed. According to one embodiment, incoming traffic is separated into unicast traffic and multicast traffic. Each root cell of the multicast traffic is classified based on multiple corresponding classes of service. Each root cell is then stored into a root cell buffer of multiple root cell buffers within an egress memory, each root cell buffer being associated with a corresponding class of service. According to one embodiment, each root cell is retrieved from the corresponding root cell buffer within the egress memory according to the associated class of service. Each root cell is then stored in a corresponding replication queue of multiple replication queues based on its associated class of service, with predetermined replication parameters assigned to each replication queue. Each root cell is subsequently replicated according to one or more associated replication parameters to obtain multiple leaf cells for each replicated root cell. According to one embodiment, the unicast traffic is multiplexed with the replicated leaf cells of the multicast traffic to obtain egress arrival cells. Each egress arrival cell is then stored hierarchically into a queuing buffer of multiple queuing buffers within a queuing memory according to queuing parameters corresponding to each egress arrival cell.
摘要翻译：公开了一种在通信网络中组播保证和尽力流量的系统和方法。根据一个实施例，入局业务被分为单播业务和组播业务。多播流量的每个根单元基于多个相应的服务类别进行分类。然后将每个根单元存储到出口存储器内的多个根单元缓冲器的根单元缓冲器中，每个根单元缓冲器与相应的服务类别相关联。根据一个实施例，根据相关联的服务类别，从出口存储器内的相应根单元缓冲器检索每个根单元。然后，每个根单元基于其相关联的服务类别存储在多个复制队列的相应复制队列中，并将预定的复制参数分配给每个复制队列。随后根据一个或多个相关复制参数复制每个根细胞，以获得每个复制根细胞的多个叶细胞。根据一个实施例，单播流量与多播流量的复制叶单元多路复用以获得出口到达单元。然后，根据对应于每个出口到达小区的排队参数，每个出口到达小区被分层地存储在排队存储器内的多个排队缓冲器的排队缓冲器中。

5. 发明授权

US07197051B1 System and method for efficient packetization of ATM cells transmitted over a packet network 有权
标题翻译：通过分组网络传输的ATM信元的有效分组化的系统和方法
公开(公告)号：US07197051B1
公开(公告)日：2007-03-27
申请号：US09974462
申请日：2001-10-09
申请人： Hariprasad Ginjpalli , Jayakumar Jayakumar , Durai Chinnaiah , Kent Wayne Wendorf , James Ding
发明人： Hariprasad Ginjpalli , Jayakumar Jayakumar , Durai Chinnaiah , Kent Wayne Wendorf , James Ding
IPC分类号： H04J3/24
CPC分类号： H04L12/5601 , H04L2012/5662
摘要： A system and method for efficient packetization of cells transmitted over a packet network are described. Multiple virtual connections are received, each virtual connection carrying multiple cells. One or more cells of the cells carried by each virtual connection are stored for a predetermined time period. A cell counter of the stored cells is modified to indicate a number of the stored cells. Finally, a packet containing the stored cells is formed, the packet to be transmitted to a destination node over a network.
摘要翻译：描述了通过分组网络传输的小区的有效分组化的系统和方法。接收多个虚拟连接，每个虚拟连接承载多个单元。每个虚拟连接承载的小区的一个或多个小区被存储预定时间段。存储的单元的单元计数器被修改以指示存储的单元的数量。最后，形成包含存储单元的分组，该分组将通过网络发送到目的地节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式