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
510
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
140
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
名刺メーカーDevグループ 紹介資料
sansan33
PRO
0
930
Performance Insights 廃止から Database Insights 利用へ/transition-from-performance-insights-to-database-insights
emiki
0
300
Node.js 2025: What's new and what's next
ruyadorno
0
400
Git in Team
kawaguti
PRO
3
380
Contract One Engineering Unit 紹介資料
sansan33
PRO
0
8.8k
incident_commander_demaecan__1_.pdf
demaecan
0
160
プロダクトのコードから見るGoによるデザインパターンの実践 #go_night_talk
bengo4com
1
2.6k
RDS の負荷が高い場合に AWS で取りうる具体策 N 連発/a-series-of-specific-countermeasures-available-on-aws-when-rds-is-under-high-load
emiki
5
3.7k
難しいセキュリティ用語をわかりやすくしてみた
yuta3110
0
250
ビズリーチ求職者検索におけるPLMとLLMの活用 / Search Engineering MEET UP_2-1
visional_engineering_and_design
1
140
サイバーエージェント流クラウドコスト削減施策「みんなで金塊堀太郎」
kurochan
4
2k
ニッポンの人に知ってもらいたいGISスポット
sakaik
0
160
Featured
See All Featured
KATA
mclloyd
PRO
32
15k
Optimising Largest Contentful Paint
csswizardry
37
3.5k
JavaScript: Past, Present, and Future - NDC Porto 2020
reverentgeek
52
5.6k
Practical Orchestrator
shlominoach
190
11k
Bootstrapping a Software Product
garrettdimon
PRO
307
110k
Scaling GitHub
holman
463
140k
Helping Users Find Their Own Way: Creating Modern Search Experiences
danielanewman
30
2.9k
Intergalactic Javascript Robots from Outer Space
tanoku
273
27k
The Psychology of Web Performance [Beyond Tellerrand 2023]
tammyeverts
49
3.1k
RailsConf & Balkan Ruby 2019: The Past, Present, and Future of Rails at GitHub
eileencodes
140
34k
Exploring the Power of Turbo Streams & Action Cable | RailsConf2023
kevinliebholz
35
6.1k
[RailsConf 2023 Opening Keynote] The Magic of Rails
eileencodes
31
9.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