Dimensionnement de réseaux virtuels de télécommunications
Sébastien Choplin · HAL (Le Centre pour la Communication Scientifique Directe) · 2002
This thesis deals with virtual telecommunication networks design. In chapter 1, we briefly present the technology of the studied networks. Chapter 2 is devoted to the modelization of the telecommunication networks using the graph theory. Chapters 3 and 4 deal with the Virtual Path Layout problem which consists in finding a graph having given properties such as its embedding in a given graph has a minimum congestion. For trees, we give polynomial algorithms allowing to find an optimal solution when the maximum hop count is fixed. In chapter 5 we introduce an optical extension of this model. Chapter 6 is devoted to hierarchical ring networks. The problem which consists in the maximization of the number of nodes of such a structure having a given diameter is solved. In chapter 7, we study an optimization problem involved in the pricing of a SDH loop.