The New Routing Algorithm for the ARPANET

IEEE Transactions on Communications

Volumn 28, Issue 5, 1980, Pages 711-719

  Mcquillan, John M ^a   Richer, Ira ^a   Rosen, Eric C ^a  

^a BBN TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS;

EID: 0019021284     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1980.1094721     Document Type: Article

References (12)

1. J. M. McQuillan and D. C. Walden. “The ARPANET design decisions,” Comput. Networks, vol. 1. Aug. 1977.
2. J. M. McQuillan, “Routing algorithms for computer networks-A survey,” presented at the 1977 Nat. Telecommun. Conf. Dec. 1977.
3. J. M. McQuillan. I. Richer. and E. C. Rosen, “ARPANET routing algorithm improvements-First semiannual technical report,” BBN Rep. 3803, Apr. 1978.
4. J. M. McQuillan, I. Richer, E. C. Rosen, and D. P. Bertsekas, “ARPANET routing algorithm improvements-Second semiannual technical report.” BBN Rep. 3940, Oct. 1978.
5. E. C. Rosen. J.Herman, I. Richer. and J. M. McQuillan, “ARPANET routing algorithm improvements-Third semiannual technical report,” BBN Rep. 4088, Apr. 1979.
6. J. M. McQuillan, G. Falk, and I. Richer. “A review of the development and performance of the ARPANET routing algorithm,” IEEE Trans. Commun., Dec. 1978.
7. J. M. McQuillan. I. Richer, and E. Rosen. “ARPANET routing study-Final report,” BBN Rep. 3641. Sept. 1977.
8. J. M. McQuillan, “Enhanced message addressing modes for computer networks,” Proc. IEEE (Special Issue on Packet Communication Networks), Nov. 1978.
9. D. B. Johnson, “Efficient algorithms for shortest paths in sparse networks,” J. Ass. Comput. Mach., vol. 24. pp. 1–13. Jan. 1977
10. E. Dijkstra, “A note on two problems in connection with graphs,” Numer. Math., vol. 1. pp. 269–271. 1959.
11. D. P. Bertsekas, “Dynamic models of shortest path routing algorithms for communications networks with a ring topology,” in preparation.
12. E. C. Rosen, “The updating protocol of the ARPANET's new routing algorithm: A case study in maintaining identical copies of a changing distributed data base,” in Proc. 4th Berkeley Conf. Distributed Data Management and Comput. Networks, Aug. 28–30, 1979, pp. 260–274.