30
no
re
ne
on
ter
th
re
be
m
va
de
re
pe
co
nu
di
0 Software Ne
orthbound an
elease of Ope
F
The contro
ecessary for
ne of the mo
rm denotes a
he data plane
eceived, whic
e sent throug
more specifica
alid during p
etermine the
equirements.
eak times, w
ommon path
umber of
iagrammatica
etworks
nd southbou
enDaylight h
Figure 2.11. T
oller contain
the proper o
ost importan
algorithms w
e. This modu
ch nodes in t
gh. This dec
ally, the user
peak hours.
e most appr
Load balan
we need to ch
s so as to be
intermediary
ally in Figure
und interface
hereinafter.
The control lay
ns modules
operation of t
nt is that of
which determ
ule must deci
the network i
ision should
r application
During othe
ropriate path
ncing becom
hannel as ma
e able to shu
y nodes. T
e 2.12.
es. We shall
yer and its inte
that handle
the network.
a “load bala
mine the best
ide, on the b
infrastructure
d optimize th
ns. Load bala
er times, the
hs, on the b
mes load unb
any streams
ut down the
This functio
l describe th
erfaces
different fu
Of these fu
ancer”. In fa
t paths to fo
basis of the s
e the packets
he user dema
ancing is ess
load balanc
basis of the
balancing: un
as possible
maximum p
on is repr
he latest
unctions
unctions,
fact, this
ollow on
statistics
s should
ands or,
sentially
cer must
e users’
nlike at
through
possible
resented
www.it-ebooks.info