Talk:Adaptive routing

	This redirect is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Redirect	This redirect does not require a rating on Wikipedia's content assessment scale.
	This redirect is supported by Networking task force.

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)[reply]

I agree with this. Very few people in the industry refer to this as Adaptive routing. -- I'll leave it a while and then rename --Dean Pemberton (talk) 28 February 2009 (UTC)

Adaptive routing

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