Advanced Net - Lecture-7
Advanced Net - Lecture-7
Routing Concept
Lecture 7
Dynamic Routing
Works with Bellman Ford Works with Dijkstra algorithm Working with Dual algorithm
Algorithm
Full routing tables are exchanged Missing routes are exchanged Missing routes are exchanged
Updates are through broadcast Updates are through multicast Updates are through multicast
• Classfull protocols
» Classfull routing protocol do not carry the subnet mask
information a long with updates
» Which mean that all devices in the network must use the same
subnet mask (FLSM) or default.
– Example: RIP, IGRP
• Classless protocols
» Classless routing protocols carry the subnet mask information
with updates that is why they support sub networks(FLSM and
VLSM) and also default
– Example: EIGRP and OSPF
• RIPv1
» Classfull routing protocol
» No authentication
» Uses broadcast
• RIPv2
» Classless routing protocol
» Support authentication
» Uses multicast address: 224.0.0.9
• Advantages RIP
» Easy to configure
» No designing constraints (un like OSPF)
» Less overhead
• disadvantages RIP
» Bandwidth utilization is very high as broadcast for every 30
second
» Works only on hop count (not consider BW)
» Not scalable as hop count is only 15
» Slow convergence