Reliability in layered networks with random link failures

IEEE/ACM Transactions on Networking

Volumn 19, Issue 6, 2011, Pages 1835-1848

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b GOOGLE INC   (United States)

Author keywords

Lightpath routing; multilayer network; network reliability; random failures; random sampling; reliability approximation

Indexed keywords

LIGHTPATH ROUTING; MULTILAYER NETWORK; NETWORK RELIABILITY; RANDOM FAILURES; RANDOM SAMPLING;

APPROXIMATION ALGORITHMS; MULTILAYERS; POLYNOMIAL APPROXIMATION; PROBABILITY; RELIABILITY; TELECOMMUNICATION NETWORKS; TOPOLOGY;

NETWORK LAYERS;

EID: 84655176463     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2011.2143425     Document Type: Article

References (32)

1. G. Iannaccone, C. n. Chuah, S. Bhattacharyya, and C. Diot, "Feasibility of IP restoration in a tier-1 backbone," IEEE Netw., vol. 18, no. 2, pp. 13-19, Mar.-Apr. 2004.
2. L. Valiant, "The complexity of enumeration and reliability problems," SIAM J. Comput., vol. 8, no. 3, pp. 410-421, Aug. 1979.
3. 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.
4. C. Tanguy, "Exact two-terminal reliability of directed networks," in Proc. DRCN, La Rochelle, France, Oct. 2007, pp. 1-8.
5. A. Shooman and A. Kershenbaum, "Exact graph-reduction algorithms for network reliability analysis," in Proc. IEEE GLOBECOM, Dec. 1991, vol. 2, pp. 1412-1420.
6. A. Rosenthal and D. Frisque, "Transformations for simplifying network reliability calculations," Networks, vol. 7, pp. 97-111, 1977. (Pubitemid 8610176)
7. A. Shooman and A. Kershenbaum, "Methods for communication-network reliability analysis: Probabilistic graph reduction," in Proc. Annu. Rel. Maintain. Symp., 1992, pp. 441-448. (Pubitemid 23562592)
8. 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.
9. T. Politof, A. Satyanarayana, and L. Tung, "An O(n-log(n))algorithm to compute the all-terminal reliability of (K5,K2,2,2) free networks," IEEE Trans. Rel., vol. 41, no. 4, pp. 512-517, Dec. 1992. (Pubitemid 23612221)
10. M. Chari, T. Feo, and J. S. Provan, "The delta-wye approximation procedure for two-terminal reliability," Oper. Res., vol. 44, no. 5, pp. 745-757, 1996. (Pubitemid 126669551)
11. E. Neufeld and C. Colbourn, "The most reliable series-parallel networks," Networks, vol. 15, pp. 27-32, 1985.
12. R. Karp and M. Luby, "Monte Carlo algorithms for planar multiterminal network reliability problems," J. Complexity, vol. 1, no. 1, pp. 45-64, 1977.
13. D. Karger, "A randomized fully polynomial time approximation scheme for the all terminal reliability problem," SIAM Rev., vol. 43, no. 3, pp. 499-522, 2001. (Pubitemid 32991212)
14. G. Fishman, "A comparison of four Monte Carlo methods for estimating the probability of s-t connectedness," IEEE Trans. Rel., vol. R-35, no. 2, pp. 145-155, Jun. 1986. (Pubitemid 16613704)
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, Dept. Comput. Sci., Univ. Waterloo, Waterloo, ON, Canada, 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. Rel., vol. 38, no. 5, pp. 538-555, Dec. 1989. (Pubitemid 20665814)
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," Math. Program., vol. 39, pp. 253-261, 1987. (Pubitemid 18546590)
21. R. G. Addie and R. Taylor, "An algorithm for calculating the availability and mean time to repair for communication through a network," Comput. Netw. ISDN Syst., vol. 20, pp. 109-114, 1989.
22. D. Bauer, F. Boesch, C. Suffel, and R. Van Slyke, "On the validity of a reduction of reliable network design to a graph extremal problem," IEEE Trans. Circuits Syst., vol. CAS-34, no. 12, pp. 1579-1581, Dec. 1987. (Pubitemid 18568027)
23. L. Nel and C. Colbourn, "Combining Monte Carlo estimates and bounds for network reliability," Networks, vol. 20, pp. 277-298, 1990.
24. M. Ball and J. S. Provan, "Bounds on the reliability polynomial for shellable independence systems," SIAM J. Algebr. Discrete Methods, vol. 3, pp. 166-181, 1982.
25. K. Lee, H.-W. Lee, and E. Modiano, "Reliability in layered networks with random link failures," MIT, Cambridge, MA, 2009 [Online]. Available: http://web.mit.edu/kylee/www/reliability.pdf
26. K. Lee, E. Modiano, and H.-W. Lee, "Cross-layer survivability in WDM-based networks," IEEE Trans. Netw., vol. 19, no. 4, Aug. 2011, to be published.
27. F. Boesch, "On unreliability polynomials and graph connectivity in reliable network synthesis," J. Graph Theory, vol. 10, no. 3, pp. 339-352, 1986.
28. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
29. B. Bollobás, Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability. New York: Cambridge Univ. Press, 1986, p. 34.
30. R. Karp and M. Luby, "Monte-carlo algorithms for enumeration and reliability problems," in Proc. Annu. Symp. Found. Comput. Sci., Nov. 1983, pp. 56-64. (Pubitemid 14462504)
31. E. Modiano and A. Narula-Tam, "Survivable lightpath routing: A new approach to the design of WDM-based networks," IEEE J. Sel. Areas Commun., vol. 20, no. 4, pp. 800-809, May 2002. (Pubitemid 34731995)
32. W. Feller, An Introduction to Probability Theory and Its Applications. New York: Wiley, 1968.