Distance Vector Routing Protocols
Most routing protocols fall into one of two classes: distance vector or link state. The basics of distance vector routing protocols are examined here; the next section covers link state routing protocols. Distance vector algorithms are based on the work done of R. E. Bellman,[1] L. R. Ford, and D. R. Fulkerson[2] and for this reason occasionally are referred to as Bellman-Ford or Ford-Fulkerson algorithms.
[1] R. E. Bellman. Dynamic Programming. Princeton, New Jersey: Princeton University Press; 1957.
[2] L. R. Ford Jr. and D. R. Fulkerson. Flows in Networks. Princeton, New Jersey: Princeton University Press; 1962.
The name distance vector is derived from the fact that routes are advertised as vectors of ...
Get Routing TCP/IP, Volume I (CCIE Professional Development) now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
