A Theory of Fault-Tolerant Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Many-to-one packet routing on the mesh
CSC '91 Proceedings of the 19th annual conference on Computer Science
Many-to-One Packed Routing via Matchings
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Congestion control and fairness for many-to-one routing in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
| Hi-index | 0.00 |
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. Usual forwarding techniques based on destination address (like IP) induce many-to-one connections. Thus, if a dependable connection is needed, all primary paths and protections having the same destination must be established in a coordinated way. Otherwise, loops may be established. 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.