公开(公告)号：US20210203620A1

公开(公告)日：2021-07-01

申请号：US17184337

申请日：2021-02-24

Applicant: Cisco Technology, Inc.

Inventor： Dennis Khoa Dang Nguyen ,  Sha Ma ,  Thomas J. Edsall ,  Keerthi Manjunathan Swarnamanjunathan ,  Parvin Taheri

IPC: H04L12/935 ,  H04L12/927 ,  H04L12/867 ,  H04L12/863

Abstract: A first node of a packet switched network transmits at least one flow of protocol data units of a network to at least one output context of one of a plurality of second nodes of the network. The first node includes X virtual output queues (VOQs). The first node receives, from at least one of the second nodes, at least one fair rate record. Each fair rate record corresponds to a particular second node output context and describes a recommended rate of flow to the particular output context. The first node allocates up to X of the VOQs among flows corresponding to i) currently allocated VOQs, and ii) the flows corresponding to the received fair rate records. The first node operates each allocated VOQ according to the corresponding recommended rate of flow until a deallocation condition obtains for the each allocated VOQ.

公开(公告)号：US10223005B2

公开(公告)日：2019-03-05

申请号：US15897659

申请日：2018-02-15

Applicant: Cisco Technology, Inc.

Inventor： Wei-Jen Huang ,  Chih-Tsung Huang ,  Sachin Agarwal ,  Sha Ma

IPC: G06F12/06 ,  G06F13/16 ,  G06F3/06 ,  G06F12/0864 ,  G06F11/10 ,  H04L12/773 ,  H04L12/741

Abstract: Techniques are described for a memory device. In various embodiments, a scheduler/controller is configured to manage data as it read to or written from a memory. A memory is partitioned into a group of sub-blocks, a parity block is associated with the sub-blocks, and the sub-blocks are accessed to read data as needed. A pending write buffer is added to a group of memory sub-blocks. Such a buffer may be sized to be equal to the group of memory sub-blocks. The pending write buffer handles collisions for write accesses to the same block.

公开(公告)号：US10148586B2

公开(公告)日：2018-12-04

申请号：US15582144

申请日：2017-04-28

Applicant: Cisco Technology, Inc.

Inventor： Sha Ma ,  Philip Chen

IPC: H04L12/865 ,  H04L12/875 ,  G06F9/48 ,  H04L12/863 ,  H04L12/741 ,  G06F5/16

Abstract: A work conserving scheduler can be implemented based on a ranking system to provide the scalability of time stamps while avoiding the fast search associated with a traditional time stamp implementation. Each queue can be assigned a time stamp that is initially set to zero. The time stamp for a queue can be incremented each time a data packet from the queue is processed. To provide varying weights to the different queues, the time stamp for the queues can be incremented at varying rates. The data packets can be processed from the queues based on the tier rank order of the queues as determined from the time stamp associated with each queue. To increase the speed at which the ranking is determined, the ranking can be calculate from a subset of the bits defining the time stamp rather than the entire bit set.

公开(公告)号：US20160337142A1

公开(公告)日：2016-11-17

申请号：US14710974

申请日：2015-05-13

Applicant: Cisco Technology, Inc.

Inventor： Mohammadreza Alizadeh Attar ,  Sha Ma ,  Vinod Mitulal ,  Krishnan Subramani ,  Georges Akis ,  Peter Newman

IPC: H04L12/18 ,  H04L12/861 ,  H04L12/865 ,  H04L12/863

CPC classification number: H04L12/1881 ,  H04L47/6255 ,  H04L47/6275 ,  H04L49/901 ,  H04L49/9047

Abstract: A network switch includes a buffer to store network packets and packet descriptors (PDs) used to link the packets into queues for output ports. The buffer and PDs are shared among the multiple traffic pools. The switch receives a multicast packet for queues in a given pool. The switch determines if there is unused buffer space available for packets in the given pool based on a pool dynamic threshold, if there is unused buffer space available for packets in each queue based on a queue dynamic threshold for the queue, if there are unused PDs available to the given pool based on a pool dynamic threshold for PDs, and if there are unused PDs available for each queue based on a queue dynamic threshold for PDs for the queue. The network switch admits the packet only into the queues for which all of the determining operations pass.

