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
680
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
Recap of Next - Google Cloud で実践する クラウドネイティブ最前線 / The Frontlines of Cloud-Native with Insights from Google Cloud
aoto
PRO
1
100
LiteXとオレオレCPUで作る自作SoC奮闘記
msyksphinz
0
630
読んで学ぶ Amplify Gen2 / Amplify と CDK の関係を紐解く #jawsug_tokyo
tacck
PRO
1
120
コスト最適重視でAurora PostgreSQLのログ分析基盤を作ってみた #jawsug_tokyo
non97
0
110
品質文化を支える小さいクロスファンクショナルなチーム / Cross-functional teams fostering quality culture
toma_sm
0
110
はてなの開発20年史と DevOpsの歩み / DevOpsDays Tokyo 2025 Keynote
daiksy
6
1.5k
彩の国で始めよう。おっさんエンジニアから共有したい、当たり前のことを当たり前にする技術
otsuki
0
150
Стильный код: натуральный поиск редких атрибутов по картинке. Юлия Антохина, Data Scientist, Lamoda Tech
lamodatech
0
720
Amazon CloudWatch を使って NW 監視を行うには
o11yfes2023
0
160
Linuxのパッケージ管理とアップデート基礎知識
go_nishimoto
0
240
AI Agentを「期待通り」に動かすために:設計アプローチの模索と現在地
kworkdev
PRO
2
450
クォータ監視、AWS Organizations環境でも楽勝です✌️
iwamot
PRO
1
310
Featured
See All Featured
Fireside Chat
paigeccino
37
3.4k
Imperfection Machines: The Place of Print at Facebook
scottboms
267
13k
The Invisible Side of Design
smashingmag
299
50k
What's in a price? How to price your products and services
michaelherold
245
12k
XXLCSS - How to scale CSS and keep your sanity
sugarenia
248
1.3M
Code Review Best Practice
trishagee
67
18k
JavaScript: Past, Present, and Future - NDC Porto 2020
reverentgeek
47
5.3k
Producing Creativity
orderedlist
PRO
344
40k
Making the Leap to Tech Lead
cromwellryan
133
9.2k
Gamification - CAS2011
davidbonilla
81
5.2k
Building Applications with DynamoDB
mza
94
6.3k
Visualization
eitanlees
146
16k
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