Optimizing the configuration of X-by-Wire networks using word combinatorics - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Optimizing the configuration of X-by-Wire networks using word combinatorics

Nicolas Navet
  • Fonction : Auteur
  • PersonId : 830599
Bruno Gaujal

Résumé

we show how one can use Fault-Tolerant Units (FTU) in an optimal way to make a TDMA network robust to bursty random perturbations. We consider two possible objectives. If one wants to minimize the probability of losing all replicas of a given message, then the optimal policy is to spread the replicas over time. This is proved using convexity properties of the loss probability. On the contrary if one wants to minimize the probability of losing at least one replica, then the optimal solution is to group all replicas together. This is proved by using majorization techniques. Finally we show how these ideas can be adapted for the TTP/C protocol.
Fichier non déposé

Dates et versions

inria-00100137 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00100137 , version 1

Citer

Nicolas Navet, Bruno Gaujal. Optimizing the configuration of X-by-Wire networks using word combinatorics. EPFL Network Calculus Group Seminar, 2004, Lausanne/Suisse. ⟨inria-00100137⟩
67 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More