Abstract translation: 网络交换机包括用于存储用于将分组链接到用于输出端口的队列的网络分组和分组描述符（PD）的缓冲器。 缓冲区和PD在多个流量池之间共享。 交换机接收给定池中队列的组播数据包。 如果存在未使用的PD，则根据队列的动态阈值，如果每个队列中的数据包有可用的未使用的缓冲区空间，交换机将根据池动态阈值确定是否存在可用于给定池中的数据包的未使用的缓冲区空间 基于PD的池动态阈值对给定池可用，以及基于队列的队列动态阈值的队列动态阈值是否存在可用于每个队列的未使用的PD。 网络交换机仅将数据包仅允许到所有确定操作通过的队列中。

公开(公告)号：US20150124832A1

公开(公告)日：2015-05-07

申请号：US14462453

申请日：2014-08-18

Applicant: Cisco Technology, Inc.

Inventor： Sha Ma ,  Philip Chen

IPC: H04L12/865 ,  H04L12/863

CPC classification number: H04L47/6275 ,  G06F5/16 ,  G06F9/4881 ,  G06F2205/064 ,  H04L45/74 ,  H04L47/50 ,  H04L47/562 ,  H04L47/62 ,  H04L47/623

Abstract: A work conserving scheduler can be implemented based on a ranking system to provide the scalability of time stamps while avoiding the fast search associated with a traditional time stamp implementation. Each queue can be assigned a time stamp that is initially set to zero. The time stamp for a queue can be incremented each time a data packet from the queue is processed. To provide varying weights to the different queues, the time stamp for the queues can be incremented at varying rates. The data packets can be processed from the queues based on the tier rank order of the queues as determined from the time stamp associated with each queue. To increase the speed at which the ranking is determined, the ranking can be calculate from a subset of the bits defining the time stamp rather than the entire bit set.

Abstract translation: 可以基于排名系统来实现工作保存调度器，以提供时间戳的可扩展性，同时避免与传统时间戳实现相关联的快速搜索。 可以为每个队列分配最初设置为零的时间戳。 每当处理来自队列的数据包时，队列的时间戳可以递增。 为了向不同的队列提供变化的权重，队列的时间戳可以以不同的速率递增。 可以根据从与每个队列相关联的时间戳确定的队列的层次顺序，从队列处理数据分组。 为了提高确定排名的速度，可以从定义时间戳而不是整个比特集的比特的子集中计算排名。

公开(公告)号：US20190222528A1

公开(公告)日：2019-07-18

申请号：US15874491

申请日：2018-01-18

Applicant: Cisco Technology, Inc.

Inventor： Rong Pan ,  Parvin Taheri ,  Liyuan Quan ,  Sha Ma ,  Krishnan Subramani

IPC: H04L12/835 ,  H04L12/825 ,  H04L12/861

Abstract: A network device is configured to transmit acknowledgement packets according to the length of the egress queue. The network device receives data packets from one or more endpoints and buffers the data packets in an egress buffer before transmitting the data packets. The network device also receives acknowledgement packets that are sent in response to data packets previously transmitted by the network device. The network device buffers the acknowledgement packets in an acknowledgement buffer. The network device transmits the acknowledgement packets at an acknowledgment rate that is based on a queue length of the egress buffer.

公开(公告)号：US12120037B2

公开(公告)日：2024-10-15

申请号：US16854212

申请日：2020-04-21

Applicant: Cisco Technology, Inc.

Inventor： Sha Ma ,  Felice Bonardi ,  Philip Chen

IPC: H04L47/6275 ,  G06F5/16 ,  G06F9/48 ,  H04L45/74 ,  H04L47/50 ,  H04L47/56 ,  H04L47/62

