Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis...
-
Upload
barnard-mcgee -
Category
Documents
-
view
226 -
download
2
Transcript of Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis...
![Page 1: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/1.jpg)
Mohammad Alizadeh
Adel Javanmard and Balaji Prabhakar
Stanford University
Analysis of DCTCP:Stability, Convergence, and Fairness
![Page 2: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/2.jpg)
2
Data Center Packet Transport
• Transport inside the DC– TCP rules (99.9% of traffic in some DCs)
• But, TCP:– Needs large buffers for high throughput– Induces large queuing delays– Does not handle bursty traffic well (Incast)
• DCTCP was proposed to address these shortcomings (SIGCOMM’10).
![Page 3: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/3.jpg)
3
TCP Buffer Requirement
• Bandwidth-delay product rule of thumb:– A single flow needs C×RTT buffers for 100% Throughput.
B
Buffe
r Siz
e B = C×RTT
B
B < C×RTT
Buffe
r Siz
e
Throughput loss!
BBu
ffer S
ize
B > C×RTT
More latency!
To lower the buffering requirements, we must reduce sending rate variations.
![Page 4: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/4.jpg)
4
DCTCP: Main Ideas
1. React in proportion to the extent of congestion. Reduce window size based on fraction of marked packets.
2. Mark based on instantaneous queue length. Fast feedback to better deal with bursts. Simplifies hardware.
ECN Marks TCP DCTCP
1 0 1 1 1 1 0 1 1 1 Cut window by 50% Cut window by 40%
0 0 0 0 0 0 0 0 0 1 Cut window by 50% Cut window by 5%
![Page 5: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/5.jpg)
5
DCTCP: Algorithm
Switch side:– Mark packets when Queue Length > K.
Sender side:– Maintain running average of fraction of packets marked (α).
Adaptive window decreases:
– Note: decrease factor between 1 and 2.
B KMark Don’t Mark
each RTT : F # of marked ACKs
Total # of ACKs (1 g) gF
W (12
)W
![Page 6: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/6.jpg)
6
DCTCP vs TCP
Setup: Win 7, Broadcom 1Gbps SwitchScenario: 2 long-lived flows, K = 30KB
(Kby
tes)
![Page 7: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/7.jpg)
Analysis of DCTCP
![Page 8: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/8.jpg)
8
Steady State Analysis
• What is the effect of the various network and algorithm parameters on system throughput and latency?– Network: Capacity, Round-trip Time, Number of flows– Algorithm: Marking threshold (K), Averaging parameter (g)
• The standard approach is to study control loop behavior via fluid models.– Kelly et al., Low et al., Misra et al., Srikant et al, …
![Page 9: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/9.jpg)
9
DCTCP Fluid Model
×
N/RTT(t)
W(t)
p(t)Delay
p(t – R*)
C
+− 1
0 K
q(t)
Switch
LPF
AIMD
α(t)
Source
![Page 10: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/10.jpg)
10
Fluid Model vs ns2 simulations
• Parameters: N = {2, 10, 100}, C = 10Gbps, d = 100μs, K = 65 pkts, g = 1/16.
N = 2 N = 10 N = 100
![Page 11: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/11.jpg)
11
• We make the following change of variables:
• The normalized system:
• The normalized system depends on only two parameters:
Normalization of Fluid Model
![Page 12: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/12.jpg)
12
Equilibrium Characterization Case 1:
• Very large N: system (globally) converges to a unique fixed point:
)2 ,1 ,2() , ,()1 ,1 ,2()~ ,~ ,~
( 2 CdNqWqW w
Example:
w 1,
g 1/16.
![Page 13: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/13.jpg)
• Very large N: system (globally) converges to a unique fixed point:
)2 ,1 ,2() , ,()1 ,1 ,2()~ ,~ ,~
( 2 CdNqWqW w
12
Example:
w 1,
g 1/16.
Equilibrium Characterization Case 1:
![Page 14: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/14.jpg)
• System has a periodic limit cycle solution.
Example:
w 10,
g 1/16.
13
Equilibrium Characterization Case 2:
![Page 15: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/15.jpg)
• System has a periodic limit cycle solution.
Example:
w 10,
g 1/16.
13
Equilibrium Characterization Case 2:
![Page 16: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/16.jpg)
Stability of Limit Cycles
• Let X* = set of points on the limit cycle.
• A limit cycle is locally asymptotically stable if δ > 0 exists s.t.:
14
![Page 17: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/17.jpg)
Poincaré Map
15
S
S
S
x*
x*
x1
x2
x2 = P(x1)
Stability of Poincaré Map ↔ Stability of limit cycle
x*α = P(x*
α)
![Page 18: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/18.jpg)
Stability Criterion
• Theorem: The limit cycle of the DCTCP system:
is locally asymptotically stable if and only if ρ(Z1Z2) < 1.
- JF is the Jacobian matrix with respect to x.
- T = (1 + hα)+(1 + hβ) is the period of the limit cycle.
• Proof: Show that P(x*α
+ δ) = x*α + Z1Z2δ + O(|δ|2).
16
We have numerically checked this condition for:
![Page 19: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/19.jpg)
Parameter Guidelines• How big does the marking
threshold K need to be to avoid queue underflow?
B K
17
![Page 20: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/20.jpg)
Throughput-Latency Tradeoff
Throughput > 94% as K 0
18• Parameters: C = 10Gbps, d = 480μs, g = 0.05.
For TCP:Throughput → 75%
![Page 21: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/21.jpg)
Convergence Analysis
• How long does it take for DCTCP sources to converge to their “fair share” rate (C/N)?– DCTCP is slower to converge than TCP since it cuts its window
by smaller factors.
• The fluid model is not suitable for transient analyses.
• We use a hybrid (continuous- and discrete-time) model.– The model is inspired by the AIMD models of Baccelli et al.
and Shorten et al.
19
![Page 22: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/22.jpg)
The Hybrid Model
20
Time
Win
dow
Size
s
Time
p(t)
(Mar
king
Pro
b.)
1 RTT
![Page 23: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/23.jpg)
Rate of Convergence (Theorem)
Assume N DCTCP flows with arbitrary Wi(0) and αi(0), evolving according to the Hybrid Model, with:
Define function , and let 0 < α*≤ 1 be the unique positive solution to
Then: Also:
where:
21
![Page 24: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/24.jpg)
Consequences
• DCTCP converges at most 40% slower than TCP:
• The parameter g should not be too small:
22
![Page 25: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/25.jpg)
(g = 0.07) (g = 0.025) (g = 0.005)
Convergence: ns2 Simulations
23
![Page 26: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/26.jpg)
Conclusion
• Our analysis shows DCTCP:– requires 17% of C×RTT for full throughput – achieves 94% throughput as K → 0. – converges at most 1.4 times slower than TCP.
• We provide guidelines for setting the DCTCP parameters.
• The analysis suggests a simple modification that improves the RTT-fairness of DCTCP.– Achieves linear-RTT fairness (Thrput RTT-1), like TCP-RED
24
![Page 27: Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,](https://reader030.fdocuments.in/reader030/viewer/2022032723/56649d015503460f949d32a8/html5/thumbnails/27.jpg)
25