We propose using least attained service (LAS) scheduling in network routers to prevent some connections against utilizing all or a large fraction of network bandwidth. This phenome...
Idris A. Rai, Guillaume Urvoy-Keller, Ernst W. Bie...
— We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are abl...