CCNA Complete Guide 2nd Edition.pdf - Cisco Learning Home
CCNA Complete Guide 2nd Edition.pdf - Cisco Learning Home
CCNA Complete Guide 2nd Edition.pdf - Cisco Learning Home
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
- Point-to-point is a type of network topology which consists a direct connection between 2<br />
routers that provides a single communication path either physically (a direct serial connection) or<br />
logically (a point-to-point Frame Relay virtual circuit). This type of topology does not elect a<br />
DR or BDR.<br />
- Point-to-multipoint is a special type of NBMA network topology which consists of a series of<br />
connections between an interface on one router and multiple interfaces on other routers, and all<br />
the interfaces belong to a same network. This type of topology does not elect a DR or BDR.<br />
- Routers running LS routing protocols establish and maintain (during steady state) neighbor<br />
relationships by exchanging periodical small messages called Hello packets. Hello packets are<br />
sent by DR and BDR to all routers with the IP multicast address 224.0.0.5 (AllSPFRouters).<br />
The Hello interval varies upon media types – 30 seconds for NBMA and 10 seconds for others<br />
(faster links receive more-frequent Hellos). As long as a router continues to receive Hello<br />
packets from its neighbors, the link and the neighboring router are considered up and running.<br />
Hello packets serve the same purpose as periodical full routing updates in DV routing protocols<br />
which notify neighbor routers that a router is up and running and the routes through it are valid.<br />
- When a router fails to receive Hellos from a neighbor for the dead interval, the router believes<br />
the silent router has failed. The router will mark the silent router as ‘down’ in its topology<br />
database and then converge by running SPF algorithm to calculate the new routes. Dead timer<br />
interval is 4 x Hello interval, which is 120 seconds for NBMA and 40 seconds for others.<br />
- LS routing protocols do not need loop avoidance features as in DV routing protocols, eg: split<br />
horizon, poison reverse, and holddown. SPF algorithm prevents loops as natural due to the<br />
processing of the topology database and maintaining the knowledge of the network topology.<br />
- OSPF sends LSUs only when a topology change is detected (event-triggered updates). When a<br />
link or router fails, a router that noticed the failure will immediately flood the new status to its<br />
neighbors, and from those routers to their neighbors. Eventually all routers will receive the new<br />
status information. This is similar to triggered updates in DV routing protocols, but this behavior<br />
is just a feature of LS routing protocols and does not have a specific term.<br />
- In DV routing protocols, most of the convergence time is taken by the loop-avoidance features;<br />
whereas in LS routing protocols, there is no such time-consuming loop-avoidance features,<br />
which means LS protocols can converge very quickly.<br />
- With proper design, OSPF can convergence as fast as 5 seconds after a router notices a failure.<br />
Good design is also very important for OSPF scalability in large networks.<br />
- The 3 scalability issues in large OSPF networks are:<br />
i) Large topology database requires more memory on each router.<br />
ii) Calculation and processing grow exponentially with the size of the topology database.<br />
iii) A single interface or link status change (up – down) forces every router to run SPF!<br />
- Unlike RIP, OSPF can operate in a hierarchy basis. Areas are used to establish a hierarchical<br />
network and the largest entity within the hierarchy is an area. Although it is capable of receiving<br />
routes from and sending routes to other areas, OSPF is still an interior gateway routing protocol.<br />
An AS can be divided into a number of areas, which are groups of networks and routers.<br />
- Hierarchical OSPF implementations reduce routing overhead, speed up convergence, confine<br />
network instability to a single area, and scalable to very large networks.<br />
93<br />
Copyright © 2008 Yap Chin Hoong<br />
yapchinhoong@hotmail.com