Aspects of the disclosure provide a method for communicating queue information. The method includes determining a queue state for each one of a plurality of queues at least partially based on respective queue length, selecting a queue with a greatest difference between the queue state of the queue and a last reported queue state of the queue, and reporting the queue state of the selected queue to at least one node.

A method for servicing multiple data queues in communication with a data communications network. The multiple data queues may receive data of differing priority and/or the data queues may be arranged for data with a predetermined priority. The data in the data queues may be serviced by the same processor. A schedule may be applied to the data in the data queues to control the servicing the data in the data queues.

A computer-implemented method of controlling communication resources and computation resources of a computerized system includes continually monitoring dual observables. The dual observables include one or more communication observables pertaining to one or more communication channels of the system, and one or more compute observables pertaining to a computational workload execution by a processor of the system. The method also includes jointly adjusting dual resources of the system based on the dual observables monitored, where the dual resources include communication resources for the one or more communication channels, and computation resources for the computational workload execution. Such a method can be used for sprinting both communication and computational resources, in a consistent way, for the system to best cope with temporary situations, in terms of both workload execution and data traffic. The invention is further directed to related systems and computer program products.

A method is provided in one example embodiment and includes determining whether a packet received at a network node in a communications network is a high priority packet; determining whether a low priority queue of the network node has been deemed to be starving; if the packet is a high priority packet and the low priority queue has not been deemed to be starving, adding the packet to a high priority queue, wherein the high priority queue has strict priority over the low priority queue; and if the packet is a high priority packet and the low priority queue has been deemed to be starving, adding the packet to the low priority queue.

A network interface controller (NIC) capable of efficient packet forwarding is provided. The NIC can be equipped with a host interface, a packet generation logic block, and a forwarding logic block. During operation, the packet generation logic block can obtain, via the host interface, a message from the host device and for a remote device. The packet generation logic block may generate a plurality of packets for the remote device from the message. The forwarding logic block can then send a first subset of packets of the plurality of packets based on ordered delivery. If a first condition is met, the forwarding logic block can send a second subset of packets of the plurality of packets based on unordered delivery. Furthermore, if a second condition is met, the forwarding logic block can send a third subset of packets of the plurality of packets based on ordered delivery.

A communication system includes a programmable switch configured to perform packet transfer and queuing, a plurality of VNFs configured to execute network functions on packets, and a controller configured to control the programmable switch including a queue distribution unit configured to distribute input packets to any of the plurality of VNFs according to an instruction of the controller with respect to a queue group, the plurality of VNFs each include a load measurement unit configured to measure an amount of consumption of server resources and notify the controller of a load status, and the controller includes a load analysis unit configured to analyze a load of each of the plurality of VNFs based on a certain rule, and a queue control unit configured to change a queue distribution rule.

A system for transmitting concurrent data flows on a network, includes a memory containing data of data flows; a plurality of queues assigned respectively to the data flows, organized to receive the data as atomic transmission units; a flow regulator to poll the queues in sequence and, if the polled queue contains a full transmission unit, transmitting the unit on the network at a nominal flow-rate of the network; a sequencer to poll the queues in a round-robin manner and enable a data request signal when the filling level of the polled queue is below a threshold common to all queues, which threshold is greater than the size of the largest transmission unit; and a direct memory access configured to receive the data request signal and respond thereto by transferring data from the memory to the corresponding queue at a nominal speed of the system, up to the common threshold.

An access control unit includes packet buffers provided for each of users, a packet identification unit that stores received packets in a corresponding packet buffer, a scheduling unit that decides a packet buffer to be the object of transfer, a transfer control unit that, in a case that updating of reference data can be performed at an application processing circuit, and also the packet buffer decided by the scheduling unit is different from the current packet buffer that is the object of transfer, updates to reference data corresponding to the packet buffer decided by the scheduling unit, and a buffer selection unit that connects the packet buffers decided to be the object of transfer to the packet transfer unit when updating of reference data is completed.

A method for joint optimization of resource allocation includes: obtaining network data volumes of two services; obtaining queue statuses at a time t; computing sub-channel slices; computing a local CPU speed scaling, a user association, a sub-carrier assignment, and a power allocation of service 1; computing a user association, a video quality decision, and a sub-carrier assignment of service 2; obtaining an initial sub-carrier assignment and an initial power allocation; obtaining the user association; obtaining the power allocation and the sub-carrier assignment of service 1; obtaining the video quality decision; obtaining the sub-carrier assignment of service 2; obtaining an optimal data transmission rate and the user association to obtain a data rate allocation; and obtaining an optimal CPU speed scaling, an optimal user association, an optimal sub-carrier assignment, an optimal power allocation, an optimal video quality decision and an optimal sub-channel allocation.

Techniques to facilitate a hardware based table look of a table maintained in or more types of memories or memory domains include examples of receiving a search request forwarded from a queue management device. Examples also include implementing table lookups to obtain a result and sending the result to an output queue of the queue management device for the queue management device to forward the result to a requestor of the search request.