Rate limiting systems and methods for regulating access to a shared network resource in a computing device accessed through an application programming interface. A rate limit associated with a shared network resource is assigned to a user for a time period. During the time period, access to the shared network resource is granted or denied repeatedly based upon the rate limit; a cost is calculated using a cost function; and, the rate limit is updated based upon the cost.

Among other things, flow rates of traffic among endpoints in a network are controlled. Notifications are received about flowlets originating or received at the endpoints. Each of the flowlets includes one or more packets that are in a queue associated with a corresponding flowlet. In response to the received notifications, updated flow rates are computed for the flowlets. The updated flow rates are sent to devices for use in controlling flow rates for the flowlets in accordance with the computed updated flow rates.

A technique allows stations to utilize an equal share of resources (e.g., airtime or throughput). This prevents slow stations from consuming too many resources (e.g., using up too much air time). Fairness is ensured by selective dropping after a multicast packet is converted to unicast. This prevents slow stations from using more than their share of buffer resources. Multicast conversion aware back-pressure into the network layer can be used to prevent unnecessary dropping of packets after multicast to unicast (1:n) conversion by considering duplicated transmit buffers. This technique helps achieve airtime/resource fairness among stations.

A method is performed by a computing device in a data transport network. The computing device receives congestion-related information corresponding to current conditions of a portion of the network. The computing device determines whether a data transport session has a fair-share protocol. When the data transport session has the fair-share protocol, determining a congestion policy for the data transport session, and applying, using the congestion-related information, the congestion policy to the data transport session.

Embodiments herein relate to a method in a first communication node (10) for transmitting a packet in a first packet network operated by a first network operator towards a destination node (10,12). The first communication node (10) is comprised in the first packet network. The first communication node (10) receives a packet with a first value related to resource sharing in a second packet network operated by a second network operator, wherein the first value indicates a level of importance of the packet relative importance of another packet along a scale of the second packet network. The first communication node (10) remarks the packet with a second value related to resource sharing in the first packet network, wherein the second value indicates a level of importance of the packet relative importance of another packet along a scale of the first packet network. The first communication node (10) transmits, over the first packet network, the remarked packet towards the destination node (10,12).

A method in a network node relating to a process of controlling a data transfer related to video data of a video streaming service from a server to a wireless device is provided. The network node and wireless device operates in a wireless communications network. The network node determines a scheduling weight value for the wireless device to be used in the data transfer based on a target rate scheduling weight value and a proportional fair rate scheduling weight value. The network node then determines a size of data segment to be used in the data transfer based on at least part of the scheduling weight value. The network node further determines a pending data volume for the transferring of the video data to a play back buffer of the wireless device based on at least part of the scheduling weight value.

A method and an apparatus for adding tokens in traffic shaping are provided. According to the method, a weight of each data stream is configured, and each data stream is added to corresponding token schedulers based on the weight of the each data stream. Based on a weight of each token scheduler, each token scheduler is sequentially added to corresponding token scheduler groups, and all the token scheduler groups are aggregated into a token scheduler of a total data stream. The token scheduler of the total data stream is added to a top token scheduler. Based on a preset cycle, a token is assigned to the token scheduler of the total data stream in the top token scheduler, and the assigned token is delivered to each token scheduler group or to a respective data stream.

Implementing a fair share of resources among one or more scheduling peers. Resource allocations are received for a plurality of scheduling peers. For each scheduling peer, a usage percentage difference is determined between their respective usage percentage and configured share ratio. For a first competing peer that is served more than a second competing peer, resource allocation is adjusted such that resources from the first competing peer are allocated to the second competing peer based, at least in part, on a time decay factor function that gives less weight to the usage percentage difference as an age of the usage percentage difference increases.

A method for queue management in a packet-switched network including at an intermediate node receiving first packets belonging to a first class associated with a first queue management mechanism and second packets belonging to a second class associated with a second queue management mechanism; marking or dropping of the first packets in accordance with the first queue management mechanism and marking or dropping of the second packets in accordance with the second queue management mechanism; and coupling the marking or dropping of the second packets to the marking or dropping of the first packets.

A method to determine a hierarchical fair share of resources among one or more scheduling peers. The method determines a greatest fairness difference between the usage percentage difference of a most-served competing peer and that of a least-served competing peer. The method determines a greatest accumulated fairness difference between the accumulated usage percentage difference of the most-served competing peer and that of the least-served competing peer. The method adjusts a resource allocation such that resources from the most-served competing peer are allocated to the least-served competing peer if an adjustment condition is met, wherein the adjustment condition is based on one or both of i) the greatest fairness difference, and ii) whether the greatest accumulated fairness difference exceeds at least one threshold.