Analysis of DCTCP

AlizadehMohammad,; JavanmardAdel,; PrabhakarBalaji,

doi:10.1145/2007116.2007125

Cited by 15 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This was demonstrated in [20] by adopting DCTCP as the congestion controller. DCTCP can theoretically maintain around 94% throughput with zero queuing [21]. As shown in [20], virtual (phantom) queues with RED support can be provided by already-deployed routers such as [22].…”

Section: Motivationsmentioning

confidence: 99%

“…We also present another dual algorithm, called Dual2, which can also solve (21). Assuming the utility function is concave, the following dual algorithm solves (21)…”

Section: Proof See Appendix D-bmentioning

confidence: 99%

“…This means that as long as the choice of ω l (p l ) does not violate the conditions that we assumed about the step size function, i.e. positive, increasing and continuous, then (26) also solves (21) or equivalently (22).…”

Section: Proof See Appendix D-bmentioning

confidence: 99%

See 2 more Smart Citations

Estimating an Additive Path Cost With Explicit Congestion Notification

Teymoori

Hayes

Welzl

et al. 2021

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

Network Utility Maximization (NUM) is a well accepted theoretical concept that describes how congestion controls could cooperate to achieve an ideal sending rate allocation, for given utility functions of senders and constraints of the network. These network constraints are expressed as a "cost" in the framework. In practice, most congestion control mechanisms obtain feedback that is different from a "cost". This paper focuses on Explicit Congestion Notification (ECN), which has been shown to be quite advantageous when it is available, e.g. with the popular Datacenter TCP (DCTCP) mechanism. However, different from a cost, ECN marks are not additive. We present a practical solution to this problem. Our solution changes how end hosts interpret the ECN signal, while the router side can be implemented via an unusual configuration of RED parameters.

show abstract

Section: Motivationsmentioning

confidence: 99%

“…We also present another dual algorithm, called Dual2, which can also solve (21). Assuming the utility function is concave, the following dual algorithm solves (21)…”

Section: Proof See Appendix D-bmentioning

confidence: 99%

See 1 more Smart Citation

Estimating an Additive Path Cost With Explicit Congestion Notification

Teymoori

Hayes

Welzl

et al. 2021

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

show abstract

Modeling and Analysis of the Latency-Based Congestion Control Algorithm DX

Jiang¹,

Peng²,

Ruan³

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Nowadays, low latency has become one of the primary goals of congestion control in data center networks. To achieve low latency, many congestion control algorithms have been proposed, wherein DX is the first latency-based one. Specifically, DX tackles the accurate latency measurement problem, reduces the flow completion time and outperforms the de facto DCTCP algorithm significantly in term of median queueing delay. Although the advantages of DX have been confirmed by experimental results, the behaviors of DX have not been fully revealed. Accordingly, some drawbacks of DX under special environment are unexplored. Therefore, in this paper, we conduct fluid-flow analysis over DX, deducing sufficient condition for the stability of DX and revealing the behaviors of DX. Analytical results uncover two problems of DX: 1) it has poor throughput when either the base RTT is very large or the number of flows is relatively small; 2) it suffers from large queueing delay when either the base RTT is relatively small or the number of flows is very large. These results are instructive to the improvement and deployment of DX. Simulation results based on NS-3 verify our analytical results.

show abstract