Anti-windup Compensation

in TCP/IP Routers: A Multi-delay Feedback

Systems Approach

Nabil El Fezazi1(&), Ismail Er Rachid1, El Houssaine Tissir1,

Fatima El Haoussi1,2, Teresa Alvarez3,
and Fernando Augusto Bender4
1
LESSI, Department of Physics, Faculty of Sciences Dhar El Mehraz,
University Sidi Mohammed Ben Abdellah, BP 1796, Fes-Atlas, Morocco
fizazi.99@gmail.com
2
Department of Mathematic and Informatics, Polydisciplinary Faculty of Nador,
IASCM, BP 300 Selouane, 62700 Nador, Morocco
3
Department of Systems Engineering and Automatic Control,
University of Valladolid, 47005 Valladolid, Spain
4
Center of Exact Sciences and Technology, Universidade de Caxias do Sul,
R. Francisco Getulio Vargas 1130, Caxias do Sul, RS 95070-560, Brazil

Abstract. The design of anti-windup compensators for TCP/IP congestion in

the presence of multiple classes of traffic is addressed here: a methodology is
presented that takes into account the constraints to achieve the desired queue
size, guaranteeing the stability even in the presence of disturbances. Our pro-
posed technique is based on using LMIs that include a tuning parameter, which
makes possible to enlarge the domain of attraction to ensure the stability in the
varying conditions inherent to TCP/IP traffic. This is so far the first control
theory based approach for anti-windup in router that allows multi class Active
Queue Management, considering delays, input saturation and variable link
bandwidth (modeled as a time-variant disturbance). These characteristics are
relevant for framing the network within Service Level Agreements, as data
traffic is not homogeneous, and transmission delays are variable.

Keywords: Anti-windup
Congestion
Domain of attraction
Control theory

1 Introduction

The increased demand for the Internet to transmit time-sensitive voice and video
applications require new congestion control algorithms that take into account flows of
different characteristics when regulating the demand of the network’s resources. Active
Queue Management (AQM) - based algorithms are frequently used in routers to inform
TCP’s senders about congestion, so senders fit their sending rate to the network
characteristics. This is inherently a feedback control issue, so significant research is
network characteristics. This is inherently a feedback control issue, so significant
research is been devoted to the use of control theory to develop more efficient con-
gestion control algorithms. A simple one is Drop Tail, which acts by dropping packets

© Springer Nature Switzerland AG 2019

Y. Farhaoui and L. Moussaid (Eds.): ICBDSDE 2018, SBD 53, pp. 190–203, 2019.
https://doi.org/10.1007/978-3-030-12048-1_21
 Anti-windup Compensation in TCP/IP Routers 191

arriving at a router when the buffer is full. As emphasized in [1], this leads to flow-
synchronization and performance degradation due to excessive time outs and restarts.
As an improvement, RED was proposed [2–4]: it uses the EWMA of the queue length
as a congestion indicator to drop/mark packets in order to achieve good balance
between throughput and queuing delay. However, RED suffers from the lack of
robustness with respect to tuning parameters which may easily lead to queue oscillation
and instability.
Different forms of controllers have been proposed in the literature based on Control
Theory: for example, [5, 6] use the phase margin specification in the frequency domain to
tune PI(D) controller gains. It must be pointed out that many of these Congestion Control
methodology proposed in the literature based on Control Theory ignore the inherent
time-varying delays, which is not adequate in practice: the packet drop/mark probability
only has its effect on the senders after the Round Trip Time (RTT). It is then important to
design controllers that do not ignore this delay, as there is a significant effect.
Furthermore, the control variable (drop probability) is subject to nested saturation,
which is not sufficiently considered by the previous works, degrading the performance
[7–13]. In this sense, [7, 8, 11] proposed delay dependent anti-windup techniques to
mitigate the saturation effect on stability of such delayed systems and to ensure closed
loop stability of TCP/IP AQM routers. However, these works consider the traffic
homogeneous, i.e. they do not differentiate one TCP flow from another, but there is a
tendency in combining different classes of traffic in Internet links that have different
requirements. For example, there are primarily secured data connections for allowing
financial and e-banking transfers (where packets should not be dropped), combined
with VoIP, that performs badly under variable delays, and standard e-mail or web page
traffic. Using a unique, single delay AQM policy for the whole traffic does not address
the Service Level Agreements (SLA) that telecom carriers and internet providers hold
with high demanding customers nowadays. Thus, this is addressed in present work,
considering multiple classes of traffic through the router, each class with its own packet
discarting policy, queue size, bandwidth share, and constant RTT, to outpace the
previous state of the art in this matter.

