公开(公告)号：US09882817B2

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

申请号：US13927160

申请日：2013-06-26

Applicant: Verizon Patent and Licensing Inc.

Inventor： Matthew W. Turlington ,  Michael U. Bencheck

IPC: G06F15/16 ,  H04L12/813 ,  H04L12/823 ,  H04L12/891 ,  H04L12/873 ,  H04L12/24

CPC classification number: H04L47/20 ,  H04L41/0893 ,  H04L41/5019 ,  H04L47/326 ,  H04L47/41 ,  H04L47/527 ,  Y02B70/30 ,  Y02D50/30

Abstract: A master network interface device (NID) receives a first packet flow associated with a particular customer via a first link of a link aggregation group (LAG). The master NID also receives, from a non-master NID, an indication of a second packet flow, associated with the particular customer, that are traversing a second link of the LAG. The master NID applies collective rate limiting criteria to the first packet flow and to the second packet flow, such that the collective rate limiting criteria enforces a SLA rate for the particular customer. The master NID forwards at least some of the first packet flow via the first link, based on the rate limiting criteria as applied to the first packet flow. The master NID also sends, to the non-master network interface device, an indication of the rate limiting criteria as applied to the second packet flow.

公开(公告)号：US09742705B2

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

申请号：US14765642

申请日：2014-02-06

Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY

Inventor： Philip L Eardley ,  Robert J Briscoe

IPC: H04L12/861 ,  H04L12/935 ,  H04L12/931 ,  H04L12/823 ,  H04L12/801 ,  H04L12/841

CPC classification number: H04L49/90 ,  H04L47/12 ,  H04L47/283 ,  H04L47/326 ,  H04L49/3045 ,  H04L49/50 ,  H04L49/508

Abstract: Congestion in respect to a network element operable to forward data items in a telecommunications networks, and in respect to a processing element operable to process requests for service is signaled. In either, the element is operable to perform its processing function at up to a processing rate which is subject to variation, and has a queue for items awaiting processing having a counter associated therewith which maintains a count from which a queue metric is derivable. A method comprises: updating the count at a rate dependent on the processing rate; further updating the count in response to receipt of items awaiting processing; and signalling a measure of congestion in respect of the element in dependence on the queue metric; then altering the rate at which the count is being updated and adjusting the counter whereby to cause a change in the queue metric if the processing rate has changed.

公开(公告)号：US09634916B2

公开(公告)日：2017-04-25

申请号：US14384097

申请日：2013-03-11

Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY

Inventor： Robert John Briscoe ,  Carla Di Cairano-Gilfedder

IPC: H04L12/26 ,  H04L12/823 ,  H04L12/801 ,  H04L12/835 ,  H04L12/833

CPC classification number: H04L43/062 ,  H04L43/0876 ,  H04L47/12 ,  H04L47/30 ,  H04L47/31 ,  H04L47/326

Abstract: Methods and apparatus are disclosed for signalling congestion being caused by data items such as packets, received at a network element such as a router, in a communications network such as the Internet, or being caused by items otherwise requiring service or capacity from a shared resource. Preferred embodiments of the method involve identifying whether or not received data items received at a network element are capable of carrying congestion indications such as ECN marks, and for those that are capable, assigning congestion indications to the data items in dependence on a queue length characterization based on a substantially current, instantaneous measurement of the length of the queue, whereas for those that are not capable, a sanction such as dropping may be applied in dependence on a different queue length characterization based on a weighted moving average of current, recent, and less recent measurements of the length of the queue.

公开(公告)号：US09319333B2

公开(公告)日：2016-04-19

申请号：US14205824

申请日：2014-03-12

Applicant: Netronome Systems, Inc.

Inventor： Ron Lamar Swartzentruber

IPC: H04L12/801 ,  H04L12/54 ,  H04L12/24 ,  H04L12/823 ,  H04L12/863

CPC classification number: H04L47/326 ,  H04L47/29 ,  H04L47/30 ,  H04L47/54

Abstract: A device that receives a packet descriptor and a queue number that indicates a queue stored within a memory unit, and in response determines an instantaneous queue depth of the queue. The instantaneous queue depth is used to determine a drop probability. The drop probability is used to randomly determine if the packet descriptor should be stored in the queue. The queue has a first queue depth range and a second queue depth range that do not overlap. A first drop probability is associated with the first queue depth range and a second drop probability is associated with the second queue depth range. The first drop probability is used when the queue depth is within the first queue depth range. The second drop probability is used with the queue depth is within the second queue depth range. The device includes a random value generator and a drop indicator generator.