CPC classification number: H04L47/6275 ,  G06F5/16 ,  G06F9/4881 ,  H04L45/74 ,  H04L47/50 ,  H04L47/562 ,  H04L47/62 ,  H04L47/623 ,  G06F2205/064

Abstract: Multiple listlets function as a single master linked list to manage data packets across one or more banks of memory in a first-in first-out (FIFO) order, while allowing multiple push and/or pop functions to be performed per cycle. Each listlet can be a linked list that tracks pointers and is stored in a different memory bank. The nodes can include a pointer to a data packet, a pointer to the next node in the listlet and a next listlet identifier that identifies the listlet that contains the next node in the master linked list. The head and tail of each listlet, as well as an identifier each to track the head and tail of the master linked list, can be maintained in cache. The individual listlets are updated accordingly to maintain order of the master linked list as pointers are pushed and popped from the master linked list.

公开(公告)号：US10951546B2

公开(公告)日：2021-03-16

申请号：US16503843

申请日：2019-07-05

Applicant: Cisco Technology, Inc.

Inventor： Dennis Khoa Dang Nguyen ,  Sha Ma ,  Thomas J. Edsall ,  Keerthi Manjunathan Swarnamanjunathan ,  Parvin Taheri

IPC: H04J1/16 ,  H04L12/935 ,  H04L12/927 ,  H04L12/867 ,  H04L12/863

Abstract: A first node of a packet switched network transmits at least one flow of protocol data units of a network to at least one output context of one of a plurality of second nodes of the network. The first node includes X virtual output queues (VOQs). The first node receives, from at least one of the second nodes, at least one fair rate record. Each fair rate record corresponds to a particular second node output context and describes a recommended rate of flow to the particular output context. The first node allocates up to X of the VOQs among flows corresponding to i) currently allocated VOQs, and ii) the flows corresponding to the received fair rate records. The first node operates each allocated VOQ according to the corresponding recommended rate of flow until a deallocation condition obtains for the each allocated VOQ.

公开(公告)号：US10560391B2

公开(公告)日：2020-02-11

申请号：US15874491

申请日：2018-01-18

Applicant: Cisco Technology, Inc.

Inventor： Rong Pan ,  Parvin Taheri ,  Liyuan Quan ,  Sha Ma ,  Krishnan Subramani

IPC: H04L12/835 ,  H04L12/861 ,  H04L12/825

Abstract: A network device is configured to transmit acknowledgement packets according to the length of the egress queue. The network device receives data packets from one or more endpoints and buffers the data packets in an egress buffer before transmitting the data packets. The network device also receives acknowledgement packets that are sent in response to data packets previously transmitted by the network device. The network device buffers the acknowledgement packets in an acknowledgement buffer. The network device transmits the acknowledgement packets at an acknowledgment rate that is based on a queue length of the egress buffer.

公开(公告)号：US09866401B2

公开(公告)日：2018-01-09

申请号：US14710974

申请日：2015-05-13

Applicant: Cisco Technology, Inc.

Inventor： Mohammadreza Alizadeh Attar ,  Sha Ma ,  Vinod Mitulal ,  Krishnan Subramani ,  Georges Akis ,  Peter Newman

IPC: H04L12/18 ,  H04L12/861 ,  H04L12/863 ,  H04L12/885 ,  H04L12/865

CPC classification number: H04L12/1881 ,  H04L47/6255 ,  H04L47/6275 ,  H04L49/901 ,  H04L49/9047

Abstract: A network switch includes a buffer to store network packets and packet descriptors (PDs) used to link the packets into queues for output ports. The buffer and PDs are shared among the multiple traffic pools. The switch receives a multicast packet for queues in a given pool. The switch determines if there is unused buffer space available for packets in the given pool based on a pool dynamic threshold, if there is unused buffer space available for packets in each queue based on a queue dynamic threshold for the queue, if there are unused PDs available to the given pool based on a pool dynamic threshold for PDs, and if there are unused PDs available for each queue based on a queue dynamic threshold for PDs for the queue. The network switch admits the packet only into the queues for which all of the determining operations pass.