2 Preliminaries

In this section, we introduce notations and lemmas (see [14, 15]) which are used in this
paper. Thus,
kðPÞ denotes the maximaln
eigenvalue

o of matrix P. The saturation function



is satðycðkÞ ðtÞÞ ¼ signðycðkÞ ðtÞÞmin
ycðkÞ ðtÞ
; u0ðkÞ , Finally, k ¼ 1; . . .; m.

Lemma 1. The following inequality holds for any matrices R [ 0; N1 ; N2 , and delay s:

Z t  T      T ! 
nð t Þ N N1 N1 1 N1 nð t Þ
 n_ T ðsÞRn_ ðsÞds  2 1 þ sðtÞ R
tsðtÞ nðt  sðtÞÞ N2 N2 N2 N2 nðt  sðtÞÞ
192 N. El Fezazi et al.

Lemma 2. For a matrix GT , we define the following polyhedral set:

n

o



S ¼ nðt  sÞ<n þ nc ;
ðKðkÞ  GTðkÞ ÞnðtÞ
 u0ðkÞ

Then, the following relation is verified for any diagonal positive matrix TT :

wT ðKnðtÞÞTT ½wðKnðtÞÞ  GT nðtÞ  0

3 Problem Formulation
3.1 TCP + AQM Dynamics
In [4], a dynamic model of TCP behavior was presented using fluid-flow and stochastic
differential equation analysis. For simplicity, this paper considers a reduced version that
ignores the TCP timeout mechanism. The model relates the average value of the
network variables and is described by the following equations:

_ 1 ðt Þ ¼ 1 W1 ðtÞW1 ðt  RTT1 ðtÞÞ

W  p1 ðt  RTT1 ðtÞÞ
RTT1 ðtÞ 2RTT1 ðt  RTT1 ðtÞÞ
ð1Þ
N1
q_ 1 ðtÞ ¼ C1 ðtÞ þ W 1 ðt Þ
RTT1 ðtÞ

where W1 ðtÞ is the average TCP window size (packets); q1 ðtÞ is the average queue
length (packets); RTT1 ðtÞ is the round trip time (secs); C1 ðtÞ is the link capacity
(packets/secs); N1 is the loading factor (number of TCP sessions); and p1 2 ½0; 1 is the
probability of packet marking/dropping.
Then, the linearization of the above model yields

dW_ 1 ðtÞ ¼ RTT

N1
2C
1
ðdW1 ðtÞ þ dW1 ðt  RTT1 ðtÞÞÞ  RTT12 C1 ðdq1 ðtÞ þ dq1 ðt  RTT1 ðtÞÞÞ
1 0 1 0
RTT1 C12 RTT1 Tp1
 2N12
0
dp1 ðt  RTT1 ðtÞÞ þ RTT12 C10
ðdC1 ðtÞ þ dC1 ðt  RTT1 ðtÞÞÞ

N1 1 Tp1
dq_ 1 ðtÞ ¼ dW1 ðtÞ  dq1 ðtÞ  dC1 ðtÞ ð2Þ
RTT1 RTT1 RTT1

where d~e1 ¼ ~e1  ~e10 with ~e ¼ W; q; p; C. Therefore, we can write:

q1 ð t Þ dq1 ðtÞ
RTT1 ðtÞ ¼ þ Tp 1 ¼ þ RTT1 ð3Þ
C1 ðtÞ C10
 Anti-windup Compensation in TCP/IP Routers 193

3.2 Multi-class Model of TCP + AQM Dynamics

Rewriting (2) and (3) in state space form yields the following state-space model:

x_ 1 ðtÞ ¼ A1 x1 ðtÞ þ Ad1 x1 ðt  s1 ðtÞÞ þ B1 u1 ðt  s1 ðtÞÞ þ Bx1 x1 ðtÞ

y1 ðtÞ ¼ Cy1 x1 ðtÞ ð4Þ
z1 ðtÞ ¼ Cz1 x1 ðtÞ

in which
  " N1 1
#
dW1 ðtÞ RTT12 C10 RTT12 C10
x1 ð t Þ ¼ ; A1 ¼ ; u1 ðtÞ ¼ dp1 ðtÞ;
dq1 ðtÞ N1 1
RTT1 RTT1

  " #
N1 1 RTT1 C12
0
Ad1 ¼ RTT12 C10 RTT12 C10 ; B1 ¼ 2N12 ; y1 ðtÞ ¼ dq1 ðtÞ;
0 0 0
  " RTT1 Tp RTT1 Tp1 #
dC1 ðtÞ
1
RTT12 C10 RTT12 C10
x 1 ðt Þ ¼ ; Bx1 ¼ ;
dC1 ðt  RTT1 ðtÞÞ Tp1
0
RTT1
h i
1
z1 ðtÞ ¼ RTT1 ðtÞ  RTT1 ; Cy1 ¼ ½ 0 1 ; Cz1 ¼ 0 C 10

In the system (4), the delay s1 ðtÞ ¼ RTT1 ðtÞ is time dependent and satisfies
0  s1 ðtÞ  hs1 , 0  s_ 1 ðtÞ  d1 \1.
Considering that there are several classes of TCP flows passing through the router,
each of them with specific delays, we can rewrite the system (4) in the following new
general state-space model of a multi-class AQM + TCP system:
2 3 2 32 3 2 32 3
x_ 1 ðtÞ A1


0 x1 ð t Þ Ad1


0 x1 ðt  s1 ðtÞÞ
6 . 7 6 . .. .. 7 6 7 6 .. 7 6 7
6 . 7¼6 . 76 . 7 6 . .. 76 .. 7
4 . 5 4 . . . 54 .. 5 þ 4 .. . . 54 . 5
x_ m ðtÞ 0


Am xm ðtÞ 0


Adm xm ðt  sm ðtÞÞ
2 32 3 2 32 3
B1


0 u1 ðt  s1 ðtÞÞ Bx1


0 x 1 ðt Þ
6 . .. .. 7 6 .. 7 6 . .. .. 7 6 7
þ6 76 7þ6 . 76 . 7
4 .. . . 54 . 5 4 . . . 54 .. 5
0


B1 um ðt  sm ðtÞÞ 0


Bxm xm ðtÞ
2 3 2 32 3 ð5Þ
y1 ð t Þ Cy1


0 x1 ðtÞ
6 . 7 6 . .. .. 7 6 7
6 . 7¼6 . 76 . 7
4 . 5 4 . . . 54 .. 5
ym ð t Þ 0


Cym xm ð t Þ
2 3 2 32 3
z1 ðt Þ Cz1


0 x1 ð t Þ
6 . 7 6 . .. .. 7 6 7
6 . 7¼6 . 76 . 7
4 . 5 4 . . . 54 .. 5
zm ðt Þ 0


Czm xm ð t Þ
194 N. El Fezazi et al.

where xk is the vector containing the congestion window and the queue size for the k th
class of traffic.
System (5) can be rewritten in the following compact form:

X
m
x_ ðtÞ ¼ AxðtÞ þ ðAsk xðt  sk ðtÞÞ þ Bsk uðt  sk ðtÞÞÞ þ Bx xðtÞ
k¼1
ð6Þ
yðtÞ ¼ Cy xðtÞ
zðtÞ ¼ Cz xðtÞ

where
 T
rðtÞ ¼ rT1 ðtÞ


rTm ðtÞ ; r ¼ x; u; x; y; z; F ¼ diagfF1 ; . . .; Fm g; F ¼ A; Bx ;
Cy ; Cz ; Hs1 ¼ diagfH1 ; . . .; 0g; . . .; Hsm ¼ diagf0; . . .; Hm g; H ¼ Ad ; B:

For simplicity, the link capacity disturbance xðtÞ 2 l2 is bounded with finite energy
R1
by d : kxðtÞk22 ¼ 0 xT ðtÞxðtÞdt  d1 .
The controller for (6) is considered to be the following dynamic output controller:
2 3 2 32 3 2 32 3
x_ c1 ðtÞ Ac1


0 xc1 ðtÞ Bc1


0 uc 1 ð t Þ
6 . 7 6 . .. .. 7 6 7 6 .. 7 6 7
6 . 7¼6 . 76 . 7 6 . .. 76 . 7
4 . 5 4 . . . 54 .. 5 þ 4 .. . . 54 .. 5
x_ c ðtÞ 0


Acm xc ð t Þ 0


Bcm uc ð t Þ
2 m 3 2 32 m 3 2 32 m 3
yc 1 ð t Þ Cc1


0 xc1 ðtÞ D c1


0 uc 1 ð t Þ
6 . 7 6 . .. .. 7 6 7 6 .. 7 6 7
6 . 7¼6 . 76 . 7 6 . .. 76 . 7
4 . 5 4 . . . 54 .. 5 þ 4 .. . . 54 .. 5
ycm ð t Þ 0


Ccm xcm ðtÞ 0


D cm uc m ð t Þ

The interconnection of this controller with the system (6) is given by uc ðtÞ ¼ yðtÞ
and uðt  s1 ðtÞÞ ¼ satðyc ðt  s1 ðtÞÞ; . . .; uðt  sm ðtÞÞ ¼ satðyc ðt  sm ðtÞÞ. To mitigate
the effects of the windup caused by saturation the following anti-windup controller is
used where wðyc ðt  sk ðtÞÞÞ ¼ yc ðt  sk ðtÞÞ  satðyc ðt  sk ðtÞÞÞ:

X
m
x_ c ðtÞ ¼ Ac xc ðtÞ þ Bc yðtÞ  Eck wðyc ðt  sk ðtÞÞÞ
k¼1 ð7Þ
yc ðtÞ ¼ Cc xc ðtÞ þ Dc yðtÞ
 Anti-windup Compensation in TCP/IP Routers 195

We define the following augmented state and matrices:

     
xðtÞ A 0 Ads1 þ Bs1 Dc Cy Bs1 Cc
nð t Þ ¼ ;A ¼ ; A1 ¼ ; . . .;
xc ðtÞ Bc Cy Ac   0 0 
Adm þ Bsm Dc Cy Bsm Cc Bs1 Bsm
Am ¼ ; B1 ¼ ; . . .; Bm ¼ ;
  0 0 0
  0
0 Bx
R¼ ; K ¼ ½ Dc Cy Cc ; Bx ¼ ; Cz ¼ ½ Cz 0 
Inc 0

In this case, the augmented system can be represented as follows:

X
m
n_ ðtÞ ¼ AnðtÞ þ ðAk nðt  sk ðtÞÞ  ðBk þ REck ÞwðKnðt  sk ðtÞÞÞÞ þ Bx xðtÞ
k¼1 ð8Þ
zðtÞ ¼ Cz nðtÞ

The stability is aimed to be ensured for a large set of initial states. To define
mathematically
 the size of the set an estimate
 of domain attraction is represented by
u ¼ /ðtÞ; 
hs  t  0 : max k/ðtÞk  @ ;
hs ¼ max fhs1 ; . . .; hsm g.
For a positive scalar l and a positive definite symmetric matrix P, the trajectories of
 
the system should not leave the set eðP; lÞ ¼ nðtÞRn þ nc ; nT ðtÞPnðtÞ  l1 :
A Lyapunov based approach will be used to derive the controllers where
Z Z Z !
X
m t t t
V ðtÞ ¼ n ðtÞPnðtÞ þ
T
n ðtÞQk nðsÞds þ
T
n_ T ðsÞRk n_ ðsÞdsdh
k¼1 tTk ðtÞ Tk ðtÞ tþ0

where P ¼ diagfP1 ; :::; Pm g ¼ PT [ 0; Q1 ¼ QT1 [ 0; :::; Qm ¼ QTm [ 0, and R1 ¼

RT1 [ 0; :::; Rm ¼ RTm [ 0 need to be determined.
Central in the developments later is an auxiliary function for the problem of AQM
based congestion control for TCP/IP networks based on dynamical model (2): For a
prescribed scalar c, the auxiliary function is J ðtÞ ¼ V_ ðtÞ þ 1c zT ðtÞzðtÞ  xT ðtÞxðtÞ.
Integrating J ðtÞ from 0 to ∞, as the system is asymptotically stable then V(∞) = 0,
so using the zero initial conditions, we equivalently require the following performance
index:
Z 1

1 T
z ðtÞzðtÞ  xT ðtÞxðtÞ dt \ 0 ð9Þ
0 c

The controller design problem is then stated as follows:

Problem 1. The objective is to develop a H∞ approach for AQM-based congestion
controllers in the presence of saturations, based on the dynamic model (2), which
196 N. El Fezazi et al.

guarantees the ratio between the norms of the RTT and the bandwidth disturbance
being less than some specified value. Thus, the inequality (9) is enforced so that
R1 T
kzðtÞk22
R 0 z ðtÞzðt Þdt
¼ 1 T \c
0 x ðtÞxðtÞdt
2
k xð t Þ k2

Furthermore, this bound is minimized for a given group of network parameters.

4 Main Results

We will first derive the conditions that satisfy the objective of the Problem 1 defined in
Sect. 3 considering m different traffic classes traversing the congested router, where
each class has its specificities.
Theorem 1. If there exist symmetric positive-definite matrices P;
1 ; . . .; Q

Q
m; R

1 ; . . .;

m , diagonal positive-definite matrices Ss1 ; . . .; Ssm , appropriately sized matrices X;
R

11 ; . . .; N
N
1m ; N

21 ; . . .; N

2m ; Ws1 ; . . .; Wsm ; Yc1 ; . . .; Ycm , and a given scalar a satisfying
the following conditions:

2 3
R11 R12 R13


R1m RY11


RY1m Bx hs1 N
11


hsm N
1m XCzT
6  R22 R23


R2m RY21


RY2m aBx 0


0 0 7
6 7
6   R33


0 RW1


0 0 hs1 N
21


0 0 7
6 7
6 .. .. .. .. .. .. .. .. .. .. .. .. .. 7
6 . . . . . . . . . . . . . 7
6 7
6   


Rmm 0


RWm 0 0


hsm N
2m 0 7
6 7
6   


 RS1


0 0 0


0 0 7
6 7
6 .. .. .. .. .. .. .. .. .. .. .. .. .. 7 \ 0;
6 . . . . . . . . . . . . . 7 ð10Þ
6 7
6   


 


RSm 0 0


0 0 7
6 7
6   


 


 I 0


0 0 7
6 7
6   


 


 
1
hs1 R


0 0 7
6 7
6 .. .. .. .. .. .. .. .. .. .. .. .. .. 7
6 . . . . . . . . . . . . . 7
6 7
4   








  



m
hsm R 0 5
  








  


 cI
2 3


P XKðTkÞ  Ws1 T



XK T  Wsm T
ðk Þ ðk Þ
6 ðk Þ
7
6 lu210ðkÞ


0 7
6 . 7  0; ð11Þ
6 .. .. .. .. 7
4 . . . 5
2
 


lum0ðkÞ

l  d  0; ð12Þ
 Anti-windup Compensation in TCP/IP Routers 197

m 
P 
R11 ¼ AX T þ XAT þ
1k þ N
N
1k
T
k ; R12 ¼ X T þ aXAT þ P
þQ

k¼1
P
m
R22 ¼
k  aðX þ X T Þ;
hsk R
11 þ N
R13 ¼ A1 X T  N
21
T
; R23 ¼ aA1 X T
k¼1
R33 ¼ N
21  N

21
T
1 ; R1m ¼ Am X T  N
 ð1  d1 ÞQ
1m þ N

2m
T
; RW1 ¼ Ws1
T

R2m ¼ aAm X ; Rmm ¼ N

T
2m  N T
m ; RWm ¼ W

2m  ð1  dm ÞQ T
sm
RY11 ¼ ðB1 Ss1 þ RYc1 Þ; RY21 ¼ aðB1 Ss1 þ RYc1 Þ; RS1 ¼ 2Ss1
RY1m ¼ ðBm Ssm þ RYcm Þ; RY2m ¼ aðBm Ssm þ RYcm Þ; RSm ¼ 2Ssm

Then, there exists Ec1 ¼ Yc1 S1 1

s1 ; . . .; Ecm ¼ Ycm Ssm which ensure that the trajecto-
ries of (8) are bounded for every initial condition in the following set:

Xm    1  h2sk  1 

@2
1
T
k X PX


þ hsk k X Qk X T
þ


k X Rk X T
 l1  d1
k¼1 2
ð13Þ

Moreover, the corresponding trajectories converge asymptotically to the origin.

Proof. Calculating the time derivative of the Lyapunov functional yields:
P
V_ ðtÞ ¼ 2nT ðtÞPn_ ðtÞ þ m k¼1 ðn ðtÞQk nðt Þ  n ðt  sk ðtÞÞQk nðt  sk ðtÞÞ þ
T T
R ð14Þ
sk ðtÞn_ ðtÞRk n_ ðtÞ  tsk ðtÞ n_ ðsÞRk n_ ðsÞdsÞ
T t T

From Eq. (8), for any matrices T1 and T2 the following relation is true:
h ih P
2 nT ðtÞT1 þ n_ T ðtÞT2 n_ ðtÞ þ AnðtÞ þ mk¼1 ðAk nðt  sk ðtÞÞÞ  ðBk þ ð15Þ
REck ÞwðKnðt  sk ðtÞÞÞ þ Bx xðtÞ ¼ 0

Taking into account (14)–(15) and applying Lemmas 1–2, we can write
Y
J ð t Þ  gT ð t Þ gð t Þ ð16Þ
2Q Q Q Q Q Q 3
11 Q11 Q13


Q1m QE11


QE1m T1 Bx
6  Q23


QE21


T2 Bx 7
6 22 2m E2m 7
6  


0


0 0 7
6 33 G1 7
6 .. .. .. .. . .. .. . .. 7
6
Q 6 . . . . Q.. . . Q.. . 77
where ¼6
6   


mm Q0


Gm 0 7 7;
6   





0 0 7
6 T1 7
6 .. .. .. .. .. .. .. . .. 7
6 . . . . . . . Q.. . 7
6 7
4   


 


0 5
Tm
  


 


 I
198 N. El Fezazi et al.


gð t Þ ¼ nT ð t Þn_ T ðtÞ nT ðt  s1 ðtÞÞ . . . nT ðt  sm ðtÞÞ wT ðKnðt  s1 ðtÞÞÞ
T
. . . wT ðKnðt  sm ðtÞÞÞ xT ðtÞ ;
Q Pm   1 T
11 ¼ T1 A þ A T1 þ
T T
N1k þ N1k
T
þ hsk N1k R1
k N1k þ Qk þ c Cz Cz
T
k¼1
Q Q P
m
12 ¼ T1 þ AT T2T þ P; ¼
hsk Rk  T2  T2T
22
Q k¼1
1 T
Q
13 ¼ T1 A  N11 þ N21 þ hsk N11 R1 N21 ; Q¼ T2 A1 T
T
Q 23
¼ N21  N21
33 Q
T
 ð1  d1 ÞQ1 þ hs1 N21 R11 N21 ; Q Gm ¼ Gsm Tsm
T
1 T
1m ¼ T1 Am  N1m þ N2m þ hsm N1m Rm N2m ; ¼ T2 Am
T
Q 1 T
2mQ
Q mm ¼ N 2m  N T
2m  ð 1  d
Q m ÞQ m þ h sm N2m R m N 2m ; QG1 ¼ Gs1 Ts1
T

Q E11 ¼ T1 ðBm þ REcm Þ; Q E21 ¼ T2 ðBm þ REcm Þ; QT1 ¼ 2Ts1
E1m ¼ T1 ðBm þ REcm Þ; E2m ¼ T2 ðBm þ REcm Þ; Tm ¼ 2Tsm
Q
If \0, then J\0. Thus, setting T2 ¼ aT1 , applying the Schur complement to 
(16), multiplying their sides by diag T11 ; . . .; T11 ; Ts1 1 1
; . . .; Tsm ; I; T11 ; . . .; T11 ; I
and its transpose and applying the variables changes: X ¼ T11 ; Ss1 ¼ Ts1 1
; . . .; Ssm ¼
1
Tsm ; Yc1 ¼ Ec1 Ss1 ; . . .; Ycm ¼ Ecm Ssm ; . . .;Ws1 ¼ Gs1 X T ; . . .; Wsm ¼ Gsm X T and X
¼
XXX , with X ¼ P; Q1 ; . . .; Qm ; R1 ; . . .; Rm ; N11 ; . . .; N1m ; N21 ; . . .; N1m , we obtain the
T

LMI (10). Since (10) holds, when xðtÞ 6¼ 0 the condition (9) verified. Moreover, the
satisfaction (10)–(13) can be proven in the same manner as in [9, 13]. This completes
the proof.
Remark 1. If there were no delays in the system (8), the results correspond to the
particular case solved in [9]. The present work contributes to the AQM problem by
explicitly allowing different time delays for multiple traffic classes, so our results is
more general and applicable to more realistic problems.

5 Numerical Example

Considering three TCP flows passing through the router where each flow has its
specificities, the numerical values are
8
> RTT1 ¼ 0:30; RTT2 ¼ 0:25; RTT3 ¼ 0:20
<
C10 ¼ 3500; C20 ¼ 3600; C30 ¼ 3700
>
: N1 ¼ 70; N2 ¼ 75; N3 ¼ 80
q10 ¼ 175; q20 ¼ 165; q30 ¼ 150

From these parameters, we obtain [11]:

8
< W10 ¼ 15; W20 ¼ 12; W30 ¼ 9:25
Tp1 ¼ 0:25; Tp2 ¼ 0:2042; Tp3 ¼ 0:1595
:
p10 ¼ 0:0089; p20 ¼ 0:0139; p30 ¼ 0:0234
 Anti-windup Compensation in TCP/IP Routers 199

The aforementioned model has an AQM policy given by (7) where (see [7])
Ac ¼ diagf0; 0; 0g, Bc ¼ diagf1; 1; 1g, Cc ¼ diagf0:0759; 0:2086; 0:6988g  104 ,
Dc ¼ diagf0:1708; 0:3129; 0:6463g  104 .
We explore the regulation of the router queue around a specific predetermined
length, when its congested traffic is comprised by three different classes. We want to
treat each class differently in terms of discharge probability, buffering and bandwidth,
according to their own characteristics. Also, giving to specific path that each traffic
classes transpasses, the RTT associated to them are also different.
Taking d1 ¼ d2 ¼ d3 ¼ 0:1 and b ¼ 1, and using in MATLAB/YALMIP/SDPT3
for specific time delays hs1 ¼ 0:30; hs2 ¼ 0:25; hs3 ¼ 0:20, the stability results pre-
sented in Theorem 1 make possible to obtain the anti-windup compensations
Ec1 ¼ diagf4800:9; 0; 0g, Ec2 ¼ diagf0; 3029:9; 0g and Ec3 ¼ diagf0; 0; 2631:5g
p
where a ¼ 0:1015 and c ¼ 1:4  103 .
The objective of the proposed controller is to control the queue length at the desired
set values while respecting the link capacity disturbances for the TCP/IP network that
generate fluctuations in the queue length. Then, we consider the disturbance is repre-
sented by the random signal in Fig. 1. On other hand, when the controller derived is
implemented the queue size and discard probability are tracking the effective equi-
librium point as is observed in Figs. 2, 3, 4 and 5, which represent the evolution from
initial values: nð0Þ ¼ ½ 10 10 10 10 10 10 T .

Fig. 1. Random disturbance.

200 N. El Fezazi et al.

Fig. 2. Variation of queue over average value (with proposed controller).

Fig. 3. Variation of discard probability over average value (with proposed controller).

The derivative converging to equilibrium point implies that the input rate of the
flows to the router matches the link capacity, so the router queue level is maintained. If
the input rate were lower than the link capacity, then the queue starts to drain, making
the derivative negative and the marking probability gets correspondingly reduced.
Then, these results show that the proposed controller provide good trajectory tracking
performance. Moreover, from Figs. 2, 3, 4 and 5 we can see that when the queue sizes
become large, the probabilities of the packet marking/dropping become less random
and the maximum values become small. It is difficult to compare the obtained results
with the previous works, because this one is the unique that threat the AQM problem
by explicitly allowing different time delays for multiple traffic classes with input sat-
uration, which was not considered before.
 Anti-windup Compensation in TCP/IP Routers 201

Fig. 4. Variation of queue over average value (without proposed controller).

Fig. 5. Variation of discard probability over average value (without proposed controller).

As a summary, we can conclude that the proposed method solves the AQM
problem on TCP/IP network that allowing 3 different traffic classes traversing a con-
gested router, where the controller with the proposed anti-windup strategy improves the
control performance providing a fast convergence and adequate stability properties.
202 N. El Fezazi et al.

6 Conclusion

This paper treated the congestion control problems of TCP/IP networks in the presence
of several classes of traffic. Based on the use of a Lyapunov functional, a generalized
sector condition and free weighting matrices, we propose delay dependent LMI con-
ditions for the synthesis of a dynamic controller that stabilizes the saturated system
where the available link bandwidth is modeled as a disturbance. Optimization algo-
rithms were then formulated to find anti-windup gains that either maximize an estimate
of the domain of attraction or ensure a minimum disturbance attenuation performance c
for a given set of admissible initial states. A numerical example illustrates our results.
With the present work we are able to consider for first time a control theory approach
for the AQM problem on TCP/IP router that allows multi class AQM in the presence of
saturations, improving the state of the art in this matter.

Acknowledgements. We would like to thank Prof. Tadeo for many helpful discussions and
Eng. Binotti for providing assistance with the software.

References
1. Hollot, C.V., Misra, V., Towsley, D., Gong, W.B.: Analysis and design of controllers for
AQM routers supporting TCP flows. IEEE Trans. Automat. Control 47(6), 945–959 (2002)
2. Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance.
IEEE/ACM Trans. Netw. 1(4), 397–413 (1993)
3. Hollot, C.V., Misra, V., Towsley, D., Gong, W.B.: A control theoretic analysis of RED. In:
Proceedings of the 20th IEEE International Conference on INFOCOM, Alaska, USA, vol. 3,
pp. 1510–1519 (2001)
4. Misra, C., Gong, W.B., Towsley, D.: Fluid-based analysis of a network of AQM routers
supporting TCP flows with an application to RED. In: Proceedings of the 19th IEEE
International Conference on SIGCOMM, Stockholm, Sweden, vol. 30, no. 4, pp. 151–160
(2000)
5. Alvarez, T.: Design of PID controllers for TCP/AQM wireless networks. In: Proceedings of
the World Congress on Engineering, vol. 2, pp. 1–8 (2012)
6. Melchor-Aguilar, D., Niculescu, S.I.: Computing non-fragile PI controllers for delay models
of TCP/AQM networks. Int. J. Control 82(12), 2249–2259 (2009)
7. Bender, F.A.: Delay dependent antiwindup synthesis for time delay systems. Int. J. Intell.
Control Syst. 18(1), 1–9 (2013)
8. Binotti, V., Bender, F.A.: On the timing of anti-windup compensation. Asian J. Control 18,
1–9 (2015)
9. El Fezazi, N., El Haoussi, F., Tissir, E.H., Tadeo, F.: Delay dependent anti-windup synthesis
for time-varying delay systems with saturating actuators. Int. J. Comput. Appl. 111(1), 1–6
(2015)
10. El Fezazi, N., El Haoussi, F., Tissir, E.H., Alvarez, T., Tadeo, F.: Robust stabilization using
LMI techniques of neutral time-delay systems subject to input saturation. J. Phys.: Conf. Ser.
783(1), 012031 (2017). IOP Publishing, Lille, France
11. El Fezazi, N., El Haoussi, F., Tissir, E.H., Alvarez, T.: Design of robust H∞ controllers for
congestion control in data networks. J. Franklin Inst. 354(17), 7828–7845 (2017)
 Anti-windup Compensation in TCP/IP Routers 203

12. El Fezazi, N., El Haoussi, F., Tissir, E.H., Alvarez, T., Tadeo, F.: Control based on saturated
time-delay systems theory of mach number in wind tunnels. Circ. Syst. Sig. Process. 37(4),
1505–1522 (2017)
13. El Fezazi, N., El Haoussi, F., Tissir, E.H., Alvarez, T., Tadeo, F.: Robust stabilization using
a sampled-data strategy of uncertain neutral state-delayed systems subject to input
limitations. Int. J. Appl. Math. Comput. Sci. 28(1), 111–122 (2018)
14. Tarbouriech, S., Da Silva, J.M.G., Garcia, G.: Delay-dependent anti-windup strategy for
linear systems with saturating inputs and delayed outputs. Int. J. Robust Nonlinear Control
14(7), 665–682 (2004)