73-85, January 1977. [18] W.D. Tajibnapis, "A correctness proof of a topology information maintenance protocol for a distributed computer network," Communications of the ACM, vol. 20, no. 7, pp. 477-485, July 1777. [19] T. E. Stern, "A class of decentralized routing algorithms using relaxation," IEEE Trans. Commun., COM-25, no. 10, pp. 1092-1102, October 1977. [20] L. Kennington, "A survey of linear cost multicommodity network flows," Operations Research, vol. 26, no. 2, pp. 209-236, March-April 1978. [21] F. C. Schoute and J. M. McQuillan, "A comparison of information policies for minimum delay routing algorithms," IEEE Trans. Commun., COM-26, no. 8, pp. 1266-1271, August 1978. J.M. McQuillan, G. Falk, and I. Richer, "A review of the development and per- formance of the ARPANET routing algorithm," IEEE Trans. Commun., COM- 26, no. 12, pp. 1802-1811, December 1978. Multiple Access [23] R. Dial et al., "A computational analysis of alternative algorithms and label- ing techniques for finding shortest path trees," Networks, vol. 9, no. 3, pp. 215- 248, Fall 1979. [24] D. R. Shier, "On algorithms for finding the k shortest paths in a network," Networks, vol. 9, no. 3, pp. 195-214, Fall 1979. [25] P. M. Merlin and A. Segall, "A failsafe distributed routing protocol," IEEE Trans. Commun., COM-27, no. 9, pp. 1280-1287, September 1979. [26] J. M. McQuillan, I. Richer, and E. C. Rosen, "An overview of the new routing algorithm for the ARPANET," Sixth Data Communication Symposium, pp. 63- 68, November 1979. [27] Y. W. Ma, "A Shortest Path Algorithm with Average Execution Time 0( Vn log n)," Ph.D. Dissertation, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, 1980. [28] W.K. Crowther, R. Pettbert, D. Walden, S. Ornstein, and F. Heart, "A system for broadcast communication: Reservation-Aloha," in Proceedings 6th Hawaii International Systems Science Conference, January 1973. [29] L. Roberts, "Dynamic allocation of satellite capacity through packets reser- vation," National Comput