|WikiProject Computing / Networking||(Rated Redirect-class)|
Adaptive vs. Dynamic
The usage of a routing protocol is typically described as "dynamic", not "adaptive" routing. Is this perhaps an archaic term that I am too young to remember? I suggest to rename this page accordingly, and to redirect "Adaptive Routing" to "Dynamic Routing" --Pgallert (talk) 16:14, 18 September 2008 (UTC)
Non-adaptive algorithms make no real attempt to adjust to changing network conditions; no routing information is exchanged by the nodes, and no observations or measurements are made at individual nodes. Centralized adaptive algorithms utilize a central authority which dictates the routing decisions to the individual nodes in response to network changes. Isolated adaptive algorithms operate independently, with each node making exclusive use of local data to adapt to changing conditions. Distributed adaptive algorithms utilize internode cooperation and the exchange of information to arrive at routing decisions.
McQuillan, J.M.; Falk, G.; Richer, I., "A Review of the Development and Performance of the ARPANET Routing Algorithm," Communications, IEEE Transactions on , vol.26, no.12, pp.1802,1811, Dec 1978