A node of a data network receives data packets (200). For at least one of the received data packets (200), the node determines whether the data packet (200) is a guaranteed data packet which is subject to a guarantee that the data packet is not dropped and not delayed by more than a certain delay limit or a non-guaranteed data packet which is not subject to the guarantee. Based on a worst case calculation of a delay experienced by a data packet forwarded by the node, the node configures a resource contingent with a maximum amount of resources which is more than a minimum amount of resources required to meet the guarantee. Further, the node assigns resources to the resource contingent and identifies resources in excess of the minimum amount as excess resources. In response to determining that the data packet (200) is a non-guaranteed data packet and determining that sufficient excess resources are present, the node forwards the data packet (200) based on the excess resources.

A node of a data network receives data packets (200). For at least one of the received data packets (200), the node determines whether the data packet (200) is a guaranteed data packet which is subject to a guarantee that the data packet is not dropped and not delayed by more than a certain delay limit or a non-guaranteed data packet which is not subject to the guarantee. Based on a worst case calculation of a delay experienced by a data packet forwarded by the node, the node configures a resource contingent with a maximum amount of resources which is more than a minimum amount of resources required to meet the guarantee. Further, the node assigns resources to the resource contingent and identifies resources in excess of the minimum amount as excess resources. In response to determining that the data packet (200) is a non-guaranteed data packet and determining that sufficient excess resources are present, the node forwards the data packet (200) based on the excess resources.

At least one aspect of the present disclosure is directed to systems and methods of pruning retrieval tokens from sets of retrieval tokens based on criteria. The system can receive a plurality of retrieval tokens including a second retrieval token. The system can retrieve an indication of a first token and a plurality of requests. The system can construct a first bit string based on the predicted requests and the first retrieval token. The system can retrieve a second bit string corresponding to the second retrieval token. The system can compare the first bit string to the second bit string to determine a similarity value. The system can determine the similarity value is greater than a predetermined threshold. The system can remove the first and second retrieval token from the plurality to create a pruned set of retrieval tokens. The system can provide the pruned set to a content provider.

At least one aspect of the present disclosure is directed to systems and methods of pruning retrieval tokens from sets of retrieval tokens based on criteria. The system can receive a plurality of retrieval tokens including a second retrieval token. The system can retrieve an indication of a first token and a plurality of requests. The system can construct a first bit string based on the predicted requests and the first retrieval token. The system can retrieve a second bit string corresponding to the second retrieval token. The system can compare the first bit string to the second bit string to determine a similarity value. The system can determine the similarity value is greater than a predetermined threshold. The system can remove the first and second retrieval token from the plurality to create a pruned set of retrieval tokens. The system can provide the pruned set to a content provider.

There is disclosed in one example a method of a work node synchronously load balancing to a multi-node service having an expected maximum of n work nodes, including: provisioning a flow table having m bucket groups, m≥1, the bucket groups including n slots each; enumerating a static integer self-identification id.sub.0; initializing the flow table with id.sub.0 in each slot; performing a discovery iteration, including: discovering a peer device; enumerating a static integer identification id.sub.x for the peer device; assigning id.sub.x to each slot corresponding to a home position for the peer device; and load balancing slots not assigned to a home position according to a deterministic algorithm; and discovering additional nodes and performing discovery iteration for the additional nodes.

There is disclosed in one example a method of a work node synchronously load balancing to a multi-node service having an expected maximum of n work nodes, including: provisioning a flow table having m bucket groups, m≥1, the bucket groups including n slots each; enumerating a static integer self-identification id.sub.0; initializing the flow table with id.sub.0 in each slot; performing a discovery iteration, including: discovering a peer device; enumerating a static integer identification id.sub.x for the peer device; assigning id.sub.x to each slot corresponding to a home position for the peer device; and load balancing slots not assigned to a home position according to a deterministic algorithm; and discovering additional nodes and performing discovery iteration for the additional nodes.

A network device includes a plurality of interfaces configured to receive, from a network, packets to be processed by the network device. A load determination circuit of the network device is configured to determine whether a packet traffic load of the network device is above a traffic load threshold, and a dual-mode counter module is configured to (i) determine a count of quanta associated with the received packets using a first counting mode in response to the load determination unit determining that the packet traffic load is above the traffic load threshold, and (ii) determine a count of quanta associated with the received packets using a second counting mode, different than the first counting mode, in response to the load determination unit determining that the packet traffic load is not above the traffic load threshold.

Systems and methods for pacing data transmission are described. An illustrative method includes transmitting, by a network device, a data stream at a pacing rate to a user equipment (UE) device. The method further includes accessing a metric of a radio access network (RAN) to which the UE device is connected, the metric associated with the UE device. The method further includes adjusting, based on the metric, the pacing rate at which the data stream is transmitted to the UE device.

A transit device receives a target token request sent by a data transmit end, and sends the target token request to a data receive end. The data receive end may determine, based on the target token request, a target token packet corresponding to the target token request, and then send the target token packet to the transit device based on a priority identifier. The transit device determines a sending rate of the token packet based on a link bandwidth of the current device, a preset packet length of a token packet, and a preset packet length of the data packet, and sends the target token packet to the data transmit end based on the priority identifier and the sending rate of the token packet. The transit device may send the target data packet to the data receive end.

A transit device receives a target token request sent by a data transmit end, and sends the target token request to a data receive end. The data receive end may determine, based on the target token request, a target token packet corresponding to the target token request, and then send the target token packet to the transit device based on a priority identifier. The transit device determines a sending rate of the token packet based on a link bandwidth of the current device, a preset packet length of a token packet, and a preset packet length of the data packet, and sends the target token packet to the data transmit end based on the priority identifier and the sending rate of the token packet. The transit device may send the target data packet to the data receive end.