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

Nicolas Navet 1 Bruno Gaujal 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Type de document :
Communication dans un congrès
EPFL Network Calculus Group Seminar, 2004, Lausanne/Suisse, 2004
Liste complète des métadonnées

https://hal.inria.fr/inria-00100137
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:14:31
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05

Identifiants

  • HAL Id : inria-00100137, version 1

Collections

Citation

Nicolas Navet, Bruno Gaujal. Optimizing the configuration of X-by-Wire networks using word combinatorics. EPFL Network Calculus Group Seminar, 2004, Lausanne/Suisse, 2004. 〈inria-00100137〉

Partager

Métriques

Consultations de la notice

131