# Efficient Redundant Assignments under Fault-Tolerance Constraints

@inproceedings{Fotakis1999EfficientRA, title={Efficient Redundant Assignments under Fault-Tolerance Constraints}, author={Dimitris Fotakis and Paul G. Spirakis}, booktitle={RANDOM-APPROX}, year={1999} }

We consider the problem of computing minimum congestion, fault-tolerant, redundant assignments of messages to faulty parallel delivery channels. In particular, we are given a set M of faulty channels, each having an integer capacity c i and failing independently with probability f i . We are also given a set of messages to be delivered over M, and a fault-tolerance constraint (1– e), and we seek a redundant assignment φ that minimize congestion Cong(φ), i.e. the maximum channel load, subject to…

## References

SHOWING 1-10 OF 14 REFERENCES

### Minimum Congestion Redundant Assignments to Tolerate Random Faults

- Computer ScienceAlgorithmica
- 2001

Both algorithms are based on computing a collection {K1, \ldots, Kν}of disjoint channel subsets such that, with probability no less than (1-ɛ) , at least one channel is active in each subset, and the objective is to maximize the sum of the minimum subset capacities.

### Minimizing Congestion of Layouts for ATM Networks with Faulty Links

- BusinessInt. J. Found. Comput. Sci.
- 1999

We consider the problem of constructing virtual path layouts for an ATM network consisting of a complete network K n of n processors in which a certain number of links may fail. Our main goal is to…

### A randomized fully polynomial time approximation scheme for the all terminal network reliability problem

- Mathematics, Computer ScienceSTOC '95
- 1995

This paper gives a fully polynomial randomized approximation scheme that, given any n-vertex graph with specified failure probabilities, computes in timePolynomial in n and $1/\epsilon$ an estimate for the failure probability that is accurate to within a relative error of $1\pm\ep silon$ with high probability.

### Fault-tolerant scheduling

- Computer ScienceSTOC '94
- 1994

This work gives nonclairvoyant algorithms (both deterministic and randomized) that have provably asymptotically optimal competitive ratios for the problems of minimizing the makespan and minimizing the average completion time (for static release times).

### Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

- Mathematics, Computer ScienceJACM
- 1975

An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum.

### Allocating bandwidth for bursty connections

- Computer ScienceSTOC '97
- 1997

This paper undertake the first study of statistical multiplexing from the perspective of approximation algorithms, and considers one of the most commonly studied models: that of two communicating nodes connected by a set of parallel edges, where the rate of each connection between them is a random variable.

### Computers and Intractability: A Guide to the Theory of NP-Completeness

- Computer Science
- 1978

The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.

### On a Dual Version of the One-Dimensional Bin Packing Problem

- Computer ScienceJ. Algorithms
- 1984

### Approximation Algorithms for NP-Hard Problems

- Computer ScienceSIGA
- 1997

This book reviews the design techniques for approximation algorithms and the developments in this area since its inception about three decades ago and the "closeness" to optimum that is achievable in polynomial time.

### The Complexity of Enumeration and Reliability Problems

- Mathematics, Computer ScienceSIAM J. Comput.
- 1979

For a large number of natural counting problems for which there was no previous indication of intractability, that they belong to the class of computationally eqivalent counting problems that are at least as difficult as the NP-complete problems.