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

1. 发明授权

US07672300B1 Network device with multiple MAC/PHY ports 失效
标题翻译：具有多个MAC / PHY端口的网络设备
公开(公告)号：US07672300B1
公开(公告)日：2010-03-02
申请号：US10896727
申请日：2004-07-22
申请人： Eitan Medina , Yaniv Kopelman
发明人： Eitan Medina , Yaniv Kopelman
IPC分类号： H04L12/50
CPC分类号： H04L49/30 , H04L49/3054 , H04L49/351
摘要： A network device comprises a multi-port MAC device that includes N MAC devices and that outputs a port multiplexed and encoded parallel data stream. A first serializer/deserializer (SERDES) serializes the port multiplexed and encoded parallel data stream from the multi-port MAC device.
摘要翻译：网络设备包括包括N个MAC设备并且输出端口多路复用和编码并行数据流的多端口MAC设备。第一个串行器/解串器（SERDES）将来自多端口MAC设备的端口复用和编码的并行数据流串行化。

2. 发明授权

US08018924B1 Network device with multiple MAC/PHY ports 有权
标题翻译：具有多个MAC / PHY端口的网络设备
公开(公告)号：US08018924B1
公开(公告)日：2011-09-13
申请号：US12715581
申请日：2010-03-02
申请人： Eitan Medina , Yaniv Kopelman
发明人： Eitan Medina , Yaniv Kopelman
IPC分类号： H04L12/50
CPC分类号： H04L49/30 , H04L49/3054 , H04L49/351
摘要： A network device includes a multi-port media access controller (MAC) device that comprises a plurality of MAC devices. Some of the MAC devices output respective data streams at different speeds. A plurality of speed translators translates the speeds of the respective data streams to be greater than or equal to a highest output speed of the plurality of MAC devices and generates parallel speed translated data streams. A multiplexer multiplexes the parallel speed translated data streams to generate a multiplexed data stream corresponding to one of the plurality of MAC devices with the highest output speed defined by the parallel speed translated data streams. A first serializer and deserializer receives the multiplexed data stream that is encoded at a physical coding sublayer and serially transmits the multiplexed data stream to a multi-port physical layer device.
摘要翻译：网络设备包括包括多个MAC设备的多端口媒体接入控制器（MAC）设备。一些MAC设备以不同的速度输出相应的数据流。多个速度转换器将各个数据流的速度转换成大于或等于多个MAC设备的最高输出速度，并产生并行速度转换的数据流。复用器多路复用并行速度转换的数据流，以产生与由并行速度转换的数据流定义的具有最高输出速度的多个MAC设备之一相对应的复用数据流。第一串行器和解串器接收在物理编码子层编码的复用数据流，并将多路复用的数据流串行发送到多端口物理层设备。

3. 发明授权

US08018851B1 Flow control for multiport PHY 有权
标题翻译：多端口PHY的流量控制
公开(公告)号：US08018851B1
公开(公告)日：2011-09-13
申请号：US10883480
申请日：2004-06-30
申请人： Eitan Medina , Yaniv Kopelman
发明人： Eitan Medina , Yaniv Kopelman
IPC分类号： H04L12/26
CPC分类号： H04L47/10 , H04L47/26 , H04L47/30
摘要： A network system may include a number of switches connected to a network processor that handles the bulk of the switching and/or routing in the system. The switches may provide per port flow control status information, e.g., the flow control status of a number of their ports, over a link to the network processor. The network processor may use this information to make traffic management decisions.
摘要翻译：网络系统可以包括连接到网络处理器的多个交换机，其处理系统中的大部分交换和/或路由。交换机可以通过到网络处理器的链路来提供每个端口流量控制状态信息，例如其端口数量的流量控制状态。网络处理器可以使用该信息来做出流量管理决定。

4. 发明申请

US20070253411A1 Efficient management of queueing resources for diffserv-aware switches 有权
标题翻译：有效管理支持diffserv的交换机的排队资源
公开(公告)号：US20070253411A1
公开(公告)日：2007-11-01
申请号：US11412265
申请日：2006-04-26
申请人： Carmi Arad , Yaniv Kopelman , Aviran Kadosh
发明人： Carmi Arad , Yaniv Kopelman , Aviran Kadosh
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L47/2408 , H04L47/2441 , H04L47/32 , H04L49/90 , H04L49/901 , H04L49/9021
摘要： Resources allocated to a group of ports include a plurality of storage regions. Each storage region includes a committed area and a shared area. A destination storage region is identified for a packet. A packet queuing engine stores the packet in the committed area of the determined destination storage region if it has a first drop precedence value, and if available storage space in the committed area exceeds a first threshold. The packet queuing engine stores the packet in the shared area of the determined destination storage region if the packet is not stored in the committed area, and if available storage space exceeds a second threshold defined by the packet's drop precedence value. If the packet is not stored either in the committed or shared area, it may be dropped.
摘要翻译：分配给一组端口的资源包括多个存储区域。每个存储区域包括承诺区域和共享区域。为分组识别目的地存储区域。如果分组排队引擎具有第一丢弃优先级值，则分组排队引擎将所述分组存储在所确定的目的地存储区域的提交区域中，并且如果所述提交区域中的可用存储空间超过第一阈值。如果分组未存储在提交区域中，并且如果可用存储空间超过由分组的丢弃优先级值定义的第二阈值，则分组排队引擎将分组存储在所确定的目的地存储区域的共享区域中。如果数据包未存储在承诺或共享区域中，则可能会丢弃该数据包。

