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
Nx × AI によるモノレポ活用 〜コードジェネレーター編〜
puku0x
0
580
全員が手を動かす組織へ - 生成AIが変えるTVerの開発現場 / everyone-codes-genai-transforms-tver-development
tohae
0
190
リモートワークで心掛けていること 〜AI活用編〜
naoki85
0
150
Google Agentspaceを実際に導入した効果と今後の展望
mixi_engineers
PRO
3
710
生成AI導入の効果を最大化する データ活用戦略
ham0215
0
160
Claude Codeは仕様駆動の夢を見ない
gotalab555
23
6.6k
Findy Freelance 利用シーン別AI活用例
ness
0
500
開発 × 生成AI × コミュニケーション:GENDAの開発現場で感じたコミュニケーションの変化 / GENDA Tech Talk #1
genda
0
230
風が吹けばWHOISが使えなくなる~なぜWHOIS・RDAPはサーバー証明書のメール認証に使えなくなったのか~
orangemorishita
15
5.8k
人に寄り添うAIエージェントとアーキテクチャ #BetAIDay
layerx
PRO
9
2.3k
마라톤 끝의 단거리 스퍼트: 2025년의 AI
inureyes
PRO
1
750
Cloud WANの基礎から応用~少しだけDeep Dive~
masakiokuda
3
110
Featured
See All Featured
No one is an island. Learnings from fostering a developers community.
thoeni
21
3.4k
XXLCSS - How to scale CSS and keep your sanity
sugarenia
248
1.3M
Templates, Plugins, & Blocks: Oh My! Creating the theme that thinks of everything
marktimemedia
31
2.5k
Stop Working from a Prison Cell
hatefulcrawdad
271
21k
Performance Is Good for Brains [We Love Speed 2024]
tammyeverts
10
1k
Sharpening the Axe: The Primacy of Toolmaking
bcantrill
44
2.4k
Designing for humans not robots
tammielis
253
25k
Art, The Web, and Tiny UX
lynnandtonic
301
21k
ReactJS: Keep Simple. Everything can be a component!
pedronauck
667
120k
Refactoring Trust on Your Teams (GOTO; Chicago 2020)
rmw
34
3.1k
Done Done
chrislema
185
16k
How To Stay Up To Date on Web Technology
chriscoyier
790
250k
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