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

1. 发明授权

US08509069B1 Cell sharing to improve throughput within a network device 有权
标题翻译：单元共享以提高网络设备内的吞吐量
公开(公告)号：US08509069B1
公开(公告)日：2013-08-13
申请号：US12754377
申请日：2010-04-05
申请人： Wing Leong Poon , Venkatraman Chandrasekaran , Srihari Vegesna , Sarin Thomas , David J. Ofelt
发明人： Wing Leong Poon , Venkatraman Chandrasekaran , Srihari Vegesna , Sarin Thomas , David J. Ofelt
IPC分类号： H04L12/26
CPC分类号： H04L49/254 , H04L49/3072
摘要： A method includes receiving packets from a network with a plurality of packet-forwarding engines (PFEs) of a router, wherein the plurality of PFEs are interconnected by a switch fabric, determining an egress one of the PFEs for each of the packets, and forming fixed-sized fabric cells that share data associated with the packets that are destined for the same egress PFE while preventing packets destined for different egress PFEs to share any of the fabric cells. The fabric cells are transmitted through the switch fabric to communicate the packets to the egress PFEs.
摘要翻译：一种方法包括从具有路由器的多个分组转发引擎（PFE）的网络接收分组，其中所述多个PFE由交换结构互连，确定每个所述分组的所述PFE中的一个出口，以及形成固定大小的结构单元，其共享与要发往相同出口PFE的分组相关联的数据，同时防止去往不同出口PFE的分组共享任何结构单元。结构单元通过交换结构传输，以将数据包传送到出口PFE。

2. 发明申请

US20100158031A1 METHODS AND APPARATUS FOR TRANSMISSION OF GROUPS OF CELLS VIA A SWITCH FABRIC 有权
标题翻译：用于通过开关织物传输细胞群的方法和装置
公开(公告)号：US20100158031A1
公开(公告)日：2010-06-24
申请号：US12343728
申请日：2008-12-24
申请人： Sarin Thomas , Srihari Vegesna , Pradeep Sindhu , Chi-Chung Kenny Chen , Jean-Marc Frailong , David J. Ofelt , Philip A. Thomas , Chang-Hong Wu
发明人： Sarin Thomas , Srihari Vegesna , Pradeep Sindhu , Chi-Chung Kenny Chen , Jean-Marc Frailong , David J. Ofelt , Philip A. Thomas , Chang-Hong Wu
IPC分类号： H04L12/56
CPC分类号： H04J3/00 , H04L49/251 , H04L49/254
摘要： In one embodiment, a method can include receiving at an egress schedule module a request to schedule transmission of a group of cells from an ingress queue through a switch fabric of a multi-stage switch. The ingress queue can be associated with an ingress stage of the multi-stage switch. The egress schedule module can be associated with an egress stage of the multi-stage switch. The method can also include determining, in response to the request, that an egress port at the egress stage of the multi-stage switch is available to transmit the group of cells from the multi-stage switch.
摘要翻译：在一个实施例中，一种方法可以包括在出口调度模块处接收通过多级交换机的交换结构调度来自进入队列的小区的传输的请求。入站队列可以与多级交换机的进入级相关联。出口调度模块可以与多级交换机的出口级相关联。该方法还可以包括响应于该请求确定多级交换机的出口级的出口端口可用于从多级交换机发送小区组。

3. 发明授权

US08325749B2 Methods and apparatus for transmission of groups of cells via a switch fabric 有权
标题翻译：用于经由交换结构传输小区组的方法和装置
公开(公告)号：US08325749B2
公开(公告)日：2012-12-04
申请号：US12343728
申请日：2008-12-24
申请人： Sarin Thomas , Srihari Vegesna , Pradeep Sindhu , Chi-Chung Kenny Chen , Jean-Marc Frailong , David J. Ofelt , Philip A. Thomas , Chang-Hong Wu
发明人： Sarin Thomas , Srihari Vegesna , Pradeep Sindhu , Chi-Chung Kenny Chen , Jean-Marc Frailong , David J. Ofelt , Philip A. Thomas , Chang-Hong Wu
IPC分类号： H04L12/28
CPC分类号： H04J3/00 , H04L49/251 , H04L49/254
摘要： In one embodiment, a method can include receiving at an egress schedule module a request to schedule transmission of a group of cells from an ingress queue through a switch fabric of a multi-stage switch. The ingress queue can be associated with an ingress stage of the multi-stage switch. The egress schedule module can be associated with an egress stage of the multi-stage switch. The method can also include determining, in response to the request, that an egress port at the egress stage of the multi-stage switch is available to transmit the group of cells from the multi-stage switch.
摘要翻译：在一个实施例中，一种方法可以包括在出口调度模块处接收通过多级交换机的交换结构调度来自进入队列的小区的传输的请求。入站队列可以与多级交换机的进入级相关联。出口调度模块可以与多级交换机的出口级相关联。该方法还可以包括响应于该请求确定多级交换机的出口级的出口端口可用于从多级交换机发送小区组。

