Au. Shankar et al., TRANSIENT AND STEADY-STATE PERFORMANCE OF ROUTING PROTOCOLS - DISTANCE-VECTOR VERSUS LINK-STATE, Internetworking, 6(2), 1995, pp. 59-87
We examine two approaches to adaptive routing protocols for wide-area
store-and-forward networks, namely, distance-vector and link-state, Di
stance-vector algorithms have less storage requirements than link-stat
e algorithms, The ARPANET started with a distance-vector algorithm (di
stributed Bellman-Ford), but because of long-lived loops, changed to a
link-state algorithm (SPP). We evaluate, using a recently developed n
etwork simulator, MaRS, the transient and steady-state performance of
SPF and two newly proposed distance-vector algorithms (ExBF and MS). O
verall, SPF and ExBF have comparable performance and MS is worse.