L10 OSPF concepts.pptVIP

123 Lecture 10OSPF concepts Outline Overview of OSPF Review of link state routing Areas OSPF router types Physical network types Neighbor routers and adjacencies Designated and backup designated router Link state database Overview of OSPF OSPF OSPF: Open Shortest Path First The OSPF routing protocol is the most important link state routing protocol on the Internet. The complexity of OSPF is significant. It runs directly over IP protocol. OSPF = Open + SPF Open: OSPF is an open and non-proprietary standard SPF: Dijkstra algorithm is applied to calculate the Shortest Path First routes History of OSPF History: 1989: RFC1131 OSPF Version 1 1991: RFC1247 OSPF Version 2 1994: RFC1583 OSPF Version 2 (revised) 1997: RFC2178 OSPF Version 2 (revised) 1998: RFC2328 OSPF Version 2 (current version) 2003: RFC3101 The OSPF Not-So-Stubby Area Features of OSPF The following features contribute to the continued acceptance of the OSPF standard: Equal cost load balancing Logical partitioning of the network Support for authentication Fast convergence time Support for CIDR and VLSM Allows hierarchical routing Support for Type-of-Service routing Support for multicasting These features has made OSPF a widely-deployed routing protocol in large networking environments. RIP vs. OSPF RIP: is both limited and simple. OSPF: is both very powerful and somewhat complex. Review of Link State Routing Basic principles Each router establishes a adjacent relationship with its neighbors. Each router generates link state advertisements (LSAs) which are distributed to all routers. LSA = (link id, state of the link, cost, neighbors of the link) Each router maintains a topology database or link state database of all received LSAs, which describes the network as a graph with weighted edges. Each router uses its link state database to run a shortest path algorithm (Dijkstra algorithm) to produce the shortest path to each network. Operation of a link state routing protocol Properties of link state routin