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

More documents

Recommendations

Info

A.2.3 Implementation of the Dynamic Bandwidth Allocation algorithms In this Section, we describe in some detail the principal phases of our bandwidth allocation algorithms implementation. First, we created the network topology and we implemented the CST tables along with a set of traffic monitors and traffic conditioners (token buckets) at ingress routers. The basic role of traffic monitors is to perform online measurements on the incom- ing traffic flows. These measurements are then collected and exchanged between ingress routers to update the CST tables, accordingly, with the state information regarding each connection. It should be clarified that the CST table, implemented at each ingress router, contains the state information concerning all connections offered to the network. In effect, each ingress router updates the CST table with the state information regarding connections that enter the network through it and then exchanges update messages with other ingress routers to maintain the state information regarding all the connections of the network. On the other hand, token buckets are used to regulate each connection sending rate according to the allocated bandwidth computed by our bandwidth allocation algorithm. Each link in the network, along with the correspondent parameters (the maximum capacity, the residual capacity, etc.) is implemented in the Java class OneLink.java. The set of links are implemented in a table named LinksTable, where each element corresponds to one instance of the Java class OneLink.java. Every update interval (i.e. Tu seconds), the proposed bandwidth allocation algorithms proceed as follows: • CST tables implemented in ingress routers are updated with the current actual information concerning all connections entering the network. This information derives from the statistics gathered by ingress routers. Table A.2 shows how the CST table 98
(CSTtable) is updated by the ingress router (IngressRouter). • At this phase, we distinguish between the four bandwidth allocation algorithms (SDBA, IDBA, OBA and IBA). – SDBA takes as input the updated CST table, the LinksTable table and the routing matrix, and then outputs the bandwidth allocations associated to the connections listed in the CST table. The bandwidth allocation values calculated by SDBA are communicated to token buckets installed at ingress routers to regulate the sources’ sending rate. Note that, Table A.1 has shown a general case for updating the CST table tak- ing into account the connections’ offered rate. These latters are not considered during SDBA execution, differently from IDBA presented hereafter. – IDBA iterates over SDBA considering also the connections’ offered rates that are updated (see Table A.2), in the previous phase, based on the measurements performed by the traffic monitors. We recall that with IDBA a connection can- not be assigned a bandwidth higher than its offered rate. Thus, IDBA can exploit more efficiently network resources achieving further gains than SDBA, in terms of network revenue. – OBA is implemented by exploiting the important feature of Java that allows to call external programs during execution. OBA takes all the inputs considered by IDBA, as well as some setting parameters and translates all these to an environment comprehensible by AMPL. At this stage, AMPL is called by OBA through an external program using the Java method getRuntime().exec(String[]). Table A.3 explains in some detail how AMPL is called by OBA.java, which is the Java class that implements OBA. 99
Page 1 and 2:
Thèse de Doctorat de l’universit
Page 3 and 4:
To my family.
Page 5 and 6:
Abstract Efficient dynamic resource
Page 7:
Acknowledgements I would like to th
Page 10 and 11:
4.2 Connections Classification . .
Page 13 and 14:
Résumé delaThèse 1. La probléma
Page 15 and 16:
supérieure sur les performances qu
Page 17 and 18:
compte les fonctions d’utilité d
Page 19 and 20:
(Policy Decision Point), d’un ens
Page 21 and 22:
ligne pour individualiser la bande
Page 23 and 24:
6. Nous proposons trois algorithmes
Page 25 and 26:
appelons débit de crête. Six sour
Page 27 and 28:
6. Conclusion générale et Perspec
Page 29 and 30:
Chapter 1 Introduction The Internet
Page 31 and 32:
upper bounds to the performance ach
Page 33 and 34:
Chapter 2 Dynamic Bandwidth Allocat
Page 35 and 36:
Utility Function Types In a multi-a
Page 37 and 38:
comes smaller than the application
Page 39 and 40:
of which there exist extensive theo
Page 41 and 42:
allows us to allocate the bandwidth
Page 43:
Shenker in [10] states that the net
Page 46 and 47:
implements such service model by pe
Page 48 and 49:
considering different constraints l
Page 50 and 51:
4.1 Problem Statement Let us model
Page 52 and 53:
y all network users. Using the nota
Page 54 and 55:
in the following Section. The struc
Page 56 and 57:
Optimum Bandwidth Allocation Algori
Page 58 and 59:
Table 5.1: Pseudo-code specificatio
Page 60 and 61: of all greedy connections that are
Page 63 and 64: Chapter 6 Mathematical Model This C
Page 65 and 66: 1 2 3 4 0000000000 1111111111 00000
Page 67 and 68: Chapter 7 Numerical Results The mai
Page 69 and 70: the two core nodes is equal to 6 Mb
Page 71 and 72: Total Accepted Load (Mb/s) 6 5.5 5
Page 75 and 76: plottedinFigure7.9. Figures 7.10 an
Page 77 and 78: Total Accepted Load (Mb/s) 6 5 4 3
Page 79 and 80: S 2 S 3 S 4 1 S 6 S1 S5 2 3 4 5 D 1
Page 81 and 82: high network loads, where it achiev
Page 83 and 84: proposed allocation algorithms in a
Page 85 and 86: Table 7.3: Peak rate, subscribed ra
Page 87 and 88: Chapter 8 Performance Upper Bound T
Page 89 and 90: Table 8.1: Average performance gain
Page 93 and 94: Total Accepted Load (Mb/s) 6 5 4 3
Page 95 and 96: Chapter 9 Conclusion 9.1 Discussion
Page 97: established by creating a session i
Page 100 and 101: [7] F. P. Kelly, “Charging and ra
Page 102 and 103: [26] P. Reichl, S. Leinen, and B. S
Page 105 and 106: Appendix A Algorithm Implementation
Page 107 and 108: these latters are implemented using
Page 109: • boolean State: the connection s
Page 113 and 114: Table A.2: Java code for updating t
Page 115 and 116: List of Acronyms ACA Autonomous Com
Page 117 and 118: List of Figures 1 Notre architectur
Page 119 and 120: 8.1 Performance upper bound for all
Page 121: List of Tables 5.1 Pseudo-code spec
show all

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

Create successful ePaper yourself

Delete template?

Save as template?