Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
TCP-FIT: An Improved TCP Congestion Control
Search
Kevin Tong
May 13, 2013
Technology
0
500
TCP-FIT: An Improved TCP Congestion Control
Kevin Tong
May 13, 2013
Tweet
Share
More Decks by Kevin Tong
See All by Kevin Tong
Improving Fairness, Efficiency, and Stability in HTTP-based Adaptive Video Streaming with FESTIVE
logicmd
1
4.6k
Transport Methods in 3DTV—A Survey
logicmd
0
130
The Performance of MapReduce: An In-depth Study
logicmd
0
690
Simple Regenerating Codes:Network Coding for Cloud Storage
logicmd
0
520
ANALYSIS OF ADAPTIVE STREAMING FOR HYBRID CDN/P2P LIVE VIDEO SYSTEMS
logicmd
1
540
Other Decks in Technology
See All in Technology
2025年夏 コーディングエージェントを統べる者
nwiizo
0
170
「どこから読む?」コードとカルチャーに最速で馴染むための実践ガイド
zozotech
PRO
0
510
250905 大吉祥寺.pm 2025 前夜祭 「プログラミングに出会って20年、『今』が1番楽しい」
msykd
PRO
1
980
2つのフロントエンドと状態管理
mixi_engineers
PRO
3
110
DevIO2025_継続的なサービス開発のための技術的意思決定のポイント / how-to-tech-decision-makaing-devio2025
nologyance
1
410
slog.Handlerのよくある実装ミス
sakiengineer
4
290
LLMを搭載したプロダクトの品質保証の模索と学び
qa
0
1.1k
2025年になってもまだMySQLが好き
yoku0825
8
4.8k
Autonomous Database - Dedicated 技術詳細 / adb-d_technical_detail_jp
oracle4engineer
PRO
4
10k
JTCにおける内製×スクラム開発への挑戦〜内製化率95%達成の舞台裏/JTC's challenge of in-house development with Scrum
aeonpeople
0
240
AWSで始める実践Dagster入門
kitagawaz
1
650
Firestore → Spanner 移行 を成功させた段階的移行プロセス
athug
1
490
Featured
See All Featured
Responsive Adventures: Dirty Tricks From The Dark Corners of Front-End
smashingmag
252
21k
Building Flexible Design Systems
yeseniaperezcruz
329
39k
GraphQLとの向き合い方2022年版
quramy
49
14k
Unsuck your backbone
ammeep
671
58k
The Language of Interfaces
destraynor
161
25k
We Have a Design System, Now What?
morganepeng
53
7.8k
Thoughts on Productivity
jonyablonski
70
4.8k
The Power of CSS Pseudo Elements
geoffreycrofte
77
6k
The Cost Of JavaScript in 2023
addyosmani
53
8.9k
RailsConf 2023
tenderlove
30
1.2k
Visualizing Your Data: Incorporating Mongo into Loggly Infrastructure
mongodb
48
9.7k
Exploring the Power of Turbo Streams & Action Cable | RailsConf2023
kevinliebholz
34
6k
Transcript
Jingyuan Wang, Jiangtao Wen, Jun Zhang and Yuxing Han Tsinghua
National Laboratory for Information Science and Technology
Introduction Background and Motivation The TCP-FIT Algorithm
Experimental Results Conclusion
TCP ◦ The Transmission Control Protocol TCP Reno/
TCP New Reno ◦ Pros Reliable Sequential ◦ Cons Wireless network high Bandwidth Delay Product (BDP)
Recent development ◦ Wireless TCP Westwood TCP
Veno ◦ BDP TCP Compound TCP CUBIC FAST TCP TCP-FIT ◦ Inspired by parallel TCP
Introduction Background and Motivation The TCP-FIT Algorithm
Experimental Results Conclusion
What is a Congestion Algorithm? Classification ◦ Loss-based
◦ Delay-based ◦ Hybrid
Loss-Based ◦ TCP Reno, TCP CUBIC ◦ TCP BIC
, High Speed TCP Definition Assumption ◦ Constraints In wireless scenarios In BDP scenarios
Delay-Based ◦ TCP Vegas and FAST TCP Definition
Assumption ◦ Queuing delay = RTT – Propagation delay. ◦ Pros Resilient -> good ◦ Cons bandwidth starvation
Hybrid TCP ◦ Veno, TCP Westwood, TCP Illinois, H-TCP
and Fusion TCP ◦ Compound TCP Cons ◦ Poor in BDP-wireless-hybrid scenarios
TCP-FIT ◦ Parallel TCP ◦ E.g. GridFTP and E-MulTCP
◦ Pros: Utilization Good in wireless and BDP ◦ Cons: Compatibility Fairness
Introduction Background and Motivation The TCP-FIT Algorithm
Experimental Results Conclusion
Notation of parameter ◦ : Size of congestion window
� ◦ : RTT time ◦ : PLR, Packet Loss Rate ◦ : Throughput of the network ◦ : Propagation delay ◦ : Queuing delay
Object ◦ achieve N times throughput of the TCP
Reno ◦ meanwhile maintain fairness TCP Reno ◦ AIMD : ← + 1 : ← − 1 2
MulTCP ◦ : ← + ◦ : ← −
1 2 Proposed Method ◦ : ← + ◦ : ← − 2 3+1
Assumption: one loss adjustment is enough ◦ Based on
AIMD ◦ = − 2 3+1 ◦ + = 2� ◦ We get ◦ = 3+1 3 �
In a certain length of time( we set it
as k*RTT time ) ◦ ∆ = 1 − � + � 𝑘𝑘 � � 2 3+1 Then ◦ ̇ = ∆ ̇ = 𝑇𝑇 − 𝑋𝑋 � 2 3+1 � 3+1 3 � Let ̇ = 0 then we get = 32 2 � 2 ( = � 𝑇𝑇 ) ◦ = 1 𝑇𝑇 3 2 1
The is adjusted adaptively. Update of is ◦ 𝑖𝑖+1
= 1, 𝑖𝑖 + − −𝑡𝑡 𝑖𝑖 The equilibrium of is ◦ = � −𝑡𝑡 = 𝑇𝑇 ◦ (denote α as α = (𝑡𝑡 − 𝑡𝑡 )/𝑡𝑡 ) ◦ (Easy to know = = + = 𝑡𝑡 + ) ◦ = 2 3 1
Network Utilization ◦ = 1 𝑇𝑇 3 2 1
vs = 1 𝑇𝑇 3 2 1 Fairness ◦ RTT-fairness η = 𝑖𝑖 = 1 vs η = 𝑖𝑖 = + 𝑖𝑖+ ( = = + ) ◦ Inter-fairness = 𝑇𝑇∗−𝑇𝑇′ 𝑇𝑇∗
Introduction Background and Motivation The TCP-FIT Algorithm
Experimental Results Conclusion
BDP Scenarios
Wireless Scenarios
Inter-fairness
RTT-fairness
Cons: ◦ a low speed ADSL network with large
bandwidth variations ◦ Due to simplistic model of bandwidth estimation compared with FAST.
Thank you