Analyses of compound TCP with Random Early Detection (RED) queue management

Manjunath, Sreelakshmi; Raina, Gaurav

doi:10.1109/ccdc.2015.7162875

Cited by 4 publications

(5 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have investigated these closed form expressions against our Markovian models in [38] and have found that the closed form expressions are not as accurate as the Markovian model results. In [39,40,41], the authors study the performance of TCP Compound using control theoretic techniques and derive stability conditions for TCP Compound. In these papers, it is shown that when multiple TCP flows share a single bottleneck queue, the queue sizes and the link utilization have oscillatory behaviour when the feedback delays (round trip times of the flows) and buffer sizes are large.…”

Section: Previous Studies Of Tcp Cubic and Compoundmentioning

confidence: 99%

See 1 more Smart Citation

Analysis of multiple flows using different high speed TCP protocols on a general network

Poojary

Sharma

2016

Performance Evaluation

View full text Add to dashboard Cite

We develop analytical tools for performance analysis of multiple TCP flows (which could be using TCP CUBIC, TCP Compound, TCP New Reno) passing through a multi-hop network. We first compute average window size for a single TCP connection (using CUBIC or Compound TCP) under random losses. We then consider two techniques to compute steady state throughput for different TCP flows in a multi-hop network. In the first technique, we approximate the queues as M/G/1 queues. In the second technique, we use an optimization program whose solution approximates the steady state throughput of the different flows. Our results match well with ns2 simulations.

show abstract

Section: Previous Studies Of Tcp Cubic and Compoundmentioning

confidence: 99%

“…In [39], the authors evaluate the TCP Compound performance as a function of buffer size in the bottleneck queue. In [40], the authors study the performance of TCP Compound with a proportional integral enhanced queue management policy whereas in [41], RED queue management policy is considered.…”

Section: Previous Studies Of Tcp Cubic and Compoundmentioning

confidence: 99%

Analysis of multiple flows using different high speed TCP protocols on a general network

Poojary

Sharma

2016

Performance Evaluation

View full text Add to dashboard Cite

show abstract

“…e authors studied the stability and bifurcation of compound TCP with the RED system in three different limiting regimes in [12,13]. In [14], chaotic phenomena and period doubling bifurcation of the first-order discrete time model for compound TCP with RED system are obtained by employing bifurcation diagrams and Lyapunov exponent.…”

Section: Introductionmentioning

confidence: 99%

Sudden Transition from Equilibrium to Hybrid Chaos and Periodic Oscillations of the State-Dependent Round-Trip Delayed Nonsmooth Compound TCP with GRED Congestion Control System via HB-AFT

2020

View full text Add to dashboard Cite

In this paper, the nonsmooth compound transmission control protocol (TCP) with the gentle random early detection (GRED) system with the state-dependent round-trip delay is investigated in detail. Uniqueness of the positive equilibrium is proved firstly. Then, the closed approximate periodic solutions in this state-dependent delayed nonsmooth compound TCP with the GRED model are obtained by employing the harmonic balance and alternating frequency/time domain (HB-AFT) method. Then, we compare the results generated by numerical simulations with those of the closed approximate expressions obtained by HB-AFT. It indicates that HB-AFT is simple, correct, and powerful for state-dependent delayed nonsmooth dynamical systems. Finally, we find the complicated dynamic: chaos. It is a grazing chaos with a hybrid property, i.e., where usually w oscillates at a very low frequency and q oscillates at a very high frequency. And, the route to chaos is a very rare route, i.e., the instantaneous and local transition of stable equilibrium to chaos. So, to the end of stability and good performance, we should adjust the parameters carefully to avoid the periodic and chaotic oscillations.

show abstract

“…There are fewer analytical studies of TCP Compound as compared to the traditional AIMD variants. In [20][21][22], the authors study the performance of TCP Compound using control theoretic techniques and derive stability conditions for TCP Compound. In these papers, it is shown that when multiple TCP flows share a single bottleneck queue, the queue sizes and the link utilization has oscillatory behaviour when the feedback delays (round trip times of the flows) and the buffer sizes are large.…”

Section: Introductionmentioning

confidence: 99%

“…In [20], the authors evaluates TCP Compound performance as a function of buffer size in the bottleneck queue. In [21], the authors study the performance of TCP Compound with a proportional integral enhanced queue management policy whereas in [22], RED queue management policy is considered. In [23], the authors study the performance of a single TCP Compound connection in the presence of random losses using Markovian models.…”

Section: Introductionmentioning

confidence: 99%

Asymptotic approximations for TCP Compound

Poojary

Sharma

2016

2016 Twenty Second National Conference on Communication (NCC)

View full text Add to dashboard Cite

In this paper, we derive an approximation for throughput of TCP Compound connections under random losses. Throughput expressions for TCP Compound under a deterministic loss model exist in the literature. These are obtained assuming the window sizes are continuous, i.e., a fluid behaviour is assumed. We validate this model theoretically. We show that under the deterministic loss model, the TCP window evolution for TCP Compound is periodic and is independent of the initial window size. We then consider the case when packets are lost randomly and independently of each other. We discuss Markov chain models to analyze performance of TCP in this scenario. We use insights from the deterministic loss model to get an appropriate scaling for the window size process and show that these scaled processes, indexed by p, the packet error rate, converge to a limit Markov chain process as p goes to 0. We show the existence and uniqueness of the stationary distribution for this limit process. Using the stationary distribution for the limit process, we obtain approximations for throughput, under random losses, for TCP Compound when packet error rates are small. We compare our results with ns2 simulations which show a good match.

show abstract

Analyses of compound TCP with Random Early Detection (RED) queue management

Cited by 4 publications

References 56 publications

Analysis of multiple flows using different high speed TCP protocols on a general network

Analysis of multiple flows using different high speed TCP protocols on a general network

Sudden Transition from Equilibrium to Hybrid Chaos and Periodic Oscillations of the State-Dependent Round-Trip Delayed Nonsmooth Compound TCP with GRED Congestion Control System via HB-AFT

Asymptotic approximations for TCP Compound

Contact Info

Product

Resources

About