Please wait a minute...
Frontiers of Computer Science

ISSN 2095-2228

ISSN 2095-2236(Online)

CN 10-1014/TP

Postal Subscription Code 80-970

2018 Impact Factor: 1.129

Front. Comput. Sci.    2014, Vol. 8 Issue (3) : 426-439    https://doi.org/10.1007/s11704-014-3443-9
RESEARCH ARTICLE
Achieving high throughput and TCP Reno fairness in delay-based TCP over large networks
Jingyuan WANG1,*(),Jiangtao WEN2,Yuxing HAN4,Jun ZHANG2,Chao LI1,3,Zhang XIONG1
1. School of Computer Science and Engineering, Beihang University, Beijing 100191, China
2. Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China
3. Research Institute of Beihang University in Shengzhen, Shenzhen 518057, China
4. Flora Production Inc., Santa Clara CA 95054, USA
 Download: PDF(853 KB)  
 Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks
Abstract

The transport control protocol (TCP) has been widely used in wired and wireless Internet applications such as FTP, email and HTTP. Numerous congestion avoidance algorithms have been proposed to improve the performance of TCP in various scenarios, especially for high speed and wireless networks. Although different algorithms may achieve different performance improvements under different network conditions, designing a congestion algorithm that can perform well across a wide spectrum of network conditions remains a great challenge. Delay-based TCP has a potential to overcome above challenges. However, the unfairness problem of delay-based TCP with TCP Reno blocks widely the eployment of delay-based TCP over wide area networks. In this paper, we proposed a novel delay-based congestion control algorithm, named FAST-FIT, which could perform gracefully in both ultra high speed networks and wide area networks, as well as keep graceful fairness with widely deployed TCP Reno hosts. FAST-FIT uses queuing delay as a primary input for controlling TCP congestion window. Packet loss is used as a secondary signal to adaptively adjust parameters of primary control process. Theoretical analysis and experimental results show that the performance of the algorithm is significantly improved as compared to other state-of-the-art algorithms, while maintaining good fairness.

Keywords TCP congestion control      congestion avoidance      fairness     
Corresponding Author(s): Jingyuan WANG   
Issue Date: 24 June 2014
 Cite this article:   
Jingyuan WANG,Jiangtao WEN,Yuxing HAN, et al. Achieving high throughput and TCP Reno fairness in delay-based TCP over large networks[J]. Front. Comput. Sci., 2014, 8(3): 426-439.
 URL:  
