Transient and steady-state performance of routing protocols: distance-vector versus link-state
A. Udaya Shankar, Cengiz Alaettinoğlu, Klaudia Dussa-Zieger, Ibrahim Matta · 1992
We examine two approaches to adaptive routing protocols for wide-area store-and-forward networks, namely, distance-vector and link-state. Distance-vector algorithms have less storage requirements than link-state algorithms. The ARPANET started with a distance-vector algorithm (Distributed Bellman-Ford), but because of long-lived loops, changed to a link-state algorithm (SPF). We evaluate, using a recently developed network simulator, MaRS, the transient and steady-state performance of SPF and two newly proposed distance-vector algorithms (ExBF and MS). Overall, SPF and ExBF have comparable performance and MS is worse. Categories and Subject Descriptors: C.2.1 [Computer-Communication Networks]: Network Architecture and Design---packet networks; store and forward networks; C.2.2 [Computer-Communication Networks]: Network Protocols---protocol architecture; C.2.m [Routing Protocols]; C.4 [Performance of Systems]: measurement techniques; modeling techniques; performance attributes;...