Just did this lab earlier today and wanted to post some stuff that might help people. I’ve posted earlier on how to quickly find out IP-addresses and masks with different commands. I played around a little more today and this
OSPF adjacency over non common subnet
Found out an interesting thing while doing a Vol3 lab. We all know that EIGRP will not form an adjacency over a non common subnet unless special circumstances. What about OSPF? I had a lab task where I need to
Timers used in OSPF
In any IGP there are a lot of timers involved in running the protocol. This post will not describe the hello and dead timers, these are well known. This post describes the less known timers that control how often packets
OSPF lab notes
This post is based on notes from my practicing OSPF vol1 labs. I want to have them saved for later reference but I also think that this post can help others and clear some of the confusions of OSPF. Lets
OSPF – Open Shortest Path First (notes)
Defined in RFC 2328 Supports VLSM and CIDR Is a link state protocol Uses a link state database (LSDB) for topology information, identical within area Reliable flooding of LSAs Uses hello protocol to build adjacencies Runs directly over IP,