Topology distribution cost vs. efficient routing in large networks
暂无分享,去创建一个
[1] Jeffrey M. Jaffe,et al. SNA Networks of Small Systems , 1985, IEEE J. Sel. Areas Commun..
[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[3] M. Gopal,et al. Topology distribution cost vs. efficient routing in large networks , 1990, SIGCOMM 1990.
[4] I. Richer,et al. A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..
[5] M. Schwartz,et al. Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..
[6] Nachum Shacham,et al. Organization of Dynamic Radio Network by Overlapping Clusters: Architecture Considerations and Optimization , 1984, Performance.
[7] Adrian Segall,et al. Distributed network protocols , 1983, IEEE Trans. Inf. Theory.
[8] F. Amer,et al. Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networks , 1988, [1988] Proceedings. Computer Networking Symposium.
[9] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[10] Farouk Kamoun,et al. Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.
[11] Jeffrey M. Jaffe,et al. Establishing Virtual Circuits in Large Computer Networks , 1986, Comput. Networks.