Oct 31 2010 6:36PM GMT
Posted by: Yasir Irfan
CCNA tips, Classless Inter-Domain-Routing (CIDR), Dijkstra algorithm, Distance vector protocols, how OSPF works?, ICND2 certification exam, ICND2 tips, ink state protocol, IPv4 networks, IPv6 networks, Open Shortest Path First (OSPF), OSPF, OSPF from CCNA- ICND2 perspective, OSPFv2, OSPFv3, RIP1, RIP2, Variable-Length Subnet Masking (VLSM)
OSPF from CCNA- ICND2 perspective – Series 2
Posted by: Yasir Irfan
Most people were introduced to OSPF as the first link-sate routing protocol and some of the features of OSPF are as follows,
- Consists of areas and autonomous systems
- Minimizes routing update traffic
- Allows scalability
- Supports VLSM/CIDR
- Has unlimited hop count
- Allows multi-vendor deployment (open standard)
Do know these features well from CCNA point of view.
The below table compares OSPF with the distance vector routing protocols like RIP1 and RIP2
| Characteristic | OSPF | RIP2 | RIP1 |
| Type of protocol | Link state | Distance vector | Distance vector |
| Classless support | Yes | Yes | No |
| VLSM support | Yes | Yes | No |
| Auto-summarization | No | Yes | Yes |
| Manual summarization | Yes | No | No |
| Discontiguous support | Yes | Yes | No |
| Route propagation | Multicast on change | Periodic multicast | Periodic broadcast |
| Path metric | Bandwidth | Hops | Hops |
| Hop count limit | None | 15 | 15 |
| Convergence | Fast | Slow | Slow |
| Peer authentication | Yes | Yes | No |
| Hierarchical network | Yes (using areas) | No (flat only) | No (flat only) |
| Updates | Event triggered | Route table updates | Route table updates |
| Route computation | Dijkstra | Bellman-Ford | Bellman-Ford |




