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

51. 发明申请

US20130266021A1 BUFFER MANAGEMENT SCHEME FOR A NETWORK PROCESSOR 审中-公开
标题翻译：网络处理器的缓冲区管理方案
公开(公告)号：US20130266021A1
公开(公告)日：2013-10-10
申请号：US13990587
申请日：2011-12-19
申请人： Claude Basso , Jean L. Calvignac , Chih-jen Chang , Damon Philippe , Michel L. Poret , Natarajan Vaidhyanathan , Fabrice J. Verplanken , Colin B. Verrilli
发明人： Claude Basso , Jean L. Calvignac , Chih-jen Chang , Damon Philippe , Michel L. Poret , Natarajan Vaidhyanathan , Fabrice J. Verplanken , Colin B. Verrilli
IPC分类号： H04L12/70
CPC分类号： H04L49/90 , G06F5/10 , G06F13/128
摘要： The invention provides a method for adding specific hardware on both receive and transmit sides that will hide to the software most of the effort related to buffer and pointers management. At initialization, a set of pointers and buffers is provided by software, in quantity large enough to support expected traffic. A Send Queue Replenisher (SQR) and Receive Queue Replenisher (RQR) hide RQ and SQ management to software. RQR and SQR fully monitor pointers queues and perform recirculation of pointers from transmit side to receive side.
摘要翻译：本发明提供了一种在接收端和发送端添加特定硬件的方法，其将隐藏与软件大部分与缓冲器和指针管理相关的功能的软件。在初始化时，一组指针和缓冲区由软件提供，数量足够大以支持预期流量。发送队列补货（SQR）和接收队列补货（RQR）将RQ和SQ管理隐藏到软件中。 RQR和SQR完全监视指针队列，并执行从发送端到接收端的指针的再循环。

52. 发明授权

US07529224B2 Scheduler, network processor, and methods for weighted best effort scheduling 失效
标题翻译：调度器，网络处理器和加权最佳努力调度的方法
公开(公告)号：US07529224B2
公开(公告)日：2009-05-05
申请号：US11108485
申请日：2005-04-18
申请人： Claude Basso , Jean Louis Calvignac , Chih-jen Chang , Natarajan Vaidhyanathan , Fabrice Jean Verplanken
发明人： Claude Basso , Jean Louis Calvignac , Chih-jen Chang , Natarajan Vaidhyanathan , Fabrice Jean Verplanken
IPC分类号： H04L12/28
CPC分类号： H04L47/568 , H04L45/00 , H04L45/60 , H04L47/50 , H04L47/527
摘要： Systems and methods for scheduling data packets in a network processor are disclosed. Embodiments provide a network processor that comprises a best-effort scheduler with a minimal calendar structure for addressing schedule control blocks. In one embodiment, a three-entry calendar structure provides for weighted best effort scheduling. Each of a plurality different flows has an associated schedule control block. Schedule control blocks are stored as linked lists in a last-in-first-out buffer. Each calendar entry is associated with a different linked list by storing in the calendar entry the address of the first-out schedule control block in the linked list. Each schedule control block has a counter and is assigned a weight according to the bandwidth priority of the flow to which the corresponding packet belongs. Each time a schedule control block is accessed from a last-in-first-out buffer storing the linked list, the scheduler generates a scheduling event and the counter of the schedule control block is incremented. When an incremented counter of a schedule control block equals its weight, the schedule control block is temporarily removed from further scheduling.
摘要翻译：公开了一种用于在网络处理器中调度数据分组的系统和方法。实施例提供了一种网络处理器，其包括具有用于寻址日程控制块的最小日历结构的尽力而为调度器。在一个实施例中，三入口日历结构提供加权最佳努力调度。多个不同的流中的每一个具有相关的进度控制块。计划控制块作为链表存储在先进先出缓冲区中。通过在日历条目中存储链表中的先出时间表控制块的地址来将每个日历条目与不同的链表相关联。每个调度控制块具有计数器，并根据相应分组所属的流的带宽优先级分配权重。每当从存储链表的最先进先出缓冲器访问调度控制块时，调度器生成调度事件，并且调度控制块的计数器递增。当调度控制块的递增计数器等于其权重时，调度控制块暂时从进一步调度中移除。

53. 发明授权