5. 发明授权

US08577854B1 Apparatus and method for high speed flow classification 有权
标题翻译：高速流分类装置及方法
公开(公告)号：US08577854B1
公开(公告)日：2013-11-05
申请号：US10179483
申请日：2002-06-24
申请人： Yaniv Kopelman , Carmi Arad , Nafea Bishara
发明人： Yaniv Kopelman , Carmi Arad , Nafea Bishara
IPC分类号： G06F7/00
CPC分类号： G06F17/30864
摘要： A flow classifier for a network device that processes packets including packet headers includes a hash generator that generates hash index values from search keys derived from the packet headers. A hash table receives the hash index values and outputs pointers. A flow table includes flow keys and corresponding actions. A variable length (VL) trie data structure uses the pointers to locate the flow keys for the search keys. The VL trie data structure selects different flow keys for the search keys that share a common hash index value. The pointers include node, NIL and leaf pointers. The flow classifier performs a default action for the NIL pointers. A pointer calculator accesses a VL trie table using the pointers.
摘要翻译：用于处理包括分组报头的分组的网络设备的流分类器包括从从分组报头导出的搜索关键字生成哈希索引值的哈希生成器。哈希表接收散列索引值并输出指针。流程表包括流量键和相应的动作。可变长度（VL）特里数据结构使用指针来定位搜索关键字的流键。 VL trie数据结构为共享公共散列索引值的搜索关键字选择不同的流密钥。指针包括节点，NIL和叶指针。流分类器对NIL指针执行默认操作。指针计算器使用指针访问VL trie表。

6. 发明授权

US08428061B1 Packet header altering device 有权
标题翻译：分组报头改变设备
公开(公告)号：US08428061B1
公开(公告)日：2013-04-23
申请号：US12283011
申请日：2008-09-09
申请人： Yaniv Kopelman , Nafea Bishara , Yariv Anafi
发明人： Yaniv Kopelman , Nafea Bishara , Yariv Anafi
IPC分类号： H04L12/28 , H04L12/26
CPC分类号： H04L61/103 , H04L12/462 , H04L29/0602 , H04L69/22
摘要： A packet processor for a network device includes an incoming port that receives a first packet. The first packet includes a data portion, a control portion and a first outgoing port. A control data processing device receives the control portion from the incoming port while the data portion is stored in memory, and transmits the control portion to the first outgoing port. The first outgoing port transmits a first request for the data portion based on the control portion. A header altering device retrieves the data portion from the memory and strips, modifies, and encapsulates the data portion based on the first request.
摘要翻译：用于网络设备的分组处理器包括接收第一分组的输入端口。第一分组包括数据部分，控制部分和第一输出端口。控制数据处理装置在将数据部分存储在存储器中的同时从输入端口接收控制部分，并将控制部分发送到第一输出端口。第一输出端口基于控制部分发送对数据部分的第一请求。报头更换设备从存储器检索数据部分，并根据第一请求剥离，修改和封装数据部分。

7. 发明授权

US08018944B1 Apparatus and method for efficient longest prefix match lookup 有权
标题翻译：用于有效最长前缀匹配查找的装置和方法
公开(公告)号：US08018944B1
公开(公告)日：2011-09-13
申请号：US12609549
申请日：2009-10-30
申请人： Yaniv Kopelman , Carmi Arad , Nafea Bishara
发明人： Yaniv Kopelman , Carmi Arad , Nafea Bishara
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/7457 , H04L49/3009
摘要： A packet processor includes a forwarding table configured to store address prefixes and a search engine configured to receive a packet and to search the forwarding table. The search engine includes a set bit counter configured to receive an address of the packet, to count set bits of a first bit vector associated with the packet, and to output a number of the set bits. A next hop table is configured to store a next hop pointer. A next bucket pointer receives the number of set bits and outputs one of the next hop pointers and the next bucket pointer based on the number of set bits.
摘要翻译：分组处理器包括被配置为存储地址前缀的转发表和被配置为接收分组并搜索转发表的搜索引擎。搜索引擎包括被配置为接收分组的地址的设置位计数器，以对与分组相关联的第一比特向量的设置比特进行计数，并输出多个设置比特。下一跳表被配置为存储下一跳指针。下一个桶指针接收设置的位数，并根据设置的位数输出下一跳指针和下一个桶指针之一。

