Paper Info
Title
An I-D Two-State Dynamic Receive Window Adjustment Scheme for Solving Bufferbloat Problems
Abstract
Bufferbloat is a phenomenon caused by excessive buffering of packets that results in high latency, large jitter, as well as throughput degradation. It happens when a loss-based Transmission Control Protocol (TCP), such as New Reno or Cubic, is used for data transfer. A dynamic receive window adjustment (DRWA) scheme has recently been proposed to solve the bufferbloat problem. It was reported that, with the DRWA scheme, the bufferbloat problem can be effectively solved. However, we found that when there are multiple TCP connections sharing some bottleneck link, the ones with DRWA tend to lose their bandwidth share to those without DRWA. Moreover, when a user equipment establishes multiple TCP connections all implemented with DRWA and all connections pass through the same bottleneck link, the connection which is established last will dominate the bandwidth. In this paper, we present a simple scheme, called I-D (increasing-decreasing) two-state dynamic receive window adjustment, which according to simulation results can effectively solve the bufferbloat problem without the unfair bandwidth-dominating issues.
Year
DOI
Venue
2018
10.1109/PIMRC.2018.8581052
2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)
Keywords
Field
DocType
Bufferbloat,TCP,DRWA,bandwidth share
Bottleneck,Bufferbloat,Data transmission,Computer science,Latency (engineering),Network packet,Computer network,Transmission Control Protocol,Bandwidth (signal processing),Jitter
Conference
ISSN
ISBN
Citations 
2166-9570
978-1-5386-6010-2
0
PageRank 
References 
Authors
0.34
4
3
Name
Order
Citations
PageRank
Tsern-Huei Lee124430.63
Cheng-Jie Tsai241.82
Yung-Chun Yang300.34