One embodiment provides an apparatus. The apparatus includes client traffic management (CTM) logic. The CTM logic is to trigger implementation of a selected network traffic flow related to the client device, the triggering based, at least in part, on a network traffic flow related to the client device. The network traffic flow is associated with a connection and includes at least one subflow. Each subflow is carried by a respective path associated with the connection. The triggering includes at least one of constraining and/or adjusting an allowable throughput at a service provider for one or more of the at least one subflow. The selected traffic policy is to be implemented in a transport layer.

Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.

The present disclosure generally discloses a scheduling granularity capability. The scheduling granularity capability is configured to improve scheduling granularity in a wireless communication system supporting transport of application flows via radio bearers. The scheduling granularity capability may be configured to support improved scheduling granularity by controlling scheduling at various levels of granularity, such as at the bearer level (e.g., for scheduling bearers with respect to each other), at the application flow level (e.g., for scheduling the application flow of a bearer when the bearer includes a single application flow, for scheduling application flows of a bearer with respect to each other when the bearer includes multiple application flows, or the like), or the like, as well as various combinations thereof. The scheduling granularity capability may be configured to support improved scheduling granularity by identifying application types of application flows supported by the bearers and controlling scheduling, at various layers of granularity, based on the application types of the application flows supported by the bearers.

The disclosure describes a data enqueuing method. The method may include: receiving a to-be-enqueued data packet, dividing the data packet into several slices to obtain slice information of the slices, and marking a tail slice of the data packet with a tail slice identifier; enqueuing corresponding slice information according to an order of the slices in the data packet, and in a process of enqueuing the corresponding slice information, if a slice is marked with the tail slice identifier, determining that the slice is the tail slice of the data packet, and generating a first-type node; and determining whether a target queue is empty, and if the target queue is empty, writing slice information of the tail slice into the target queue, and updating a head pointer of a queue head list according to the first-type node.

The present disclosure relates to an adaptive jitter buffer for buffering audio data received via a network. The adaptive jitter buffer comprises an adaptive audio sample buffer, which comprises an adaptive resampler that receives a number of audio samples of the audio data and that outputs a first number of audio samples, which are resampled from the received number of audio samples according to a resampling factor, an audio sample buffer that buffers audio samples, wherein the outputted first number of audio samples are written to the audio sample buffer during an input access event and a second number of audio samples are read from the audio sample buffer during an output access event, and an audio sample buffer fill quantity controller that controls a fill quantity of the audio sample buffer based on controlling the resampling factor of the adaptive resampler.

Orders received by an electronic trading system are processed in batches based on the instrument to which an order relates. An incoming order is assigned to a queue of a queue set that makes up the batch according to a random process. Where orders are received from related trading parties, they are assigned to the same queue set according to their time of receipt. The batch has a random duration within defined minimum and maximum durations and at the end of the batch, the orders held in the queues are transferred to a matching thread of the trading system sequentially with one order being removed from each queue and a number of passes of the queues completed until orders have been removed.

Described are systems, methods, and computer readable medium for dynamic power usage and data transfer rate management in a sensor network including synchronous and asynchronous links. Exemplary embodiments provide a lightweight communication protocol enabling dynamic management of data buffer size in a sensor network and corresponding control of power usage and data transfer rates in the sensor network.

A method for communicating data in a processing architecture comprising a plurality of interconnected IP blocks. Transmitting IP blocks may transmit messages to a shared receive queue for a first IP block. Receipt of the messages at the shared receive queue may be controlled based on receive credits allocated to each transmitting IP block. The allocation of receive credits for each transmitting IP block may dynamically managed such that the allocation of receive credits may be dynamically adjusted for each transmitting IP block based at least in part on message traffic associated with each transmitting IP block and/or a priority associated with each transmitting IP block.

Orders received by an electronic trading system are processed in batches based on the instrument to which an order relates. An incoming order is assigned to a queue of a queue set that makes up the batch according to a random process. Where orders are received from related trading parties, they are assigned to the same queue set according to their time of receipt. The batch has a random duration within defined minimum and maximum durations and at the end of the batch, the orders held in the queues are transferred to a matching thread of the trading system sequentially with one order being removed from each queue and a number of passes of the queues completed until orders have been removed.

Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.