A fast link assignment algorithm for satellite communication networks
暂无分享,去创建一个
[1] Yuan-Chieh Chow,et al. Initialization of dynamic laser networks , 1990 .
[2] C. Ward,et al. Optimizing the Delay and Reliability of Low Altitude Satellite Network Topologies , 1987, MILCOM 1987 - IEEE Military Communications Conference - Crisis Communications: The Promise and Reality.
[3] Giuseppe F. Italiano,et al. Incremental algorithms for minimal length paths , 1991, SODA '90.
[4] Michael D. Noakes,et al. A Distributed Link Assignment (Reconstitution) Algorithm for Space-Based SDI Networks , 1987, MILCOM 1987 - IEEE Military Communications Conference - Crisis Communications: The Promise and Reality.
[5] ZVI GALIL,et al. Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.
[6] R. Newman-Wolfe,et al. An efficient algorithm for reconfiguration of large-scale point-to-point satellite computer networks with maximum connectivity , 1990, Ninth Annual International Phoenix Conference on Computers and Communications. 1990 Conference Proceedings.
[7] Katarína Cechlárová. The uniquely solvable bipartite matching problem , 1991, Oper. Res. Lett..
[8] Udi Manber,et al. Introduction to algorithms - a creative approach , 1989 .
[9] J.H. Lodge. Mobile satellite communications systems: Toward global personal communications , 1991, IEEE Communications Magazine.
[10] C. McLochlin,et al. Determining the delay and reliability of low altitude satellite network topologies using simulation , 1987 .
[11] J.L. Grubb. The traveler's dream come true (satellite personal communication) , 1991, IEEE Communications Magazine.
[12] Alon Itai,et al. The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..