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
企業の生成AIガバナンスにおけるエージェントとセキュリティ
lycorptech_jp
PRO
2
170
【NoMapsTECH 2025】AI Edge Computing Workshop
akit37
0
180
CDK CLIで使ってたあの機能、CDK Toolkit Libraryではどうやるの?
smt7174
4
180
ブロックテーマ時代における、テーマの CSS について考える Toro_Unit / 2025.09.13 @ Shinshu WordPress Meetup
torounit
0
130
なぜテストマネージャの視点が 必要なのか? 〜 一歩先へ進むために 〜
moritamasami
0
220
20250910_障害注入から効率的復旧へ_カオスエンジニアリング_生成AIで考えるAWS障害対応.pdf
sh_fk2
3
260
5年目から始める Vue3 サイト改善 #frontendo
tacck
PRO
3
220
実践!カスタムインストラクション&スラッシュコマンド
puku0x
0
410
Platform開発が先行する Platform Engineeringの違和感
kintotechdev
4
570
フルカイテン株式会社 エンジニア向け採用資料
fullkaiten
0
8.7k
新アイテムをどう使っていくか?みんなであーだこーだ言ってみよう / 20250911-rpi-jam-tokyo
akkiesoft
0
280
Automating Web Accessibility Testing with AI Agents
maminami373
0
1.3k
Featured
See All Featured
Responsive Adventures: Dirty Tricks From The Dark Corners of Front-End
smashingmag
252
21k
Building an army of robots
kneath
306
46k
Dealing with People You Can't Stand - Big Design 2015
cassininazir
367
27k
Being A Developer After 40
akosma
90
590k
Fireside Chat
paigeccino
39
3.6k
CSS Pre-Processors: Stylus, Less & Sass
bermonpainter
358
30k
Fashionably flexible responsive web design (full day workshop)
malarkey
407
66k
Imperfection Machines: The Place of Print at Facebook
scottboms
268
13k
Practical Orchestrator
shlominoach
190
11k
Performance Is Good for Brains [We Love Speed 2024]
tammyeverts
12
1.1k
ReactJS: Keep Simple. Everything can be a component!
pedronauck
667
120k
Building Adaptive Systems
keathley
43
2.7k
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