Editing Heuristic routing (section)

==IP routing==
{{Main|IP forwarding}}
The [[IP routing]] protocols in use today are based on one of two algorithms: ''distance vector'' or ''link state''. Distance vector algorithms broadcast routing information to all neighboring routers. Link state routing protocols build a topographical map of the entire network based on updates from neighbor routers, and then use the [[Dijkstra algorithm]] to compute the shortest path to each destination. Metrics used are based on the number of hops, delay, throughput, traffic, and reliability.

===Distance vector algorithms===
*[[Routing Information Protocol|RIP]] uses number of hops, or gateways traversed, as its metric
*[[IGRP]] uses bandwidth, delay, hop count, link reliability, load, and [[Maximum transmission unit|MTU]]
*[[EIGRP]] uses the (DUAL) [[Diffusing Update Algorithm]]
*[[BGP]] uses the distance vector algorithm

===Link state algorithms===
*[[OSPF]] uses the [[Dijkstra algorithm]].