From wikistone
Revision as of 21:38, 4 April 2013 by Bill (talk | contribs)
Jump to: navigation, search

OSPF: Open Shortest Path First

Link State routing protocol.
Uses Dijkstra's SPF (Shortest Path First) algorithm.

Tables:

  • Neighbor
  • Topology
  • Route


Notes:

  • All areas connect to area 0.
  • All routers in an area know about all other routers in that area.
  • Area 0 is aka Backbone area.
  • Neighborships form in same area only.
  • Hellos:
    • 10 sec on broadcast & P2P networks
    • 30 sec on NBMA networks
    • Timeout 4x Hello


Router Types:

  • ABR: Area Border Router. Must have 1 int in area 0. Can summarize here only.
  • ASBR: Autonomous System Boundary Router. Links the OSPF AS to external network(s).


LSA Types: (Link State Adverts)

  • ...


Packets:

  • Hello
    • RID, Router Priority, Neighbors, BR & BDR addresses
    • (Must match for neighborship formation.) Area #, Hello & Dead timers, NetMask, Auth


Neighborship:

  • RID (Router ID) is determined.
    • Staticly declared or determined by: highest active IP when OSPF starts (loopback > physical).
    • RID is 32 bit in IPv4 format.
    • If dynamic RID, RID will only change if OSPF is manually restarted or at router reload.
  • If Hello contains This router, This knows neighborship is formed. If Hello doesn't contain This, This attempts to form neighborship.
  • States:
    • Init State: received Hello (if no Hello matches, Init -> Down).
    • 2-Way State: This router listed in Other's Hello & Other router listed in This' Hello.
    • ExStart State: Master-Slave determined by Priority > RID. Master sends DB Desc (DBD) packet (summary of Link-State db). Slave sends DBD.
    • Loading State: Ack DBDs.
      • Slave Req details (Link-State Requests [LSR])
      • Master Tx updates (Link-State Updates [LSU])
      • Master Req details (LSR)
      • Slave Tx updates (LSU)
    • Full State: Neighborship formed.



.