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

More documents

Recommendations

Info

To implement these two steps, it is necessary to have an accurate information regarding all connections entering the network. More specifically, at the beginning of each update interval, our algorithms need to know the state of each connection and its actual sending rate. To this end we installed traffic monitors at each ingress router to perform online mea- surements on the incoming traffic flows, and we implemented a table, named Connections’ State Table (CST), that contains the state information concerning all connections. The J-Sim network simulation package (drcl.inet) offers the basic classes defined in the abstract network model. Therefore, to augment the ingress router elements with the key features mentioned above, we extended the drcl.inet package to implement the CST table and traffic monitors. The structure of this Chapter is the following: Section A.1 describes in some detail AMPL, and Section A.2 provides a brief description of our extensions to J-Sim existing classes, including the CST table and dynamic bandwidth allocation algorithms implementation. A.1 AMPL: A Modeling Language for Mathematical Programming AMPL is an algebraic modeling language for linear and nonlinear optimization problems, in discrete or continuous variables. Developed at Bell Laboratories, AMPL allows to formulate optimization models and examine solutions, while the computer manages communication with an appropriate solver. AMPL’s flexibility and convenience make it ideal for rapid prototyping and model development, while its speed and control options make it an efficient choice for repeated production runs. For more details, the reader can refer to [35]. As described in the previous Chapters, the two algorithms OBA and IBA are based on a mathematical formulation of the network revenue maximization problem. Therefore, 94
these latters are implemented using AMPL along with J-Sim simulator. The way in which AMPL is used is described briefly in the following. A.2 J-Sim Simulator Extensions J-Sim is presented in [37] as an open, component-based, compositional simulation environment, proposed in the frame of research cooperation between the Ohio State University and the University of Illinois at Urbana-Champaign, and built in Java upon the notion of the autonomous component architecture (ACA). The behaviors of the J-Sim components are defined in terms of contracts and can be individually designed, implemented, tested, and incrementally deployed in a software system. A system can be composed of individual components in much the same way a hardware module is composed of Integrated Circuits chips. Moreover, components can be plugged into a software system, even during execution. This makes J-Sim a platform- neutral, extensible, and reusable environment. J-Sim also provides a script interface to allow integration with different script languages such as Perl, Tcl or Python. A fully integrated J-Sim with a Java implementation of the Tcl interpreter (with the Tcl/Java extension) already exists and is called Jacl. So, similar to NS-2, J-Sim is a dual-language simulation environment in which classes are written in Java (for NS-2, in C++) and “glued” together using Tcl/Java. However, all the public classes/methods/fields in Java can be accessed naturally in the Tcl environment without the need to export them to the Tcl environment as required in NS-2. This component-based architecture makes it possible to compose different simulation scenarios, for different networks’ architectures, from a set of basic components and classes proposed by J-Sim and/or defined by the user. 95
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: Appendix A Algorithm Implementation
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?