Abstract translation: 接收分组描述符的设备和指示存储在存储器单元中的队列的队列号，并且作为响应确定队列的瞬时队列深度。 瞬时队列深度用于确定丢弃概率。 丢弃概率用于随机确定包描述符是否应该存储在队列中。 队列具有不重叠的第一队列深度范围和第二队列深度范围。 第一丢弃概率与第一队列深度范围相关联，并且第二丢弃概率与第二队列深度范围相关联。 当队列深度在第一队列深度范围内时，使用第一个丢弃概率。 第二个丢弃概率用于队列深度在第二个队列深度范围内。 该装置包括随机值发生器和下降指示器发生器。

公开(公告)号：US20160099882A1

公开(公告)日：2016-04-07

申请号：US14507652

申请日：2014-10-06

Applicant: Netronome Systems, Inc.

Inventor： Ron Lamar Swartzentruber

IPC: H04L12/823 ,  H04L12/865

CPC classification number: H04L47/326 ,  H04L47/6275 ,  H04L49/00

Abstract: A method for receiving a packet descriptor associated with a packet and a queue number indicating a queue stored within a memory unit, determining a priority level of the packet and an amount of free memory available in the memory unit. Applying a global drop probability to generate a global drop indicator and applying a queue drop probability to generate a queue drop indicator. The global drop probability is a function of the amount of free memory. The queue drop probability is a function of instantaneous queue depth or drop precedence value. The packet is transmitted whenever the priority level is high. When the priority level is low, the packet is transmitted when both the global drop indicator and the queue drop indicator are a logic low value. When the priority level is low, the packet is not transmitted when either drop indicator is a logic low value.

Abstract translation: 一种用于接收与分组相关联的分组描述符的方法和指示存储在存储器单元中的队列的队列号，确定分组的优先级和可用存储器单元中的可用内存量。 应用全局丢弃概率来生成全局丢弃指示符并应用队列丢弃概率来生成队列丢弃指示符。 全局丢弃概率是空闲内存量的函数。 队列丢弃概率是瞬时队列深度或丢弃优先级值的函数。 每当优先级高时，传输数据包。 当优先级低时，当全局丢弃指示符和队列丢弃指示符均为逻辑低值时，传输数据包。 当优先级低时，当任一个丢包指示符为逻辑低电平值时，该数据包不传输。

公开(公告)号：US08705357B2

公开(公告)日：2014-04-22

申请号：US13306214

申请日：2011-11-29

Applicant: Robert Torres ,  John Border ,  Patrick Stevens ,  Jun Xu ,  Je-Hong Jong

Inventor： Robert Torres ,  John Border ,  Patrick Stevens ,  Jun Xu ,  Je-Hong Jong

IPC: H04L1/00 ,  H04L12/56

CPC classification number: H04L47/27 ,  H04L47/326

Abstract: A method for controlling data traffic with random early detection and window size adjustments including performing random early detection on incoming data packets, calculating a simple moving average of packet dropping probabilities for the data packets as calculated when performing random early detection, decreasing an advertised window size if the simple moving average is greater than a probability target plus a tolerance factor, increasing the advertised window size if the simple moving average is less than the probability target minus a tolerance factor, and not adjusting the window size if the simple moving average is not greater than a probability target plus a tolerance factor and not less than a probability target minus a tolerance factor.

Abstract translation: 一种用于随机早期检测和窗口大小调整来控制数据流量的方法，包括对输入数据分组执行随机早期检测，计算在执行随机早期检测时计算的数据分组的分组丢弃概率的简单移动平均值，减少广告窗口大小 如果简单移动平均值大于概率目标加公差因子，如果简单移动平均值小于概率目标减去公差因子，则增加通告窗口大小，如果简单移动平均值不是，调整窗口大小 大于概率目标加上公差因子，并且不小于概率目标减去公差因子。

公开(公告)号：US08593972B2

公开(公告)日：2013-11-26

申请号：US13248181

申请日：2011-09-29

Applicant: Yu Gu

Inventor： Yu Gu

IPC: H04J1/06 ,  H04L12/28

CPC classification number: H04L43/0858 ,  H04L43/50 ,  H04L47/326

Abstract: In one embodiment, a test technique verifies a drop probability curve implemented by an intermediate node of a computer network, wherein a test point of the drop probability curve has a drop probability value and a queue length value. Traffic may be loaded into a queue of the node at a constant bit rate that is based on the drop probability value and an output rate associated with queue. An average traffic latency may then be measured, and an actual queue length may be calculated by multiplying the measured average traffic latency with the output rate. The drop probability curve may be verified when the calculated queue length is within a specified tolerance of the queue length value associated with the test point.

Abstract translation: 在一个实施例中，测试技术验证由计算机网络的中间节点实现的丢弃概率曲线，其中丢弃概率曲线的测试点具有丢弃概率值和队列长度值。 流量可以以基于丢弃概率值和与队列相关联的输出速率的恒定比特率加载到节点的队列中。 然后可以测量平均流量延迟，并且可以通过将测量的平均流量等待时间与输出速率相乘来计算实际的队列长度。 当计算的队列长度在与测试点相关联的队列长度值的指定公差内时，可以验证丢弃概率曲线。

