High-reliability architectures for networks under stress
暂无分享,去创建一个
[1] F. Harary. THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.
[2] R. S. Wilkov. Reliability Considerations in Computer Network Design , 1971, IFIP Congress.
[3] G. K. McAuliffe,et al. Exact calculation of computer network reliability , 1974, Networks.
[4] H. Sachs,et al. Regukre Graphen gegebener Taillenweite mit minimaler Knotenzahl , 1963 .
[5] S. Louis Hakimi,et al. On the design of reliable networks , 1973, Networks.
[6] Wendy J. Myrvold,et al. Maximizing spanning trees in almost complete graphs , 1997, Networks.
[7] Wayne D. Grover,et al. Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).
[8] Charles J. Colbourn. Reliability Issues In Telecommunications Network Planning , 1999 .
[9] Stewart E. Miller,et al. Optical Fiber Telecommunications , 1979 .
[10] John A. Silvester,et al. Performance Analysis of Networks with Unreliable Components , 1984, IEEE Trans. Commun..
[11] W. Mader,et al. Minimalen-fach kantenzusammenhängende Graphen , 1971 .
[12] I. Frisch,et al. Analysis and Design of Survivable Networks , 1970 .
[13] John D. Spragins. A Fast Algorithm for Computing Availability in Networks with Dependent Failures , 1984, INFOCOM.
[14] Ching-Shui Cheng,et al. Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory , 1981, J. Comb. Theory B.
[15] Henry D. Friedman,et al. A Design for (d, k) Graphs , 1966, IEEE Trans. Electron. Comput..
[16] Wendy Myrvold,et al. Uniformly-most reliable networks do not always exist , 1991, Networks.
[17] Dieter Jungnickel,et al. Graphs, Networks, and Algorithms , 1980 .
[18] Michael O. Ball. Computing Network Reliability , 1979, Oper. Res..
[19] Xiaoming Li,et al. On the existence of uniformly optimally reliable networks , 1991, Networks.
[20] Jhing-Fa Wang,et al. On the number of spanning trees of circulant graphs , 1984 .
[21] B. Bollobás. A problem of the theory of communication networks , 1968 .
[22] Thomas E. Stern,et al. Automatic protection switching for link failures in optical networks with bi-directional links , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.
[23] W. T. Tutte. A family of cubical graphs , 1947, Mathematical Proceedings of the Cambridge Philosophical Society.
[24] Richard M. Van Slyke,et al. Network reliability analysis: Part I , 1971, Networks.
[25] Y. F. Lam,et al. Reliability Modeling and Analysis of Communication Networks with Dependent Failures , 1986, IEEE Trans. Commun..
[26] Jacek Wojciechowski,et al. Synthesis of reliable networks in the presence of line failures , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).
[27] José Rodríguez,et al. A new technique for the characterization of graphs with a maximum number of spanning trees , 2002, Discret. Math..
[28] Victor Ok Li,et al. NETWORK RELIABILITY CALCULATIONS WITH DEPENDENT FAILURES. , 1983 .
[29] Yuanping Zhang,et al. The number of spanning trees in circulant graphs , 2000, Discret. Math..
[30] F. Boesch,et al. On graphs of invulnerable communication nets , 1970 .
[31] H. Frank,et al. Vulnerability of Communication Networks , 1967 .
[32] J. O. Gobien,et al. A new analysis technique for probabilistic graphs , 1979 .
[33] F. Boesch,et al. Super line-connectivity properties of circulant graphs , 1986 .
[34] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..
[35] Jhing-Fa Wang,et al. Reliable circulant networks with minimum transmission delay , 1985 .
[36] Ralph Tindell,et al. Circulants and their connectivities , 1984, J. Graph Theory.
[37] Yonggang Wen,et al. Ultra-reliable communication over unreliable optical networks via lightpath diversity: system characterization and optimization , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).
[38] Wendy Myrvold. Reliable Network Synthesis: Some Recent Developments , 1996 .
[39] Wayne D. Grover. Bridging the Ring-Mesh Dichotomy With P-Cycles , 2000 .
[40] Wayne D. Grover,et al. Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles") , 2000, IEEE Trans. Commun..
[41] M. Médard,et al. Reliable Architectures for Networks under Stress , 2003 .
[42] Charles J. Colbourn,et al. Bounding all-terminal reliability in computer networks , 1988, Networks.
[43] Thomas E. Stern,et al. Protection cycles in mesh WDM networks , 2000, IEEE Journal on Selected Areas in Communications.
[44] Muriel Médard,et al. WDM loop-back recovery in mesh networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[45] S. Bedrosian,et al. Synthesis of Reliable Networks , 1969 .
[46] A. Satyanarayana,et al. A Unified Formula for Analysis of Some Network Reliability Problems , 1982, IEEE Transactions on Reliability.
[47] W. Mader. Minimale n-fach kantenzusammenh angende graphen , 1971 .
[48] Irwin Mark. Jacobs,et al. Connectivity in probabilistic graphs , 1960 .
[49] Tsong-Ho Wu,et al. Fiber Network Service Survivability , 1992 .
[50] R. V. Slyke,et al. On the validity of a reduction of reliable network design to a graph extremal problem , 1987 .
[51] J. S. Provan,et al. Bounds on the reliability polynomial for shellable independence systems , 1982 .
[52] A. Satyanarayana,et al. New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks , 1978 .
[53] Alan J. Hoffman,et al. On Moore Graphs with Diameters 2 and 3 , 1960, IBM J. Res. Dev..
[54] Frank Harary,et al. Graph Theory , 2016 .
[55] A. Satyanarayana,et al. A New Algorithm for the Reliability Analysis of Multi-Terminal Networks , 1981, IEEE Transactions on Reliability.
[56] J. Spragins,et al. Dependent Failures in Data Communication Systems , 1977, IEEE Trans. Commun..
[57] Victor O. K. Li,et al. Modeling and analysis of systems with multimode components and dependent failures , 1989 .
[58] M. Medard,et al. A reliable architecture for networks under stress , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..
[59] R. Singleton. On Minimal graphs of maximum even girth , 1966 .
[60] Kumar N. Sivarajan,et al. Optical Networks: A Practical Perspective , 1998 .
[61] I. Korn. On (d, k) Graphs , 1967 .
[62] Francis T. Boesch,et al. On unreliability polynomials and graph connectivity in reliable network synthesis , 1986, J. Graph Theory.
[63] Charles L. Suffel,et al. On the characterization of graphs with maximum number of spanning trees , 1998, Discret. Math..
[64] Sean Riley,et al. Switched, fast, and gigabit Ethernet , 1999 .
[65] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[66] Claude E. Shannon,et al. Reliable Circuits Using Less Reliable Relays , 1956 .
[67] Wendy Myrvold,et al. Maximizing spanning trees in almost complete graphs , 1997 .
[68] F. Boesch,et al. On the Minimum m Degree Vulnerability Criterion , 1971 .
[69] Jafar A. Assiri. Development of dependent failure reliability models for distributed communication networks , 1980 .
[70] Appajosyula Satyanarayana,et al. A reliability-improving graph transformation with applications to network reliability , 1992, Networks.
[71] Pak-Ken Wong,et al. Cages - a survey , 1982, J. Graph Theory.
[72] Howard J. Quaife,et al. On (d, k, μ) Graphs , 1969, IEEE Trans. Computers.
[73] Guifang Wang. A proof of Boesch's conjecture , 1994, Networks.
[74] F. Boesch. Synthesis of reliable networks - a survey , 1986, IEEE Transactions on Reliability.
[75] Vincent W. S. Chan,et al. Connectivity architectures of regular optical mesh networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.
[76] Muriel Medard,et al. Network Reliability and Fault Tolerance , 2003 .