LAS scheduling to avoid bandwidth hogging in heterogeneous TCP networks

Abstract

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 phenomenon, which is also known as bandwidth hogging, occurs in heterogeneous networks such as networks with connections that have varying propagation delays, networks with competing TCP and UDP applications, and networks with multiple congested routers. LAS scheduling in routers avoids bandwidth hogging by giving service priority to connections that have sent the least data. In other words, a connection under LAS scheduler does not receive service if there is another active connection with less attained service. Simulation results in this paper show that this scheduling approach is more efficient than FIFO scheduling, and offers close to fair sharing of network bandwidth among competing connections in congested heterogeneous networks. © Springer-Verlag Berlin Heidelberg 2004.