US07050940B2 Method and system for maintaining and examining timers for network connections 失效
标题翻译：用于维护和检查网络连接的定时器的方法和系统
公开(公告)号：US07050940B2
公开(公告)日：2006-05-23
申请号：US10802235
申请日：2004-03-17
申请人： Claude Basso , Richard J. Blasiak , Philippe Damon , Laurent Frelechoux , Brahmanand K. Gorti , Bernard Metzler , Bay V. Nguyen , Natarajan Vaidhyanathan , Colin B. Verrilli
发明人： Claude Basso , Richard J. Blasiak , Philippe Damon , Laurent Frelechoux , Brahmanand K. Gorti , Bernard Metzler , Bay V. Nguyen , Natarajan Vaidhyanathan , Colin B. Verrilli
IPC分类号： G06F15/00
CPC分类号： H04L69/28
摘要： System and method for maintenance and examination of timers for a computer system having connections in a networking system. Timer values in a connection table each indicate a timeout for a timer for a connection, where each connection has multiple timers, and one of the timer values is written to a global timer array for each connection such that the global timer array can be scanned to determine when timeouts occur for active connections. Sparse restart of a timer includes restarting the timer if data is communicated with a connected computer before the timeout occurs and after a predetermined time interval after timer start, and not restarting the timer if data is communicated before the timeout occurs and within the predetermined interval after timer start.
摘要翻译：用于维护和检查具有网络系统中的连接的计算机系统的定时器的系统和方法。连接表中的定时器值各自表示连接的定时器的超时，其中每个连接具有多个定时器，并且其中一个定时器值被写入到每个连接的全局定时器阵列，以便可以扫描全局定时器阵列确定活动连接的超时时间。定时器的稀疏重新启动包括重新启动定时器，如果数据在超时发生之前与连接的计算机通信，并且在定时器启动之后的预定时间间隔之后重新启动，并且如果在超时发生之前传输数据并且在超时之后的预定时间间隔内，则不重新启动定时器定时器启动。

54. 发明申请

US20050060428A1 Apparatus and method for caching lookups based upon TCP traffic flow characteristics 有权
标题翻译：基于TCP流量特性来缓存查找的装置和方法
公开(公告)号：US20050060428A1
公开(公告)日：2005-03-17
申请号：US10662007
申请日：2003-09-11
申请人： Everett Corl , Gordon Davis , Clark Jeffries , Natarajan Vaidhyanathan , Colin Verrilli
发明人： Everett Corl , Gordon Davis , Clark Jeffries , Natarajan Vaidhyanathan , Colin Verrilli
IPC分类号： G06F15/173 , H04L12/56 , H04L29/06
CPC分类号： H04L45/00 , H04L69/22
摘要： The classification system of a network device includes a cache in which a mapping between predefined characteristics of TCP/IP packets and associated actions are stored in response to the first “Frequent Flyer” packet in of a session. Selected characteristics from subsequent received packets of that session are correlated with the predefined characteristics and the stored actions are applied to the received packets if the selected characteristics and the predefined characteristics match, thus reducing the processing required for subsequent packets. The packets selected for caching may be data packets. For mismatched characteristics, the full packet search of the classification system is used to determine the action to apply to the received packet.
摘要翻译：网络设备的分类系统包括缓存，其中响应于会话中的第一“频繁传单”分组而存储TCP / IP分组的预定义特性与相关动作之间的映射。如果所选择的特征和预定义的特征匹配，则从该会话的后续接收到的分组中选出的特征与预定义的特征相关联，并且将存储的动作应用于所接收的分组，从而减少后续分组所需的处理。选择用于缓存的数据包可能是数据包。对于不匹配的特征，分类系统的全分组搜索用于确定应用于接收到的分组的动作。

55. 发明授权

US08726132B2 Checksum verification accelerator 失效
标题翻译：校验和验证加速器
公开(公告)号：US08726132B2
公开(公告)日：2014-05-13
申请号：US13302688
申请日：2011-11-22
申请人： Francois Abel , Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice Jean Verplanken
发明人： Francois Abel , Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice Jean Verplanken
IPC分类号： H03M13/00
CPC分类号： H04L1/0079 , H04L1/0061 , H04L1/0072
摘要： Disclosed is a method and system for validating a data packet by a network processor supporting a first network protocol and a second network protocol and utilizing shared hardware. The network processor receives a data packet; identifies a network packet protocol for the data packet; and processes the data packet according to the network packet protocol comprising: updating a first register with a first partial packet length specific to the first network protocol; updating a second register with a second partial packet length specific to the second network protocol; and updating a third register with a first checksum computed from fields independent of the network protocol. The system produces a second checksum utilizing a function that combines values from the first register, the second register, and the third register. The system validates the data packet by comparing the data packet checksum to the second checksum.
摘要翻译：公开了一种用于通过支持第一网络协议和第二网络协议的网络处理器来验证数据分组并利用共享硬件的方法和系统。网络处理器接收数据包; 识别数据包的网络包协议; 并根据网络分组协议对数据分组进行处理，包括：以第一网络协议特有的第一部分分组长度更新第一寄存器; 用第二网络协议特有的第二部分分组长度更新第二寄存器; 以及用独立于网络协议的字段计算的具有第一校验和的更新第三寄存器。该系统利用组合来自第一寄存器，第二寄存器和第三寄存器的值的函数产生第二校验和。系统通过将数据包校验和与第二个校验和进行比较来验证数据包。

