Efficient Protection of Many-to-One Communications

Miklos Molnar (1, 2) , Alexandre Guitton (1) , Bernard Cousin (3, 1, 4) , Raymond Marie (1, 4)

1 ARMOR - Architectures and network models
2 INSA Rennes - Institut National des Sciences Appliquées - Rennes
3 Inria Rennes – Bretagne Atlantique
4 UR - Université de Rennes

The dependability of a network is its ability to cope with failures , i.e., to maintain established connections even in case of failures. IP routing protocols (such as OSPF and RIP) do not fit the dependability objectives of today applications. Moreover, forwarding techniques based on destination address (like IP) induce many-to-one connections. If a dependable connection is needed, all primary paths and protections having the same destination must be established in a coordinated way. In this paper, we propose a fault recovery for many-to-one connections based on a cold (preplanned) protection. The main advantage of our approach is that the recovery in case of failures is achieved within a short delay. Additionally, with respect to other approaches, the dependability of the routing scheme is increased in the way that it statistically copes with many failures. The algorithm we propose computes an efficient backup for an arbitrary primary tree using an improved multi-tree algorithm.

Mots clés: fault-tolerant routing; many-to-one communications; network protection; multi-tree algorithm; networking

Domaines: Réseaux et télécommunications [cs.NI]

Miklos Molnar, Alexandre Guitton, Bernard Cousin, Raymond Marie. Efficient Protection of Many-to-One Communications. 5th European Dependable Computing Conference (EDCC'05), Apr 2005, Budapest, Hungary. pp.363-378, ⟨10.1007/11408901_27⟩. ⟨hal-01184257⟩