01.07.2013 Views

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 ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

7.1 Performance M<strong>et</strong>rics<br />

We consi<strong>de</strong>r the following performance m<strong>et</strong>rics: the average accepted load and n<strong>et</strong>work<br />

extra-revenue.<br />

The average accepted load is obtained averaging the total load accepted in the n<strong>et</strong>work<br />

over all the bandwidth update intervals, while the average n<strong>et</strong>work extra-revenue has been<br />

<strong>de</strong>fined in Section 4.3. We recall, hereafter, the <strong>de</strong>finition of n<strong>et</strong>work extra-revenue:<br />

where srk and b n k<br />

<br />

Uk(b n k) − Uk(srk)<br />

k∈Kg<br />

represent, respectively, the subscribed rate and the average transmission<br />

rate in the n − th update interval for all greedy connections k ∈ Kg, andUk(x) mo<strong>de</strong>lsthe<br />

perceived utility of the k − th user for an allocation of x bandwidth units.<br />

7.2 N<strong>et</strong>work Scenarios<br />

We refer to four n<strong>et</strong>work scenarios ranging from a single-bottleneck topology to a complex<br />

core n<strong>et</strong>work topology to evaluate the performance of our proposed bandwidth allocation<br />

algorithms. All numerical results have been calculated over long-lived data exchanges,<br />

achieving very narrow 95% confi<strong>de</strong>nce intervals [36].<br />

7.2.1 Single-Bottleneck Scenario<br />

In this scenario we gauge the effectiveness of the proposed traffic-based bandwidth allo-<br />

cation algorithms. We consi<strong>de</strong>r, in line with [1, 2], the scenario illustrated in Figure 7.1,<br />

that consists of a single-bottleneck with 2 core no<strong>de</strong>s, 6 access no<strong>de</strong>s, 40 end no<strong>de</strong>s (20<br />

source-<strong>de</strong>stination pairs) and traffic conditioners at the edge. Each ingress conditioner is<br />

configured with one profile for each traffic source, and drops out-of-profile pack<strong>et</strong>s. All links<br />

are full-duplex and have a propagation <strong>de</strong>lay of 1 ms. The capacity of the link connecting<br />

56

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!