Loss synchronization and router buffer sizing with high-speed versions of TCP

Hassayoun, Sofiane; Ros, David

doi:10.1109/infocom.2008.4544632

Cited by 13 publications

(18 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Second assumption relates to the fact that high speed TCP flows are aggressive and higher burstiness is attributed to high congestion window values; the assumption that highest sending rate flows have higher probability to record losses is heuristically justified (in [11], it is observed that larger burstiness increases the probability of packet losses) if not very accurate. To understand the third assumption, we refer to [2] that shows high speed TCP flows intent to show some level of loss synchronization. Fairness in packet drops (i.e., dropped packets are uniformly distributed among all the flows) can create synchronization among flows whereas unfair packet drops (i.e., only some of the flows record packet drops) can lead to reduced synchronization.…”

Section: High Speed Network Simulation Setupmentioning

confidence: 99%

“…In [2,3], the authors presented a study of loss synchronization phenomena in a high speed network setting using drop-tail and RED respectively, for different buffer sizes. However, their studies only validated loss synchronization effect of these two specific queue management schemes.…”

Section: Related Workmentioning

confidence: 99%

“…Modeling the loss synchronization has been a challenging task for network researchers especially for high speed networks. A few studies have concentrated on loss synchronization studies on high speed networks such as [1][2][3]. The work in [1] presents an analytical model using M/M/1/K queuing model approximations that is only valid for HighSpeed TCP (HSTCP) [4].…”

Section: Introductionmentioning

confidence: 99%

“…The work in [1] presents an analytical model using M/M/1/K queuing model approximations that is only valid for HighSpeed TCP (HSTCP) [4]. The work in [2,3] presents synchronization statistics in a high speed network environment via NS2 simulation. However, both [2,3] do not answer the question: how does loss synchronization level affect the performance of high speed TCP variants?…”

Section: Introductionmentioning

confidence: 99%

“…The work in [2,3] presents synchronization statistics in a high speed network environment via NS2 simulation. However, both [2,3] do not answer the question: how does loss synchronization level affect the performance of high speed TCP variants? Or how does loss synchronization affect the design of high speed networks?…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Impact of Loss Synchronization on Reliable High Speed Networks: A Model Based Simulation

Kumar

Xue

Park

2014

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

Contemporary nature of network evolution demands for simulation models which are flexible, scalable, and easily implementable. In this paper, we propose a fluid based model for performance analysis of reliable high speed networks. In particular, this paper aims to study the dynamic relationship between congestion control algorithms and queue management schemes, in order to develop a better understanding of the causal linkages between the two. We propose a loss synchronization module which is user configurable. We validate our model through simulations under controlled settings. Also, we present a performance analysis to provide insights into two important issues concerning 10 Gbps high speed networks: (i) impact of bottleneck buffer size on the performance of 10 Gbps high speed network and (ii) impact of level of loss synchronization on link utilization-fairness tradeoffs. The practical impact of the proposed work is to provide design guidelines along with a powerful simulation tool to protocol designers and network developers.

show abstract

Section: High Speed Network Simulation Setupmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Impact of Loss Synchronization on Reliable High Speed Networks: A Model Based Simulation

Kumar

Xue

Park

2014

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

show abstract

Trading link utilization for queueing delays: An adaptive approach

Stanojevic

Shorten

2010

Computer Communications

View full text Add to dashboard Cite

Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in understanding this relationship stem from the fact that it depends on the complex nature of arriving traffic and the problems associated with modelling such traffic. Existing AQM schemes achieve a "low delay" and "high utilization" by responding early to congestion without considering the exact relationship between delay and utilization. However, in the context of exploiting the delay/utilization tradeoff, the optimal choice of a queueing scheme's control parameter depends on the cost associated with the relative importance of queueing delay and utilization. The optimal choice of control parameter is the one that maximizes a benefit that can be defined as the difference between utilization and cost associated with queuing delay. We present two practical algorithms, Optimal Drop-Tail (ODT) and Optimal BLUE (OB), that are designed with a common performance goal: namely, maximizing this benefit. Their novelty lies in fact that they maximize the benefit in an online manner, without requiring knowledge of the traffic conditions, specific delay-utilization models, nor do they require complex parameter estimation. Packet level ns2 simulations are given to demonstrate the efficacy of the proposed algorithms and the framework in which they are designed.

show abstract

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

Xue

Chiu

Kondikoppa

et al. 2015

Computer Communications

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

Loss synchronization and router buffer sizing with high-speed versions of TCP

Cited by 13 publications

References 25 publications

Impact of Loss Synchronization on Reliable High Speed Networks: A Model Based Simulation

Impact of Loss Synchronization on Reliable High Speed Networks: A Model Based Simulation

Trading link utilization for queueing delays: An adaptive approach

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

Contact Info

Product

Resources

About