8. 发明授权

US07852850B2 Double-hash lookup mechanism for searching addresses in a network device 有权
标题翻译：用于搜索网络设备中的地址的双哈希查找机制
公开(公告)号：US07852850B2
公开(公告)日：2010-12-14
申请号：US11412672
申请日：2006-04-26
申请人： Yaniv Kopelman , Ruven Torok , Dan Aharoni
发明人： Yaniv Kopelman , Ruven Torok , Dan Aharoni
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： H04L45/00 , H04L45/745 , H04L49/3009 , H04L49/45
摘要： A hash function is applied to a set of data to generate a hash. A first subset of the hash is used to lookup an entry in a lookup table for a forwarding database. A second subset of the hash is used to identify, within the entry, data comprising an offset. The offset is applied to a location identified in the forwarding database by the first subset of the hash to determine an entry in the forwarding database. Optionally, the lookup mechanism is used in conjunction with one or more other forwarding databases. A method of updating the forwarding database within the double hash lookup framework is also described.
摘要翻译：散列函数应用于一组数据以生成散列。散列的第一个子集用于查找转发数据库的查找表中的条目。散列的第二子集用于在条目内识别包括偏移的数据。偏移量被应用于转发数据库中由散列的第一子集识别的位置，以确定转发数据库中的条目。可选地，查找机制与一个或多个其他转发数据库结合使用。还描述了在双重哈希查找框架内更新转发数据库的方法。

9. 发明授权

US07613189B1 Apparatus and method for efficient longest prefix match lookup 有权
标题翻译：用于有效最长前缀匹配查找的装置和方法
公开(公告)号：US07613189B1
公开(公告)日：2009-11-03
申请号：US11796143
申请日：2007-04-26
申请人： Yaniv Kopelman , Carmi Arad , Nafea Bishara
发明人： Yaniv Kopelman , Carmi Arad , Nafea Bishara
IPC分类号： H04L12/56 , G06F15/16
CPC分类号： H04L45/00 , H04L45/7457 , H04L49/3009
摘要： A network switch includes a matching device that employs a first data structure to select one of N address groups including a first partial address of an IP packet. An action table selects one of a next hop location corresponding to a longest prefix match and a first matching operation for the IP packet based on the selected one of the N groups. When the first matching operation is selected, the matching device employs a second data structure to select one of M address groups including a second partial address of the IP packet. The action table selects one of a next hop location corresponding to a longest prefix match and a second matching operation for the IP packet based on the selected one of the M groups. A routing engine routes the IP packet based on the first and second next hop locations.
摘要翻译：网络交换机包括匹配设备，其采用第一数据结构来选择包括IP分组的第一部分地址的N个地址组之一。动作表基于所选择的N个组中的一个，选择对应于最长前缀匹配的下一跳位置和针对IP分组的第一匹配操作中的一个。当选择第一匹配操作时，匹配装置采用第二数据结构来选择包括IP分组的第二部分地址的M个地址组之一。所述动作表基于所述M组中选择的一个，选择对应于最长前缀匹配的下一跳位置和所述IP分组的第二匹配操作中的一个。路由引擎基于第一和第二下一跳位置来路由IP分组。

10. 发明授权

US07212531B1 Apparatus and method for efficient longest prefix match lookup 有权
标题翻译：用于有效最长前缀匹配查找的装置和方法
公开(公告)号：US07212531B1
公开(公告)日：2007-05-01
申请号：US10167005
申请日：2002-06-10
申请人： Yaniv Kopelman , Carmi Arad , Nafea Bishara
发明人： Yaniv Kopelman , Carmi Arad , Nafea Bishara
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/7457 , H04L49/3009
摘要： A search engine improves search speed and reduces required memory for a longest prefix matching (LPM) router that routes packets using IP addresses. The search engine includes a first bit vector with set bits corresponding to address ranges. A set bit counter counts the set bits in the bit vector based on a first portion of the address of the a first packet. A first next hop table contains first pointers for each of the set bits. One of the first pointers is selected based on a number of set bits counted by the set bit counter. For longer addresses, the addresses are split into address portions. The search engine includes a trie data structure that has n levels. The n levels of the trie data structure include nodes representing non-overlapping address space.
摘要翻译：搜索引擎提高搜索速度，并减少使用IP地址路由数据包的最长前缀匹配（LPM）路由器所需的内存。搜索引擎包括具有对应于地址范围的设置位的第一位向量。设置位计数器基于第一分组的地址的第一部分对比特向量中的设置比特进行计数。第一个下一跳表包含每个设置位的第一个指针。基于由设置的位计数器计数的设定位数来选择第一个指针之一。对于较长的地址，地址被分割成地址部分。搜索引擎包括具有n个级别的特里数据结构。特里数据结构的n个级别包括表示非重叠地址空间的节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式