Documente Academic
Documente Profesional
Documente Cultură
1 ≤ i ≤ M ,1 ≤ j ≤ N , ∑ aij ≤ 1. (2)
Notation Description i =1
M
V a set of all switch nodes As can be seen from the condition ∑a
i =1
ij ≤1 ,
E a set of links between switches
the allocation is based on the flow. Namely, a
V′ a set of optimal residual network nodes
flow is assigned to at most one candidate path.
E′ a set of edge of optimal residual network
Definition 3: Optimal residual network Gr
Cr (euv ) Residual capacity of a network link euv
Given the network G = (V , E ) and flow
PVe Path vector of link e
request set FRV , the optimal residual net-
BU Bandwidth Utilization
w o r k f o r FRV : Gr = (V ′ , E ′ ) i s f o r m e d
CPS Candidate path set
by the top M optimal paths between
F Flow set in aggregated elephant flow Src _ DPID and Dst _ DPID of aggregated
FAM Flow allocation matrix elephant flow. The top optimal paths are
FRV Flow request vector found with k-shortest path algorithm[25].
e Edge e ∈ E E ′ = {euv ∈ V ′ × V ′ : Cr (u , v) > 0}
Whether the path i is selected by flow j Definition 4: The maximum feasible capac-
aij
(0 for not selected or 1 for selected) ity of the optimal residual network maxC (Gr )
Whether the link e belong to a path i The maximum feasible capacity of the op-
bi
(0 for not selected or 1 for selected) timal residual network indicates that the maxi-
get the maximum flow maxC (Gr ) . By defini- As CPS is the optimal path set, there is no
tion, it satisfies the max flow/min cut theory. other path in the network with more available
Definition 5: The maximum admitta- bandwidth than path in CPS . Therefore, the
ble flows in the optimal residual network flows are not admitable to the current network.
maxCaccept ( FRV ) 2 ) O p t i m i z a t i o n p ro b l e m f o r f l o w
scheduling: Existing objectives for traffic op-
A s s u m i n g ∀euv ∈ E ′ i f ∃ ∩ik=1 pathi = euv
timization are minimizing the maximum link
and 1 ≤ i, k ≤ M , pathi ∈ CPS , then these paths
utilization [27] and minimizing link cost [28].
intersect at the link euv . Then link euv be-
The latter may lead to uneven distribution of
longs to the path vector can be expressed
traffic in the network and traffic congestion
as a column vector of 1× M dimension
in the low cost path. The objective in our op-
PVe = [b1 , b2 , b3 ,bM ] .
timization problem is close to the first one.
uv
0, e ∈ pathi
bi = uv (3)
1, euv ∉ pathi
However, we consider that the variance of link
The maximum admittable flows utilization ratio is an important index of the
maxCaccept ( FRV ) are flows satisfying the fol- distribution of link bandwidth utilization as
lowing conditions opposed to the average link utilization and the
1) ( PVe × ( FAM × FRV )) / Cr (euv ) ≤ 1, ∀euv ∈ E ′ . maximum link utilization which are not suffi-
uv
M
cient to show the balance of the link utilization.
2) Maximizing ∑c
i =1
i1 ,∀ci1 ∈ FAM × FRV .
The smaller variance of link utilization, the
Condition 1 guarantees that the allocated closer utilization among links. Then, the over-
flow rate of the link is less than the avail- all utilization of the links is more balanced.
able bandwidth of the link. By definition, The higher link utilization, the higher packet
we can see that the maximum feasible flow loss rate of the link. Given the certain amount
is not necessarily the maximum admitta- of traffic, the balanced utilization of con-
ble aggregate flow. As shown in figure 2, gestion links produces lowest overall packet
the optimal residual network is composed loss rate. As a result, the overall performance
of the candidate optimal paths. The source and QoS of network are improved. Assume
is S1 , destination is S 4 , there are 4 routes ∀euv ∈ E ′ , BU=
uv ( PVe × ( FAM × FRV )) / Cr (euv ) ,
uv
∑ ( BU
i =1
− BU ) 2
i
the optimal candidate path can not meet all
D( BU ) = i =1
. Therefore, the
N −1 request of flows in the flow set.
objective of flow reallocation is to mini- 3) Chaos genetic algorithm to solve the
mize D( BU ) . optimization problem: Because the mathemat-
We form the optimization problem as fol- ical model (4) is a combinatorial optimization
lows: problem of NP hard (in particular, 0-1 integrat-
N
∑ ( BU i − BU ) 2
(4)
ed linear programming problem). The genetic
Minimize D( BU ) = i =1
algorithm is more suitable for combinatorial
N −1
optimization problem [30], and the crossover
subject to and mutation operators have typical combi-
M
nation features. In order to avoid the local
∑a i =1
ij ≤ 1,1 ≤ j ≤ N (Constr. 1)
optimal solution, we use the genetic algorithm
M
=∑ ci1 maxCaccept ( FRV ), ∀ci1 ∈ FAM × FRV based on chaotic map [31]. The parameters for
i =1
the algorithm are set as follows:
(Constr. 2)
Population number: popsize, each popula-
∑ f low(u, v) = 0
v∈V
(Constr. 3)
tion represents a distribution matrix;
Genetic times: GeneticNum;
Constraint 1 guarantees that each flow can N
∑ ( BU i − BU ) 2
only choose one path; Constraint 2 guarantees Fitness function: D( BU ) = i =1
h 11
h 12 e6:100 Mbps
S5 S6
h1 h8
e5:100 Mbps e10 :100 Mbps e4:100 Mbps
100 Mbps e3:100 Mbps
h2 e8:100 Mbps e9:100 Mbps
S1 S7 S4
e2:100 Mbps
… S2 S3
…
…
h7 h 13 h 14
1
h1, h 2 and h3 are 6.73Mbps, 6.82Mbps and ei belongs to, is expressed as follows:
0.988Mbps respectively, and flow rates from PVe = [1,0,1,0] , PVe = [1,0,1,0] , PVe = [1,0,0,0] ,
1 2 3
server h9 to h 4, h5, h6 and h7 are 6.8Mbps, PVe = [1,1,0,0] , PVe = [0,1,0,0] , PVe = [0,1,0,0] ,
4 5 6
8.68Mbps, 6.73Mbps and 0.165Mbps respec- PVe = [0,0,1,0] , PVe = [0,0,0,1] , PVe = [0,0,0,1]
7 8 9
tively. Table 2 shows the physical bandwidth The optimal residual network composed of
and residual bandwidth for each edge. The the candidate paths is shown in figure 4.
remaining bandwidth of edge e9 is 43.6Mbps, After the reallocation by our SDN-based
namely background traffic is 56.4Mbps. congestion-aware traffic scheduling algorithm
However total flow rate allocated by OSPF CATS, the flow allocation matrix FAM is as
is 36.913Mbps (where 6.73 + 0.165 + 0.988 follows:
+6.82 + 6.8 + 8.68 + 6.73 =36.913). As a re- 0 0 0 0 0 0 0
sult, the utilization rate of link e9 reaches up 0 0 0 1 1 0 0
to 93.3% ((36.913+56.4)/100). About 36.913% 0 1 1 0 0 1 0
of the physical bandwidth is occupied by 1 0 0 0 0 0 1
flows going from S1 to S4. Then, flows to X-axis represents 7 flows from servers
h1, h 2, h3, h 4, h5, h6, h7 are aggregated as an ag- to h7, h6, h5, h4, h3, h 2, h1 respectively. Y-axis
indicates path1 , path2 , path3 , path4 , where 0 in-
Table II Residual bandwidth in the backbone network dicates the path is not selected, and 1 indicates
Edge Residual bandwidth Physical bandwidth selected.
E1 55.5 100 As ECMP is a commonly used meth-
e2 55.5 100 od to balance the traffic in the data cen-
e3 37.1 100 ters, we use ECMP with 4 candidate paths
e4 53.4 100 path1 , path2 , path3 , path4 for comparison. We
e5 58 100 also compare the performance of the proposed
e6 57.7 100 algorithm with OSPF [34] which is based on
e7 48.5 100 Dijkstra’s algorithm. The experimental results
e8 64.3 100 of link utilization of all candidate paths are
e9 43.6 100 shown in figure 5. It can be seen from the fig-
ure, the variance of link utilization based on
traditional OSPF is high, indicating that the
link utilization is not balanced. Our algorithm
e6:57.7
57 Mbps
57.7
S5 S6
is triggered at 14th second when congestion
e5:58Mbpss e4:53.4Mbps
bps happened, and then it reduces the variance of
e3:37.1M
1Mbps link utilization. The variance of link utiliza-
e9:43.6Mbps
S1
e8:64.3Mbpss S4 tion based on OSPF, ECMP and CATS right
S7
after 14th second is 0.032125, 0.008803 and
e1:55.5Mbps
bps e7:48.5Mbps
bps
0.0036928 respectively. The link utilization
improved with our proposed algorithm . There
e2:55.5Mbpss
S2 S3 is no fully loaded link and no idle link with
our algorithm. The overall variance of link
Fig. 4 Optimal residual network utilization based on OSPF, ECMP and CATS
103
109
115
121
127
133
139
145
151
157
163
169
175
181
187
193
199
13
19
25
31
37
43
49
55
61
67
73
79
85
91
97
1
7
Time(Second)
utilization reaches up to 100% sometimes.
From figure 7, we can see packet loss rate
on link e9 with traditional OSPF algorithm, Fig. 5 Variance of link utilization of candidate paths
ECMP and CATS. Packet loss occurs most
often with OSPF routing algorithm. This is
because OSPF does not take into account the
1.2
current link state and traffic load balance. Our
proposed algorithm CATS performs best in
terms of packet loss rate. 1
The convergence of the chaotic genetic al-
gorithm that we proposed is shown in figure 8.
Bandwidth Utilization of Link e9
0.8
The algorithm converges after 1.5362 seconds
in the sixtieth generation with the utilization
variance of 0.0036928, which is close to the 0.6
121
127
133
139
145
151
157
163
169
175
181
187
193
199
115
13
19
25
31
37
43
49
55
61
67
73
79
85
91
97
1
7
Time(Second)
chain length L = 200 and cooling rate q = 0.9 .
As shown in figure 8, the simulated annealing
algorithm is close to the optimal solution after Fig. 6 Bandwidth link utilization of link e9
V. CONCLUSION
0.08
In this paper, we study the SDN based traffic
Packetloss rate of link from S12 to S10
engineering to improve the QoS for applica- 0.07
tions such as video streaming and video file
transferring. We propose traffic scheduling 0.06
No scheduling
120
127
134
141
148
155
162
169
176
183
190
197
204
113
Fig. 11 TCP packet loss rate of link from S12 to S10 before and after trac schedul-
ing
120
127
134
141
148
155
162
169
176
183
190
197
204
113