4. 发明授权

US08605722B1 Deadlock-resistant fabric tree replication in a network device 有权
公开(公告)号：US08605722B1
公开(公告)日：2013-12-10
申请号：US12759850
申请日：2010-04-14
申请人： Pradeep Sindhu , Jean-Marc Frailong , Sarin Thomas , Srihari Vegesna , David J. Ofelt , Chang-Hong Wu
发明人： Pradeep Sindhu , Jean-Marc Frailong , Sarin Thomas , Srihari Vegesna , David J. Ofelt , Chang-Hong Wu
IPC分类号： H04L12/28
CPC分类号： H04L45/16 , H04L12/1863 , H04L49/201 , H04L49/90 , H04L67/1095
摘要： In general, the invention is directed to techniques for reducing deadlocks that may arise when performing fabric replication. For example, as described herein, a network device includes packet replicators that each comprises a plurality of resource partitions. A replication data structure for a packet received by the network device includes packet replicator nodes that are arranged hierarchically to occupy one or more levels of the replication data structure. Each of the resource partitions in each of the plurality of packet replicators is associated with a different level of the replication data structure. The packet replicators replicate the packet according to the replication data structure, and each of the packet replicators handles the packet using the one of the resource partitions of the packet replicator that is associated with the level of the replication data structure occupied by the node that corresponds to that particular packet replicator.

5. 发明授权

US08363668B2 Avoiding unfair advantage in weighted round robin (WRR) scheduling 有权
标题翻译：避免加权轮询（WRR）调度中的不公平优势
公开(公告)号：US08363668B2
公开(公告)日：2013-01-29
申请号：US12640417
申请日：2009-12-17
申请人： Sarin Thomas , Srihari Vegesna
发明人： Sarin Thomas , Srihari Vegesna
IPC分类号： H04L12/56
CPC分类号： H04L47/527 , H04L47/524
摘要： A network device includes multiple queues to store packets to be scheduled, and a weighted round-robin (WRR) scheduler. The WRR scheduler performs a first WRR scheduling iteration including processing of at least one packet from a particular queue of the multiple queues, identifies the particular queue as an empty queue during the performing of the first WRR scheduling iteration, identifies the particular queue as a non-empty queue after the identifying the particular queue as the empty queue, and performs a second WRR scheduling iteration including processing of only one packet of a group of packets from the particular queue of the multiple queues.
摘要翻译：网络设备包括多个队列来存储要调度的分组，以及加权循环（WRR）调度器。 WRR调度器执行包括处理来自多队列的特定队列的至少一个分组的第一WRR调度迭代，在执行第一WRR调度迭代期间将特定队列识别为空队列，将特定队列识别为非在将特定队列识别为空队列之后的空队列，并且执行第二WRR调度迭代，包括仅处理来自多队列的特定队列的一组分组的一个分组。

6. 发明授权