https://academic.hep.com.cn/fcs/EN/10.1007/s11704-014-3443-9
https://academic.hep.com.cn/fcs/EN/Y2014/V8/I3/426
1 WangJ Y, GaoF, WenJ T, LiC, XiongZ, HanY X. Achieving TCP reno friendliness in fast TCP over wide area networks. In: Proceedings of the 2014 International Conference on Computing, Networking and Communications. 2014, 100-109
doi: 10.1109/ICCNC.2014.6785376
2 AllmanM, PaxsonV, StevensW. TCP congestion control. RFC 2581, 1999
3 WeiD X, JinC, LowS H, HegdeS. FAST TCP: motivation, architecture, algorithms, performance. IEEE/ACM Transactions on Networking, 2006, 14(6): 1246-1259
doi: 10.1109/TNET.2006.886335
4 MascoloS, CasettiC, GerlaM, SanadidiM Y, WangR. TCP westwood: Bandwidth estimation for enhanced transport over wireless links. In: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking. 2001, 287-297
5 MascoloS, GriecoL A, FerorelliR, CamardaP, PiscitelliG. Performance evaluation of westwood+ TCP congestion control. Performance Evaluation, 2004, 55(1-2): 93-111
doi: 10.1016/S0166-5316(03)00098-1
6 FuC P, LiewS C. TCP veno: TCP enhancement for transmission over wireless access networks. IEEE Journal on Selected Areas in Communications, 2003, 21(2): 216-228
doi: 10.1109/JSAC.2002.807336
7 FloydS. Highspeed TCP for large congestion windows. RFC 3649, 2003
8 KellyT. Scalable TCP: improving performance in highspeed wide area networks. SIGCOMM Computer Communication Review, 2003, 33(2): 83-91
doi: 10.1145/956981.956989
9 TanK, SongJ, ZhangQ, SridharanM. A compound TCP approach for high-speed and long distance networks. In: Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies. APRIL 2006
10 HaS, RheeI, XuL. Cubic: a new TCP-friendly high-speed TCP variant. ACM SIGOPS Operating Systems Review, 2008, 42(5): 64-74
doi: 10.1145/1400097.1400105
11 WangJ Y, JiangY X, OuyangY, LiC, XiongZ, CaiJ X. TCP congestion control for wireless datacenters. IEICE Electronics Express, 2013, 10(12): 1-11
doi: 10.1587/elex.10.20130349
12 FangW, LiangX, LiS, ChiaraviglioL, XiongN. Vmplanner: Optimizing virtual machine placement and traffic flow routing to reduce network power costs in cloud data centers. Computer Networks, 2013, 57(1): 179-196
doi: 10.1016/j.comnet.2012.09.008
13 BrakmoL S, O’MalleySW, PetersonL L. TCP Vegas: new techniques for congestion detection and avoidance. SIGCOMM Computer Communication Review, 1994, 24(4): 24-35
doi: 10.1145/190809.190317
14 LowS H, PetersonL L, WangL. Understanding TCP vegas: a duality model. Journal of the ACM, 2002, 49(2): 207-235
doi: 10.1145/506147.506152
15 TangA, WangJ, HegdeS, LowS. Equilibrium and fairness of networks shared by TCP Reno and Vegas/FAST. Telecommunication Systems, 2005, 30(4): 417-439
doi: 10.1007/s11235-005-5499-1
16 BudziszŁ, StanojevićR, SchloteA, BakerF, ShortenR. On the fair coexistence of loss-and delay-based TCP. IEEE/ACM Transactions on Networking (TON), 2011, 19(6): 1811-1824
17 WangJ, WenJ, ZhangJ, HanY. TCP-FIT — a novel TCP congestion control algorithm for wireless networks. In: Proceedings of the 2010 IEEE Globecom Workshop on Advances in Communications and Networks. 2010, 2133-2137
doi: 10.1109/GLOCOMW.2010.5700308
18 WangJ, WenJ, ZhangJ, HanY. TCP-FIT: an improved TCP congestion control algorithm and its performance. In: Proceedings of the 30th IEEE International Conference on Computer Communications, 2010, 2065-2069
19 WangJ, WenJ, HanY, ZhangJ, LiC, XiongZ. CUBIC-FIT: A high performance and TCP CUBIC friendly congestion control algorithm. IEEE Communications Letters, 2013, 17(8): 1664-1667
doi: 10.1109/LCOMM.2013.060513.130664
20 TangA, WangJ, LowS H, ChiangM. Equilibrium of heterogeneous congestion control: existence and uniqueness. IEEE/ACM Transactions on Networking, 2007, 15: 824-837
doi: 10.1109/TNET.2007.893885
21 LowS. A duality model of TCP and queue management algorithms. IEEE/ACM Transactions on Networking, 2003, 11(4): 525-536
doi: 10.1109/TNET.2003.815297
22 KellyF, MaullooA, TanD. Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 1998, 49(3): 237-252
doi: 10.1057/palgrave.jors.2600523
23 PadhyeJ, FiroiuV, TowsleyD, KuroseJ. Modeling TCP throughput: A simple model and its empirical validation. In: Proceedings of the 1998 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 1998, 303-314
24 HaS, RheeI, XuL. CUBIC: a new TCP-friendly high-speed TCP variant. ACM SIGOPS Operating Systems Review, 2008, 42(5): 64-74
doi: 10.1145/1400097.1400105
25 ZhouB, FuC P, ChiuD M, LauC T, NgohL H. A simple throughput model for TCP veno. In: Proceedings of the 2006 IEEE International Conference on Communications. 2006, 5395-5400
doi: 10.1109/ICC.2006.255519
26 GriecoL, MascoloS. Mathematical analysis of Westwood+ TCP congestion control. IEEE Proceedings: Control Theory and Applications, 2005, 152(1): 35-42
27 SamiosC, VernonM. Modeling the throughput of TCP Vegas. In: Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems. 2003, 31(1): 71-81
doi: 10.1145/781027.781037
28 XuL, HarfoushK, RheeI. Binary increase congestion control (BIC) for fast long-distance networks. In: Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies. 2004, 2514-2524
[1] Kazuhiro OGATA. A divide & conquer approach to liveness model checking under fairness & anti-fairness assumptions[J]. Front. Comput. Sci., 2019, 13(1): 51-72.
[2] Yuyue DU,Yuhui NING. Property analysis of logic Petri nets by marking reachability graphs[J]. Front. Comput. Sci., 2014, 8(4): 684-692.
[3] Yuanjie SI, Jun SUN, Yang LIU, Jin Song DONG, Jun PANG, Shao Jie ZHANG, Xiaohu YANG. Model checking with fairness assumptions using PAT[J]. Front. Comput. Sci., 2014, 8(1): 1-16.
[4] Zhiyuan LIU, Jun PANG, Chenyi ZHANG. Design and formal verification of a CEM protocol with transparent TTP[J]. Front Comput Sci, 2013, 7(2): 279-297.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed