A quality of service (QoS) management system and guarantee is presented. The QoS management system can be used for end to end data. More specifically, and without limitation, the invention relates to the management of traffic and priorities in a queue and relates to grouping transactions in a queue providing solutions to queue starvation and transmission latency.

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.

The dynamic proportioning of a maximum queue size of a data transport device queue based on throughput parameters may decrease routing latency of a data transport device. A maximum queue size parameter for a data queue may be calculated based on at least a plurality of throughput parameters during routing of data traffic from a data source device to a data recipient device. Subsequently, a maximum queue size of the data queue may be decreased according to the maximum queue size parameter to prevent enqueuing of incoming service frames into the data queue. The lack of enqueueing of the incoming service frames may cause the data source device to retransmit the one or more incoming service frames to the data transport device, instead of allowing the one or more incoming service frames to be enqueued and trapped in the data queue by additional incoming service frames.

A quality of service (QoS) management system and guarantee is presented. The QoS management system can be used for end to end data. More specifically, and without limitation, the invention relates to the management of traffic and priorities in a queue and relates to grouping transactions in a queue providing solutions to queue starvation and transmission latency.

Example implementations relate to hybrid arbitration of requests for access to a shared pool of resources. An example implementation includes receiving a set of requests for access to the shared pool of resources. The requests may each be from any number of traffic classes. A traffic class may be selected according to turn-based arbitration logic. Additionally, a request from each traffic class of a subset of received requests may be selected. A request selected by the age-based arbitration logic and of the selected traffic class may be granted access to the shared pool of resources.

A packet transfer device includes a circuit configured to include a first queue to store a first packet classified into a high priority class and a second queue to store a second packet classified into a low priority class, a memory configured to store data configured to indicate possibilities of output for the first packet and the second packet for each time slot, a processor coupled to the memory and configured to control the output of the first packet and the second packet for each time slot according to the data stored in the memory, count a number of discards of the second packet within the second queue in a predetermined cycle, and change the data stored in the memory, when the number of discards is less than a first predetermined value, so as to reduce an output period of the second packet every the time slot.

If a plurality of streams and an environment in which a dependent relationship exists between the streams are assumed, fairness may not be maintained by a conventional technique. The priority of a stream is determined by the dependent relationship between the streams.

Example implementations relate to hybrid arbitration of requests for access to a shared pool of resources. An example implementation includes receiving a set of requests for access to the shared pool of resources. The requests may each be from any number of traffic classes. A traffic class may be selected according to turn-based arbitration logic. Additionally, a request from each traffic class of a subset of received requests may be selected. A request selected by the age-based arbitration logic and of the selected traffic class may be granted access to the shared pool of resources.

Example implementations relate to hybrid arbitration of requests for access to a shared pool of resources. An example implementation includes receiving a set of requests for access to the shared pool of resources. The requests may each be from any number of traffic classes. A traffic class may be selected according to turn-based arbitration logic. Additionally, a request from each traffic class of a subset of received requests may be selected. A request selected by the age-based arbitration logic and of the selected traffic class may be granted access to the shared pool of resources.

Described herein include systems, methods, and apparatuses for the scheduling of data over a network (e.g., a wired or wireless network). A scheduler may be configured to receive a portion of packets at a receiving buffer and classify the packets into real time packets or non-real time packets using associated first and second queues. Further, a first re-transmission component may receive the real time packets from the first queue, and a second re-transmission component may receive the non-real time packets from the second queue. The real time packets may be received, by a transmission component, from the first re-transmission component; the transmission component may also receive non-real time packets from the second re-transmission component. The scheduler may then transmit at least one real time packet or non-real time packet to another device over a network using any suitable scheduling algorithm.