1 / 14

OSPF Version 2 (Open Shortest Path First) (RFC 2328)

OSPF Version 2 (Open Shortest Path First) (RFC 2328). Speaker: Sandra Date:2012/03/20. Outline. Definition Advantages Disadvantages Shortest-Path Tree Routing patterns Link State Advertisements (LSAs) OSPF Connection Hello packet message Reference. Definition.

tory
Download Presentation

OSPF Version 2 (Open Shortest Path First) (RFC 2328)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. OSPF Version 2(Open Shortest Path First)(RFC 2328) Speaker: Sandra Date:2012/03/20

  2. Outline • Definition • Advantages • Disadvantages • Shortest-Path Tree • Routing patterns • Link State Advertisements (LSAs) • OSPFConnection • Hello packet message • Reference

  3. Definition • OSPF (Open Shortest Path First ). It is designed to be run internal to a single Autonomous System. Each OSPF router maintains an identical database describing the Autonomous System's topology. From this database, a routing table is calculated by constructing a shortest- path tree.

  4. Advantages • 1. Fast convergence. • 2. OSPF is a Link State Algorithm. • 3. OSPF supports Variable Length Subnet Masks (VLSM). • 4. OSPF uses multicasting within areas. • 5. After initialization, OSPF only sends updates on routing table sections which have changed, it does not send the entire routing table.

  5. Disadvantages • 1. OSPF is very processor intensive due to implementation of SPF algorithm. OSPF maintains multiple copies of routing information, increasing the amount of memory needed. • 2. OSPF is a more complex protocol to implement compared to RIP.

  6. Shortest-Path Tree R1 2 1 R2 R3 5 4 2 R4 R5 R5 2 3 R6 R6

  7. Routing patterns AS(Autonomous System) area 0 Backbone Areas ABR(Area Border Router) area 1 area 2 ASBR(Autonomous System Boundary Router)

  8. Link State Advertisements (LSAs)(1/2) • Router LSA: Router link advertisements generated by each router for each area it belongs to. • Network LSA：Network link advertisements generated by designated routers (DRs) giving the set of routers attached to a particular network. • Network Summary LSA ： Area Border Router (ABR) takes information it has learned on one of its attached areas and it can summarize it (but not by default) before sending it out on other areas it is connected to.

  9. Link State Advertisements (LSAs)(2/2) • ASBR Summary LSA: This is solved by an Area Border Router flooding the information for the router (i.e. the Autonomous System Boundary Router) where the type 5 originated. • AS External LSA: Generated by the ASBR and provides links external to the Autonomous System (AS). • Group Membership LSA : Group membership link entry generated by multicast OSPF routers. • NSSA(Not-So-Stubby Area) External LSA: not receive external LSAs from Area Border Routers, but are allowed to send external routing information for redistribution.

  10. OSPFConnection E D Hello C B A

  11. Hello packet message • Router ID • Hello/Dead lntervals • Neighbors • Area ID • Router priority • DR(Designated Router) ip address • BDR(Backup Designated Router) ip address E D Hello C B A

  12. Summary(1/2) • OSPF is an interior gateway protocol based on the shortest path first algorithm. • Each router in an OSPF network stores information about router interfaces and their relationship to neighboring routers in a link state database. • The SPF algorithm uses a measurement of the overhead required to send a packet over a particular interface to calculate the cost of a particular route. • The largest entity in an OSPF network is the autonomous system, which is further divided into areas; all OSPF routers within a single area have identical databases.

  13. Summary(2/2) • OSPF routers can have all interfaces in one area, interfaces in multiple areas, or interfaces that connect to other routing protocols. • All traffic between areas travels through Area 0, the backbone. • Routers that share a common segment are neighbors; the Designated Router and Backup Designated Router form adjacencies with their neighbors for the purpose of synchronizing databases.

  14. Reference • OSPF_Tutorial • RFC 2328

More Related