公开(公告)号：US20130083657A1

公开(公告)日：2013-04-04

申请号：US13248181

申请日：2011-09-29

Applicant: Yu Gu

Inventor： Yu Gu

IPC: H04L12/26

CPC classification number: H04L43/0858 ,  H04L43/50 ,  H04L47/326

Abstract: In one embodiment, a test technique verifies a drop probability curve implemented by an intermediate node of a computer network, wherein a test point of the drop probability curve has a drop probability value and a queue length value. Traffic may be loaded into a queue of the node at a constant bit rate that is based on the drop probability value and an output rate associated with queue. An average traffic latency may then be measured, and an actual queue length may be calculated by multiplying the measured average traffic latency with the output rate. The drop probability curve may be verified when the calculated queue length is within a specified tolerance of the queue length value associated with the test point.

Abstract translation: 在一个实施例中，测试技术验证由计算机网络的中间节点实现的丢弃概率曲线，其中丢弃概率曲线的测试点具有丢弃概率值和队列长度值。 流量可以以基于丢弃概率值和与队列相关联的输出速率的恒定比特率加载到节点的队列中。 然后可以测量平均流量延迟，并且可以通过将测量的平均流量等待时间与输出速率相乘来计算实际的队列长度。 当计算的队列长度在与测试点相关联的队列长度值的指定公差内时，可以验证丢弃概率曲线。

公开(公告)号：US20120314707A1

公开(公告)日：2012-12-13

申请号：US13230069

申请日：2011-09-12

Applicant: Garry P. Epps ,  Michael Laor

Inventor： Garry P. Epps ,  Michael Laor

IPC: H04L12/56

CPC classification number: H04L47/527 ,  H04L47/10 ,  H04L47/21 ,  H04L47/326 ,  H04L47/50 ,  H04L47/6215 ,  H04L49/1546 ,  H04L49/205 ,  H04L49/3009 ,  H04L49/3018 ,  H04L49/3063 ,  H04L49/50 ,  H04L49/552 ,  H04L49/602 ,  H04L49/90 ,  H04L49/9078

Abstract: A pipelined linecard architecture for receiving, modifying, switching, buffering, queuing and dequeuing packets for transmission in a communications network is disclosed. The linecard has two paths: a receive path and a transmit path. In the receive path, received packets are processed and switched in an asynchronous, multi-stage pipeline. The pipelined switch operates on several packets in parallel while determining each packet's routing destination. Once that determination is made, each packet is modified to contain new routing information. Each packet is buffered and enqueued for transmission over the switching fabric to a destination linecard. The transmit path includes a buffer/queuing circuit similar to that used in the receive path. Both enqueuing and dequeuing of packets is accomplished using a CoS-based decision making apparatus.

Abstract translation: 公开了一种用于在通信网络中接收，修改，切换，缓冲，排队和排队分组以进行传输的流水线线路卡架构。 线卡有两条路径：接收路径和发送路径。 在接收路径中，接收的分组在异步多级流水线中进行处理和切换。 流水线交换机在确定每个数据包的路由目的地时并行操作多个数据包。 一旦确定，每个数据包被修改为包含新的路由信息​​。 每个数据包被缓冲并排入队列，以便通过交换结构传输到目标线卡。 发送路径包括与在接收路径中使用的类似的缓冲器/排队电路。 分组的入队和出队均使用基于CoS的决策设备完成。

公开(公告)号：US20120224480A1

公开(公告)日：2012-09-06

申请号：US13504252

申请日：2010-10-12

Applicant: Shell Nakash

Inventor： Shell Nakash

IPC: H04L12/56 ,  H04L12/26

CPC classification number: H04L47/10 ,  H04L47/12 ,  H04L47/31 ,  H04L47/32 ,  H04L47/326 ,  H04L49/3018

Abstract: A method for selective admission of traffic packets to a telecommunication switch having a limited throughput T and a common input queue, wherein the traffic packets comprise packets pre-assigned to higher and lower classes; in case of congestion at the common input queue of the switch, the method performs selective admission of the packets to the switch according to classes pre-assigned to them and depending on dynamic, recently utilized throughput of the switch.

Abstract translation: 一种用于选择性地接纳具有有限吞吐量T和公共输入队列的电信交换机的业务分组的方法，其中所述业务分组包括预先分配给更高和更低等级的分组; 在交换机的公共输入队列拥塞的情况下，该方法根据预先分配给它们的类别并根据动态的最近利用的交换机的吞吐量来对交换机进行选择性接纳。