Th`ese de Doctorat de l'université Paris VI Pierre et Marie Curie Mlle ...

Chapter 5
Dynamic Bandwidth Allocation
Algorithms
This Chapter provides three measurement-based bandwidth allocation algorithms that take
into account the traffic statistics measured online, links utilization and users’ utility func-
tions to allocate network resources dynamically and efficiently. First, we introduce the
Optimum Bandwidth Allocation (OBA) algorithm that allows to achieve the highest net-
work revenue taking into account users’ bandwidth utility functions. OBA assumes that
the utility function is known or can be estimated for every connection. Then extending
the max-min fair share algorithm introduced in [13], we propose two heuristic algorithms,
with increasing performance and complexity. The first algorithm is simple and named
Simple Dynamic Bandwidth Allocation (SDBA) algorithm, while the second algorithm it-
erates over the first taking into account sources’ offered loads, avoiding to waste bandwidth
and thus increasing network revenue. This latter is called Iterative Dynamic Bandwidth
Allocation (IDBA) algorithm.
Initially, OBA, SDBA and IDBA need to perform the connections’ classification de-
scribed in Section 4.2 and then proceed in two main steps, where the first step is in
common, while the second step differs for each algorithm. These two steps are described
41