US08230110B2 Work-conserving packet scheduling in network devices 有权
标题翻译：网络设备中的工作节省分组调度
公开(公告)号：US08230110B2
公开(公告)日：2012-07-24
申请号：US12835481
申请日：2010-07-13
申请人： Srihari Vegesna , Sarin Thomas
发明人： Srihari Vegesna , Sarin Thomas
IPC分类号： G06F15/173
CPC分类号： H04L12/56
摘要： In general, techniques are described for performing work conserving packet scheduling in network devices. For example, a network device comprising queues that store packets and a control unit may implement these techniques. The control unit stores data defining hierarchically-ordered nodes, which include leaf nodes from which one or more of the queues depend. The control unit executes first and second dequeue operations concurrently to traverse the hierarchically-ordered nodes and schedule processing of packets stored to the queues. During execution, the first dequeue operation masks at least one of the selected ones of the leaf nodes from which one of the queues depends based on scheduling data stored by the control unit. The scheduling data indicates valid child node counts in some instances. The masking occurs to exclude the node from consideration by the second dequeue operation concurrently executing with the first dequeue operation, which may preserve work in certain instances.
摘要翻译：通常，描述了在网络设备中执行保存分组调度的工作的技术。例如，包括存储分组的队列的网络设备和控制单元可以实现这些技术。控制单元存储定义分层有序节点的数据，其包括一个或多个队列依赖于的叶节点。控制单元同时执行第一和第二出队操作，以遍历层次顺序的节点并对存储在队列中的分组进行调度处理。在执行期间，第一出队操作基于由控制单元存储的调度数据来屏蔽所选叶节点中的一个叶节点中的至少一个队列。在某些情况下，调度数据表示有效的子节点计数。发生掩蔽，以通过与第一出队操作同时执行的第二出队操作排除节点，这可能会在某些情况下保留工作。

7. 发明申请

US20110216773A1 WORK-CONSERVING PACKET SCHEDULING IN NETWORK DEVICES 有权
标题翻译：网络设备中的工作维护分组调度
公开(公告)号：US20110216773A1
公开(公告)日：2011-09-08
申请号：US12835481
申请日：2010-07-13
申请人： Srihari Vegesna , Sarin Thomas
发明人： Srihari Vegesna , Sarin Thomas
IPC分类号： H04L12/56
CPC分类号： H04L12/56
摘要： In general, techniques are described for performing work conserving packet scheduling in network devices. For example, a network device comprising queues that store packets and a control unit may implement these techniques. The control unit stores data defining hierarchically-ordered nodes, which include leaf nodes from which one or more of the queues depend. The control unit executes first and second dequeue operations concurrently to traverse the hierarchically-ordered nodes and schedule processing of packets stored to the queues. During execution, the first dequeue operation masks at least one of the selected ones of the leaf nodes from which one of the queues depends based on scheduling data stored by the control unit. The scheduling data indicates valid child node counts in some instances. The masking occurs to exclude the node from consideration by the second dequeue operation concurrently executing with the first dequeue operation, which may preserve work in certain instances.
摘要翻译：通常，描述了在网络设备中执行保存分组调度的工作的技术。例如，包括存储分组的队列的网络设备和控制单元可以实现这些技术。控制单元存储定义分层有序节点的数据，其包括一个或多个队列依赖于的叶节点。控制单元同时执行第一和第二出队操作，以遍历层次顺序的节点并对存储在队列中的分组进行调度处理。在执行期间，第一出队操作基于由控制单元存储的调度数据来屏蔽所述一个队列所依赖的叶节点中的至少一个叶节点。在某些情况下，调度数据表示有效的子节点计数。发生掩蔽，以通过与第一出队操作同时执行的第二出队操作排除节点，这可能会在某些情况下保留工作。

8. 发明授权

US08797877B1 Virtual output queue allocation using dynamic drain bandwidth 有权
标题翻译：虚拟输出队列分配使用动态排除带宽
公开(公告)号：US08797877B1
公开(公告)日：2014-08-05
申请号：US13570419
申请日：2012-08-09
申请人： Srinivas Perla , Sanjeev Kumar , Avanindra Godbole , Srihari Vegesna , Sarin Thomas , Mahesh Dorai
发明人： Srinivas Perla , Sanjeev Kumar , Avanindra Godbole , Srihari Vegesna , Sarin Thomas , Mahesh Dorai
IPC分类号： H04J3/14
CPC分类号： H04L49/90
摘要： In general, techniques are described for allocating virtual output queue (VOQ) buffer space to ingress forwarding units of a network device based on drain rates at which network packets are forwarded from VOQs of the ingress forwarding units. For example, a network device includes multiple ingress forwarding units that each forward network packets to an output queue of an egress forwarding unit. Ingress forwarding units each include a VOQ that corresponds to the output queue. The drain rate at any particular ingress forwarding unit corresponds to its share of bandwidth to the output queue, as determined by the egress forwarding unit. Each ingress forwarding unit configures its VOQ buffer size in proportion to its respective drain rate in order to provide an expected delay bandwidth buffering for the output queue of the egress forwarding unit.
摘要翻译：通常，描述了基于从入口转发单元的VOQ转发网络分组的排出速率来将虚拟输出队列（VOQ）缓冲区空间分配给网络设备的入口转发单元的技术。例如，网络设备包括多个入口转发单元，每个转发单元将网络分组转发到出口转发单元的输出队列。入口转发单元各自包括对应于输出队列的VOQ。任何特定入口转发单元的排出速率对应于由出口转发单元确定的到输出队列的带宽份额。每个入口转发单元将其VOQ缓冲器大小与其相应的排出速率成比例地配置，以便为出口转发单元的输出队列提供期望的延迟带宽缓冲。

