The effect of faults on network expansion

Theory of Computing Systems

Volumn 39, Issue 6, 2006, Pages 903-928

  Bagchi, Amitabha ^a   Bhargava, Ankur ^b   Chaudhary, Amitabh ^c   Eppstein, David ^d   Scheideler, Christian ^e  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b GOOGLE INC   (United States)

^c UNIVERSITY OF NOTRE DAME   (United States)

^d Irvine   (United States)

^e TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED COMPONENT; D-DIMENSIONAL MESH; FAULT PROBABILITIES; NETWORK EXPANSION; PRUNING TECHNIQUES; RANDOM FAULTS; RESILIENT NETWORKS; UNIFORM EXPANSION;

ELECTRIC ARC WELDING; PROBABILITY;

EXPANSION;

EID: 33845285547     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1349-0     Document Type: Conference Paper

References (32)

1. M. Ajtai, J. Komlós, and E. Szemerédi. Largest random component of a k-cube. Combinatorioa, 2(1):1-7, 1982.
2. N. Alon and F.R.K. Chung. Explicit construction of linear sized tolerant networks. Discrete Math, 72:15-19, 1989.
3. A. Anagnostopoulos, A. Kirsch, and E. Upfal. Load balancing in arbitrary network topologies with stochastic adversarial input. SIAM Journal on Computing, 34(3):616-639, 2005.
4. O. Angel, I. Benjamini, E. Ofek, and U. Wieder. Routing complexity of faulty networks. In Pioc. of the 24th Annu. ACM Symp. on Principles of Distributed Computing (PODC '05), pages 209-217, 2005.
5. E. Anshelevich, D. Kempe, and J. Kleinberg. Stability of load balancing algorithms in dynamic adversarial systems. In Proc. of the 34th ACM Symp. on Theory of Computing (STOC), 2002.
6. S. Arora, S.B. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proc. of the 36th Annu. ACM Symp. on Theory of Computing, pages 222-231, 2004.
7. M. Ben-Or and D. Ron. Agreement in the presence of faults, on networks of bounded degree. Information Processing Letters, 57(6):329-334, 1996.
8. B. Bollobas. The evolution of random graphs. Transactions of the AMS, 286:257-274, 1984.
9. R.J. Cole, B.M. Maggs, and R.K. Sitaraman. Multi-scale self emulation: a technique for reconfiguring arrays with faults. In Proc. of the 25th ACM Symp. on Theory of Computing (STOC), pages 561-572, 1993.
10. R.J. Cole, B.M. Maggs, and R.K. Sitaraman. Routing on butterfly networks with random faults. In Proc. of the. 36th IEEE Symp. on Foundations of Computer Science (FOCS), pages 558-570, 1995.
11. R.J. Cole, B.M. Maggs, and R.K. Sitaraman. Reconfiguring arrays with faults, part I: worst-case faults. SIAM Journal on Computing, 26(6):1581-1611, 1997.
12. C. Dwork, D. Peleg, N. Pippenger, and E. Upfal. Fault tolerance in networks of bounded degree. SIAM Journal on Computing, 17:975-988, 1988.
13. P. Erdos and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5:17-61, 1960.
14. B. Ghosh, F.T. Leighton, B.M. Maggs, S. Muthukrishnan, C.G. Plaxton, R. Rajaraman, A.W. Richa, R.E. Tarjan, and D. Zuckermann. Tight analyses of two local load balancing algorithms. SIAM Journal on Computing, 29(1):29-64, 1999.
15. J. Håstad, F.T. Leighton, and M. Newman. Reconfiguring a hypercube in the presence of faults. In Proc. of the 19th ACM Symp. on Theory of Computing (STOC), pages 274-284, 1987.
16. M. Henle. A Combinatorial Introduction to Topology. Freeman, San Francisco, CA, 1979.
17. C. Kaklamanis, A.R. Karlin, F.T. Leighton, V. Milenkovic, P. Raghavan, S.B. Rao, and A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors. In Proc. of the 22nd ACM Symp. on Theory of Computing (STOC), pages 285-296, 1990.
18. A.R. Karlin, G. Nelson, and H. Tamaki. On the fault tolerance of the butterfly. In Proc. of the 26th ACM Symp. on Theory of Computing (STOC), pages 125-133, 1994.
19. H. Resten. The critical probability of bond percolation on the square lattice equals 1/2. Communication in Mathematical Physics, 74:41-59, 1980.
20. 1. In Pmc. of the 46th Annu. IEEE Symp. on Foundations of Computer Science (FOCS '05), pages 53-62, 2005.
21. F.T. Leighton and B.M. Maggs. Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks. IEEE Transactions on Computers, 41(5):578-587, 1992.
22. F.T. Leighton, B.M. Maggs, and S.B. Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 14(2):167-186, 1994.
23. F.T. Leighton, B.M. Maggs, and R.K. Sitaraman. On the fault tolerance of some popular bounded-degree networks. SIAM Journal on Computing, 27(5):1303-1333, 1998.
24. F.T. Leighton and S.B. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. of the 29th Annu. Symp. on Foundations of Compute r Science (FOCS), pages 422-431, 1988.
25. T. Luczak, B. Pittel, and J.C. Wierman. The structure of a random graph at the point of the phase transition. Transactions of the AMS, 341:721-748, 1994.
26. T.R. Mathies. Percolation theory and computing with faulty arrays of processors. In Proc. of the 3rd ACM Symp. on Discrete Algorithms (SODA), pages 100-103, 1992.
27. P. Raghavan. Robust algorithms for packet routing in a mesh. In Proc. of the 1st ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 344-350, 1989.
28. S. Ratnasamy, P. Francis, M. Handley, R.M. Karp, and S. Schenker. A scalable content-addressable network. In Proc. of SIGCOMM 2001, pages 161-172, 2001.
29. C. Scheideler. Universal Routing Strategies for Interconnection Networks. Lecture Notes in Computer Science 1390. Springer, Berlin, 1998.
30. C. Scheideler. Probabilistic Methods for Coordination Problems. HNI-Verlagsschriftenreihe 78, University of Paderborn, 2000.
31. C. Scheideler. Models and techniques for communication in dynamic networks. In Proc. of the 19th Symp. on Theoretical Aspects of Computer Science (STACS), pages 27-49, 2002.
32. E. Upfal. Tolerating a linear number of faults in networks of bounded degree. Information and Computation, 115(2):312-320, 1994.