OPTIMAL REPLICA ALLOCATION FOR TTP/C BASED SYSTEMS

摘要

In this study we show how one can use Fault-Tolerant Units (FTU) in an optimal way to make a TTP/C network robust to bursty random perturbations. We consider two possible objectives corresponding to well defined situations of the field of fault-tolerance. 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. 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.