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

More documents

Recommendations

Info

per-flow bandwidth guarantee and then exploits the unused bandwidth individuated peri- odically in the network to propose short-term guaranteed extra-bandwidth to users who are willing to pay more to get a higher bandwidth. To implement our service model, we introduced a distributed dynamic resource provisioning architecture for quality of service networks and a set of control messages to provide interactions between network elements. In Chapter 4, we presented a precise statement of the bandwidth allocation problem, then we provided a utility-based definition of the network extra-revenue and finally we performed a connections classification based on traffic statistics gathered at ingress routers. In Chapter 5, we proposed a broad set of heuristic dynamic bandwidth allocation algorithms tailored to our proposed service model, with increasing complexity and performance. In Chapter 6, we introduced a novel mathematical model that assumes the exact knowl- edge of the future traffic offered to the network and extends the well known utility max- imization problem studied in [7] to include connections arrival-times and durations. Our model allows to provide bounds to the performance achievable by any online dynamic bandwidth allocation algorithm. Simulation results in Chapter 7 measured in realistic network scenarios showed that our allocation algorithms and service model allow to increase both resource utilization and network revenue with respect to static provisioning techniques. Further, in Chapter 8, we compared the performance of our bandwidth allocation algorithms to the bounds provided by the mathematical model. We have shown that these algorithms allow to increase consistently network revenue with respect to static provisioning schemes and approach, in several network scenarios, the upper bound provided by the mathematical model. 9.2 Future Research Issues In this thesis we have addressed the problem of dynamic bandwidth allocation considering a fixed routing strategy. We have assumed that each communication between a user pair is 84
established by creating a session involving a path that remains fixed throughout the user pair conversation duration. The session path choice method (i.e., the routing algorithm) has not been considered. In [7], the authors have addressed the problems of charging, rate control and routing for a communication network carrying elastic traffic. Therefore, we envisage to take into account the routing strategy to extend our work. The routing issue in dynamic bandwidth allocation should be studied carefully to achieve a higher network revenue while satisfying, at the same time, the individual users’ requirements. On the other hand, realizing flexible and efficient bandwidth allocation in wireless networks presents several technical challenges, including physical layer impairments, mobility and bandwidth mismatch between wireline and wireless networks. Physical layer impairments (e.g., co-channel interference, hidden terminals, path-loss, fast fading and shadowing) contribute toward time-varying error characteristics and time-varying channel capacity making the delivery of hard QOS guarantees unlikely. In addition, user mobility can trigger rapid degradation in the delivered service quality (e.g., during handoff). Hence, one important perspective of this thesis can be devoted to study the challenging points in wireless networks and extend our work to this area. 85
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: Chapter 9 Conclusion 9.1 Discussion
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 ...

Create successful ePaper yourself

Delete template?

Save as template?