Years and Authors of Summarized Original Work
2002; Fotakis, Spirakis
Problem Definition
This problem is concerned with the most efficient use of redundancy in load balancing on faulty parallel links. More specifically, this problem considers a setting where some messages need to be transmitted from a source to a destination through some faulty parallel links. Each link fails independently with a given probability, and in case of failure, none of the messages assigned to it reaches the destination. (This assumption is realistic if the messages are split into many small packets transmitted in a round-robin fashion. Then the successful delivery of a message requires that all its packets should reach the destination.) An assignment of the messages to the links may use redundancy, i.e., assign multiple copies of some messages to different links. The reliability of a redundant assignment is the probability that every message has a copy on some active link, thus managing to reach the...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Fotakis D, Spirakis P (2002) Minimum congestion redundant assignments to tolerate random faults. Algorithmica 32:396–422
Gasieniec L, Kranakis E, Krizanc D, Pelc A (1996) Minimizing congestion of layouts for ATM networks with faulty links. In: Penczek W, Szalas A (eds) Proceedings of the 21st international symposium on mathematical foundations of computer science. Lecture notes in computer science, vol 1113. Springer, Berlin, pp 372–381
Karger D (1999) A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM J Comput 29:492–514
Kleinberg J, Rabani Y, Tardos E (2000) Allocating bandwidth for bursty connections. SIAM J Comput 30:191–217
Lomonosov M (1974) Bernoulli scheme with closure. Probl Inf Transm 10:73–81
Toda S, Watanabe O (1992) Polynomial-time 1-turing reductions from #PH to #P. Theor Comput Sci 100:205–221
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Fotakis, D., Spirakis, P.(. (2016). Minimum Congestion Redundant Assignments. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_232
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_232
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering