Routing in a Network with Unreliable Components
暂无分享,去创建一个
[1] I. Frisch,et al. Analysis and Design of Survivable Networks , 1970 .
[2] Leonard Kleinrock,et al. Communication Nets: Stochastic Message Flow and Delay , 1964 .
[3] Ira W. Cotton,et al. Criteria for Evaluation of Data Communications Services , 1977, Comput. Networks.
[4] Bezalel Gavish,et al. A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..
[5] J. Cavers. Cutset Manipulations for Communication Network Reliability Estimation , 1975, IEEE Trans. Commun..
[6] F. Boesch,et al. On the Minimum m Degree Vulnerability Criterion , 1971 .
[7] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[8] Sidney L. Hantler,et al. An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..
[9] Salim Hariri,et al. Reliability Optimization in the Design of Distributed Systems , 1985, IEEE Transactions on Software Engineering.
[10] Bezalel Gavish,et al. Capacity and Flow Assignments in Large Computer Networks , 1986, INFOCOM 1986.
[11] I. Neuman,et al. Routing and capacity assignment in a network with different classes of messages , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track.
[12] Izhak Rubin,et al. On Reliable Topological Structures for Message-Switching Communication Networks , 1976, IEEE Trans. Commun..
[13] Bezalel Gavish,et al. Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.
[14] Richard V. Laue. A versatile queueing model for data switching , 1981, SIGCOMM 1981.
[15] Wushow Chou,et al. Topological considerations in the design of the ARPA computer network , 1899, AFIPS '70 (Spring).
[16] Andrew W. Shogan. Sequential Bounding of the Reliability of a Stochastic Network , 1976, Oper. Res..
[17] Suresh Rai,et al. Reliability Evaluation in Computer-Communication Networks , 1981, IEEE Transactions on Reliability.
[18] John A. Silvester,et al. Performance Analysis of Networks with Unreliable Components , 1984, IEEE Trans. Commun..
[19] A. Satyanarayana,et al. New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks , 1978 .
[20] Luigi Fratta,et al. A Recursive Method Based on Case Analysis for Computing Network Terminal Reliability , 1978, IEEE Trans. Commun..
[21] F. T. Boesch,et al. On the Invulnerability of the Regular Complete k-Partite Graphs , 1971 .
[22] Richard V. Laue. A versatile queueing model for data switching , 1981, SIGCOMM.
[23] J. Abraham. An Improved Algorithm for Network Reliability , 1979, IEEE Transactions on Reliability.
[24] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[25] Richard M. Bailey,et al. IBM information network performance and availability measurement , 1983, AFIPS '83.
[26] U. Karmarkar,et al. Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems , 1984 .
[27] F. Boesch,et al. On graphs of invulnerable communication nets , 1970 .
[28] Wushow Chou,et al. Topological optimization of computer networks , 1972 .
[29] Peter Kubat. Reliability Analysis for Integrated Networks with Application to Burst Switching , 1986, IEEE Trans. Commun..
[30] Bezalel Gavish,et al. Backbone Network Design Tools with Economic Tradeoffs , 1990, INFORMS J. Comput..
[31] A. M. Geoffrion. Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .
[32] Henry C. Lucas,et al. Center for Research on Information Systems Computer Applications and Information Systems Area Graduate School of Business Administration , 1986 .
[33] Michael O. Ball,et al. Computing Network Reliability , 1979, Oper. Res..