Minimal selectors and fault tolerant networks

In this paper we study a combinatorial optimization problem arising from on-board networks in satellites. In these kind of networks the entering signals (inputs) should be routed to amplifiers (outputs). The connections are made via expensive switches with four links available. The paths connecting inputs to outputs should be link-disjoint. More formally, we call (p, λ, k)−network an undirected graph with p + λ inputs, p + k outputs and internal vertices of degree four. A (p, λ, k)−network is valid if it is tolerant to a restricted number of faults in the network, i.e. if for any choice of at most λ faulty inputs and k faulty outputs, there exist p edge-disjoint paths from the remaining inputs to the remaining outputs. In the special case λ = 0, a (p, λ, k)−network is already known as a selector. Our optimization problem consists of determining N(p, λ, k), the minimum number of nodes in a valid (p, λ, k)−network. For this, we present validity cer-tificates and a quasi-partitioning technique from which we derive lower bounds for N(p, λ, k). We also provide constructions, and hence upper bounds, based on expanders. The problem is very sensitive to the order of λ and k. For instance, when λ and k are small compared to p, the question reduces to the avoidance of certain forbidden local configurations. For larger values of λ and k, the problem is to find graphs with a good expansion property for small sets. This leads us to introduce a new parameter called α-robustness. We us

Minimal Selectors and Fault Tolerant Networks

In this paper we study a combinatorial optimization problem arising from on-board networks in satellites. In these kinds of networks the entering signals (inputs) should be routed to amplifiers (outputs). The connections are made via expensive switches with four available links. The paths connecting inputs to outputs should be link-disjoint. More formally, we call a (p, λ, k)−network an undirected graph with p + λ inputs, p + k outputs and internal vertices of degree four. A (p, λ,k)−network is valid if it is tolerant to a restricted number of faults in the network, i.e., if, for any choice of at most λ faulty inputs and k faulty outputs, there exist p edge-disjoint paths from the remaining inputs to the remaining outputs. Our optimization problem consists in determining N(p, λ, k), the minimum number of vertices in a valid (p, λ, k)−network. We present validity certificates and a quasi-partitioning technique from which we derive lower bounds for N(p, λ, k). We also provide constructions, and hence upper bounds, based on expanders. The problem is shown to be sensitive to the order of λ and k. For instance, when λ and k are small compared to p, the question reduces to the avoidance of some forbidden local configurations. For larger values of λ and k, the problem is to find graphs with a good expansion property for small sets. This leads us to introduce a new parameter called α-robustness. We use α-robustness to generalize our constructions for larger values of k and λ. In many cases, we provide asymptotically tight bounds for N(p, λ, k)