9. 发明申请

US20130235880A1 APPLYING BACKPRESSURE TO A SUBSET OF NODES IN A DEFICIT WEIGHTED ROUND ROBIN SCHEDULER 审中-公开
标题翻译：在缺陷加重的罗宾调度器中将背压应用到节点
公开(公告)号：US20130235880A1
公开(公告)日：2013-09-12
申请号：US13874042
申请日：2013-04-30
申请人： Gary GOLDMAN , Srihari Vegesna
发明人： Gary GOLDMAN , Srihari Vegesna
IPC分类号： H04L12/70
CPC分类号： H04L47/629 , H04L47/266
摘要： A scheduler in a network element may include a dequeuer to dequeue packets from a set of scheduling nodes using a deficit weighted round robin process, where the dequeuer is to determine whether a subset of the set of scheduling nodes is being backpressured. The dequeuer may set a root rich most negative credits (MNC) value, associated with a root node, to a root poor MNC value, associated with the root node, and set the root poor MNC value to zero, when the subset is not being backpressured, and may set the rich MNC value to a maximum of the root poor MNC value and a root backpressured rich MNC value, associated with the subset, and set the root poor MNC value to a root backpressured poor MNC value, associated with the subset, when the subset is being backpressured.
摘要翻译：网络元件中的调度器可以包括使用赤字加权轮询过程从一组调度节点出队的出局的出局，其中出局要确定该组调度节点的子集是否被反压。当该子集不是时，出局者可以将与根节点相关联的根最丰富的最负值（MNC）值设置为与根节点相关联的根差的MNC值，并将根差的MNC值设置为零并且可以将丰富的MNC值设置为与子集相关联的根差的MNC值和根背压的富MNC值的最大值，并将根差的MNC值设置为与子集相关联的根背压差的MNC值当子集被反压时。

10. 发明授权

US08321753B2 Optimization of packet buffer memory utilization 有权
标题翻译：分组缓冲存储器利用率的优化
公开(公告)号：US08321753B2
公开(公告)日：2012-11-27
申请号：US12759313
申请日：2010-04-13
申请人： Pradeep Sindhu , Srihari Vegesna
发明人： Pradeep Sindhu , Srihari Vegesna
IPC分类号： H03M13/00
CPC分类号： G06F11/006 , G06F11/1008 , H03M13/09 , H03M13/096 , H03M13/1515 , H03M13/19 , H04L1/0052
摘要： A method performed by an I/O unit connected to another I/O unit in a network device. The method includes receiving a packet; segmenting the packet into a group of data blocks; storing the group of data blocks in a data memory; generating data protection information for a data block of the group of data blocks; creating a control block for the data block; storing, in a control memory, a group of data items for the control block, the group of data items including information associated with a location, of the data block, within the data memory and the data protection information for the data block; performing a data integrity check on the data block, using the data protection information, to determine whether the data block contains a data error; and outputting the data block when the data integrity check indicates that the data block does not contain a data error.
摘要翻译：由与网络设备中的另一I / O单元连接的I / O单元执行的方法。该方法包括接收分组; 将分组分割成一组数据块; 将数据块组存储在数据存储器中; 生成数据块组的数据块的数据保护信息; 创建数据块的控制块; 在控制存储器中存储用于控制块的一组数据项，数据组的数据项组，包括与数据块的位置相关联的信息，数据存储器内的数据块和数据块的数据保护信息; 使用数据保护信息对数据块执行数据完整性检查，以确定数据块是否包含数据错误; 并且当数据完整性检查指示数据块不包含数据错误时，输出数据块。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式