![]() Remaining Dead Interval on the neighbor adjacencyĪ lot of the concepts in this table will be expanded on later in this series.Neighbor’s Adjacency State and DR/BDR status.There are a few pieces of information in the neighbor table: We’ll use this topology to discuss the OSPF tables: Each table serves a particle role in the OSPF process. OSPF TablesĪn OSPF router holds the information related to OSPF in three distinct tables. OSPF also makes use of five different types of packets:Īpart from defining the eight terms above, there are two other critical components of OSPF that must be understood in any discussion of OSPF:Īll ten of the concepts above are discussed in the first lesson. OSPF makes use of three different tables: ![]() To understand OSPF, it’s important to understand the framework OSPF utilizes: OSPF Tables and OSPF Packets. What must match for a Neighbor Adjacency to form?. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |