公开(公告)号：US20150124833A1

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

申请号：US14494510

申请日：2014-09-23

Applicant: Cisco Technology, Inc.

Inventor： Sha Ma ,  Felice Bonardi ,  Philip Chen

IPC: H04L12/863 ,  H04L12/741

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

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.

Abstract translation: 多个列表用作单个主链表，以先进先出（FIFO）顺序管理跨一个或多个存储器组的数据包，同时允许每个周期执行多个推送和/或弹出功能。 每个列表可以是跟踪指针并被存储在不同存储体中的链表。 节点可以包括指向数据分组的指针，指向列表中的下一个节点的指针，以及标识包含主链表中下一个节点的列表的下一个列表标识符。 每个列表的头尾，以及每个跟踪主链表头部和尾部的标识符都可以保存在缓存中。 相应地更新单个列表以维持主链表的顺序，因为从主链表列表中推出并弹出指针。

公开(公告)号：US10986026B2

公开(公告)日：2021-04-20

申请号：US16437887

申请日：2019-06-11

Applicant: Cisco Technology, Inc.

Inventor： Parvin Taheri ,  Sha Ma ,  Thomas J. Edsall

IPC: H04L12/863 ,  H04L12/815 ,  H04L12/801 ,  H04L12/835

Abstract: A network device includes network ports to communicate with source devices and destination devices. The network device receives respective packets from each source device and, for each source device, respectively performs the following operations. The network device stores the respective packets in a shared memory that stores all packets from all of the source devices, and dequeues the respective packets from the shared memory to send the packets to destination devices. Responsive to the storing and the dequeuing, the network device respectively increases and decreases an input packet count for the source device. The network device determines for the source device a packet sending rate based on the input packet count and a flow control threshold common across all of the source devices in accordance with a proportional integral (PI) control equation. The network device transmits to the source device a control message including the packet sending rate.

公开(公告)号：US20210006509A1

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

申请号：US16503843

申请日：2019-07-05

Applicant: Cisco Technology, Inc.

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

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

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.

公开(公告)号：US20200252345A1

公开(公告)日：2020-08-06

申请号：US16854212

申请日：2020-04-21

Applicant: Cisco Technology, Inc.

Inventor： Sha Ma ,  Felice Bonardi ,  Philip Chen

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

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.

公开(公告)号：US09674086B2

公开(公告)日：2017-06-06

申请号：US14462453

申请日：2014-08-18

Applicant: Cisco Technology, Inc.

Inventor： Sha Ma ,  Philip Chen

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

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.

公开(公告)号：US20250007855A1

公开(公告)日：2025-01-02

申请号：US18883513

申请日：2024-09-12

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

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.

公开(公告)号：US11552905B2

公开(公告)日：2023-01-10

申请号：US17184337

申请日：2021-02-24

Applicant: Cisco Technology, Inc.

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

IPC: H04J1/16 ,  H04L49/00 ,  H04L47/80 ,  H04L47/629 ,  H04L47/62

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.

公开(公告)号：US10652163B2

公开(公告)日：2020-05-12

申请号：US14494510

申请日：2014-09-23

Applicant: Cisco Technology, Inc.

Inventor： Sha Ma ,  Felice Bonardi ,  Philip Chen

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

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.

公开(公告)号：US20170237678A1

公开(公告)日：2017-08-17

申请号：US15582144

申请日：2017-04-28

Applicant: Cisco Technology, Inc.

Inventor： Sha Ma ,  Philip Chen

IPC: H04L12/865 ,  H04L12/875 ,  G06F9/48 ,  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.

公开(公告)号：US09590914B2

公开(公告)日：2017-03-07

申请号：US14448934

申请日：2014-07-31

Applicant: Cisco Technology, Inc.

Inventor： Mohammadreza Alizadeh Attar ,  Sha Ma ,  Thomas J. Edsall

IPC: H04L12/863 ,  H04L12/803 ,  H04L12/741 ,  H04L29/12 ,  H04L29/06 ,  H04L12/743 ,  H04L12/947 ,  H04L12/875 ,  H04L29/08 ,  H04L12/937

CPC classification number: H04L47/50 ,  H04L45/74 ,  H04L45/7453 ,  H04L47/125 ,  H04L47/56 ,  H04L49/25 ,  H04L49/254 ,  H04L61/103 ,  H04L61/2084 ,  H04L61/6004 ,  H04L61/6095 ,  H04L67/22 ,  H04L67/322 ,  H04L69/167 ,  H04L69/22

Abstract: Systems, methods, and non-transitory computer-readable storage media for per-packet load balancing in a port channel. The system first maps an incoming traffic flow to queues containing packets to be transmitted through a port channel at the system, the port channel including ports grouped into a single virtual port. Next, the system assigns a port from the port channel to a queue for a predetermined period of time, wherein the port is assigned to the queue based on at least one of a port state and a service history associated with the queue. The system then de-queues at least a portion of the packets in the queue through the port for the predetermined period of time. This load balancing can ensure that traffic is efficiently and fairly load balanced across the links of the port channel, and packets of each queue are not reordered.

Abstract translation: 用于端口通道中每个数据包负载均衡的系统，方法和非暂时的计算机可读存储介质。 系统首先将进入的流量映射到包含要通过系统端口通道发送的数据包的队列，端口通道包括分组为单个虚拟端口的端口。 接下来，系统将端口从端口信道分配到队列预定的时间段，其中基于与队列相关联的端口状态和服务历史中的至少一个将端口分配给队列。 然后，系统通过端口在队列中的至少一部分分组排队预定时间段。 这种负载均衡可以确保流量在端口通道的链路之间高效，平衡地负载平衡，并且每个队列的数据包不重新排序。