In one embodiment, a method includes selecting a flow from a head of a first control queue or a second control queue. The method also includes providing service to the selected flow. Moreover, the method includes decreasing a service credit of the selected flow by an amount corresponding to an amount of service provided to the selected flow. In another embodiment, a computer program product includes a computer readable storage medium having program code embodied therewith. The embodied program code is readable/executable by a device to select, by the device, a flow from a head of a first control queue or a second control queue. The embodied program code is also readable/executable to provide, by the device, service to the selected flow, and decrease, by the device, a service credit of the selected flow by an amount corresponding to an amount of service provided to the selected flow.

A self-protecting router limits the extent to which its queues can be filled with potentially malicious or otherwise harmful messages received from outside the router, thereby ensuring the queues have sufficient room to accept messages generated internally within the router and are necessary for management and operation of the router. Such routers are, therefore, immune to attack by floods of messages from malicious or malfunctioning network nodes, such as computers, switches and other routers.

A system and method can support efficient packet switching in a network environment. A networking device, such as a network switch, which includes a crossbar fabric, can be associated with a plurality of input ports and a plurality of output ports. Furthermore, the networking device operates to detect a link state change at an output port on the networking device. The output port can provide one or more credits to an output scheduler, and the output scheduler allows one or more packets targeting the output port to be dequeued from one or more virtual output queues, based on the one or more credits.

Embodiments relate to systems and methods that facilitate coordination amongst host devices that share network resources in order to use available bandwidth effectively. Embodiments can ensure the host devices themselves take responsibility for sending their data via shared network bandwidth, keeping access to bandwidth fair to all the host devices. Embodiments also include adapting to a continuously changing network bandwidth allocation policy for the shared network resource. In one embodiment, this includes using tokens (e.g., small chunk messages) to represent a grant to a host device to send a specified number of bytes over the network. Using a token generator module and a distributed queue, embodiments provide a unique and adaptive way to manage data transmissions among host devices within available resources.

An apparatus for managing data queues is disclosed. The apparatus includes at least one sensor for collecting data, a data interface for receiving data from the sensor(s) and for placing the collected data in a set of data queues, and a priority sieve for organizing the set of data queues according to data priority of a specific task. The priority sieve includes a scoreboard for identifying queue priority and a system timer for synchronization.

In one embodiment of a network pipe optimization method, a network element may obtain at least one of a push pipe utilization report and a pull pipe utilization report from each distribution node of the content delivery network. Based on the utilization reports, the network element may determine new push pipe weights and new pull pipe weights for distribution pipes associated with each distribution node of the content delivery network. Using at least one of the new push pipe weights and new pull pipe weights, a network pipe utilization model associated with the content delivery network may be simulated. Responsive to determining that the simulated network pipe utilization model yields an improved utilization of the content delivery network, the new push pipe weights and new pull pipe weights may be distributed to each distribution node in the content delivery network.

Embodiments of the present invention disclose a packet forwarding method and apparatus. The method includes: receiving, by a first scheduler, a target packet; sending the target packet to a destination physical egress port corresponding to the egress port information, and increasing, according to the queue identifier, a queue length of a virtual queue corresponding to the queue identifier by the packet length; sending update information to a second scheduler, where the update information includes that the queue length of the virtual queue is increased by the packet length; and decreasing the queue length of the virtual queue by the packet length according to a bandwidth scheduling result that is corresponding to the update information and sent by the second scheduler. In this way, even if back pressure appears in the destination physical egress port corresponding to the target packet, that the first scheduler sends the target packet is not affected.

According to an example, a method for bandwidth guarantee and work conservation includes determining virtual machine (VM) bandwidth guarantees assigned to VMs in a network including a source VM that communicates with destination VMs. The method further includes assigning minimum bandwidth guarantees to communications between the source VM with the destination VMs by dividing a VM bandwidth guarantee assigned to the source VM between the destination VMs based on active VM-to-VM communications between the source VM and the destination VMs. The method also includes allocating, by a processor, spare bandwidth capacity in the network to a communication between the source VM and a destination VM based on the assigned minimum bandwidth guarantees.

A traffic control apparatus at which packets of a plurality of packet flows arrive includes a plurality of buffers corresponding to a plurality of times, a selector configured to read a packet accumulated in one of the plurality of buffers corresponding to a current time, and a scheduler configured to decide one of the plurality of buffers to accumulate a packet of each of the plurality of packet flows. The scheduler attempts, for each of the plurality of packet flows, accumulation of packets which are reached during a predetermined period under a condition that, as quantity of packets accumulated in the plurality of buffers is larger, the number of buffers into which packets can be accumulated becomes smaller after the predetermined period.

Switched digital television programming for video-on-demand and other interactive television services are combined utilizing a class-based, multi-dimensional decision logic to simultaneously optimize video quality and audio uniformity while minimizing latency during user interactions with the system over managed networks such as cable and satellite television networks. A group of user sessions are assigned to a single modulator. The user sessions include data in a plurality of classes, each class having a respective priority. In response to a determination that an aggregate bandwidth of the group of user sessions for a first frame time exceeds a specified budget, bandwidth is allocated for the group of user sessions during the first frame time in accordance with the class priorities. The group of user sessions is multiplexed onto a channel corresponding to the modulator in accordance with the allocated bandwidth and transmitted over a managed network.