A new method for topological design in large, traffic laden packet switched networks
暂无分享,去创建一个
[1] N. Georganas,et al. NEWCLUST: An Algorithm for the Topological Design of Two-Level, Multidrop Teleprocessing Networks , 1978, IEEE Trans. Commun..
[2] Aaron Kershenbaum,et al. Centralized teleprocessing network design , 1976, Networks.
[3] Wushow Chou,et al. Topological optimization of computer networks , 1972 .
[4] Wushow Chou,et al. Topological considerations in the design of the ARPA computer network , 1899, AFIPS '70 (Spring).
[5] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[6] Motoo Hoshi. Local Network Area Size Optimization , 1985, IEEE Trans. Commun..
[7] Mario Gerla,et al. On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..
[8] R. Boorstyn,et al. Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..
[9] Shimon Even,et al. An Algorithm for Determining Whether the Connectivity of a Graph is at Least k , 1973, SIAM J. Comput..
[10] Farouk Kamoun,et al. Optimal clustering structures for hierarchical topological design of large computer networks , 1980, Networks.