Delay Dependent Antiwindup for <scp>AQM</scp> in <scp>TCP/IP</scp> Routers

Bender, Fernando Augusto

doi:10.1002/asjc.810

Cited by 9 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pre-and post-multiplying the above LMIs by blockdiag{ √ , … , √ }, considering = and the variable changes in (13) we obtain LMIs (9) and (10).…”

Section: Resultsmentioning

confidence: 99%

“…For simplicity we assume = 0. Hence, by computing = min subject to (8)- (10) max subject to <1.20⋅ , (8)- (10)…”

Section: Remarkmentioning

confidence: 99%

“…For instance, does not consider any type of disturbances on the plant. This prevents any direct comparison with , where the antiwindup compensators are synthesized in order to minimize the

{scriptℒ}_{2}

‐gain of the disturbance to the plant output. However, some differences in other aspects of the methodology can be highlighted.…”

Section: Introductionmentioning

confidence: 99%

“…This combination of delays is likely to occur in spatially distributed systems with a remote saturating input. We have been researching precisely this category, mostly motivated by its application on TCP/IP congested routers (see ). It should be noted that a method developed for one category is not likely to be directly extensible to another one.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On The Timing of Antiwindup Compensation

Binotti¹,

Bender²

2014

Asian Journal of Control

View full text Add to dashboard Cite

In this paper we address the problem of determining the effect of the timing of the antiwindup compensation on the stability of a class of nonlinear systems. Besides proposing a new and less conservative synthesis framework, we move forward and compare the impact of antiwindup compensation when it occurs immediately or it is delayed. The class of systems considered are input saturating linear systems with known and constant time delay in both the input and the states. The synthesis of these antiwindup compensators is carried out on a linear matrix inequality (LMI)‐based framework whose development is based on the use of a Lyapunov–Krasovskii functional, a generalized sector condition, and a negligibly constrained usage of the Finsler Lemma. We compare results by computing the upper bound of the scriptℒ2‐norm on the admissible disturbances for which the system trajectories are assured to be bounded.

show abstract

“…Pre-and post-multiplying the above LMIs by blockdiag{ √ , … , √ }, considering = and the variable changes in (13) we obtain LMIs (9) and (10).…”

Section: Resultsmentioning

confidence: 99%

“…For simplicity we assume = 0. Hence, by computing = min subject to (8)- (10) max subject to <1.20⋅ , (8)- (10)…”

Section: Remarkmentioning

confidence: 99%

“…For instance, does not consider any type of disturbances on the plant. This prevents any direct comparison with , where the antiwindup compensators are synthesized in order to minimize the

{scriptℒ}_{2}

‐gain of the disturbance to the plant output. However, some differences in other aspects of the methodology can be highlighted.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On The Timing of Antiwindup Compensation

Binotti¹,

Bender²

2014

Asian Journal of Control

View full text Add to dashboard Cite

show abstract

“…Since the control actions in AQM are the discarding probabilities (real numbers bounded between [0, 1]), the AQM approaches that ignore the input saturation are not adequate because saturations might deteriorate the control system's performance and frequently lead to unacceptable losses of stability. Then, to mitigate the saturation effects on stability of such systems, local/global stabilization in a specified region of attraction (Cao et al 2002;El Fezazi et al 2017, 2019cEl Fezazi 2019;Naamane et al 2017) and anti-windup techniques where the emphasis is on the transient performance caused by the saturations (Bender 2013(Bender , 2014Lamrabet et al 2017Lamrabet et al , 2018 is studied. The drawback of some proposed approaches is the computing resources demanded to implement them in a real network, which may yield it unfeasible.…”

Section: Introductionmentioning

confidence: 99%

AQM Congestion Controller for TCP/IP Networks: Multiclass Traffic

Fezazi

Elfakir

Bender

et al. 2020

J Control Autom Electr Syst

View full text Add to dashboard Cite

Active queue management (AQM) is a congestion control mechanism for the early notification of the incipient congestion pursued by dropping/marking packets. The novelty in our result is that we are able to consider heterogeneous traffic (i.e., multiclass traffic) where each class has its own packet discarding policy, queue size, and bandwidth share. Then, this is so far the first control theory-based approach for the AQM problem on the TCP/IP routers that allows multiclass AQM. Our proposed technique assumes that each class has already a controller, designed a priori, and focuses on designing a static state feedback controller where the proposed design approach is based on the solution of linear matrix inequalities (LMIs). From the theoretical conditions, a new controller design methodology for discrete time systems with multi-delays, saturated inputs, and disturbances is proposed to overcome the obstacle of bilinearity which leads to a quite simple LMI condition that is numerically tractable with any convex optimization algorithm. A numerical example is provided at the end of this paper to show the effectiveness and performances of the proposed approach in the presence of multiclass traffic.

show abstract