Routing Protocol Techniques
Distance-vector routing uses a distance-vector algorithm (such as the Bellman-Ford routing algorithm), which uses a direction (vector and distance to any link in the internetwork to determine the best route. Each router periodically sends information to each of its neighbours on the cost that it takes to get to a distance node. Typically the cost relates to the hop count. The main problem with distance-vector is that updates to the network are step-by-step, and it has high bandwidth requirements as each router sends its complete routing table to all of its neighbours at regular intervals.
Link-state invloves each router building up the complete topology of the entire internetwork( or at least of the partition on which the router is situated), thus each router contains the same information. With this method, routers only send information to all of the other routers when there is a change in the topology of the network. Link-state is also known as the shortest path first. Typically link-state protocols are OSPF, BGP and EGP. With OSPF, each router builds a hierarchical with link-state is that routers require much more processing power to update the database with details of all the routers on the network.
A mixture of distance-vector and link-state. Typically hybrid routing protocols are IS-IS and Enhanced IGRP.
This site is created by:
Digant Vakharia & Sandip Patel