This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes OSPF's basic features and configuration, including enabling OSPF, configuring network statements, examining the routing table, and modifying interface costs. It also covers OSPF operations in multi-access networks such as Designated Router election and flooding reduction techniques.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes the basic features and configuration of OSPF, including how OSPF establishes neighbor relationships using Hello packets, elects a designated router for multi-access networks, calculates routes using the Dijkstra algorithm, and populates the routing table. The document also covers configuring and verifying OSPF, modifying interface metrics, and some advanced OSPF configurations.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes OSPF's message encapsulation, packet types, neighbor discovery process using Hello packets, link state database and shortest path first algorithm, metric and cost calculation, and mechanisms for handling multi-access networks like designated router election. The objectives are to describe OSPF configuration and troubleshooting.
The document discusses link-state routing protocols and OSPF in particular. It describes how link-state protocols build a topological map of the network and use the SPF algorithm to independently calculate the shortest path to all networks. OSPF is introduced as an example link-state protocol, with explanations of its message encapsulation, packet types, hello protocol for neighbor discovery, link-state updates for exchanging routing information, and basic configuration including setting the router ID and verifying OSPF neighbors. The document also covers how OSPF uses cost based on bandwidth as its routing metric.
This document provides an introduction to routing and packet forwarding. It discusses routers and their components, how routers operate at the network, data link and physical layers, and how routers determine the best path and switch packets. Specifically, it describes how routers examine a packet's destination IP address to determine the best path using the routing table. It then re-encapsulates the packet and forwards it out the exit interface towards the destination.
This document discusses routing and packet forwarding in computer networks. It describes routers as specialized computers that interconnect networks and forward packets based on their destination IP addresses. The document outlines the basic components and boot-up process of routers. It also covers configuring router interfaces and IP addresses, the structure of routing tables, and how routers use routing tables to determine the best path and switch packets between networks.
Routers are specialized computers that interconnect networks and select the best path for packets to travel by examining the destination IP address. Routers have interfaces that connect to different networks, and use routing tables to determine the best path for forwarding packets between networks in a process called packet switching. Dynamic routing protocols allow routers to share routing information and automatically discover remote networks to maintain accurate routing tables.
CCNA 2 Routing and Switching v5.0 Chapter 8Nil Menon
油
The document discusses the configuration and operation of single-area OSPF routing. It covers OSPF concepts like link-state routing, neighbor adjacencies, designated routers, flooding LSAs, and SPF calculations. It also compares OSPFv2 to OSPFv3, describing how OSPFv3 uses link-local addresses and interfaces are enabled directly instead of using network statements. The document provides instructions for configuring OSPFv2 and OSPFv3 on Cisco routers as well as commands for verifying their operation and settings.
This document discusses static routing concepts in 3 sentences or less:
Static routing involves manually configuring routing information in routers by specifying the destination network, subnet mask, and next hop address or exit interface. Static routes must be configured on each router and do not automatically adjust to network changes. The document covers configuring, verifying, and troubleshooting static routes, including default and summary routes.
This document provides an overview of advanced OSPF configurations and troubleshooting techniques. It discusses how to optimize OSPF in multiaccess networks using the designated router (DR) and backup designated router (BDR). It also covers how to propagate default routes in OSPF, fine-tune OSPF interfaces, and troubleshoot common OSPF issues. Troubleshooting steps include verifying neighbor states, routing tables, and using commands like show ip ospf neighbor to analyze the OSPF neighbor table.
This document provides an introduction to routing and packet forwarding. It describes routers as computers that specialize in sending packets between networks by selecting the best path using routing tables. The document outlines router components, the boot-up process, interface types, and how routers examine packet headers to determine the best path and switch packets between incoming and outgoing interfaces. It also discusses topics like routing table structure, static and dynamic routing, path determination, and how packets are forwarded hop-by-hop between routers while headers are updated.
This document discusses configuring and troubleshooting single-area OSPF routing. It covers topics like:
- Configuring static and dynamic routing on distribution and core routers
- Configuring and verifying single-area OSPF
- Designated router election process for multiaccess networks
- Propagating default static routes in OSPF
- Securing OSPF with message digest 5 authentication
- Components of troubleshooting single-area OSPF like forming adjacencies and transitioning states
This document discusses static routing and provides examples of configuring static routes on Cisco routers. It covers defining the role of routers, examining directly connected networks and interfaces, configuring static routes with next hop addresses and exit interfaces, using summary and default routes, and troubleshooting static route issues. The key points covered include the basic syntax for configuring static routes on routers and using show commands to view routing tables and troubleshoot connectivity problems.
This document discusses static routing and provides configuration examples. It covers defining router roles, examining directly connected networks, configuring static routes with next hop addresses or exit interfaces, summarizing routes, and troubleshooting routing issues. Static routes allow routers to forward packets to destination networks manually without a dynamic routing protocol. Route summarization and default routes reduce routing table sizes.
The document discusses configuring single-area OSPFv2 in point-to-point networks. It describes using the network command to enable OSPF on interfaces matching a network address and wildcard mask. Alternatively, OSPF can be configured directly on interfaces using the ip ospf command. Passive interfaces are used to prevent sending unnecessary routing updates on LAN links. Point-to-point networks are configured to disable DR/BDR election when only two routers connect an interface. Loopbacks can also be used as point-to-point networks.
The document discusses configuring single-area OSPFv2 in point-to-point networks. It describes using the network command to enable OSPF on interfaces matching a network address and wildcard mask. Alternatively, OSPF can be configured directly on interfaces using the ip ospf command. Passive interfaces are described to prevent unnecessary routing updates on interfaces. The network type is changed to point-to-point to disable DR/BDR election for links with only two routers. Loopbacks can also be used as point-to-point networks.
The document discusses configuring single-area OSPFv2 in point-to-point networks. It describes using the network command to enable OSPF on interfaces based on their IP addresses and wildcard masks. Specifying the exact interface IP address with a quad zero wildcard mask is an alternative. The ip ospf command can also be used to directly configure OSPF on interfaces and associate them with an area. The area ID is typically 0 for single-area OSPFv2 configurations.
The document discusses Open Shortest Path First (OSPF) routing protocol. It covers basic OSPF configuration, establishing OSPF neighbor relationships, OSPF message types, OSPF operation overview including building the routing table, and optimizing OSPF adjacencies on multiaccess networks. The key aspects are electing a designated router and backup designated router to reduce routing update traffic and ensure synchronized link-state databases across all routers.
Link-state routing protocols use Dijkstra's shortest path first (SPF) algorithm to determine the optimal path to all destinations. Each router uses hello packets to discover neighbors and then floods link state packets (LSPs) throughout the network, allowing every router to build a topological map and independently calculate the shortest path to each destination using SPF trees. Common link-state routing protocols are Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS).
RIP version 1 is a classful distance vector routing protocol that uses hop count as its metric. It sends routing updates every 30 seconds and considers routes with a hop count greater than 15 to be unreachable. It performs automatic summarization which reduces the size of routing updates but does not support discontiguous subnets. Common commands to configure and verify RIP include router rip, network, show ip protocols, and debug ip rip.
The document discusses IPv6 addressing and transitioning from IPv4 to IPv6. It describes the need for a larger address space than IPv4 due to the growing number of internet-connected devices. It then covers various IPv6 features and address types including global unicast addresses, link-local addresses, and address assignment methods like stateless autoconfiguration and DHCPv6. The document also discusses IPv6 routing protocols and transition technologies like dual stack and tunneling to help networks migrate from IPv4 to IPv6.
OSPF is an open standard link-state routing protocol used within organizations. It divides large networks into areas and uses the shortest path first algorithm to determine the best routes between routers. OSPF configurations include enabling the protocol, advertising networks and their area IDs, and tuning parameters such as bandwidth costs, authentication, and loopback interfaces. Administrators can also summarize inter-area routes to reduce routing table sizes and filter routing information between areas.
This document provides an overview of single-area OSPF routing protocols. It discusses the characteristics and components of OSPF, including how it establishes neighbor adjacencies, exchanges link state advertisements (LSAs), and calculates the shortest path tree. It then describes how to configure single-area OSPFv2 and OSPFv3 on Cisco routers, including setting the router ID, network types, costs, and passive interfaces. Verification commands are also provided.
The document discusses implementing an OSPF routing protocol. It provides an overview of OSPF including how it establishes neighbor relationships, propagates link state advertisements, and uses the shortest path first algorithm to calculate routes. It then covers topics like configuring single-area and multi-area OSPF, setting the router ID, verifying the OSPF configuration, and different OSPF network types including broadcast and point-to-point.
Routers are specialized computers that interconnect networks and select the best path for packets to travel by examining the destination IP address. Routers have interfaces that connect to different networks, and use routing tables to determine the best path for forwarding packets between networks in a process called packet switching. Dynamic routing protocols allow routers to share routing information and automatically discover remote networks to maintain accurate routing tables.
CCNA 2 Routing and Switching v5.0 Chapter 8Nil Menon
油
The document discusses the configuration and operation of single-area OSPF routing. It covers OSPF concepts like link-state routing, neighbor adjacencies, designated routers, flooding LSAs, and SPF calculations. It also compares OSPFv2 to OSPFv3, describing how OSPFv3 uses link-local addresses and interfaces are enabled directly instead of using network statements. The document provides instructions for configuring OSPFv2 and OSPFv3 on Cisco routers as well as commands for verifying their operation and settings.
This document discusses static routing concepts in 3 sentences or less:
Static routing involves manually configuring routing information in routers by specifying the destination network, subnet mask, and next hop address or exit interface. Static routes must be configured on each router and do not automatically adjust to network changes. The document covers configuring, verifying, and troubleshooting static routes, including default and summary routes.
This document provides an overview of advanced OSPF configurations and troubleshooting techniques. It discusses how to optimize OSPF in multiaccess networks using the designated router (DR) and backup designated router (BDR). It also covers how to propagate default routes in OSPF, fine-tune OSPF interfaces, and troubleshoot common OSPF issues. Troubleshooting steps include verifying neighbor states, routing tables, and using commands like show ip ospf neighbor to analyze the OSPF neighbor table.
This document provides an introduction to routing and packet forwarding. It describes routers as computers that specialize in sending packets between networks by selecting the best path using routing tables. The document outlines router components, the boot-up process, interface types, and how routers examine packet headers to determine the best path and switch packets between incoming and outgoing interfaces. It also discusses topics like routing table structure, static and dynamic routing, path determination, and how packets are forwarded hop-by-hop between routers while headers are updated.
This document discusses configuring and troubleshooting single-area OSPF routing. It covers topics like:
- Configuring static and dynamic routing on distribution and core routers
- Configuring and verifying single-area OSPF
- Designated router election process for multiaccess networks
- Propagating default static routes in OSPF
- Securing OSPF with message digest 5 authentication
- Components of troubleshooting single-area OSPF like forming adjacencies and transitioning states
This document discusses static routing and provides examples of configuring static routes on Cisco routers. It covers defining the role of routers, examining directly connected networks and interfaces, configuring static routes with next hop addresses and exit interfaces, using summary and default routes, and troubleshooting static route issues. The key points covered include the basic syntax for configuring static routes on routers and using show commands to view routing tables and troubleshoot connectivity problems.
This document discusses static routing and provides configuration examples. It covers defining router roles, examining directly connected networks, configuring static routes with next hop addresses or exit interfaces, summarizing routes, and troubleshooting routing issues. Static routes allow routers to forward packets to destination networks manually without a dynamic routing protocol. Route summarization and default routes reduce routing table sizes.
The document discusses configuring single-area OSPFv2 in point-to-point networks. It describes using the network command to enable OSPF on interfaces matching a network address and wildcard mask. Alternatively, OSPF can be configured directly on interfaces using the ip ospf command. Passive interfaces are used to prevent sending unnecessary routing updates on LAN links. Point-to-point networks are configured to disable DR/BDR election when only two routers connect an interface. Loopbacks can also be used as point-to-point networks.
The document discusses configuring single-area OSPFv2 in point-to-point networks. It describes using the network command to enable OSPF on interfaces matching a network address and wildcard mask. Alternatively, OSPF can be configured directly on interfaces using the ip ospf command. Passive interfaces are described to prevent unnecessary routing updates on interfaces. The network type is changed to point-to-point to disable DR/BDR election for links with only two routers. Loopbacks can also be used as point-to-point networks.
The document discusses configuring single-area OSPFv2 in point-to-point networks. It describes using the network command to enable OSPF on interfaces based on their IP addresses and wildcard masks. Specifying the exact interface IP address with a quad zero wildcard mask is an alternative. The ip ospf command can also be used to directly configure OSPF on interfaces and associate them with an area. The area ID is typically 0 for single-area OSPFv2 configurations.
The document discusses Open Shortest Path First (OSPF) routing protocol. It covers basic OSPF configuration, establishing OSPF neighbor relationships, OSPF message types, OSPF operation overview including building the routing table, and optimizing OSPF adjacencies on multiaccess networks. The key aspects are electing a designated router and backup designated router to reduce routing update traffic and ensure synchronized link-state databases across all routers.
Link-state routing protocols use Dijkstra's shortest path first (SPF) algorithm to determine the optimal path to all destinations. Each router uses hello packets to discover neighbors and then floods link state packets (LSPs) throughout the network, allowing every router to build a topological map and independently calculate the shortest path to each destination using SPF trees. Common link-state routing protocols are Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS).
RIP version 1 is a classful distance vector routing protocol that uses hop count as its metric. It sends routing updates every 30 seconds and considers routes with a hop count greater than 15 to be unreachable. It performs automatic summarization which reduces the size of routing updates but does not support discontiguous subnets. Common commands to configure and verify RIP include router rip, network, show ip protocols, and debug ip rip.
The document discusses IPv6 addressing and transitioning from IPv4 to IPv6. It describes the need for a larger address space than IPv4 due to the growing number of internet-connected devices. It then covers various IPv6 features and address types including global unicast addresses, link-local addresses, and address assignment methods like stateless autoconfiguration and DHCPv6. The document also discusses IPv6 routing protocols and transition technologies like dual stack and tunneling to help networks migrate from IPv4 to IPv6.
OSPF is an open standard link-state routing protocol used within organizations. It divides large networks into areas and uses the shortest path first algorithm to determine the best routes between routers. OSPF configurations include enabling the protocol, advertising networks and their area IDs, and tuning parameters such as bandwidth costs, authentication, and loopback interfaces. Administrators can also summarize inter-area routes to reduce routing table sizes and filter routing information between areas.
This document provides an overview of single-area OSPF routing protocols. It discusses the characteristics and components of OSPF, including how it establishes neighbor adjacencies, exchanges link state advertisements (LSAs), and calculates the shortest path tree. It then describes how to configure single-area OSPFv2 and OSPFv3 on Cisco routers, including setting the router ID, network types, costs, and passive interfaces. Verification commands are also provided.
The document discusses implementing an OSPF routing protocol. It provides an overview of OSPF including how it establishes neighbor relationships, propagates link state advertisements, and uses the shortest path first algorithm to calculate routes. It then covers topics like configuring single-area and multi-area OSPF, setting the router ID, verifying the OSPF configuration, and different OSPF network types including broadcast and point-to-point.
. マ留 裡留略龍侶: Foundation Analysis and Design: Single Piles
Welcome to this comprehensive presentation on "Foundation Analysis and Design," focusing on Single PilesStatic Capacity, Lateral Loads, and Pile/Pole Buckling. This presentation will explore the fundamental concepts, equations, and practical considerations for designing and analyzing pile foundations.
We'll examine different pile types, their characteristics, load transfer mechanisms, and the complex interactions between piles and surrounding soil. Throughout this presentation, we'll highlight key equations and methodologies for calculating pile capacities under various conditions.
Preface: The ReGenX Generator innovation operates with a US Patented Frequency Dependent Load
Current Delay which delays the creation and storage of created Electromagnetic Field Energy around
the exterior of the generator coil. The result is the created and Time Delayed Electromagnetic Field
Energy performs any magnitude of Positive Electro-Mechanical Work at infinite efficiency on the
generator's Rotating Magnetic Field, increasing its Kinetic Energy and increasing the Kinetic Energy of
an EV or ICE Vehicle to any magnitude without requiring any Externally Supplied Input Energy. In
Electricity Generation applications the ReGenX Generator innovation now allows all electricity to be
generated at infinite efficiency requiring zero Input Energy, zero Input Energy Cost, while producing
zero Greenhouse Gas Emissions, zero Air Pollution and zero Nuclear Waste during the Electricity
Generation Phase. In Electric Motor operation the ReGen-X Quantum Motor now allows any
magnitude of Work to be performed with zero Electric Input Energy.
Demonstration Protocol: The demonstration protocol involves three prototypes;
1. Protytpe #1, demonstrates the ReGenX Generator's Load Current Time Delay when compared
to the instantaneous Load Current Sine Wave for a Conventional Generator Coil.
2. In the Conventional Faraday Generator operation the created Electromagnetic Field Energy
performs Negative Work at infinite efficiency and it reduces the Kinetic Energy of the system.
3. The Magnitude of the Negative Work / System Kinetic Energy Reduction (in Joules) is equal to
the Magnitude of the created Electromagnetic Field Energy (also in Joules).
4. When the Conventional Faraday Generator is placed On-Load, Negative Work is performed and
the speed of the system decreases according to Lenz's Law of Induction.
5. In order to maintain the System Speed and the Electric Power magnitude to the Loads,
additional Input Power must be supplied to the Prime Mover and additional Mechanical Input
Power must be supplied to the Generator's Drive Shaft.
6. For example, if 100 Watts of Electric Power is delivered to the Load by the Faraday Generator,
an additional >100 Watts of Mechanical Input Power must be supplied to the Generator's Drive
Shaft by the Prime Mover.
7. If 1 MW of Electric Power is delivered to the Load by the Faraday Generator, an additional >1
MW Watts of Mechanical Input Power must be supplied to the Generator's Drive Shaft by the
Prime Mover.
8. Generally speaking the ratio is 2 Watts of Mechanical Input Power to every 1 Watt of Electric
Output Power generated.
9. The increase in Drive Shaft Mechanical Input Power is provided by the Prime Mover and the
Input Energy Source which powers the Prime Mover.
10. In the Heins ReGenX Generator operation the created and Time Delayed Electromagnetic Field
Energy performs Positive Work at infinite efficiency and it increases the Kinetic Energy of the
system.
Optimization of Cumulative Energy, Exergy Consumption and Environmental Life ...J. Agricultural Machinery
油
Optimal use of resources, including energy, is one of the most important principles in modern and sustainable agricultural systems. Exergy analysis and life cycle assessment were used to study the efficient use of inputs, energy consumption reduction, and various environmental effects in the corn production system in Lorestan province, Iran. The required data were collected from farmers in Lorestan province using random sampling. The Cobb-Douglas equation and data envelopment analysis were utilized for modeling and optimizing cumulative energy and exergy consumption (CEnC and CExC) and devising strategies to mitigate the environmental impacts of corn production. The Cobb-Douglas equation results revealed that electricity, diesel fuel, and N-fertilizer were the major contributors to CExC in the corn production system. According to the Data Envelopment Analysis (DEA) results, the average efficiency of all farms in terms of CExC was 94.7% in the CCR model and 97.8% in the BCC model. Furthermore, the results indicated that there was excessive consumption of inputs, particularly potassium and phosphate fertilizers. By adopting more suitable methods based on DEA of efficient farmers, it was possible to save 6.47, 10.42, 7.40, 13.32, 31.29, 3.25, and 6.78% in the exergy consumption of diesel fuel, electricity, machinery, chemical fertilizers, biocides, seeds, and irrigation, respectively.
How to Build a Maze Solving Robot Using ArduinoCircuitDigest
油
Learn how to make an Arduino-powered robot that can navigate mazes on its own using IR sensors and "Hand on the wall" algorithm.
This step-by-step guide will show you how to build your own maze-solving robot using Arduino UNO, three IR sensors, and basic components that you can easily find in your local electronics shop.
Welcome to the March 2025 issue of WIPAC Monthly the magazine brought to you by the LinkedIn Group WIPAC Monthly.
In this month's edition, on top of the month's news from the water industry we cover subjects from the intelligent use of wastewater networks, the use of machine learning in water quality as well as how, we as an industry, need to develop the skills base in developing areas such as Machine Learning and Artificial Intelligence.
Enjoy the latest edition
EXPLORE 6 EXCITING DOMAINS:
1. Machine Learning: Discover the world of AI and ML!
2. App Development: Build innovative mobile apps!
3. Competitive Programming: Enhance your coding skills!
4. Web Development: Create stunning web applications!
5. Blockchain: Uncover the power of decentralized tech!
6. Cloud Computing: Explore the world of cloud infrastructure!
Join us to unravel the unexplored, network with like-minded individuals, and dive into the world of tech!
Lessons learned when managing MySQL in the CloudIgor Donchovski
油
Managing MySQL in the cloud introduces a new set of challenges compared to traditional on-premises setups, from ensuring optimal performance to handling unexpected outages. In this article, we delve into covering topics such as performance tuning, cost-effective scalability, and maintaining high availability. We also explore the importance of monitoring, automation, and best practices for disaster recovery to minimize downtime.
Gauges are a Pump's Best Friend - Troubleshooting and Operations - v.07Brian Gongol
油
No reputable doctor would try to conduct a basic physical exam without the help of a stethoscope. That's because the stethoscope is the best tool for gaining a basic "look" inside the key systems of the human body. Gauges perform a similar function for pumping systems, allowing technicians to "see" inside the pump without having to break anything open. Knowing what to do with the information gained takes practice and systemic thinking. This is a primer in how to do that.
Gauges are a Pump's Best Friend - Troubleshooting and Operations - v.07Brian Gongol
油
OSPF-BASICO PROTOCOLO DE ENRUTAMIENTO DINAMICO
1. 息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
ITE PC v4.0
Chapter 1 1
OSPF
Cap鱈tulo 11
2. ITE PC v4.0
Chapter 1 2
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Introduction
3. ITE PC v4.0
Chapter 1 3
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Introduction to OSPF
OSPF Packet Types
4. ITE PC v4.0
Chapter 1 4
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Introduction to OSPF
OSPF Hello Intervals
Usually multicast (224.0.0.5)
Sent every 30 seconds for NBMA segments
OSPF Dead Intervals
This is the time that must transpire
before the neighbor is considered
down
Default time is 4 times
the hello interval
5. ITE PC v4.0
Chapter 1 5
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Introduction to OSPF
OSPF Algorithm
OSPF routers build &
maintain link-state
database containing LSA
received from other routers
Information found in database
is utilized upon execution of
Dijkstra SPF algorithm
SPF algorithm used to create
SPF tree
SPF tree used to populate
routing table
6. ITE PC v4.0
Chapter 1 6
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Basic OSPF Configuration
The router ospf command
To enable OSPF on a router use the following
command
R1(config)#router ospf process-id
Process id
A locally significant number between 1 and 65535
-this means it does not have to match other OSPF
routers
7. ITE PC v4.0
Chapter 1 7
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Basic OSPF Configuration
OSPF network command
-Requires entering: network address
wildcard mask - the inverse of the subnet
mask
area-id - area-id refers to the OSPF area.
OSPF area is a group of routers
that share link state information
-Example: Router(config-router)#network network-address
wildcard-ask area area-id
8. ITE PC v4.0
Chapter 1 8
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Basic OSPF Configuration
Router ID
This is an IP address used to identify a router
3 criteria for deriving the router ID
Use IP address configured with OSPF router-id command
-Takes precedence over loopback and physical interface
addresses
If router-id command not used then router chooses highest
IP address of any loopback interfaces
If no loopback interfaces are configured then the highest IP
address on any active interface is used
Show ip protocols
Show ip ospf
Show ip ospf interface
9. ITE PC v4.0
Chapter 1 9
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Basic OSPF Configuration
Verifying OSPF
Use the show ip ospf neighbor command to verify &
troubleshoot OSPF networks
Command will display the following:
Neighbor adjacency
-No adjacency indicated by -
Neighboring routers Router ID is not displayed
A state of full is not displayed
-Consequence of no adjacency-
No link state information exchanged
Inaccurate SPF trees & routing tables
10. ITE PC v4.0
Chapter 1 10
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF Metric
OSPF uses cost as the metric for determining the
best route
-The best route will have the lowest cost
-Cost is based on bandwidth of an interface
Cost is calculated using the formula
108
/ bandwidth
-Reference bandwidth
defaults to 100Mbps
can be modified using
auto-cost reference-bandwidth command
11. ITE PC v4.0
Chapter 1 11
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Basic OSPF Configuration
Modifying the Cost of a link
Both sides of a serial link should be configured with the
same bandwidth
Commands used to modify bandwidth value
Bandwidth command
Example: Router(config-if)#bandwidth bandwidth-kbps
ip ospf cost command allows you to directly specify
interface cost
-Example:R1(config)#interface serial 0/0/0
R1(config-if)#ip ospf cost 1562
12. ITE PC v4.0
Chapter 1 12
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF in Multiaccess Networks
2 challenges presented by multiaccess networks
Multiple adjacencies
Extensive LSA flooding
13. ITE PC v4.0
Chapter 1 13
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF in Multiaccess Networks
Solution to LSA flooding issue
is the use of
Designated router (DR)
Backup designated router (BDR)
DR & BDR selection
Routers are elected to send &
receive LSA
Sending & Receiving LSA
DRothers send LSAs via multicast
224.0.0.6 to DR & BDR
DR forward LSA via multicast
address 224.0.0.5 to all other
routers
14. ITE PC v4.0
Chapter 1 14
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF in Multiaccess Networks
DR/BDR Election Process
DR/BDR elections DO NOT occur in point to point
networks
15. ITE PC v4.0
Chapter 1 15
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF in Multiaccess Networks
Criteria for getting elected DR/BDR
1. DR: Router with the highest OSPF
interface priority.
2. BDR: Router with the second highest
OSPF interface priority.
3. If OSPF interface priorities are equal, the
highest router ID is used to break the tie.
16. ITE PC v4.0
Chapter 1 16
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
Introduction to OSPF
Hello Protocol
OSPF Hello Packet
Discover OSPF neighbors & establish adjacencies
Advertise guidelines on which routers must agree to become neighbors
Used by multi-access networks to elect a designated router and a
backup designated router
17. ITE PC v4.0
Chapter 1 17
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF in Multiaccess Networks
Timing of DR/BDR Election
Occurs as soon as 1st
router has its interface enabled on
multiaccess network
When a DR is elected it remains as the DR until one of the
following occurs
-The DR fails.
-The OSPF process on the DR fails.
-The multiaccess interface on the DR fails.
18. ITE PC v4.0
Chapter 1 18
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF in Multiaccess Networks
OSPF Interface Priority
Manipulating the DR/BDR election process continued
Use the ip ospf priority interface command.
Example:Router(config-if)#ip ospf priority {0 - 255}
Priority number range 0 to 255
0 means the router cannot become the DR or BDR
1 is the default priority value
19. ITE PC v4.0
Chapter 1 19
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
More OSPF Configuration
Redistributing an OSPF Default Route
Topology includes a link to ISP
Router connected to ISP
Called an autonomous system border router
Used to propagate a default route
Example of static default route
R1(config)#ip route 0.0.0.0 0.0.0.0
loopback 1
R1(config-router)#default-information
originate
20. ITE PC v4.0
Chapter 1 20
息 2007 Cisco Systems, Inc. All rights reserved. Cisco Public
More OSPF Configuration
Fine-Tuning OSPF
Modifying OSPF timers
Reason to modify timers
Faster detection of network failures
Manually modifying Hello & Dead intervals
Router(config-if)#ip ospf hello-interval seconds
Router(config-if)#ip ospf dead-interval seconds
Point to be made
Hello & Dead intervals must be the same between
neighbors