Approximate distributed Bellman-Ford algorithms (computer network routing)
暂无分享,去创建一个
[1] Farouk Kamoun,et al. Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.
[2] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[3] Jeffrey M. Jaffe,et al. A Responsive Distributed Routing Algorithm for Computer Networks , 1982, ICDCS.
[4] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[5] Dimitri Bertsekas,et al. Distributed dynamic programming , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[6] D.A. Pitt,et al. Addressing, bridging, and source routing (LAN interconnection) , 1988, IEEE Network.
[7] Adrian Segall,et al. Distributed network protocols , 1983, IEEE Trans. Inf. Theory.
[8] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[9] Radia J. Perlman,et al. Fault-Tolerant Broadcast of Routing Information , 1983, Comput. Networks.
[10] J. J. Garcia-Luna-Aceves,et al. A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM 1989.
[11] Adrian Segall,et al. A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..
[12] R. Perlman,et al. Comparison of two LAN bridge approaches , 1988, IEEE Network.
[13] I. Richer,et al. A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..
[14] M. Schwartz,et al. Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..
[15] C. V. Ramamoorthy,et al. ADAPTIVE HIERARCHICAL ROUTING ALGORITHM. , 1983 .
[16] Jeffrey M. Jaffe,et al. SNA Networks of Small Systems , 1985, IEEE J. Sel. Areas Commun..