Overload Based Explicit Rate Switch Schemes with MCR Guarantees
Bobby Vandalore, Sonia Fahmy, Raj Jain, Rohit Goyal, Mukul Goyal

TL;DR
This paper introduces four overload-based explicit rate switch schemes with MCR guarantees that adaptively control feedback rates to optimize link utilization and maintain steady-state delay, tested through extensive simulations.
Contribution
It proposes novel overload-based ABR switch algorithms that incorporate overload factors and dynamic queue control to ensure MCR guarantees and efficient link usage.
Findings
Algorithms effectively manage link and source bottlenecks
Achieve constant queuing delay at steady state
Outperform existing schemes in simulations
Abstract
An explicit rate switch scheme monitors the load at each link and gives feedback to the sources. We define the overload factor as the ratio of the input rate to the available capacity. In this paper, we present four overload based ABR switch schemes which provide MCR guarantees. The switch schemes proposed use the overload factor and other quantities to calculate feedback rates. A dynamic queue control mechanism is used to achieve efficient usage of the link, control queues and, achieve constant queuing delay at steady state. The proposed algorithms are studied and compared using several configurations. The configurations were chosen to test the performance of the algorithms in presence of link bottlenecks, source bottlenecks and transient sources. A comparison of the proposed algorithms based on the simulation results is presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Advanced Queuing Theory Analysis · Real-Time Systems Scheduling
