Excessive buffer sizes in access networks may result in long delays, the effect known under the name of bufferbloat. There exist mechanisms that can solve the problem, however their deployment may be difficult or not feasible. In this paper, we explore other approaches that may bring better performance if the known solutions cannot be applied. Our main finding is the paradoxical observation that adding low intensity traffic of short packets improves latency at the price of a slight decrease in throughput. The result comes from the fact that buffer sizes are generally limited to a number of packets, so that filling them with small packets improves the queueing delay. Such a countermeasure does not require any modification at the head of the bottleneck link so an end host can use it to improve its performance. We also notice that the reverse download traffic has beneficial influence on performance, which explains why the negative effect of bufferbloat sometimes appears as alleviated. The paper presents the results of extensive experiments in a realistic setup over an ADSL link as well as on a dedicated testbed to illustrate the performance gains and the effect of several TCP variants.
[1]
Guillaume Urvoy-Keller,et al.
Size-based scheduling to improve the performance of short TCP flows
,
2005,
IEEE Network.
[2]
Larry Peterson,et al.
TCP Vegas: new techniques for congestion detection and avoidance
,
1994,
SIGCOMM 1994.
[3]
Van Jacobson,et al.
Controlling Queue Delay
,
2012,
ACM Queue.
[4]
John B. Nagle,et al.
On Packet Switches with Infinite Storage
,
1987,
IEEE Trans. Commun..
[5]
Andrzej Duda,et al.
Two-way TCP connections: old problem, new insight
,
2011,
CCRV.
[6]
Van Jacobson,et al.
BufferBloat: What’s Wrong with the Internet?
,
2011,
ACM Queue.
[7]
Mark Allman,et al.
Comments on bufferbloat
,
2013,
CCRV.
[8]
Deep Medhi,et al.
Proceedings of the 2011 23rd International Teletraffic Congress
,
2011
.
[9]
Injong Rhee,et al.
Tackling bufferbloat in 3G/4G networks
,
2012,
Internet Measurement Conference.