56. 发明申请

US20130182707A1 MANAGING A GLOBAL FORWARDING TABLE IN A DISTRIBUTED SWITCH 有权
标题翻译：在分布式交换机中管理全局前向表
公开(公告)号：US20130182707A1
公开(公告)日：2013-07-18
申请号：US13352973
申请日：2012-01-18
申请人： Debra L. Angst , Claude Basso , Josep Cors , Rekha Mundhra , Natarajan Vaidhyanathan
发明人： Debra L. Angst , Claude Basso , Josep Cors , Rekha Mundhra , Natarajan Vaidhyanathan
IPC分类号： H04L12/56
CPC分类号： H04L12/44 , H04L12/18 , H04L12/4625 , H04L41/12 , H04L45/02 , H04L45/16 , H04L45/54 , H04L47/15 , H04L49/201 , H04L49/65 , H04L69/28
摘要： Apparatuses and methods to manage a global forwarding table in a distributed switch are provided. A particular method may include managing a global forwarding table in a distributed switch. The distributed switch may include a plurality of switch forwarding units. The method may start a timer for an entry in the global forwarding table, and the entry may include a multicast destination address and corresponding multicast membership information. The method may also, in response to expiration of the timer of the entry, check at least one hit status to determine whether at least one switch forwarding unit of the plurality of switch forwarding units has forwarded multicast data to the corresponding multicast membership information of the multicast destination address of the entry. The method may further determine whether the entry is a cast-out candidate based on the hit status.
摘要翻译：提供了在分布式交换机中管理全局转发表的设备和方法。特定方法可以包括管理分布式交换机中的全局转发表。分布式交换机可以包括多个交换机转发单元。该方法可以启动全局转发表中的条目的定时器，并且该条目可以包括多播目的地地址和相应的多播成员资格信息。该方法还可以响应于条目的定时器的到期来检查至少一个命中状态，以确定多个交换机转发单元中的至少一个交换机转发单元是否已经将多播数据转发到相应的组播成员信息组播目的地址。该方法还可以基于命中状态进一步确定该条目是否是舍弃候选者。

57. 发明申请

US20090103536A1 Method and System for Reducing Look-Up Time in Packet Forwarding on Computer Networks 有权
标题翻译：减少计算机网络中数据包转发查找时间的方法和系统
公开(公告)号：US20090103536A1
公开(公告)日：2009-04-23
申请号：US11780444
申请日：2007-07-19
申请人： Claude Basso , Bay Van Nguyen , Max Robert Povse , Natarajan Vaidhyanathan , Colin Beaton Verrilli
发明人： Claude Basso , Bay Van Nguyen , Max Robert Povse , Natarajan Vaidhyanathan , Colin Beaton Verrilli
IPC分类号： H04L12/56
CPC分类号： H04L29/00 , H04L45/742
摘要： A method and system for reducing the lookup time in packet forwarding on computer networks. A first lookup is performed in a memory tree to find a first protocol forwarding entry in the memory tree. The forwarding entry includes first protocol (e.g., EGP) information and cached associated second protocol (e.g., IGP) information. Both EGP and IGP information are retrievable with the first lookup and used in the determination of an EGP route for the data packet. If the cached IGP information has been invalidated due to address updates, a second lookup can be performed to find an original IGP entry in the memory tree, the information from which can be cached in the EGP forwarding entry if a background maintenance task has finished designating all the EGP entries as having out-of-date caches.
摘要翻译：一种用于减少计算机网络上的分组转发中的查找时间的方法和系统。在存储器树中执行第一次查找以在存储器树中找到第一协议转发条目。转发条目包括第一协议（例如，EGP）信息和缓存的相关联的第二协议（例如，IGP）信息。 EGP和IGP信息都可以通过第一次查找进行检索，并用于确定数据包的EGP路由。如果缓存的IGP信息由于地址更新而被无效，则可以执行第二次查找以在存储器树中找到原始IGP条目，如果后台维护任务已经完成指定，则可以将其从EGP转发条目缓存到其中所有EGP条目都具有过期缓存。

58. 发明授权

