The document discusses OSPF link-state routing protocol. It describes OSPF's use of link-state databases containing topology information and Dijkstra's algorithm to calculate the shortest path to all destinations. It also explains OSPF's hierarchical area-based network structure and use of link-state advertisements to exchange routing information between neighbors.
The document provides information on configuring the OSPF routing protocol. It discusses OSPF link-state routing concepts, areas, adjacencies, and the SPF algorithm. It also covers configuring OSPF on routers, including enabling OSPF routing, defining network statements, and setting the OSPF router ID using a loopback interface or router-id command. Debugging OSPF packets is demonstrated using the debug ip ospf packet command.
The document discusses link-state routing protocols and OSPF. It provides details on:
- The link-state routing process which involves routers learning their own links, meeting neighbors, building link-state packets, flooding LSPs to neighbors, and computing the best path.
- Components of OSPF including link states, areas, route types, router classifications, and packet types.
- The OSPF operation process of establishing neighbor adjacencies through hello packets, exchanging LSAs, building the topology table, running the SPF algorithm, and updating routing tables.
- OSPF router states including down, init, 2-way, exchange, loading, and full when establishing
- OSPF is a link-state routing protocol that is more scalable than RIP. It builds a complete "map" of the network to avoid routing loops.
- OSPF uses link-state advertisements and flooding to exchange routing information between routers. It elects a designated router and backup designated router to optimize this exchange.
- Routers using OSPF establish neighbor relationships, synchronize their link-state databases, and calculate the shortest path to all known destinations using an algorithm on the link-state database.
OSPF is a link-state routing protocol that uses LSAs to exchange routing and topology information between routers. Routers must establish neighbor relationships by exchanging Hello packets before sharing LSAs. Routers run the SPF algorithm to calculate the best paths based on the collected link-state database and populate their routing tables. OSPF supports features like equal cost load balancing, VLSM, and manual summarization. It divides large networks into areas to reduce routing overhead.
OSPF is a link-state routing protocol that uses the Shortest Path First algorithm to calculate the shortest path to destinations. It propagates link-state advertisements rather than routing table updates. OSPF supports hierarchical routing to minimize routing updates. Single-area OSPF configurations assign networks to areas using the network command under the OSPF routing process.
Menggali Lebih Dalam tentang OSPF: Protokol Routing Dinamis yang Efisien.pptRochmadGSaputra
OSPF is a link-state routing protocol used for dynamic routing between routers in an IP network. It works by having each router build a map of the entire network topology and calculate the shortest path to each destination. Changes in link states are flooded throughout the network and all routers recalculate routes. OSPF uses designated routers on broadcast networks to reduce routing traffic and scale better in large networks. It supports features like areas, route authentication, and equal cost multipath.
OSPF is a link-state routing protocol used for dynamic routing between routers in an IP network. It works by having each router build a map of the entire network topology and calculate the shortest path to each destination. Changes in link states are flooded throughout the network and all routers recalculate routes. OSPF uses designated routers on broadcast networks to reduce routing traffic and scale better in large networks. It supports features like areas, route authentication, and equal cost multipath.
The document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes how OSPF routers exchange link state advertisements to maintain a synchronized topological database. The database allows each router to calculate the shortest path to all destinations within the autonomous system. The document also discusses OSPF packet types, the process of forming adjacencies between neighbors, and the election of designated routers on multi-access networks.
Basically it contains information about the OSPF routing protocol. As much as possible the information was tried to be summarized and a slideshow of visual weight was made.
- Open Shortest Path First (OSPF) is an interior gateway protocol that uses link state routing to distribute routing information within a single autonomous system to calculate the shortest path to destinations. It provides fast convergence, supports authentication and security, and can load balance traffic across multiple equal-cost paths.
- OSPF functions by establishing neighbor adjacencies, exchanging link state advertisements to build a complete topology database, running the shortest path first algorithm to determine the best routes, and installing these routes in the routing table. It also uses areas and link state types to optimize routing and segment traffic flow.
Layer 3 Protocols
This document provides an overview of various layer 3 protocols and techniques, including routing protocols (BGP, IS-IS, OSPF, RIP), multicasting protocols (IGMP), and loop avoidance techniques. It describes the purpose and key features of each protocol. BGP exchanges routing information between autonomous systems. IS-IS and OSPF are intra-AS routing protocols that use link-state algorithms. RIP is a distance vector protocol best suited to small networks. IGMP manages multicast group membership. NDP provides address resolution and neighbor discovery for IPv6. HIP separates host identity from IP addresses to enable mobility.
- Open Shortest Path First (OSPF) is a link-state routing protocol that can be used for both small and large networks. It uses areas and hierarchical network design to reduce routing overhead and improve performance as the network scales.
- OSPF establishes neighbor relationships to exchange routing information. It elects a Designated Router and Backup Designated Router to optimize this exchange on multi-access networks. Link-state databases are synchronized between neighbors to calculate the shortest paths.
- Basic OSPF configuration involves enabling OSPF on interfaces and networks, setting authentication, and adjusting metrics and timers. Loopback interfaces ensure router IDs remain stable. Verification commands display neighbor relationships and routing tables.
This document provides an overview of a seminar presentation on Open Shortest Path First (OSPF) routing protocol. The presentation covers the basic concepts of OSPF including its use of the Shortest Path First algorithm, areas, router types, header format, and hello packets. It also gives examples of OSPF configuration and important terms like loopback interfaces, designated routers, and authentication. The summary highlights both the processor intensive nature of OSPF but also its advantages like hierarchy, link state design, and support for VLSM.
he Associate level of Cisco Certifications can begin directly with CCNA for network installation, operations and troubleshooting or CCDA for network design. Think of the Associate Level as the foundation level of networking certification.
A PROJECT REPORT
On
CISCO CERTIFIED NETWORK ASSOCIATE
A computer network, or simply a network, is a collection of computer and other hardware components interconnected by communication channels that allow sharing of resources and information. Where at least one process in one device is able to send/receive data to/from at least one process residing in a remote device, then the two devices are said to be in a network. Simply, more than one computer interconnected through a communication medium for information interchange is called a computer network.
EIGRP and OSPF are routing protocols. EIGRP uses the DUAL algorithm and metric to select fast, loop-free routes. It supports multiple network layers and rapid convergence. OSPF is an open standard link-state protocol that provides a common network view and calculates the shortest path. It can route between autonomous systems and uses link state updates and SPF algorithm. Configuring OSPF involves assigning networks to areas and defining the routing process. Verification includes checking neighbors, routes, and topology tables.
EIGRP and OSPF are routing protocols. EIGRP uses the DUAL algorithm and metric to select fast, loop-free routes. It supports multiple network layers and rapid convergence. OSPF is an open standard link-state protocol that provides a common network view and calculates the shortest path. It can route between autonomous systems and uses link state updates and SPF algorithm. Configuring OSPF involves assigning networks to areas and defining the routing process. Verification includes checking neighbors, routes, and topology tables.
Open Shortest Path First (OSPF) || 2020 || Ser-2Nutan Singh
Open Shortest Path First (OSPF) is a routing protocol for Internet Protocol (IP) networks. It uses a link state routing (LSR) algorithm and falls into the group of interior gateway protocols (IGPs), operating within a single autonomous system (AS). It is defined as OSPF Version 2 in RFC 2328 (1998) for IPv4.
This document provides an overview of OSPFv3, the Open Shortest Path First routing protocol for IPv6 networks. It describes the key differences between OSPFv3 and OSPFv2, including that OSPFv3 runs per link instead of per subnet, uses new LSA types to advertise addresses and link-local addresses, and has additional option bits. The document also covers common aspects like the use of multicast, DR election, the database exchange process, and the different OSPF packet types.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes key OSPF concepts like link state routing, areas, neighbor relationships, designated routers, link state advertisements, and shortest path first algorithms. It also provides configuration examples and compares OSPF to other routing protocols.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes key OSPF concepts like link state routing, areas, neighbor relationships, designated routers, link state advertisements, and shortest path first algorithms. It also provides configuration examples and compares OSPF to other routing protocols.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It defines key OSPF concepts like link state advertisements (LSAs), neighbor and topology tables, designated routers (DRs), flooding, shortest path first (SPF) algorithm, and areas. It also compares OSPF to distance vector protocols, describes OSPF network types and neighbor relationships, and provides examples of basic OSPF configuration.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It defines key OSPF terminology like link, router ID, neighbors, adjacency, area, backbone area, Area Border Router (ABR), Autonomous System Boundary Router (ASBR). It describes OSPF network types, neighbor tables, topology tables, routing tables, and the link state advertisement (LSA) process. It also covers OSPF configuration, path calculation using the Dijkstra algorithm, and advantages of OSPF like rapid convergence and scalability.
OSPF is a link-state interior gateway protocol that uses shortest path first algorithm to calculate routes. It elects a designated router that exchanges link-state advertisements and database information with other routers to choose the best routes. OSPF supports equal cost multi-path routing, uses different types of link-state advertisements, and allows dividing networks into areas to reduce routing overhead. It authenticates messages to prevent routing attacks.
OSPF is a link-state routing protocol used within an autonomous system. Each router maintains an identical link state database describing the network topology and calculates shortest paths using the SPF algorithm. Routers establish adjacencies to exchange routing information and databases are synchronized during the exchange process. OSPF supports features like equal-cost multi-path routing and areas to reduce routing traffic and provide protection.
OSPF is a link-state routing protocol used for dynamic routing between routers in an IP network. It works by having each router build a map of the entire network topology and calculate the shortest path to each destination. Changes in link states are flooded throughout the network and all routers recalculate routes. OSPF uses designated routers on broadcast networks to reduce routing traffic and scale better in large networks. It supports features like areas, route authentication, and equal cost multipath.
The document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes how OSPF routers exchange link state advertisements to maintain a synchronized topological database. The database allows each router to calculate the shortest path to all destinations within the autonomous system. The document also discusses OSPF packet types, the process of forming adjacencies between neighbors, and the election of designated routers on multi-access networks.
Basically it contains information about the OSPF routing protocol. As much as possible the information was tried to be summarized and a slideshow of visual weight was made.
- Open Shortest Path First (OSPF) is an interior gateway protocol that uses link state routing to distribute routing information within a single autonomous system to calculate the shortest path to destinations. It provides fast convergence, supports authentication and security, and can load balance traffic across multiple equal-cost paths.
- OSPF functions by establishing neighbor adjacencies, exchanging link state advertisements to build a complete topology database, running the shortest path first algorithm to determine the best routes, and installing these routes in the routing table. It also uses areas and link state types to optimize routing and segment traffic flow.
Layer 3 Protocols
This document provides an overview of various layer 3 protocols and techniques, including routing protocols (BGP, IS-IS, OSPF, RIP), multicasting protocols (IGMP), and loop avoidance techniques. It describes the purpose and key features of each protocol. BGP exchanges routing information between autonomous systems. IS-IS and OSPF are intra-AS routing protocols that use link-state algorithms. RIP is a distance vector protocol best suited to small networks. IGMP manages multicast group membership. NDP provides address resolution and neighbor discovery for IPv6. HIP separates host identity from IP addresses to enable mobility.
- Open Shortest Path First (OSPF) is a link-state routing protocol that can be used for both small and large networks. It uses areas and hierarchical network design to reduce routing overhead and improve performance as the network scales.
- OSPF establishes neighbor relationships to exchange routing information. It elects a Designated Router and Backup Designated Router to optimize this exchange on multi-access networks. Link-state databases are synchronized between neighbors to calculate the shortest paths.
- Basic OSPF configuration involves enabling OSPF on interfaces and networks, setting authentication, and adjusting metrics and timers. Loopback interfaces ensure router IDs remain stable. Verification commands display neighbor relationships and routing tables.
This document provides an overview of a seminar presentation on Open Shortest Path First (OSPF) routing protocol. The presentation covers the basic concepts of OSPF including its use of the Shortest Path First algorithm, areas, router types, header format, and hello packets. It also gives examples of OSPF configuration and important terms like loopback interfaces, designated routers, and authentication. The summary highlights both the processor intensive nature of OSPF but also its advantages like hierarchy, link state design, and support for VLSM.
he Associate level of Cisco Certifications can begin directly with CCNA for network installation, operations and troubleshooting or CCDA for network design. Think of the Associate Level as the foundation level of networking certification.
A PROJECT REPORT
On
CISCO CERTIFIED NETWORK ASSOCIATE
A computer network, or simply a network, is a collection of computer and other hardware components interconnected by communication channels that allow sharing of resources and information. Where at least one process in one device is able to send/receive data to/from at least one process residing in a remote device, then the two devices are said to be in a network. Simply, more than one computer interconnected through a communication medium for information interchange is called a computer network.
EIGRP and OSPF are routing protocols. EIGRP uses the DUAL algorithm and metric to select fast, loop-free routes. It supports multiple network layers and rapid convergence. OSPF is an open standard link-state protocol that provides a common network view and calculates the shortest path. It can route between autonomous systems and uses link state updates and SPF algorithm. Configuring OSPF involves assigning networks to areas and defining the routing process. Verification includes checking neighbors, routes, and topology tables.
EIGRP and OSPF are routing protocols. EIGRP uses the DUAL algorithm and metric to select fast, loop-free routes. It supports multiple network layers and rapid convergence. OSPF is an open standard link-state protocol that provides a common network view and calculates the shortest path. It can route between autonomous systems and uses link state updates and SPF algorithm. Configuring OSPF involves assigning networks to areas and defining the routing process. Verification includes checking neighbors, routes, and topology tables.
Open Shortest Path First (OSPF) || 2020 || Ser-2Nutan Singh
Open Shortest Path First (OSPF) is a routing protocol for Internet Protocol (IP) networks. It uses a link state routing (LSR) algorithm and falls into the group of interior gateway protocols (IGPs), operating within a single autonomous system (AS). It is defined as OSPF Version 2 in RFC 2328 (1998) for IPv4.
This document provides an overview of OSPFv3, the Open Shortest Path First routing protocol for IPv6 networks. It describes the key differences between OSPFv3 and OSPFv2, including that OSPFv3 runs per link instead of per subnet, uses new LSA types to advertise addresses and link-local addresses, and has additional option bits. The document also covers common aspects like the use of multicast, DR election, the database exchange process, and the different OSPF packet types.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes key OSPF concepts like link state routing, areas, neighbor relationships, designated routers, link state advertisements, and shortest path first algorithms. It also provides configuration examples and compares OSPF to other routing protocols.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes key OSPF concepts like link state routing, areas, neighbor relationships, designated routers, link state advertisements, and shortest path first algorithms. It also provides configuration examples and compares OSPF to other routing protocols.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It defines key OSPF concepts like link state advertisements (LSAs), neighbor and topology tables, designated routers (DRs), flooding, shortest path first (SPF) algorithm, and areas. It also compares OSPF to distance vector protocols, describes OSPF network types and neighbor relationships, and provides examples of basic OSPF configuration.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It defines key OSPF terminology like link, router ID, neighbors, adjacency, area, backbone area, Area Border Router (ABR), Autonomous System Boundary Router (ASBR). It describes OSPF network types, neighbor tables, topology tables, routing tables, and the link state advertisement (LSA) process. It also covers OSPF configuration, path calculation using the Dijkstra algorithm, and advantages of OSPF like rapid convergence and scalability.
OSPF is a link-state interior gateway protocol that uses shortest path first algorithm to calculate routes. It elects a designated router that exchanges link-state advertisements and database information with other routers to choose the best routes. OSPF supports equal cost multi-path routing, uses different types of link-state advertisements, and allows dividing networks into areas to reduce routing overhead. It authenticates messages to prevent routing attacks.
OSPF is a link-state routing protocol used within an autonomous system. Each router maintains an identical link state database describing the network topology and calculates shortest paths using the SPF algorithm. Routers establish adjacencies to exchange routing information and databases are synchronized during the exchange process. OSPF supports features like equal-cost multi-path routing and areas to reduce routing traffic and provide protection.
5 Reasons cheap WordPress hosting is costing you more | Reversed OutReversed Out Creative
Cheap WordPress hosting may seem budget-friendly, but it often comes with hidden costs like poor performance, security risks, and limited support. This article breaks down the true impact of low-cost hosting and why investing wisely can benefit your website in the long run.
Follow this step-by-step guide to activate and configure your Frontier Unlimited Internet. Get expert setup tips from a reliable Internet service Provider and responsive Frontier Customer Service.
文凭(UMA毕业证书)马拉加大学毕业证成绩单制作案例【q微1954292140】马拉加大学offer/学位证、留信官方学历认证(永久存档真实可查)采用学校原版纸张、特殊工艺完全按照原版一比一制作【q微1954292140】Buy Universidad de Málaga Diploma购买美国毕业证,购买英国毕业证,购买澳洲毕业证,购买加拿大毕业证,以及德国毕业证,购买法国毕业证(q微1954292140)购买荷兰毕业证、购买瑞士毕业证、购买日本毕业证、购买韩国毕业证、购买新西兰毕业证、购买新加坡毕业证、购买西班牙毕业证、购买马来西亚毕业证等。包括了本科毕业证,硕士毕业证。
【办理马拉加大学成绩单Buy Universidad de Málaga Transcripts】
购买日韩成绩单、英国大学成绩单、美国大学成绩单、澳洲大学成绩单、加拿大大学成绩单(q微1954292140)新加坡大学成绩单、新西兰大学成绩单、爱尔兰成绩单、西班牙成绩单、德国成绩单。成绩单的意义主要体现在证明学习能力、评估学术背景、展示综合素质、提高录取率,以及是作为留信认证申请材料的一部分。
马拉加大学成绩单能够体现您的的学习能力,包括马拉加大学课程成绩、专业能力、研究能力。(q微1954292140)具体来说,成绩报告单通常包含学生的学习技能与习惯、各科成绩以及老师评语等部分,因此,成绩单不仅是学生学术能力的证明,也是评估学生是否适合某个教育项目的重要依据!
Buy Universidad de Málaga Diploma《正式成绩单论文没过》有文凭却得不到认证。又该怎么办???西班牙毕业证购买,西班牙文凭购买,【q微1954292140】西班牙文凭购买,西班牙文凭定制,西班牙文凭补办。专业在线定制西班牙大学文凭,定做西班牙本科文凭,【q微1954292140】复制西班牙Universidad de Málaga completion letter。在线快速补办西班牙本科毕业证、硕士文凭证书,购买西班牙学位证、马拉加大学Offer,西班牙大学文凭在线购买。
特殊原因导致无法毕业,也可以联系我们帮您办理相关材料:
1:在马拉加大学挂科了,不想读了,成绩不理想怎么办?
2:打算回国了,找工作的时候,需要提供认证《UMA成绩单购买办理马拉加大学毕业证书范本》
购买日韩毕业证、英国大学毕业证、美国大学毕业证、澳洲大学毕业证、加拿大大学毕业证(q微1954292140)新加坡大学毕业证、新西兰大学毕业证、爱尔兰毕业证、西班牙毕业证、德国毕业证,回国证明,留信网认证,留信认证办理,学历认证。从而完成就业。马拉加大学毕业证办理,马拉加大学文凭办理,马拉加大学成绩单办理和真实留信认证、留服认证、马拉加大学学历认证。学院文凭定制,马拉加大学原版文凭补办,成绩单详解细节,扫描件文凭定做,100%文凭复刻。
主营项目:
1、真实教育部国外学历学位认证《西班牙毕业文凭证书快速办理马拉加大学学位证和毕业证的区别》【q微1954292140】《论文没过马拉加大学正式成绩单》,教育部存档,教育部留服网站100%可查.
2、办理UMA毕业证,改成绩单《UMA毕业证明办理马拉加大学学历认证失败怎么办》【Q/WeChat:1954292140】Buy Universidad de Málaga Certificates《正式成绩单论文没过》,马拉加大学Offer、在读证明、学生卡、信封、证明信等全套材料,从防伪到印刷,从水印到钢印烫金,高精仿度跟学校原版100%相同.
3、真实使馆认证(即留学人员回国证明),使馆存档可通过大使馆查询确认.
4、留信网认证,国家专业人才认证中心颁发入库证书,留信网存档可查.
西班牙马拉加大学毕业证(UMA毕业证书)UMA文凭【q微1954292140】高仿真还原西班牙文凭证书和外壳,定制西班牙马拉加大学成绩单和信封。学历认证失败怎么办UMA毕业证【q微1954292140】毕业证工艺详解马拉加大学offer/学位证文凭一模一样、留信官方学历认证(永久存档真实可查)采用学校原版纸张、特殊工艺完全按照原版一比一制作。帮你解决马拉加大学学历学位认证难题。
帮您解决在西班牙马拉加大学未毕业难题(Universidad de Málaga)文凭购买、毕业证购买、大学文凭购买、大学毕业证购买、买文凭、日韩文凭、英国大学文凭、美国大学文凭、澳洲大学文凭、加拿大大学文凭(q微1954292140)新加坡大学文凭、新西兰大学文凭、爱尔兰文凭、西班牙文凭、德国文凭、教育部认证,买毕业证,毕业证购买,买大学文凭,【q微1954292140】学位证1:1完美还原海外各大学毕业材料上的工艺:水印,阴影底纹,钢印LOGO烫金烫银,LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。《马拉加大学2025年新版毕业证书西班牙毕业证书办理UMA录取通知书》
Essential Tech Stack for Effective Shopify Dropshipping Integration.pdfCartCoders
Looking to connect AliExpress or other platforms with your Shopify store? Our Shopify Dropshipping Integration service helps automate orders, manage inventory, and improve delivery time. Start syncing your suppliers and scale your dropshipping business.
Cloud VPS Provider in India: The Best Hosting Solution for Your BusinessDanaJohnson510230
HeroXhost is a leading Cloud VPS provider in India offering powerful hosting solutions with SSD storage, high-speed performance, and 24/7 support. It provides flexible pricing plans suitable for startups, enterprises, and developers.
3. Link-State Data Structures
• Neighbor table:
– Also known as the adjacency database
– Contains list of recognized neighbors
• Topology table:
– Typically referred to as LSDB
– Contains all routers and their attached links in the area or network
– Identical LSDB for all routers within an area
• Routing table:
– Commonly named a forwarding database
– Contains list of best paths to destinations
4. Link-State Routing Protocols
• Link-state routers recognize more information about the
network than their distance vector counterparts.
• Each router has a full picture of the topology.
• Consequently, link-state routers tend to make more accurate
decisions.
5. Link-State Data Structure:
Network Hierarchy
• Link-state routing requires a hierachical
network structure that is enforced by OSPF.
• This two-level hierarchy consists of the following:
– Transit area (backbone or area 0)
– Regular areas (nonbackbone areas)
6. OSPF area
characteristics:
• Minimizes routing
table entries
• Localizes impact of
a topology change
within an area
• Detailed LSA
flooding stops at
the area boundary
• Requires a
hierarchical
network design
OSPF Areas
7. • Routers A and B are
backbone routers.
• Backbone routers
make up area 0.
• Routers C, D, and E are
known as area border
routers (ABRs).
• ABRs attach all other
areas to area 0.
Area Terminology
8. OSPF Adjacencies
• Routers discover neighbors by exchanging hello packets.
• Routers declare neighbors to be up after checking
certain parameters or options in the hello packet.
9. Forming OSPF Adjacencies
• Point-to-point WAN links:
– Both neighbors become fully adjacent.
• LAN links:
– Neighbors form a full adjacency with the DR and BDR.
– Routers maintain two-way state with the other routers
(DROTHERs).
• Routing updates and topology information are passed only between
adjacent routers.
• Once an adjacency is formed, LSDBs are synchronized by
exchanging LSAs.
• LSAs are flooded reliably throughout the area (or network).
10. OSPF Calculation
Routers find the best paths to destinations by applying
Dijkstra’s SPF algorithm to the link-state database as
follows:
• Every router in an area has the identical
link-state database.
• Each router in the area places itself into
the root of the tree that is built.
• The best path is calculated with respect to the
lowest total cost of links to a specific destination.
• Best routes are put into the forwarding database (routing table).
13. Summary
• Link-state routing protocols respond quickly to changes,
send triggered updates when changes occur, and send
periodic updates every 30 minutes.
• A two-tier hierarchical network structure is used by OSPF in
which the network is divided into areas. This area structure
is used to separate the LSDB into more manageable sizes.
• Adjacencies are built by OSPF routers using the Hello
protocol. Over these logical adjacencies, LSUs are sent to
exchange database information between adjacent OSPF
routers.
14. Summary (Cont.)
• Dijkstra’s SPF algorithm is used to calculate best paths for
all destinations. SPF is run against the LSDB, and the
outcome is a table of best paths, known as the routing table.
• After an LSA entry ages, the router that originated the entry
sends an LSU about the network to verify that the link is still
active. The LSU can contain one or more LSAs.
22. • Router A notifies all OSPF DRs on 224.0.0.6.
• DR notifies others on 224.0.0.5.
Maintaining Routing Information
23. LSA Sequence Numbering
• Each LSA in the LSDB maintains a sequence number.
• The sequence numbering scheme is a 4-byte number that
begins with 0x80000001 and ends with 0x7FFFFFFF.
• OSPF floods each LSA every 30 minutes to maintain proper
database synchronization. Each time the LSA is flooded, the
sequence number is incremented by one.
• Ultimately, an LSA sequence number will wrap around to
0x80000001. When this occurs, the existing LSA is
prematurely aged to the maximum age (one hour) and
flushed.
• When a router encounters two instances of an LSA, it must
determine which is more recent. The LSA having the newer
(higher) LS a sequence number is more recent.
24. LSA Sequence Numbers and Maximum Age
• Every OSPF router announces a router LSA for those
interfaces that it owns in that area.
• Router with link ID 192.168.1.67 has been updated eight
times; the last update was 48 seconds ago.
RTC# show ip ospf database
OSPF Router with ID (192.168.1.67) (Process ID 10)
Router Link States (Area 1)
Link ID ADV Router Age Seq# Checksum Link count
192.168.1.67 192.168.1.67 48 0x80000008 0xB112 2
192.168.2.130 192.168.2.130 212 0x80000006 0x3F44 2
<output omitted>
25. debug ip ospf packet
R1#debug ip ospf packet
OSPF packet debugging is on
R1#
*Feb 16 11:03:51.206: OSPF: rcv. v:2 t:1 l:48 rid:10.0.0.12
aid:0.0.0.1 chk:D882 aut:0 auk: from Serial0/0/0.2
Debug of a single packet
• Shows fields in OSPF header
26. Summary
• There are five OSPF packet types: hello, DBD, LSU, LSR, and
LSAck.
• The Hello protocol forms logical neighbor adjacency
relationships. A DR may be required to coordinate adjacency
formations.
• The exchange protocol passes through several states
(down, init, two-way, exstart, and exchange) before finally
reaching the goal of full state. Full state means that
databases are synchronized with adjacent routers.
27. Summary (Cont.)
• LSAs are sent on change but are also sent every 30 minutes
to ensure database integrity. The maximum time that an LSA
will stay in the database, without an update, is 1 hour. The
LSA sequence number is incremented every time it is
advertised.
• Each LSA in the LSDB has a sequence number, which is
incremented by one each time the LSA is flooded. When a
router encounters two instances of an LSA, it must
determine which is more recent. The LSA having the newer
(higher) LSA sequence number is more recent.
• Use the debug ip ospf packet command to verify that OSPF
packets are flowing properly between two routers.
29. router ospf process-id [vrf vpn-name]
Router(config)#
• Enables one or more OSPF routing processes
Configuring Basic OSPF
network ip-address wildcard-mask area area-id
Router(config-router)#
• Defines the interfaces that OSPF will run on
Router(config-if)#
ip ospf process-id area area-id [secondaries none]
• Optional method to enable OSPF explicitly on an interface
32. OSPF Router ID
• The router is known to OSPF by the OSPF router ID number.
• LSDBs use the OSPF router ID to differentiate one router from the
next.
• By default, the router ID is the highest IP address on an active
interface at the moment of OSPF process startup.
• A loopback interface can override the OSPF router ID. If a loopback
interface exists, the router ID is the highest IP address on any active
loopback interface.
• The OSPF router-id command can be used to override the OSPF
router ID.
• Using a loopback interface or a router-id command is recommended
for stability.
33. Router(config)#interface loopback 0
Router(config-if)#ip address 172.16.17.5 255.255.255.255
• If the OSPF process is already running, the router must be
reloaded or the OSPF process must be removed and
reconfigured before the new loopback address will take effect.
Loopback Interfaces
34. router-id ip-address
• This command is configured under the router ospf [process-id]
command.
• Any unique arbitrary 32-bit value in an IP address format
(dotted decimal) can be used.
• If this command is used on an OSPF process that is already
active, then the new router ID is used after the next reload or
manual OSPF process restart using:
OSPF router-id Command
Router(config-router)#
Router(config)#router ospf 1
Router(config-router)#router-id 172.16.1.1
Router#clear ip ospf process
clear ip ospf process
Router#
35. OSPF Router ID Verification
RouterB#sh ip ospf
Routing Process "ospf 50" with ID 10.64.0.2
<output omitted>
Number of areas in this router is 2. 2 normal 0 stub 0 nssa
Number of areas transit capable is 0
External flood list length 0
Area BACKBONE(0)
Area BACKBONE(0)
Area has no authentication
SPF algorithm last executed 00:01:25.028 ago
SPF algorithm executed 7 times
<output omitted>
Area 1
Number of interfaces in this area is 1
Area has no authentication
SPF algorithm last executed 00:00:54.636 ago
SPF algorithm executed 3 times
<output omitted>
36. show ip protocols
Router#
• Verifies the configured IP routing protocol processes,
parameters, and statistics
Verifying OSPF Operation
show ip route ospf [process-id ]
Router#
• Displays all OSPF routes learned by the router
show ip ospf interface [type number]
Router#
• Displays the OSPF router ID, area ID, and adjacency information
37. show ip ospf
Router#
• Displays the OSPF router ID, timers, and statistics
Verifying OSPF Operation (Cont.)
show ip ospf neighbor [type number] [neighbor-id]
[detail]
Router#
• Displays information about the OSPF neighbors, including DR
and BDR information on broadcast networks
38. Example: The show ip route ospf Command
RouterA#show ip route ospf
10.0.0.0/8 is variably subnetted, 3 subnets, 2 masks
O IA 10.2.1.0/24 [110/782] via 10.64.0.2, 00:03:05, FastEthernet0/0
RouterA#
39. Example: The show ip ospf interface
Command
RouterA#show ip ospf interface fastEthernet 0/0
FastEthernet0/0 is up, line protocol is up
Internet Address 10.64.0.1/24, Area 0
Process ID 1, Router ID 10.64.0.1, Network Type BROADCAST, Cost: 1
Transmit Delay is 1 sec, State DROTHER, Priority 0
Designated Router (ID) 10.64.0.2, Interface address 10.64.0.2
No backup designated router on this network
Timer intervals configured, Hello 10, Dead 40, Wait 40, Retransmit 5
oob-resync timeout 40
Hello due in 00:00:04
Supports Link-local Signaling (LLS)
Index 1/1, flood queue length 0
Next 0x0(0)/0x0(0)
Last flood scan length is 1, maximum is 4
Last flood scan time is 0 msec, maximum is 4 msec
Neighbor Count is 1, Adjacent neighbor count is 1
Adjacent with neighbor 10.64.0.2 (Designated Router)
Suppress hello for 0 neighbor(s)
40. Example: The show ip ospf neighbor
Command
RouterB# show ip ospf neighbor
Neighbor ID Pri State Dead Time Address Interface
10.64.0.1 0 FULL/DROTHER 00:00:30 10.64.0.1 FastEthernet0/0
10.2.1.1 0 FULL/ - 00:00:34 10.2.1.1 Serial0/0/1
RouterB# show ip ospf neighbor detail
Neighbor 10.64.0.1, interface address 10.64.0.1
In the area 0 via interface FastEthernet0/0
Neighbor priority is 0, State is FULL, 16 state changes
DR is 10.64.0.2 BDR is 0.0.0.0
<output omitted>
Neighbor 10.2.1.1, interface address 10.2.1.1
In the area 1 via interface Serial0/0/1
Neighbor priority is 0, State is FULL, 6 state changes
DR is 0.0.0.0 BDR is 0.0.0.0
<output omitted>
41. Summary
• Configuration of OSPF is a two-step process:
– Enter OSPF configuration with the router ospf command.
– Use the network command to describe which interfaces will run OSPF in
which area.
• OSPF selects a router ID at startup time:
– The router ID’s specified in the router-id command under the OSPF process.
– Otherwise, the highest IP address of a loopback interface, if there are any,
is used.
– By default, the highest IP address of all active interfaces
• Use the show ip ospf command to verify the router ID.
• Use the show ip protocols, show ip route ospf, show ip ospf interface, show ip ospf,
and show ip ospf neighbor commands to verify OSPF operation.
43. OSPF Network Types
The three types of networks defined by OSPF are:
• Point-to-point: A network that joins a single pair of routers.
• Broadcast: A multiaccess broadcast network, such as
Ethernet.
• Nonbroadcast multiaccess (also called NBMA): A network
that interconnects more than two routers but that has no
broadcast capability. Frame Relay, ATM, and X.25 are
examples of NBMA networks.
– Five modes of OSPF operation are available for NBMA
networks.
44. Point-to-Point Links
• Usually a serial interface running either PPP or HDLC.
• May also be a point-to-point subinterface running Frame
Relay or ATM.
• No DR or BDR election required.
• OSPF autodetects this interface type.
• OSPF packets are sent using multicast 224.0.0.5.
45. Multiaccess Broadcast Network
• Generally these are, LAN technologies like Ethernet and
Token Ring.
• DR and BDR selection are required.
• All neighbor routers form full adjacencies with the DR and
BDR only.
• Packets to the DR and the BDR use 224.0.0.6.
• Packets from DR to all other routers use 224.0.0.5.
46. Electing the DR and BDR
• Hello packets are exchanged via IP multicast.
• The router with the highest OSPF priority is selected as
the DR. The router with the second-highest priority value is
the BDR.
• Use the OSPF router ID as the tiebreaker.
• The DR election is nonpreemptive.
47. Setting Priority for DR Election
• This interface configuration command assigns the OSPF
priority to an interface.
• Different interfaces on a router may be assigned different
values.
• The default priority is 1. The range is from 0 to 255.
• 0 means the router cannot be the DR or BDR.
• A router that is not the DR or BDR is DROTHER.
ip ospf priority number
Router(config-if)#
48. NBMA Topology
• A single interface interconnects multiple sites.
• NBMA topologies support multiple routers, but without
broadcasting capabilities.
49. DR Election in NBMA Topology
• OSPF considers NBMA to be like other broadcast media.
• The DR and BDR need to have fully meshed connectivity with
all other routers, but NBMA networks are not always fully
meshed.
• The DR and BDR need a list of neighbors.
• OSPF neighbors are not automatically discovered by the
router.
51. OSPF over NBMA Topology Modes of
Operation
• RFC 2328-compliant modes are as follows:
– Nonbroadcast (NBMA)
– Point-to-multipoint
• Additional modes from Cisco are as follows:
– Point-to-multipoint nonbroadcast
– Broadcast
– Point-to-point
52. Selecting the OSPF Network Type for NBMA
Networks
ip ospf network [{broadcast | non-broadcast | point-to-
multipoint [non-broadcast] | point-to-point}]
• Defines OSPF network type
Router(config-if)#
Router(config)#interface serial 0/0/0
Router(config-if)#encapsulation frame-relay
Router(config-if)#ip ospf network broadcast
Example: Broadcast Mode
53. Nonbroadcast Mode (NBMA Mode)
• Treated as a broadcast
network by OSPF
(acts like a LAN).
• All serial ports are part of
the same IP subnet.
• Frame Relay, X.25, and
ATM networks default to
nonbroadcast mode.
• Neighbors must be
statically configured.
• Duplicates LSA updates.
• Complies with RFC 2328.
54. Using the neighbor Command
• Used to statically define neighbor relationships in an NBMA
network
neighbor ip-address [priority number] [poll-interval
number] [cost number] [database-filter all]
Router(config-router)#
55. neighbor Command Example
RouterA(config)# router ospf 100
RouterA(config-router)# network 192.168.0.0 0.0.255.255 area 0
RouterA(config-router)# neighbor 192.168.1.2 priority 0
RouterA(config-router)# neighbor 192.168.1.3 priority 0
RouterA(config-router)# network 172.16.0.0 0.0.255.255 area 0
56. RouterA# show ip ospf neighbor
Neighbor ID Pri State Dead Time Address Interface
192.168.1.3 0 FULL/DROTHER 00:01:57 192.168.1.3 Serial0/0/0
192.168.1.2 0 FULL/DROTHER 00:01:33 192.168.1.2 Serial0/0/0
172.16.1.1 1 FULL/BDR 00:00:34 172.16.1.1 FastEthernet0/0
The show ip ospf neighbor Command
57. Point-to-Multipoint Mode
• The point-to-multipoint mode allows for NBMA networking.
• The point-to-multipoint mode fixes partial-mesh and star
topologies.
• No DR is required and only a single subnet is used.
• A 30-second hello is used.
• This mode is RFC 2328-compliant.
58. Point-to-Multipoint Configuration
interface Serial0/0/0
ip address 192.168.1.1 255.255.255.0
encapsulation frame-relay
ip ospf network point-to-multipoint
<output omitted>
router ospf 100
log-adjacency-changes
network 172.16.0.0 0.0.255.255 area 0
network 192.168.0.0 0.0.255.255 area 0
interface Serial0/0/0
ip address 192.168.1.3 255.255.255.0
encapsulation frame-relay
ip ospf network point-to-multipoint
ip ospf priority 0
Router A
Router C
59. Point-to-Multipoint Example
RouterA#sh ip ospf int s0/0/0
Serial0/0/0 is up, line protocol is up
Internet Address 192.168.1.1/24, Area 0
Process ID 100, Router ID 192.168.1.1, Network Type POINT_TO_MULTIPOINT,
Cost: 781
Transmit Delay is 1 sec, State POINT_TO_MULTIPOINT
Timer intervals configured, Hello 30, Dead 120, Wait 120, Retransmit 5
oob-resync timeout 120
Hello due in 00:00:26
Supports Link-local Signaling (LLS)
Index 2/2, flood queue length 0
Next 0x0(0)/0x0(0)
Last flood scan length is 1, maximum is 1
Last flood scan time is 0 msec, maximum is 4 msec
Neighbor Count is 2, Adjacent neighbor count is 2
Adjacent with neighbor 192.168.1.3
Adjacent with neighbor 192.168.1.2
Suppress hello for 0 neighbor(s)
RouterA#
60. Point-to-Multipoint Nonbroadcast
• Cisco extension to RFC-compliant point-to-multipoint mode
• Must statically define neighbors, like nonbroadcast mode
• Like point-to-multipoint mode, DR and BDR not elected
• Used in special cases where neighbors cannot be automatically
discovered
61. Using Subinterfaces
• The physical serial port becomes multiple logical ports.
• Each subinterface requires an IP subnet.
interface serial number.subinterface-number {multipoint |
point-to-point}
Router(config)#
62. Point-to-Point Subinterfaces
• Each PVC and SVC gets its own subinterface.
• OSPF point-to-point mode is the default on point-to-point
Frame Relay subinterfaces.
– No DR/BDR
– Do not need to configure neighbors
interface serial number.subinterface-number point-to-point
Router(config)#
64. Multipoint Subinterfaces
• Multiple PVCs and SVCs are on a single subinterface.
• OSPF nonbroadcast mode is the default.
– DR and BDR are required.
– Neighbors need to be statically configured.
interface serial number.subinterface-number multipoint
Router(config)#
65. Multipoint Subinterface Example
• Single interface serial 0/0/0 has been logically separated into two subinterfaces:
one point-to-point (S0/0/0.1) and one point-to-multipoint (S0/0/0.2).
• Each subinterface requires a subnet.
• OSPF defaults to point-to-point mode on point-to-point subinterfaces.
• OSPF defaults to nonbroadcast mode on point-to-multipoint subinterfaces.
66. OSPF Mode
NBMA Preferred
Topology
Subnet Address
Hello
Timer
Adjacency
RFC or
Cisco
Broadcast
Full or partial
mesh
Same 10 sec
Automatic,
DR/BDR elected
Cisco
Nonbroadcast
(NBMA)
Full or partial
mesh
Same 30 sec
Manual
configuration,
DR/BDR elected
RFC
Point-to-
multipoint
Partial-mesh
or star
Same 30 Sec
Automatic,
no DR/BDR
RFC
Point-to-
multipoint
nonbroadcast
partial-mesh
or star
Same 30 sec
Manual
configuration,
no/DR/BDR
Cisco
Point-to-point
Partial-mesh or
star, using
subinterface
Different for Each
Subinterface
10 sec
Automatic,
no DR/BDR
Cisco
OSPF over NBMA Topology Summary
67. Creation of Adjacencies for Point-to-Point
Mode
RouterA# debug ip ospf adj
OSPF: Interface Serial0/0/0.1 going Up
OSPF: Build router LSA for area 0, router ID 192.168.1.1, seq 0x80000023
OSPF: Rcv DBD from 192.168.1.2 on Serial0/0/0.1 seq 0xCF0 opt 0x52 flag 0x7 len 32
mtu 1500 state INIT
OSPF: 2 Way Communication to 192.168.1.2 on Serial0/0/0.1, state 2WAY
OSPF: Send DBD to 192.168.1.2 on Serial0/0/0.1 seq 0xF4D opt 0x52 flag 0x7 len 32
OSPF: NBR Negotiation Done. We are the SLAVE
OSPF: Send DBD to 192.168.1.2 on Serial0/0/0.1 seq 0xCF0 opt 0x52 flag 0x2 len 132
OSPF: Rcv DBD from 192.168.1.2 on Serial0/0/0.1 seq 0xCF1 opt 0x52 flag 0x3 len 132
mtu 1500 state EXCHANGE
OSPF: Send DBD to 192.168.1.2 on Serial0/0/0.1 seq 0xCF1 opt 0x52 flag 0x0 len 32
OSPF: Database request to 192.168.1.2
OSPF: sent LS REQ packet to 192.168.1.2, length 12
OSPF: Rcv DBD from 192.168.1.2 on Serial0/0/0.1 seq 0xCF2 opt 0x52 flag 0x1 len 32
mtu 1500 state EXCHANGE
OSPF: Exchange Done with 192.168.1.2 on Serial0/0/0.1
OSPF: Send DBD to 192.168.1.2 on Serial0/0/0.1 seq 0xCF2 opt 0x52 flag 0x0 len 32
OSPF: Synchronized with 192.168.1.2 on Serial0/0/0.1, state FULL
%OSPF-5-ADJCHG: Process 100, Nbr 192.168.1.2 on Serial0/0/0.1 from LOADING to FULL,
Loading Done
OSPF: Build router LSA for area 0, router ID 192.168.1.1, seq 0x80000024
68. Creation of Adjacencies for Broadcast
Mode
RouterA# debug ip ospf adj
OSPF: Interface FastEthernet0/0 going Up
OSPF: Build router LSA for area 0, router ID 192.168.1.1,seq 0x80000008
OSPF: 2 Way Communication to 172.16.1.1 on FastEthernet0/0, state 2WAY
OSPF: end of Wait on interface FastEthernet0/0
<output omitted>
OSPF: Neighbor change Event on interface FastEthernet0/0
OSPF: DR/BDR election on FastEthernet0/0
OSPF: Elect BDR 172.16.1.1
OSPF: Elect DR 192.168.1.1
DR: 192.168.1.1 (Id) BDR: 172.16.1.1 (Id)
OSPF: Rcv DBD from 172.16.1.1 on FastEthernet0/0 seq 0x14B 7 opt 0x52 flag
0x7 len 32 mtu 1500 state EXSTART
OSPF: First DBD and we are not SLAVE-if)#
OSPF: Send DBD to 172.16.1.1 on FastEthernet0/0 seq 0xDCE opt 0x52 flag 0x7
len 32
OSPF: Retransmitting DBD to 172.16.1.1 on FastEthernet0/0[1]
OSPF: Rcv DBD from 172.16.1.1 on FastEthernet0/0 seq 0xDCE
opt 0x52 flag 0x2 len 152 mtu 1500 state EXSTART
<output omitted>
69. Summary
• OSPF defines three types of networks: point-to-point, broadcast, and
NBMA.
• On point-to-point links, adjacency is dynamic, uses multicast
addresses, and has no DR or BDR.
• On broadcast links, adjacency is dynamic and includes election of a
DR and BDR. All updates are sent to the DR, which forwards the
updates to all routers.
• The router with the highest OSPF priority is selected as
the DR. The router with the second-highest priority value is the BDR.
• By default on NBMA links, adjacency requires manual definition of
neighbors for the DR and BDR because OSPF will consider the
network similar to broadcast media.
70. Summary (Cont.)
• The OSPF mode of operation on Frame Relay depends on the underlying
Frame Relay network. OSPF mode options include nonbroadcast,
broadcast, point-to-multipoint, point-to-multipoint nonbroadcast, and
point-to-point.
• In nonbroadcast mode, a DR and BDR are elected, and neighbors must
be statically configured.
• In point-to-multipoint mode, no DR and BDR are needed and neighbors
are automatically discovered. In point-to-multipoint nonbroadcast mode,
no DR and BDR are needed, but neighbors must be statically
configured.
• A physical interface can be split into multiple logical interfaces called
subinterfaces. Each subinterface requires an IP subnet.
• Using the debug ip ospf adj command enables you to see OSPF packet
exchanges and the status of neighbor adjacencies.
75. • Virtual links are used to connect a discontiguous area to
area 0.
• A logical connection is built between router A and router B.
• Virtual links are recommended for backup or temporary
connections.
Defining Virtual Links
76. Configuring Virtual Links
area area-id virtual-link router-id [authentication
[message-digest | null]] [hello-interval seconds]
[retransmit-interval seconds] [transmit-delay
seconds] [dead-interval seconds] [[authentication-
key key] | [message-digest-key key-id md5 key]]
Router(config-router)#
Creates a virtual link
remoterouter#sh ip ospf
Routing Process "ospf 1000" with ID 10.2.2.2
Supports only single TOS(TOS0) routes
Supports opaque LSA
Supports Link-local Signaling (LLS)
Supports area transit capability
It is an area border router
<output omitted>
78. RouterA#sh ip ospf virtual-links
Virtual Link OSPF_VL0 to router 10.2.2.2 is up
Run as demand circuit
DoNotAge LSA allowed.
Transit area 1, via interface Serial0/0/1, Cost of using 781
Transmit Delay is 1 sec, State POINT_TO_POINT,
Timer intervals configured, Hello 10, Dead 40, Wait 40, Retransmit 5
Hello due in 00:00:07
Adjacency State FULL (Hello suppressed)
Index 1/2, retransmission queue length 0, number of retransmission 1
First 0x0(0)/0x0(0) Next 0x0(0)/0x0(0)
Last retransmission scan length is 1, maximum is 1
Last retransmission scan time is 0 msec, maximum is 0 msec
RouterA#
The show ip ospf virtual-links Command
79. LSA Type Description
1 Router LSAs
2 Network LSAs
3 or 4 Summary LSAs
5
Autonomous system
external LSAs
6 Multicast OSPF LSA
7 Defined for not-so-stubby areas
8
External attributes LSA for
Border Gateway Protocol (BGP)
9, 10, 11 Opaque LSAs
LSA Types
80. LSA Type 1: Router LSA
• One router LSA (type 1) for every router in an area
– Includes list of directly attached links
– Each link identified by IP prefix assigned to link and link type
• Identified by the router ID of the originating router
• Floods within its area only; does not cross ABR
81. LSA Type 2: Network LSA
• One network (type 2) LSA for each transit broadcast or NBMA network in
an area
– Includes list of attached routers on the transit link
– Includes subnet mask of link
• Advertised by the DR of the broadcast network
• Floods within its area only; does not cross ABR
82. LSA Type 3: Summary LSA
• Type 3 LSAs are used to flood network information to areas outside the
originating area (interarea)
– Describes network number and mask of link.
• Advertised by the ABR of originating area.
• Regenerated by subsequent ABRs to flood throughout the autonomous
system.
• By default, routes are not summarized, and type 3 LSA is advertised for every
subnet.
83. LSA Type 4: Summary LSA
• Summary (type 4) LSAs are used to advertise an ASBR to all other areas in
the autonomous system.
• They are generated by the ABR of the originating area.
• They are regenerated by all subsequent ABRs to flood throughout the
autonomous system.
• Type 4 LSAs contain the router ID of the ASBR.
84. LSA Type 5: External LSA
• External (type 5) LSAs are used to advertise networks from other autonomous
systems.
• Type 5 LSAs are advertised and owned by the originating ASBR.
• Type 5 LSAs flood throughout the entire autonomous system.
• The advertising router ID (ASBR) is unchanged throughout the autonomous
system.
• Type 4 LSA is needed to find the ASBR.
• By default, routes are not summarized.
85. Interpreting the OSPF Database
RouterA#show ip ospf database
OSPF Router with ID (10.0.0.11) (Process ID 1)
Router Link States (Area 0)
Link ID ADV Router Age Seq# Checksum Link count
10.0.0.11 10.0.0.11 548 0x80000002 0x00401A 1
10.0.0.12 10.0.0.12 549 0x80000004 0x003A1B 1
100.100.100.100 100.100.100.100 548 0x800002D7 0x00EEA9 2
Net Link States (Area 0)
Link ID ADV Router Age Seq# Checksum
172.31.1.3 100.100.100.100 549 0x80000001 0x004EC9
Summary Net Link States (Area 0)
Link ID ADV Router Age Seq# Checksum
10.1.0.0 10.0.0.11 654 0x80000001 0x00FB11
10.1.0.0 10.0.0.12 601 0x80000001 0x00F516
<output omitted>
86. Interpreting the Routing Table: Types of
Routes
Router Designator Description
O
OSPF intra-area
(router LSA) and
network LSA
• Networks from within the area of
the router
• Advertised by way of router LSAs
and network LSA
O IA
OSPF interarea
(summary LSA)
• Networks from outside the area of
the router, but within the OSPF
autonomous system
• Advertised by way of
summary LSAs
O E1 Type 1 external routes
• Networks outside of the
autonomous system of the router
• Advertised by way of external
LSAs
O E2 Type 2 external routes
88. The show ip route Command
RouterB>show ip route
Codes: C - connected, S - static, R - RIP, M - mobile, B - BGP
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inter area
N1 - OSPF NSSA external type 1, N2 - OSPF NSSA external type 2
E1 - OSPF external type 1, E2 - OSPF external type 2
i - IS-IS, su - IS-IS summary, L1 - IS-IS level-1, L2 - IS-IS level-2
ia - IS-IS inter area, * - candidate default, U - per-user static route
o - ODR, P - periodic downloaded static route
Gateway of last resort is not set
172.31.0.0/24 is subnetted, 2 subnets
O IA 172.31.2.0 [110/1563] via 10.1.1.1, 00:12:35, FastEthernet0/0
O IA 172.31.1.0 [110/782] via 10.1.1.1, 00:12:35, FastEthernet0/0
10.0.0.0/8 is variably subnetted, 6 subnets, 2 masks
C 10.200.200.13/32 is directly connected, Loopback0
C 10.1.3.0/24 is directly connected, Serial0/0/0
O 10.1.2.0/24 [110/782] via 10.1.3.4, 00:12:35, Serial0/0/0
C 10.1.1.0/24 is directly connected, FastEthernet0/0
O 10.1.0.0/24 [110/782] via 10.1.1.1, 00:12:37, FastEthernet0/0
O E2 10.254.0.0/24 [110/50] via 10.1.1.1, 00:12:37, FastEthernet0/0
89. OSPF LSDB Overload Protection
• Excessive LSAs generated by other routers can drain local
router resources.
• This feature can limit the processing of non-self-generated
LSAs for a defined OSPF process.
max-lsa maximum-number [threshold-percentage] [warning-
only] [ignore-time minutes] [ignore-count count-number]
[reset-time minutes]
Router(config-router)#
90. ip ospf cost interface-cost
• Overrides the default cost calculation. Values from 1 to 65535
can be defined.
Changing the Cost Metric
auto-cost reference-bandwidth ref-bw
• Sets the reference bandwidth to values other than 100 Mbps
(legal values range from 1 to 4,294,967 in megabits per second).
• Dijkstra’s algorithm determines the best path by adding all link
costs along a path.
• The cost, or metric, is an indication of the overhead to send
packets over an interface. Default = (100 Mbps) / (bandwidth in
Mbps).
RouterA(config-if)#
RouterA(config-router)#
91. Summary
• There are four OSPF router types: internal routers, backbone routers,
ABRs, and ASBRs.
• A virtual link allows discontiguous area 0’ to be connected, or a
disconnected area to be connected to area 0, via a transit area. Virtual
links should be used only for temporary connections or backup after a
failure, not as a primary backbone design feature.
• There are 11 OSPF LSA types. The first five are the most commonly used:
– Type 1 router
– Type 2 network
– Type 3 and 4 summary
– Type 5 external
92. Summary (Cont.)
• In the IP routing table, OSPF routes are classified as either
intra-area, interarea, or external; external routes are
subdivided into E1 and E2.
• OSPF LSDB overload protection limits the processing of
non-self-generated LSAs.
• The OSPF cost defaults to (100 Mbps) / (bandwidth in
megabits per second). The cost can be changed on a per-
interface basis, and the reference bandwidth (100 Mbps) can
also be changed.
94. Benefits of Route Summarization
• Minimizes number of routing table entries
• Localizes impact of a topology change
• Reduces LSA type 3 and 5 flooding and saves CPU resources
95. Using Route Summarization
• Interarea summary link carries mask.
• One or more entries can represent several subnets.
96. area area-id range address mask [advertise | not-
advertise] [cost cost]
Router(config-router)#
• Consolidates interarea routes on an ABR
Configuring Route Summarization
summary-address ip-address mask [not-advertise] [tag tag]
Router(config-router)#
• Consolidates external routes, usually on an ASBR
99. Default Routes in OSPF
• A default route is injected into OSPF as an external LSA
type 5.
• Default route distribution is not on by default; use the
default-information originate command under the OSPF routing
process.
100. • Normally, this command advertises a 0.0.0.0 default into the
OSPF network only if the default route already exists in the
routing table.
• The always keyword allows the 0.0.0.0 default to be advertised
even when the default route does not exist in the routing table.
default-information originate [always] [metric metric-
value] [metric-type type-value] [route-map map-name]
Router(config-router)#
Configuring OSPF Default Routes
102. Summary
• Route summarization improves CPU utilization, reduces LSA
flooding, and reduces routing table sizes.
• The area range command is used to summarize at
the ABR. The summary-address command is used to
summarize at the ASBR.
• Default routes can be used in OSPF to prevent the need for a
specific route to all destination networks. The benefits
include a much smaller routing table and LSDB, with
complete reachability.
• OSPF uses the default-information originate command to inject
a default route.
105. Stub and Totally Stub Area Rules
An area can be stub or totally stub if:
• There is a single ABR, or if there is more than one ABR,
suboptimal routing paths to other areas or external
autonomous systems are acceptable.
• All routers in the area are configured as stub routers.
• There is no ASBR in the area.
• The area is not area 0.
• No virtual links go through the area.
106. • External LSAs
are stopped.
• Default route
is advertised
into stub area
by the ABR.
• All routers in
area 50 must
be configured
as stub.
Using Stub Areas
107. Stub Area Configuration
area area-id stub [no-summary]
• This command turns on stub area networking.
• All routers in a stub area must use the stub command.
RouterA(config-router)#
area area-id default-cost cost
• This command defines the cost of a default route sent into the
stub area.
• The default cost is 1.
RouterA(config-router)#
109. • External LSAs
are stopped.
• Summary LSAs
are stopped.
• Routing table
is reduced to
a minimum.
• All routers must
be configured
as stub.
• ABR must be
configured as
totally stubby.
• This is a Cisco
proprietary
feature.
Using Totally Stubby Areas
110. area area-id stub no-summary
• The addition of no-summary on the ABR creates a totally stubby
area and prevents all summary LSAs from entering the stub
area.
Totally Stubby Configuration
RouterA(config-router)#
112. Routing Table in a Standard Area
P1R3#sh ip route
<output omitted>
Gateway of last resort is not set
172.31.0.0/32 is subnetted, 4 subnets
O IA 172.31.22.4 [110/782] via 10.1.1.1, 00:02:44, FastEthernet0/0
O IA 172.31.11.1 [110/1] via 10.1.1.1, 00:02:44, FastEthernet0/0
O IA 172.31.11.2 [110/782] via 10.1.3.4, 00:02:52, Serial0/0/0
[110/782] via 10.1.1.1, 00:02:52, FastEthernet0/0
O IA 172.31.11.4 [110/782] via 10.1.1.1, 00:02:44, FastEthernet0/0
10.0.0.0/8 is variably subnetted, 7 subnets, 2 masks
O 10.11.0.0/24 [110/782] via 10.1.1.1, 00:03:22, FastEthernet0/0
C 10.200.200.13/32 is directly connected, Loopback0
C 10.1.3.0/24 is directly connected, Serial0/0/0
O 10.1.2.0/24 [110/782] via 10.1.3.4, 00:03:23, Serial0/0/0
C 10.1.1.0/24 is directly connected, FastEthernet0/0
O 10.1.0.0/24 [110/782] via 10.1.1.1, 00:03:23, FastEthernet0/0
O E2 10.254.0.0/24 [110/50] via 10.1.1.1, 00:02:39, FastEthernet0/0
P1R3#
113. Routing Table in a Stub Area
P1R3#sh ip route
<output omitted>
Gateway of last resort is 10.1.1.1 to network 0.0.0.0
172.31.0.0/32 is subnetted, 4 subnets
O IA 172.31.22.4 [110/782] via 10.1.1.1, 00:01:49, FastEthernet0/0
O IA 172.31.11.1 [110/1] via 10.1.1.1, 00:01:49, FastEthernet0/0
O IA 172.31.11.2 [110/782] via 10.1.3.4, 00:01:49, Serial0/0/0
[110/782] via 10.1.1.1, 00:01:49, FastEthernet0/0
O IA 172.31.11.4 [110/782] via 10.1.1.1, 00:01:49, FastEthernet0/0
10.0.0.0/8 is variably subnetted, 6 subnets, 2 masks
O 10.11.0.0/24 [110/782] via 10.1.1.1, 00:01:50, FastEthernet0/0
C 10.200.200.13/32 is directly connected, Loopback0
C 10.1.3.0/24 is directly connected, Serial0/0/0
O 10.1.2.0/24 [110/782] via 10.1.3.4, 00:01:50, Serial0/0/0
C 10.1.1.0/24 is directly connected, FastEthernet0/0
O 10.1.0.0/24 [110/782] via 10.1.1.1, 00:01:50, FastEthernet0/0
O*IA 0.0.0.0/0 [110/2] via 10.1.1.1, 00:01:51, FastEthernet0/0
P1R3#
114. Routing Table in a Stub Area with
Summarization
P1R3#sh ip route
<output omitted>
Gateway of last resort is 10.1.1.1 to network 0.0.0.0
172.31.0.0/16 is variably subnetted, 2 subnets, 2 masks
O IA 172.31.22.4/32 [110/782] via 10.1.1.1, 00:13:08, FastEthernet0/0
O IA 172.31.11.0/24 [110/1] via 10.1.1.1, 00:02:39, FastEthernet0/0
10.0.0.0/8 is variably subnetted, 6 subnets, 2 masks
O 10.11.0.0/24 [110/782] via 10.1.1.1, 00:13:08, FastEthernet0/0
C 10.200.200.13/32 is directly connected, Loopback0
C 10.1.3.0/24 is directly connected, Serial0/0/0
O 10.1.2.0/24 [110/782] via 10.1.3.4, 00:13:09, Serial0/0/0
C 10.1.1.0/24 is directly connected, FastEthernet0/0
O 10.1.0.0/24 [110/782] via 10.1.1.1, 00:13:09, FastEthernet0/0
O*IA 0.0.0.0/0 [110/2] via 10.1.1.1, 00:13:09, FastEthernet0/0
P1R3#
115. Routing Table in a Totally Stubby Area
P1R3#sh ip route
<output omitted>
Gateway of last resort is 10.1.1.1 to network 0.0.0.0
10.0.0.0/8 is variably subnetted, 6 subnets, 2 masks
O 10.11.0.0/24 [110/782] via 10.1.1.1, 00:16:53, FastEthernet0/0
C 10.200.200.13/32 is directly connected, Loopback0
C 10.1.3.0/24 is directly connected, Serial0/0/0
O 10.1.2.0/24 [110/782] via 10.1.3.4, 00:16:53, Serial0/0/0
C 10.1.1.0/24 is directly connected, FastEthernet0/0
O 10.1.0.0/24 [110/782] via 10.1.1.1, 00:16:53, FastEthernet0/0
O*IA 0.0.0.0/0 [110/2] via 10.1.1.1, 00:00:48, FastEthernet0/0
P1R3#
116. • NSSA breaks stub area
rules.
• ASBR (R1) is allowed in
NSSA.
• Special LSA type 7
defined, sent by ASBR.
• ABR (R2) converts LSA type 7
to LSA type 5.
• ABR sends default route into
NSSA instead of external
routes from other ASBRs.
• NSSA is an RFC addendum.
Not-So-Stubby Areas
117. area area-id nssa [no-redistribution] [default-
information-originate [metric metric-value] [metric-
type type-value]] [no-summary]
• Use this command instead of the area stub command to define
the area as NSSA.
• The no-summary keyword creates an NSSA totally stubby area;
this is a Cisco proprietary feature.
NSSA Configuration
RouterA(config-router)#
119. NSSA Totally Stubby Configuration
• NSSA totally stubby area is a Cisco proprietary feature.
120. show ip ospf
• Displays which areas are normal, stub, or NSSA
show Commands for Stub and NSSA
show ip ospf database
• Displays details of LSAs
show ip ospf database nssa-external
• Displays specific details of each LSA type 7 update in database
show ip route
• Displays all routes
RouterA#
RouterA#
RouterA#
RouterA#
121. Summary
• There are several OSPF area types: standard, backbone, stub,
totally stubby, and NSSA.
• Use the area area-id stub command to define an area as stubby.
• Use the area area-id stub command with the no-summary keyword
on the ABR only to define an area as totally stubby.
• For stub areas, external routes are not visible in the routing table,
but are accessible via the intra-area default route. For totally
stubby areas, interarea and external routes are not visible in the
routing table, but are accessible via the intra-area default route.
• Use the area area-id nssa command to define an area as NSSA.
• Use show ip ospf, show ip ospf database, show ip route commands
to verify all types of stub areas. Use the show ip ospf database
nssa-external command to display details of type 7 LSAs.
123. OSPF Authentication Types
• OSPF supports 2 types of authentication:
– Simple password (or plain text) authentication
– MD5 authentication
• Router generates and checks every OSPF packet. Router
authenticates the source of each routing update packet that
it receives.
• Configure a “key” (password); each participating neighbor
must have same key configured.
124. Configuring OSPF Simple Password
Authentication
ip ospf authentication-key password
Router(config-if)#
• Assigns a password to be used with neighboring routers
Router(config-if)#
ip ospf authentication [message-digest | null]
• Specifies the authentication type for an interface
(since Cisco IOS software 12.0)
Router(config-router)#
area area-id authentication [message-digest]
• Specifies the authentication type for an area (was in Cisco
IOS software before 12.0)
126. R2 Configuration for Simple Password
Authentication
<output omitted>
interface Loopback0
ip address 10.2.2.2 255.255.255.0
<output omitted>
interface Serial0/0/1
ip address 192.168.1.102 255.255.255.224
ip ospf authentication
ip ospf authentication-key plainpas
<output omitted>
router ospf 10
log-adjacency-changes
network 10.2.2.2 0.0.0.0 area 0
network 192.168.1.0 0.0.0.255 area 0
127. Verifying Simple Password Authentication
R1#sh ip ospf neighbor
Neighbor ID Pri State Dead Time Address Interface
10.2.2.2 0 FULL/ - 00:00:32 192.168.1.102 Serial0/0/1
R1#show ip route
<output omitted>
Gateway of last resort is not set
10.0.0.0/8 is variably subnetted, 2 subnets, 2 masks
O 10.2.2.2/32 [110/782] via 192.168.1.102, 00:01:17, Serial0/0/1
C 10.1.1.0/24 is directly connected, Loopback0
192.168.1.0/27 is subnetted, 1 subnets
C 192.168.1.96 is directly connected, Serial0/0/1
R1#ping 10.2.2.2
Type escape sequence to abort.
Sending 5, 100-byte ICMP Echos to 10.2.2.2, timeout is 2 seconds:
!!!!!
Success rate is 100 percent (5/5), round-trip min/avg/max = 28/29/32 ms
128. Configuring OSPF MD5 Authentication
ip ospf message-digest-key key-id md5 key
Router(config-if)#
• Assigns a key ID and key to be used with neighboring routers
Router(config-if)#
ip ospf authentication [message-digest | null]
• Specifies the authentication type for an interface
(since Cisco IOS software 12.0)
Router(config-router)#
area area-id authentication [message-digest]
• Specifies the authentication type for an area (was in Cisco
IOS software before 12.0)
130. R2 Configuration for MD5 Authentication
<output omitted>
interface Loopback0
ip address 10.2.2.2 255.255.255.0
<output omitted>
interface Serial0/0/1
ip address 192.168.1.102 255.255.255.224
ip ospf authentication message-digest
ip ospf message-digest-key 1 md5 secretpass
<output omitted>
router ospf 10
log-adjacency-changes
network 10.2.2.2 0.0.0.0 area 0
network 192.168.1.0 0.0.0.255 area 0
131. Verifying MD5 Authentication
R1#sho ip ospf neighbor
Neighbor ID Pri State Dead Time Address Interface
10.2.2.2 0 FULL/ - 00:00:31 192.168.1.102 Serial0/0/1
R1#show ip route
<output omitted>
Gateway of last resort is not set
10.0.0.0/8 is variably subnetted, 2 subnets, 2 masks
O 10.2.2.2/32 [110/782] via 192.168.1.102, 00:00:37, Serial0/0/1
C 10.1.1.0/24 is directly connected, Loopback0
192.168.1.0/27 is subnetted, 1 subnets
C 192.168.1.96 is directly connected, Serial0/0/1
R1#ping 10.2.2.2
Type escape sequence to abort.
Sending 5, 100-byte ICMP Echos to 10.2.2.2, timeout is 2 seconds:
!!!!!
Success rate is 100 percent (5/5), round-trip min/avg/max = 28/28/32 ms
132. Troubleshooting Simple Password
Authentication
R1#debug ip ospf adj
OSPF adjacency events debugging is on
R1#
<output omitted>
*Feb 17 18:42:01.250: OSPF: 2 Way Communication to 10.2.2.2 on Serial0/0/1,
state 2WAY
*Feb 17 18:42:01.250: OSPF: Send DBD to 10.2.2.2 on Serial0/0/1 seq 0x9B6 opt
0x52 flag 0x7 len 32
*Feb 17 18:42:01.262: OSPF: Rcv DBD from 10.2.2.2 on Serial0/0/1 seq 0x23ED
opt0x52 flag 0x7 len 32 mtu 1500 state EXSTART
*Feb 17 18:42:01.262: OSPF: NBR Negotiation Done. We are the SLAVE
*Feb 17 18:42:01.262: OSPF: Send DBD to 10.2.2.2 on Serial0/0/1 seq 0x23ED opt
0x52 flag 0x2 len 72
<output omitted>
R1#show ip ospf neighbor
Neighbor ID Pri State Dead Time Address Interface
10.2.2.2 0 FULL/ - 00:00:34 192.168.1.102 Serial0/0/1
debug ip ospf adj
Router#
• Displays the OSPF adjacency-related events
133. Troubleshooting Simple Password
Authentication Problems
R1#
*Feb 17 18:51:31.242: OSPF: Rcv pkt from 192.168.1.102, Serial0/0/1 :
Mismatch Authentication type. Input packet specified type 0, we use type 1
R2#
*Feb 17 18:50:43.046: OSPF: Rcv pkt from 192.168.1.101, Serial0/0/1 :
Mismatch Authentication type. Input packet specified type 1, we use type 0
Simple authentication on R1, no authentication on R2
R1#
*Feb 17 18:54:01.238: OSPF: Rcv pkt from 192.168.1.102, Serial0/0/1 :
Mismatch Authentication Key - Clear Text
R2#
*Feb 17 18:53:13.050: OSPF: Rcv pkt from 192.168.1.101, Serial0/0/1 :
Mismatch Authentication Key - Clear Text
Simple authentication on R1 and R2, but different
passwords
134. Troubleshooting MD5 Authentication
R1#debug ip ospf adj
OSPF adjacency events debugging is on
<output omitted>
*Feb 17 17:14:06.530: OSPF: Send with youngest Key 1
*Feb 17 17:14:06.546: OSPF: 2 Way Communication to 10.2.2.2 on Serial0/0/1,
state 2WAY
*Feb 17 17:14:06.546: OSPF: Send DBD to 10.2.2.2 on Serial0/0/1 seq 0xB37 opt
0x52 flag 0x7 len 32
*Feb 17 17:14:06.546: OSPF: Send with youngest Key 1
*Feb 17 17:14:06.562: OSPF: Rcv DBD from 10.2.2.2 on Serial0/0/1 seq 0x32F opt
0x52 flag 0x7 len 32 mtu 1500 state EXSTART
*Feb 17 17:14:06.562: OSPF: NBR Negotiation Done. We are the SLAVE
*Feb 17 17:14:06.562: OSPF: Send DBD to 10.2.2.2 on Serial0/0/1 seq 0x32F opt
0x52 flag 0x2 len 72
*Feb 17 17:14:06.562: OSPF: Send with youngest Key 1
<output omitted>
R1#show ip ospf neighbor
Neighbor ID Pri State Dead Time Address Interface
10.2.2.2 0 FULL/ - 00:00:35 192.168.1.102 Serial0/0/1
135. Troubleshooting MD5 Authentication
Problems
R1#
*Feb 17 17:56:16.530: OSPF: Send with youngest Key 1
*Feb 17 17:56:26.502: OSPF: Rcv pkt from 192.168.1.102, Serial0/0/1 :
Mismatch Authentication Key - No message digest key 2 on interface
*Feb 17 17:56:26.530: OSPF: Send with youngest Key 1
R2#
*Feb 17 17:55:28.226: OSPF: Send with youngest Key 2
*Feb 17 17:55:28.286: OSPF: Rcv pkt from 192.168.1.101, Serial0/0/1 :
Mismatch Authentication Key - No message digest key 1 on interface
*Feb 17 17:55:38.226: OSPF: Send with youngest Key 2
MD5 authentication on both R1 and R2, but R1 has
key 1 and R2 has key 2, both with the same
passwords:
136. Summary
• When authentication is configured, the router generates and
checks every OSPF packet and authenticates the source of each
routing update packet that it receives. OSPF supports two types of
authentication:
– Simple password (or plain text) authentication: The router sends
an OSPF packet and key.
– MD5 authentication: The router generates a message digest, or
hash, of the key, key ID, and message. The message digest is
sent with the packet; the key is not sent.
• To configure simple password authentication, use the ip ospf
authentication-key password command and the ip ospf authentication
command.
137. Summary (Cont.)
• To configure MD5 authentication, use the ip ospf message-
digest-key key-id md5 key command and the ip ospf
authentication message-digest command.
• Use show ip ospf neighbor, show ip route, and debug ip ospf adj
to verify and troubleshoot both types of authentication.
• With MD5 authentication, the debug ip ospf adj command
output indicates the key ID sent.
138. Module Summary
• OSPF is an open-standard link-state routing protocol, offering quick
convergence and the ability to scale large networks.
• There are five OSPF packet types: hello, DBD, LSU, LSR, and LSAck.
• Configuration of OSPF is a two-step process:
– Enter OSPF configuration with the router ospf command.
– Use the network command to describe which interfaces will run
OSPF in which area.
• OSPF defines three types of networks: point-to-point, broadcast,
and NBMA. On NBMA networks, OSPF mode options include
nonbroadcast, broadcast, point-to-multipoint, point-to-multipoint
nonbroadcast, and point-to-point.
139. Module Summary (Cont.)
• LSAs are the building blocks of the LSDB. There are 11 types
of OSPF LSAs.
• Route summarization reduces OSPF LSA flooding and
routing table size, which reduces memory and CPU
utilization on routers.
• Stub area techniques improve OSPF performance by
reducing the LSA flooding.
• OSPF supports two types of authentication:
– Simple password (or plain text) authentication
– MD5 authentication