for Distributed Digital Radio Networks, MTR-81W00273, Richard W. Carpenter, Contract No. F19628- 82-C-0001, Washington Operations, McLean, VA, January 1981. [4] Session 25, "Advanced space technology for next-generation MILSATCOM system," MILCOM '82, Boston, MA, October 1982. [5] P. Baran, On Distributed Communications: I. Introduction to Distributed Communications Networks, The RAND Corporation, RM-3420-PR, August 1964. [6] B. W. Boehm and R. L. Mobley, "Adaptive routing techniques for distributed communications systems," IEEE Trans. Commun., COM-17, no. 3, pp. 340-349, June 1969. [7] J.W.S Liu, "Distributed routing and relay management in mobile packet radio networks," Proc. Compcon Fall 80, pp. 235-243, September 1980. [8] E. W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik 1, pp. 269-271, 1959. [9] L. R. Ford and D. R. Fulkerson, Flow in Networks, Princeton, NJ: Princeton University Press, 1962. [10] R. W. Floyd, "Algorithm 97 shortest path," Communications of the ACM, vol. 5, no. 6, p. 345, June 1962. [11] L. Kleinrock, Communication Nets: Stochastic Message Flow and Delay, New York: McGraw-Hill, 1964. [12] S. E. Dreyfus, An Appraisal of Some Shortest Path Algorithms, The RAND Corporation, RM-5433-1-PR, September 1968. [13] L. Fratta, M. Gerla, and L. Kleinrock, "The flow deviation method: An approach to store-and-forward communication network design," Networks, vol. 3, pp. 97-133, 1973. [14] H. Rudin, On Routing and "Delta Routing": A Taxonomy of Techniques for Packet-Switched Networks, IBM Zurich Research Laboratory, RZ 701, June 1975. [15] W. D. Tajibnapis, Message-Switching Protocols in Distributed Computer Networks, Ph.D. Dissertation, The University of Michigan, 1976. [16] D.B. Johnson, "Efficient algorithms for shortest paths in sparse networks," Journal of the Association for Computing Machinery, vol. 24, no. 1, pp. 1-13, January 1977. [17] R. G. Gallagher, "A minimum delay routing algorithm using distributed computation," IEEE Trans. Commun., COM-25, no. 1, pp. 