THE BELLMAN-FORD ALGORITHM AND “DISTRIBUTED BELLMAN-FORD”

In the spring of 2003, I began to wonder about the history of the Bellman-Ford algorithm [CLRS01] for finding shortest paths in a graph. In particular, I was interested in understanding when Bellman’s name and Ford’s name became jointly associated with the algorithm. To research these questions, I made trips to the BBN Technologies and MIT libraries, did Web searches, and sent emails to university professors who taught courses or wrote books on algorithms, parallel processing, or routing in networks. I didn’t find the source of the joint name in the several weeks before I grew tired of searching the massive literature on shortest path algorithms. However, I did learn a good bit, as described below.

[1]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[2]  Radia Perlman.  Interconnections: Bridges and Routers , 1992 .

[3]  Fernando Gustavo Tinetti,et al.  Parallel programming: techniques and applications using networked workstations and parallel computers. Barry Wilkinson, C. Michael Allen , 2000 .

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  William R. Crowther,et al.  The interface message processor for the ARPA computer network , 1899, AFIPS '70 (Spring).

[6]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[7]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[8]  David C. Walden,et al.  The ARPA Network Design Decisions , 1977, Comput. Networks.

[9]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[10]  J. Walrand,et al.  Distributed Dynamic Programming , 2022 .

[11]  Eric C. Rosen,et al.  An overview of the new routing algorithm for the ARPANET , 1979, SIGCOMM '79.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[13]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[14]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[15]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM '89.

[16]  John M. Mcquillan,et al.  Adaptive routing algorithms for distributed computer networks , 1974 .