Skip to Main content Skip to Navigation
Theses

Méthodes de partitionnement de graphes pour la conception d'architectures de réseaux locaux

Abstract : The choice of topology of a communication network is a fundamental factor during the designing phase. Nowadays the topological definition of the network and its cabling plan is done in an empirical way according to the knowledge of the network expert. Thus we propose some of algorithms enabling to find an optimal topology according the volume of exchanges between the End-points (users). Two approaches are proposed according to the kinds of applications. The first one attempts to study the plans of cabling of the industrial networks. Some algorithms based on the spectral techniques of graph partitioning are proposed. The second one concerns the optimization of the design offices network topology. An analysis, of the working processes of the company, based on the metrical techniques (DSM: Design Structure Matrix) is realized. The obtained results are analyzed by means of a networks simulation tool in order to prove the interests of our propositions.
Document type :
Theses
File URL :
http://docnum.univ-lorraine.fr/prive/SCD_T_2002_0285_ADOUD.pdf
Complete list of metadatas

https://hal.univ-lorraine.fr/tel-01746873
Contributor : Thèses Ul <>
Submitted on : Thursday, March 29, 2018 - 10:46:41 AM
Last modification on : Thursday, October 15, 2020 - 3:22:47 PM

Identifiers

  • HAL Id : tel-01746873, version 1

Collections

Citation

Houssein Adoud. Méthodes de partitionnement de graphes pour la conception d'architectures de réseaux locaux. Autre [cs.OH]. Université Henri Poincaré - Nancy 1, 2002. Français. ⟨NNT : 2002NAN10285⟩. ⟨tel-01746873⟩

Share

Metrics

Record views

17