Th`ese de Doctorat de l'université Paris VI Pierre et Marie Curie Mlle ...
Th`ese de Doctorat de l'université Paris VI Pierre et Marie Curie Mlle ...
Th`ese de Doctorat de l'université Paris VI Pierre et Marie Curie Mlle ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Chapter 7<br />
Numerical Results<br />
The main goal of our bandwidth allocation algorithms is to offer services that satisfy the<br />
QoS requirements of individual users while guaranteeing at the same time an efficient<br />
utilization of n<strong>et</strong>work resources.<br />
In this Chapter we compare the performance of the proposed dynamic bandwidth allo-<br />
cation algorithms illustrated in Chapter 5 with a static provisioning strategy, referring to<br />
different n<strong>et</strong>work scenarios to cover a wi<strong>de</strong> range of possible environments. The simulation<br />
tool we used was J-Sim simulator version 1.3 [34]. Furthermore, to solve the utility maxi-<br />
mization problem in OBA and IBA, we use AMPL (A Mo<strong>de</strong>ling Language for Mathematical<br />
Programming) [35].<br />
Note that our proposed service mo<strong>de</strong>l is novel and different from all those referred<br />
in Chapter 2. Therefore, since it is impossible to compare our approach to the dynamic<br />
provisioning schemes presented in the literature, in this Chapter we performed a comparison<br />
with the static provisioning technique, which consists in assigning to each source k its<br />
subscribed rate srk.<br />
55