The proposed AC algorithm(5/5)
Let u be a new user requesting
admission for a connection from source s to destination d carrying a traffic rate X and with QoS constraint qv(u). Suppose also that the
network is currently carrying other users z, any one of which will be generically
represented by some QoS constraint qw(z).
ØFind the set of known paths P(s,d). If it is empty, send SPs
to discover paths. If unsuccessful, reject the request. Otherwise send probe
traffic at rate x along the network.
ØUse the probe traffic to obtain for each QoS metric w of
interest, including w=v, and for all concerned links (i,j). Some links will not be concerned by the probe
traffic so for that links we take .
ØThen compute
for all concerned links and all QoS metrics. For unconcerned links we
take
.
ØCompute
from (to be detailed
below) for all the QoS metrics of interest, including v.
ØIf
for all other current users z with source-destination pair (s',d') and QoS metric qv, then accept u; else reject the request.
