Flexible deterministic binary scheduler
    31.
    发明授权
    Flexible deterministic binary scheduler 有权
    灵活的确定性二进制调度器

    公开(公告)号:US09455933B2

    公开(公告)日:2016-09-27

    申请号:US14164167

    申请日:2014-01-25

    CPC classification number: H04L47/826 H04L47/6255 H04L49/00 H04L49/25

    Abstract: A method for allocating port assignments for transmitting a reserved network stream across a network node comprises determining a cycle time associated with a network node. The method also comprises establishing, for at least one port of the network node, a plurality of virtual layers associated with the cycle time, wherein each of the plurality of virtual layers is divided into 2n equally-spaced slots per cycle (where n>0). The method further comprises receiving a reserved stream request associated with transmission of a reserved stream across the node, and determining a number of slots required to transmit the reserved stream. The method also comprises assigning one or more slots associated with a port of the network node to the transmission of packets associated with the reserved stream based on the determined number of slots. The method further comprises transmitting the stream according to the slot assignment associated with the port of the network node.

    Abstract translation: 用于分配用于通过网络节点发送保留网络流的端口分配的方法包括确定与网络节点相关联的周期时间。 所述方法还包括为所述网络节点的至少一个端口建立与所述周期时间相关联的多个虚拟层,其中所述多个虚拟层中的每一个虚拟层每个周期被划分成2n个等间隔的时隙(其中n> 0 )。 所述方法还包括:接收与所述节点之间的保留流的传输相关联的保留流请求,以及确定发送所述预留流所需的时隙数。 该方法还包括基于所确定的时隙数量,将与网络节点的端口相关联的一个或多个时隙分配给与保留流相关联的分组的传输。 该方法还包括根据与网络节点的端口相关联的时隙分配来发送流。

    FLEXIBLE DETERMINISTIC BINARY SCHEDULER
    32.
    发明申请
    FLEXIBLE DETERMINISTIC BINARY SCHEDULER 有权
    灵活的确定性二进制调度器

    公开(公告)号:US20150215237A1

    公开(公告)日:2015-07-30

    申请号:US14164167

    申请日:2014-01-25

    CPC classification number: H04L47/826 H04L47/6255 H04L49/00 H04L49/25

    Abstract: A method for allocating port assignments for transmitting a reserved network stream across a network node comprises determining a cycle time associated with a network node. The method also comprises establishing, for at least one port of the network node, a plurality of virtual layers associated with the cycle time, wherein each of the plurality of virtual layers is divided into 2n equally-spaced slots per cycle (where n>0). The method further comprises receiving a reserved stream request associated with transmission of a reserved stream across the node, and determining a number of slots required to transmit the reserved stream. The method also comprises assigning one or more slots associated with a port of the network node to the transmission of packets associated with the reserved stream based on the determined number of slots. The method further comprises transmitting the stream according to the slot assignment associated with the port of the network node.

    Abstract translation: 用于分配用于通过网络节点发送保留网络流的端口分配的方法包括确定与网络节点相关联的周期时间。 所述方法还包括为所述网络节点的至少一个端口建立与所述周期时间相关联的多个虚拟层,其中所述多个虚拟层中的每一个虚拟层每个周期被划分成2n个等间隔的时隙(其中n> 0 )。 所述方法还包括:接收与所述节点之间的保留流的传输相关联的保留流请求,以及确定发送所述预留流所需的时隙数。 该方法还包括基于所确定的时隙数量,将与网络节点的端口相关联的一个或多个时隙分配给与保留流相关联的分组的传输。 该方法还包括根据与网络节点的端口相关联的时隙分配来发送流。

    UTILIZING LATENCY CONTROL TO ALLEVIATE BUFFERBLOAT
    34.
    发明申请
    UTILIZING LATENCY CONTROL TO ALLEVIATE BUFFERBLOAT 有权
    使用对ALLEVIATE BUFFERBLOAT的延迟控制

    公开(公告)号:US20140328175A1

    公开(公告)日:2014-11-06

    申请号:US13874600

    申请日:2013-05-01

    Abstract: In one embodiment, a method includes estimating a current queuing latency, the estimated current queuing latency being associated with a queue of packets maintained in a buffer. The method also includes calculating a current drop or mark probability, the current drop or mark probability being associated with a probability that packets associated with the queue of packets will be dropped or marked. A rate at which the packets associated with the queue of packets are dequeued from the buffer is estimated in order to estimate the current queuing latency. The current drop or mark probability is calculated using the current estimated queuing latency.

    Abstract translation: 在一个实施例中,一种方法包括估计当前排队延迟,所估计的当前排队等待时间与保持在缓冲器中的分组队列相关联。 该方法还包括计算当前下降或标记概率,当前丢弃或标记概率与丢弃或标记与分组队列相关联的分组的概率相关联。 与缓冲区队列相关联的分组的速率被估计为估计当前排队等待时间。 使用当前估计的排队延迟来计算当前的下降或标记概率。

    TCP-Based Weighted Fair Video Delivery
    35.
    发明申请
    TCP-Based Weighted Fair Video Delivery 审中-公开
    基于TCP的加权公平视频传送

    公开(公告)号:US20140244798A1

    公开(公告)日:2014-08-28

    申请号:US13778350

    申请日:2013-02-27

    Abstract: Weighted fair sharing of video bandwidth may be provided, for example, over TCP. First, a number of connections with a receiver may be opened. The number of active connections may be proportional to a weighting parameter associated with a stream. Next, the stream may be transmitted over the number of active connections and feedback information may be obtained corresponding to the stream received at the receiver. A quality adaptation may then be made based on the obtained feedback. The process may be repeated over time with the number of active connections changing along with the weighting parameters.

    Abstract translation: 可以例如通过TCP提供视频带宽的加权公平共享。 首先,可以打开与接收器的多个连接。 活动连接的数量可以与与流相关联的加权参数成比例。 接下来,可以通过有效连接的数量来发送流,并且可以相应于在接收器处接收的流来获得反馈信息。 然后可以基于获得的反馈来进行质量调整。 随着随着加权参数的变化,活动连接的数量随着时间的推移重复该过程。

    LAYER 3 FAIR RATE CONGESTION CONTROL NOTIFICATION

    公开(公告)号:US20200153748A1

    公开(公告)日:2020-05-14

    申请号:US16738659

    申请日:2020-01-09

    Abstract: A network device, including ports that receive/send data packets from/to a network, receives data packets of multiple traffic flows, and populates a queue in memory with the data packets. The network device periodically updates a fair rate for the multiple traffic flows to converge a length of the queue to a reference length. Specifically, the network device determines a length of the queue, a change in the length from a previous length, and a deviation of the length from the reference length. The network device detects an increase in the change in length above a threshold that is based on the reference length. If the increase is not above the threshold, the network device derives the fair rate from a previous fair rate using proportional integral control. The network device identifies elephant flows among the multiple traffic flows, and sends the fair rate to a source of each elephant flow.

    Methods and devices for backward congestion notification

    公开(公告)号:US10171328B2

    公开(公告)日:2019-01-01

    申请号:US14304676

    申请日:2014-06-13

    Abstract: The present invention provides improved methods and devices for managing network congestion. Preferred implementations of the invention allow congestion to be pushed from congestion points in the core of a network to reaction points, which may be edge devices, host devices or components thereof. Preferably, rate limiters shape individual flows of the reaction points that are causing congestion. Parameters of these rate limiters are preferably tuned based on feedback from congestion points, e.g., in the form of backward congestion notification (“BCN”) messages. In some implementations, such BCN messages include congestion change information and at least one instantaneous measure of congestion. The instantaneous measure(s) of congestion may be relative to a threshold of a particular queue and/or relative to a threshold of a buffer that includes a plurality of queues.

Patent Agency Ranking