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

More documents

Recommendations

Info

Table 5.1: Pseudo-code specification of the Simple Dynamic Bandwidth Allocation algorithm (SDBA) Algorithm SDBA(Kg, Rl, a l k ) (1) initiate all f n (2) k =0, ∀ k ∈ Kg remove from the link set L all links l ∈ L that have a number of connections crossing them nl equal to 0 (3) for every link l ∈ L, calculateFl = Rl/nl (4) identify the link α that minimizes Fα i.e. α | Fα = mink(Fk) (5) set f n k = Fα, ∀ k ∈ Kα, whereKα⊆Kgis the set of greedy connections that cross link α (6) for every link l, update the residual capacity and the number of crossing greedy connections as follows: Rl = Rl − nl = nl − k∈Kα f n k · al k k∈Kα al k (7) remove from set L link α and those that have nl =0 (8) if L is empty, then stop; else go to Step (3) at the beginning of the first iteration of IDBA. For every successive iteration, a greedy connection can be either marked as Served, when its total assigned rate (srk + f n k )isat least equal to its offered load, or Non-served otherwise. Let K NS g and K S g of greedy Non-served and Served connections respectively. denote the set IDBA iterates over the two following steps until either all sources become Served or the extra-bandwidth on the bottleneck links is completely allocated: • First, the extra-bandwidth individuated in the network is allocated fairly among the Non-served greedy connections using SDBA(K NS g , Rl, a l k ). • Second, for every Non-served greedy connection, k ∈ K NS g if srk + f n k >Oln−1 k r n k is set equal to Oln−1 k then and the connection is classified as Served; the difference, srk + f n k − Oln−1 k , is redistributed in the next iteration to the remaining Non-served greedy connections. 46
Table 5.2: Pseudo-code specification of the Iterative Dynamic Bandwidth Allocation algorithm (IDBA) Algorithm IDBA(Kg, Ol n−1 k , Rl, al k ) (1) initiate K NS g = Kg (2) run SDBA(K NS g ,Rl,a l k ), then set f n k (3) set N NS g,b =0, where N NS g,b , k ∈ KNS g represents the number of bottlenecked connections among the set of greedy Non-served connections, K NS g (4) for every connection k ∈ K NS g , if(srk + f n k
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 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 and 110:
• boolean State: the connection s
Page 111 and 112:
(CSTtable) is updated by the ingres
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 ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?