Design and analysis of networks with large components in presence of region-based faults

IEEE International Conference on Communications

Volumn , Issue , 2011, Pages

  Banerjee, Sujogya ^a   Shirazipourazad, Shahrzad ^a   Sen, Arunabha ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPONENT SIZE; DESIGN AND ANALYSIS; FAULT-TOLERANCE CAPABILITY; LARGE COMPONENTS; LARGEST CONNECTED COMPONENT; LEAST-COST DESIGN; NEAR-OPTIMAL SOLUTIONS; NETWORK STATE; NETWORK STATE INFORMATION; NP COMPLETE; OPTIMAL DESIGN; OPTIMAL SOLUTIONS; RANDOM FAULTS; REGION-BASED; TARGET VALUES;

COMPUTATIONAL COMPLEXITY; DESIGN; FAULT TOLERANCE; OPTIMAL SYSTEMS; OPTIMIZATION;

PROBLEM SOLVING;

EID: 80052167635     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icc.2011.5962427     Document Type: Conference Paper

References (16)

1. K. Eswaran and R. Tarjan, "Augmentation problems," SIAM Journal on Computing, vol. 5, p. 653, 1976.
2. G. Frederickson and J. JaJa, "Approximation algorithms for several graph augmentation problems," SIAM Journal on Computing, 1981.
3. M. Bakkaloglu, J. J. Wylie, C. Wang, and G. R. Ganger, "On correlated failures in survivable storage systems," Carnegie Mellon University, Tech. Rep. CMU-CS- 02-129, 2002.
4. W. Cui, I. Stoica, R. H. Katz, and Y. H. Katz, "Backup path allocation based on a correlated link failure probability model in overlay networks," in 10th IEEE ICNP, 2002.
5. A. Sen, B. Shen, L. Zhou, and B. Hao, "Fault-tolerance in sensor networks: A new evaluation metric," in Infocom, 2006.
6. J. Fan, T. Chang, D. Pendarakis, and Z. Liu, "Cost-effective configuration of content resiliency services under correlated failures," in Proceedings of the International Conference on DSN, 2006.
7. S. Neumayer, G. Zussman, R. Cohen, and E. Modiano, "Assessing the vulnerability of the fiber infrastructure to disasters," Columbia University, EE, Tech. Rep, pp. 08-26, 2008.
8. A. Sen, S. Murthy, and S. Banerjee, "Region-based connectivity: a new paradigm for design of fault-tolerant networks," in HPSR, 2009.
9. S. Neumayer and E. Modiano, "Network reliability with geographically correlated failures," in Proceedings of the 29th conference on Information communications. IEEE Press, 2010.
10. B. Bollobas, Random Graphs. Cambridge Univ Pr, 2001.
11. M. Molloy and B. Reed, "The size of the giant component of a random graph with a given degree sequence," Combin. Probab. Comput, 1998.
12. A. Vigneron, "Geometric optimization and sums of algebraic functions," 2009.
13. S. Basu, R. Pollack, and M. Roy, "On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety* 1," Journal of Complexity, vol. 13, no. 1, pp. 28-37, 1997.
14. J. Hopcroft and R. Tarjan, "Efficient algorithms for graph manipulation," 1971.
15. M. Garey and D. Johnson, Computers and intractability. A guide to the theory of NP-completeness., 1979.
16. H. Fraysseix, J. Pach, and R. Pollack, "How to draw a planar graph on a grid," Combinatorica, vol. 10, no. 1, pp. 41-51, 1990.