US07333493B2 Method for prevention of out-of-order delivery of data packets 失效
标题翻译：防止数据包乱序传送的方法
公开(公告)号：US07333493B2
公开(公告)日：2008-02-19
申请号：US10850296
申请日：2004-05-20
申请人： Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice J. Verplanken
发明人： Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice J. Verplanken
IPC分类号： H04L12/28
CPC分类号： H04L69/166 , H04L29/06 , H04L69/16
摘要： A method for sequencing delivery of information packets from a router having several processing elements to a receiving processing installation, wherein delivery of the packets must be completed in the order the packets arrive at the router. A linked list of packets is formed in the order they are received at the router, and each packet fragmented into successive fragments. Each fragment is processed at the router. The last fragment of each packet in each linked list is labeled with the sequence in which the packet was received, and enqueued in the order labeled for each last fragment on each linked list. Each fragment of each packet is delivered as processed, except the last fragment of each packet on its linked list to the receiving processor installation, and thereafter, transmitting the final fragment of each packet after processing only if that fragment is at the head of the queue.
摘要翻译：一种用于将信息分组从具有多个处理元件的路由器传送到接收处理设备的方法，其中分组的传送必须按分组到达路由器的顺序完成。分组的链表以它们在路由器处接收的顺序形成，并且每个分组被分段成连续的片段。每个片段在路由器处理。每个链表中每个数据包的最后一个片段都标有接收数据包的顺序，并按照每个链表上每个最后一个片段标记的顺序排队。每个分组的每个片段被处理，除了其链接列表上的每个分组的最后片段到接收处理器安装，然后在处理之后仅在该片段位于队列的头部时发送每个分组的最后片段。

59. 发明授权

US06721800B1 System using weighted next hop option in routing table to include probability of routing a packet for providing equal cost multipath forwarding packets 失效
标题翻译：在路由表中使用加权下一跳选项的系统包括路由数据包以提供相等成本的多路径转发数据包的概率
公开(公告)号：US06721800B1
公开(公告)日：2004-04-13
申请号：US09546702
申请日：2000-04-10
申请人： Claude Basso , Anthony Matteo Gallo , Natarajan Vaidhyanathan
发明人： Claude Basso , Anthony Matteo Gallo , Natarajan Vaidhyanathan
IPC分类号： G06F15173
CPC分类号： H04L45/54 , H04L45/00 , H04L45/22 , H04L45/745
摘要： A system and method for providing the ability for a network processor to select from multiple next hop options for a single forwarding entry and provide the ability to weight the probability of which next hop will be chosen.
摘要翻译：一种用于提供网络处理器从单个转发条目的多个下一跳选项中进行选择的能力的系统和方法，并提供加权下一跳将被选择的概率的能力。

60. 发明申请

US20140082176A1 USING SPECIAL-CASE HARDWARE UNITS FOR FACILITATING ACCESS CONTROL LISTS ON A NETWORKING ELEMENT 有权
标题翻译：使用特殊情况硬件单元，实现对网络元素的访问控制列表
公开(公告)号：US20140082176A1
公开(公告)日：2014-03-20
申请号：US13616201
申请日：2012-09-14
申请人： Claude Basso , Natarajan Vaidhyanathan , Colin B. Verrilli
发明人： Claude Basso , Natarajan Vaidhyanathan , Colin B. Verrilli
IPC分类号： G06F15/173
CPC分类号： H04L45/7457 , G06F15/167 , G06F17/30982 , H04L63/101
摘要： Access control lists (ACLs) include one or more rules that each define a condition and one or more actions to be performed if the condition is satisfied. In one embodiment, the conditions are stored on a ternary content-addressable memory (TCAM), which receives a portion of network traffic, such as a frame header, and compares different portions of the header to entries in the TCAM. If the frame header satisfies the condition, the TCAM reports the match to other elements in the ACL. For certain conditions, the TCAM may divide the condition into a plurality of sub-conditions which are each stored in a row of the TCAM. To efficiently use the limited space in TCAM, the networking element may include one or more comparator units which check for special-case conditions. The comparator units may be used in lieu of the TCAM to determine whether the condition is satisfied.
摘要翻译：访问控制列表（ACL）包括一个或多个规则，每个规则定义条件和满足条件时要执行的一个或多个操作。在一个实施例中，条件存储在三元可内容寻址存储器（TCAM）上，该内容可寻址存储器（TCAM）接收网络业务的一部分，例如帧头，并且将头部的不同部分与TCAM中的条目进行比较。如果帧头满足条件，则TCAM报告与ACL中其他元素的匹配。对于某些条件，TCAM可以将条件划分为多个子条件，这些子条件各自存储在一行TCAM中。为了有效地使用TCAM中的有限空间，网络元件可以包括一个或多个比较器单元，用于检查特殊情况。可以使用比较器单元代替TCAM来确定条件是否满足。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式