Reliability in layered networks with random link failures

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Lee, Kayi ^a   Lee, Hyang Won ^a   Modiano, Eytan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE EXPRESSIONS; FAILURE PROBABILITY; LAYERED NETWORK; LINK-FAILURE PROBABILITIES; LOGICAL TOPOLOGY; MIN-CUT; MULTIPLE FAILURES; NETWORK RELIABILITY; PHYSICAL TOPOLOGY; POLYNOMIAL EXPRESSION; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RANDOM LINK FAILURES; RANDOM SAMPLING; RESAMPLES; ROUTINGS; UPPER LAYER;

POLYNOMIAL APPROXIMATION; PROBABILITY; RAILROAD PLANT AND STRUCTURES; RELIABILITY; TOPOLOGY;

APPROXIMATION ALGORITHMS;

EID: 77953301657     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5461985     Document Type: Conference Paper

References (27)

1. L. Valiant, "The complexity of enumeration and reliability problems," SIAM J. Comput., vol. 8, no. 3, pp. 410-421, Aug. 1979.
2. J. S. Provan and M. Ball, "The complexity of counting cuts and of computing the probability that a graph is connected," SIAM J. Comput., vol. 12, no. 4, pp. 777-788, Nov. 1983.
3. C. Tanguy, "Exact two-terminal reliability of directed networks," in DRCN, La Rochelle, France, Oct. 2007.
4. A. Shooman and A. Kershenbaum, "Exact graph-reduction algorithms for network reliability analysis," in IEEE GLOBECOM, Dec. 1991.
5. A. Rosenthal and D. Frisque, "Transformations for simplifying network reliability calculations," Networks, vol. 7, pp. 97-111, 1977.
6. A. Shooman and A. Kershenbaum, "Methods for communication-network reliability analysis: Probabilistic graph reduction," in Annual Reliability and Maintainability Symposium, 1992.
7. G. Lingner, T. Politof, and A. Satyanarayana, "A forbidden minor characterization and reliability of a class of partial 4-trees," Networks, vol. 25, pp. 139-146, 1995.
8. 2,2,2) free networks," IEEE Trans. Reliability, vol. 41, no. 4, pp. 512-517, Dec. 1992.
9. M. Chari, T. Feo, and J. S. Provan, "The delta-wye approximation procedure for two-terminal reliability," Operations Research, vol. 44, no. 5, pp. 745-757, 1996.
10. E. Neufeld and C. Colbourn, "The most reliable series-parallel networks," Networks, vol. 15, pp. 27-32, 1985.
11. R. Karp and M. Luby, "Monte Carlo algorithms for planar multiterminal network reliability problems," Journal of Complexity, vol. 1, no. 1, pp. 45-64, 1977.
12. D. Karger, "A randomized fully polynomial time approximation scheme for the all terminal reliability problem," SIAM Review, vol. 43, no. 3, pp. 499-522, 2001.
13. G. Fishman, "A comparison of four Monte Carlo methods for estimating the probability of s-t connectedness," IEEE Trans. Reliability, vol. 35, no. 2, pp. 145-155, 1986.
14. R. G. Addie and R. Taylor, "An algorithm for calculating the availability and mean time to repair for communication through a network," Computer Networks and ISDN Systems, vol. 20, 1989.
15. M. Ball, "Complexity of network reliability computations," Networks, vol. 10, pp. 153-165, 1980.
16. T. Brecht, "Lower bounds for two-terminal network reliability," Master's thesis, University of Waterloo, Waterloo, ON, 1985.
17. R. Van Sylke and H. Frank, "Network reliability analysis: Part i," Networks, vol. 1, pp. 279-290, 1972.
18. H. AboElFotoh and C. Colbourn, "Computing 2-terminal reliability for radio-broadcast networks," IEEE Trans. Reliability, vol. 38, no. 5, pp. 538-555, Dec. 1989.
19. C. Colbourn and D. Harms, "Bounding all-terminal reliability in computer networks," Networks, vol. 18, pp. 1-12, 1988.
20. A. Ramanathan and C. Colbourn, "Counting almost minimum cutsets with reliability applications," Mathematical Programming, vol. 39, pp. 253-261, 1987.
21. L. Nel and C. Colbourn, "Combining Monte Carlo estimates and bounds for network reliability," Networks, vol. 20, pp. 277-298, 1990.
22. M. Ball and J. S. Provan, "Bounds on the reliability polynomial for shellable independence systems," SIAM J. Alg. Disc. Meth., vol. 3, pp. 166-181, 1982.
23. K. Lee, H.-W. Lee, and E. Modiano, "Reliability in layered networks with random link failures," MIT, Tech. Rep., 2009. [Online]. Available: http://web.mit.edu/kylee/www/reliability.pdf
24. K. Lee and E. Modiano, "Cross-layer survivability in WDM-based networks," in IEEE INFOCOM, Rio de Janeiro, Brazil, Apr. 2009.
25. F. Boesch, "On unreliability polynomials and graph connectivity in reliable network synthesis," Journal of Graph Theory, vol. 10, no. 3, pp. 339-352, 1986.
26. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
27. R. Karp and M. Luby, "Monte-carlo algorithms for enumeration and reliability problems," in Ann. Symp. on Found. of Comp. Sci., Nov. 1983.