Logical clustering for the optimization and analysis of a rearrangeable distributed ATM switch
暂无分享,去创建一个
[1] M. Gopal,et al. Topology distribution cost vs. efficient routing in large networks , 1990, SIGCOMM 1990.
[2] A. Bouloutas,et al. Some graph partitioning problems and algorithms related to routing in large computer networks , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.
[3] A. S. Acampora,et al. Partially reconfigurable multihop lightwave networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.
[4] Anthony S. Acampora,et al. Logically rearrangeable multihop lightwave networks , 1991, IEEE Trans. Commun..
[5] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[6] M. J. Karol,et al. ShuffleNet: an application of generalized perfect shuffles to multihop lightwave networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.
[7] Farouk Kamoun,et al. Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.
[8] Farouk Kamoun,et al. Optimal clustering structures for hierarchical topological design of large computer networks , 1980, Networks.
[9] Anthony S. Acampora,et al. The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching , 1987, IEEE J. Sel. Areas Commun..
[10] Fouad A. Tobagi,et al. Fast packet switch architectures for broadband integrated services digital networks , 1990, Proc. IEEE.
[11] Alan Huang,et al. Starlite: a wideband digital switch , 1991 .