4-2z Fast convergence: Transmits updates instantly after network topology changes for routinginformation synchronization in the AS.z Loop-free: Computes routes with the shortest path first (SPF) algorithm according to collected linkstates, so no route loops are generated.z Area partition: Allows an AS to be split into different areas for ease of management and routinginformation transmitted between areas is summarized to reduce network bandwidth consumption.z Equal-cost multi-route: Supports multiple equal-cost routes to a destination.z Routing hierarchy: Supports a four-level routing hierarchy that prioritizes routes into intra-area,inter-area, external Type-1, and external Type-2 routes.z Authentication: Supports interface-based packet authentication to ensure the security of packetexchange.z Multicast: Supports multicasting protocol packets on some types of links.Basic ConceptsAutonomous SystemA set of routers using the same routing protocol to exchange routing information constitute anAutonomous System (AS).OSPF route computationOSPF route computation in an area is described as follows:z Based on the network topology around itself, each router generates Link State Advertisements(LSA) and sends them to other routers in update packets.z Each OSPF router collects LSAs from other routers to compose a LSDB (Link State Database).An LSA describes the network topology around a router, so the LSDB describes the entirenetwork topology of the AS.z Each router transforms the LSDB to a weighted directed graph, which actually reflects thetopology architecture of the entire network. All the routers have the same graph.z Each router uses the SPF algorithm to compute a Shortest Path Tree that shows the routes to thenodes in the autonomous system. The router itself is the root of the tree.Router IDAn OSPF process running on a router must have its own router ID, which is a 32-bit unsigned integer,the unique identifier of the router in the AS.OSPF packetsOSPF uses five types of packets:z Hello packet: Periodically sent to find and maintain neighbors, containing the values of sometimers, information about the DR, BDR and known neighbors.z DD packet (database description packet): Describes the digest of each LSA in the LSDB,exchanged between two routers for data synchronization.z LSR (link state request) packet: Requests needed LSAs from the neighbor. After exchanging theDD packets, the two routers know which LSAs of the neighbor are missing from the local LSDBs.Then, they send an LSR packet to each other, requesting the missing LSAs. The LSA packetcontains the digest of the missing LSAs.z LSU (link state update) packet: Transmits the needed LSAs to the neighbor.
