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.
Appendix A<br />
Algorithm Implementation<br />
The numerical results presented in this thesis are obtained using the simulation tool J-Sim<br />
ver. 1.3 [34] and the Mo<strong>de</strong>ling Language for Mathematical Programming (AMPL) [35].<br />
In our work, we have proposed four algorithms for dynamic bandwidth allocation:<br />
• Simple Dynamic Bandwidth Allocation (SDBA) algorithm;<br />
• Iterative Dynamic Bandwidth Allocation (IDBA) algorithm;<br />
• Optimum Bandwidth Allocation (OBA) algorithm;<br />
• I<strong>de</strong>al Bandwidth Allocation (IBA) algorithm.<br />
We recall that all these algorithms proceed in two main steps:<br />
• First, bandwidth is allocated to all active connections trying to match their near-<br />
term traffic requirements that are predicted based on statistics collected by ingress<br />
routers.<br />
• Second, the spare bandwidth as well as the bandwidth left unused by idle and active<br />
connections is individuated on each link. Such available extra-bandwidth is allocated<br />
with guarantee during the current update interval exclusively to connections that can<br />
take advantage of it since they are already fully exploiting their subscribed rate.<br />
93