A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Distance vector routing is a classic distributed algorithm for obtaining routing tables in a communication network. The algorithm relies on message exchange between neighbor routers. This paper studies the amount of routing data that needs to be stored and exchanged. On a static network, a variation of the algorithm that exchanges routing trees or pseudotrees is slightly more information theoretically efficient than a traditional implementation that exchanges tables. Knowledge of an underlyingdoi:10.1109/ita.2014.6804243 dblp:conf/ita/BarberoY14 fatcat:kjuuhcbdibhkpp24b7fsb35afy