Abstract
This disclosure describes a scheduler/arbiter that arbitrates between queues of a network connection in a fair and efficient manner while accounting for network congestion. Fairness in bandwidth allocation across the queues can be achieved using various strategies such as round-robin (RR) scheduling, least recently used (LRU) scheduling, etc. The arbiter allocates network access (bandwidth) to the queues in an equitable manner that is cognizant of the current levels of fabric/end-node congestion and compatible with congestion-control mechanisms. The described techniques apply to any transport layer that seeks to attain reliability by using a congestion control mechanism.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
NA, "Fair Arbitration Among Queues of a Connection Scheduler", Technical Disclosure Commons, (November 15, 2024)
https://www.tdcommons.org/dpubs_series/7539