Stability Analysis of Explicit Congestion Control Protocols

Abstract

Abstract-In the context of explicit congestion control protocols like XCP and RCP where the equilibrium queue lengths are zero, we show that the stability region derived from traditional Nyquist analysis is not an accurate representation of the actual stability region, and that the use of switched linear system models with time delay and new Lyapunov tools can provide sound sufficient stability conditions.

Switch Architectures For Small-buffered Optical Packet Switched Networks

“…Furthermore, our aim is to have a small buffered network and effect of queue parameter is low as persistent queue size is usually small with such a small buffered network, so β parameter is set to zero in the core routers. [9] shows that this parameter set is stable. Total simulation duration is 40s.…”

Adaptive optimization for active queue management supporting TCP flows

“…The difference between the RED and the AO strategies is also underlined by looking at the sending rate trajectory: while, in the transient phase, the RED controller increases the sending rate with respect to its initial value, the AO controllers decreases it. Table II summarizes the improvement in terms of the cost function (17): the performances of the centralized and of the decentralized AO solutions, with improvements over RED ranging from 67 to 80%. Moreover, also in the presence of larger capacity and round trip-time the proposed AO strategies sensibly reduce the oscillations and achieve smaller residual capacity and queue length, i.e.…”

“…This suggests that the current RED protocol is not well-suited for future networks where capacity will be large. This is the reason why, over the years, many different protocols have been studied as an alternative to the RED strategy [17], [18], [19], [20], [21], [22]. This paper proposes an adaptive optimization method for active queue management of TCP flows.…”

Stability of piecewise affine systems with state-dependent delay, and application to congestion control

“…Let us now analyse the termsh 2 − τ (t, x) and τ (t, x) −h 1 using this property. One can show thath 2 …”

“…Denoting x 1 (t) = y(t) − y d and x 2 (t) = z(t) − µ, with y d the desired amount of data in the router's buffer, and using the approach presented in [2], it is possible to embed the system (1) into the following switched system: ẋ 1 (t) = x 2 (t − (x 1 (t) + y d )/µ − d), x 2 (t) = u(t), for x 1 (t) > −y d or x 2 (t − (x 1 (t) + y d )/µ − d) ≥ 0, ẋ 1 (t) = −x 1 (t) − y d , x 2 (t) = u(t), for x 1 (t) ≤ −y d and x 2 (t − (x 1 (t) + y d )/µ − d) ≤ 0.…”