AFCD: An Approximated-Fair and Controlled-Delay Queuing for High Speed Networks

Xue, Lin; Kumar, Suman; Kondikoppa, Praveenkumar; Chiu, Chui-Hui; Park, Seung-Jong

doi:10.1109/icccn.2013.6614103

Cited by 6 publications

(6 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also as shown in Figure 1(b), drop the flow which has the largest congestion window will balance fairness among multiple flows [26]. This requires communication among flows that smaller flows should not cut rate at the time when the largest flow cuts off.…”

Section: Motivation: Problems Of High Speed Access Network Withmentioning

confidence: 95%

DMCTCP: Desynchronized Multi-Channel TCP for high speed access networks with tiny buffers

Xue

Chiu

Kondikoppa

et al. 2014

2014 23rd International Conference on Computer Communication and Networks (ICCCN)

Self Cite

View full text Add to dashboard Cite

The past few years have witnessed debate on how to improve link utilization of high-speed tiny-size buffer routers. Widely argued proposals for TCP traffic to realize acceptable link capacities mandate: (i) over-provisioned core link bandwidth; and (ii) non-bursty flows; and (iii) tens of thousands of asynchronous flows. However, in high speed access networks where flows are bursty, sparse and synchronous, TCP traffic suffer severely from routers with tiny buffers.We propose a new congestion control algorithm called Desynchronized Multi-Channel TCP (DMCTCP) that creates a flow with multiple channels. It avoids TCP loss synchronization by desynchronizing channels, and it avoids sending rate penalties from burst losses. Over a 10 Gb/s large delay network ruled by routers with only a few dozen packets of buffers, our results show that bottleneck link utilization can reach 80% with only 100 flows. Our study is a new step towards the deployment of optical packet switching networks.

show abstract

Section: Motivation: Problems Of High Speed Access Network Withmentioning

confidence: 95%

DMCTCP: Desynchronized Multi-Channel TCP for high speed access networks with tiny buffers

Xue

Chiu

Kondikoppa

et al. 2014

2014 23rd International Conference on Computer Communication and Networks (ICCCN)

Self Cite

View full text Add to dashboard Cite

show abstract

“…1b, dropping the flow that has the largest congestion window will balance fairness among multiple flows [32]. This requires communication among flows so that smaller flows should not cut rate at the time when the largest flow cuts off.…”

Section: The Tcp Loss Synchronization Analysismentioning

confidence: 99%

Exploring parallelism and desynchronization of TCP over high speed networks with tiny buffers

Xue

Chiu

Kondikoppa

et al. 2015

Computer Communications

Self Cite

View full text Add to dashboard Cite

a b s t r a c tThe buffer sizing problem is a big challenge for high speed network routers to reduce buffer cost without throughput loss. The past few years have witnessed debate on how to improve link utilization of high speed networks where the router buffer size is idealized into dozens of packets. Theoretically, the buffer size can be shrunk by more than 100 times. Under this scenario, widely argued proposals for TCP traffic to achieve acceptable link capacities mandate three necessary conditions: over-provisioned core link bandwidth, nonbursty flows, and tens of thousands of asynchronous flows. However, in high speed networks where these conditions are insufficient, TCP traffic suffers severely from routers with tiny buffers.To explore better performance, we propose a new congestion control algorithm called Desynchronized Multi-Channel TCP (DMCTCP) that creates a flow with parallel channels. These channels can desynchronize each other to avoid TCP loss synchronization, and they can avoid traffic penalties from burst losses. Over a 10 Gb/s large delay network ruled by tiny buffer routers, our emulation results show that bottleneck link utilization can reach over 80% with much fewer number of flows. Compared with other TCP congestion control variants, DMCTCP can also achieve much better performance in high loss rate networks. Facing the buffer sizing challenge, our study is a new step towards the deployment of optical packet switching networks.

show abstract

“…Moreover, plenty of other studies cover all the aspects of TCP, including improving loss recovery for specific applications , redesigning the slow start strategy , increasing TCP's initial congestion window , enabling data exchange during the three‐way handshake to accelerate the startup of TCP connections , generating congestion control algorithms automatically using machine learning , and evaluating the performance of TCP variants over high‐speed networks , etc.…”

Section: Related Workmentioning

confidence: 99%

“…As mentioned in Section 5.5, CUBIC and HSTCP have substantial presence in current Internet . In this section, CUBIC and HSTCP are compared with DCUDP in term of TCP friendliness.…”

Section: Performance Evaluationmentioning

confidence: 99%

DCUDP: scalable data transfer for high‐speed long‐distance networks

Zhang

2016

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYThe emergence of high-speed long-distance networks has promoted the development of various new types of applications that are required to transfer bulk data efficiently. Because of the conservative additive increase and multiplicative decrease strategy, traditional TCP has a severe problem in utilizing bandwidth, which provides an opening for new classes of UDP-based protocols. This paper proposes a high-speed bulk data transfer protocol, Double Cubic UDP (henceforth DCUDP), which is built on top of UDP with rate control and reliability control. DCUDP improves the scalability of the protocol over high bandwidth-delay product networks through cubic-shaped rate control functions and employs a randomized algorithm to alleviate the impacts of continuous loss and loss synchronization. In addition, DCUDP introduces a novel high-precision user-space timer system to facilitate the data transfer. The experimental results demonstrate that DCUDP performs well in terms of bandwidth utilization, CPU utilization, intra-protocol fairness and round-trip time fairness, and exhibits favorable friendliness to standard TCP and high-speed TCP variants.

show abstract

AFCD: An Approximated-Fair and Controlled-Delay Queuing for High Speed Networks

Cited by 6 publications

References 23 publications

DMCTCP: Desynchronized Multi-Channel TCP for high speed access networks with tiny buffers

DMCTCP: Desynchronized Multi-Channel TCP for high speed access networks with tiny buffers

Exploring parallelism and desynchronization of TCP over high speed networks with tiny buffers

DCUDP: scalable data transfer for high‐speed long‐distance networks

Contact Info

Product

Resources

About