Routing strategies for fast networks
暂无分享,去创建一个
[1] P. Green. Computer communications: Milestones and prophecies , 1984, IEEE Communications Magazine.
[2] Luigi Fratta,et al. The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.
[3] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[4] Anthony Ephremides,et al. The Routing Problem in Computer Networks , 1986 .
[5] Ofrit Lesser. Routing by controlled flooding in communication networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.
[6] Shimon Even,et al. Graph Algorithms , 1979 .
[7] Israel Cidon,et al. Paris: An approach to integrated high‐speed private networks , 1988 .
[8] Robert G. Gallager,et al. A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..
[9] M. Schwartz,et al. Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..
[10] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[11] Jonathan S. Turner,et al. Design of a broadcast packet switching network , 1988, IEEE Trans. Commun..
[12] J. Spencer. Ten lectures on the probabilistic method , 1987 .
[13] Howard Jay Siegel,et al. Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .