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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Claffy, K.M.G., Thompson, K.: The nature of the beast: Recent traffic measurements from an internet backbone. Proceedings of INET (July 1998)
Nandy, B., et al.: Intelligent traffic conditioners for assured forwarding based differentiated services networks. In: Proc. IFIP High Performance Networking, HPN 2000, Paris (2000)
Aikat, J., et al.: Variability in tcp round-trip times. Internet Measurement Conference 2003 (2003)
Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling TCP throughput: A simple model and its empricial validation. In: Proceedings of the ACM SIGCOMM Conference, Vancouver, British Columbia, Canada (1998)
Floyd, S.: Connections with multiple congested gateways in packet-switched networks. ACM Computer Communication Review 21, 30–47 (1991)
Brakmo, L.S., O’Malley, S.W., Peterson, L.L.: TCP Vegas: New techniques for congestion detection and avoidance. In: Proceedings of the ACM SIGCOMM Conference, London, England (1994)
Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACMTransactions on Networking 1, 397–413 (1993)
Lin, D., Morris, R.: Dynamics of random early detection. In: Proc. of the ACM/SIGCOMM 1997, pp. 127–137 (1997)
Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round robin. ACM Computer Communication Review 25, 231–242 (1995)
Hasegawa, G., Murata, M.: Survey of fairness issues in tcp control mechanisms. IEICE Trans. on Communications E84-B, 1461–1472 (2001)
Kleinrock, L.: Queuing Systems, Volume II: Computer Applications. Wiley, New York (1976)
Coffman, E.G., Denning, P.J.: Operating Systems Theory. Prentice-Hall Inc., Englewood Cliffs (1973)
Rai, I.A., Biersack, E.W., Urvoy-Keller, G.: Analyzing the performance of tcp flows in packet networks with las schedulers. Technical Report RR-03.075 (2003)
Hahne, E.L.: Round-robin scheduling for max-min fairness in data networks. IEEE Journal of Selected Areas in Communications 9, 1024–1039 (1991)
http://www.isi.edu/nsnam/ns/: The network simulator ns2 (Technical report)
Bhagwan, R., Lin, B.: Fast and scalable priority queue architecture for high-speed network switches. In: INFOCOM 2000, pp. 538–547 (2000)
Rai, I.A., Urvoy-Keller, G., Biersack, E.W.: Analysis of las scheduling for job size distributions with high variance. In: ACM Sigmetrics 2003, pp. 218–228 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rai, I.A., Urvoy-Keller, G., Biersack, E.W. (2004). LAS Scheduling to Avoid Bandwidth Hogging in Heterogeneous TCP Networks. In: Mammeri, Z., Lorenz, P. (eds) High Speed Networks and Multimedia Communications. HSNMC 2004. Lecture Notes in Computer Science, vol 3079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25969-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-25969-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22262-0
Online ISBN: 978-3-540-25969-5
eBook Packages: Springer Book Archive