Created by Thea Usita
about 7 years ago
|
||
Question | Answer |
It is a link-state routing protocol that was developed as a replacement for the distance vector routing protocol, RIP. | Open Shortest Path First (OSPF) |
It is RIP's metric for determining the best route quickly. | hop count |
T or F: Using hop count does not scale well in larger networks with multiple paths of varying speeds. | TRUE |
T or F: An advantage of OSPF is having faster convergence and scales to much larger network implementations. | TRUE |
OSPF is a _____ routing protocol that uses the concept of areas for ______. | classless scalability |
What are the characteristics of OSPF? | Classless Efficient Fast Convergence Scalable Secure |
OSPF v3 for IPv6 currently published in _____. | RFC 5340 |
Supports VLSM and CIDR. | Classless |
Routing changes trigger routing updates. It uses the SPF algorithm to choose the best path. | Efficient |
T or F: OSPF has periodic updates. | FALSE |
It is the algorithm used by OSPF to choose its best path. | Djistra's SPF Algorithm |
It quickly propagates network changes. | Fast Convergence |
It works well in small and large network sizes. Routers can be grouped into areas to support a hierarchical system. | Scalable |
Routers can be grouped into _____ to support a _____. | Areas Hierarchical System |
It supports Message Digest 5 (MD5) authentication. When enabled, OSPF routers only accept encrypted routing updates from peers with the same pre-shared password. | Secure |
Authentication supported by OSPF. | Message Digest 5 (MD 5) |
T or F: With Message Digest 5, routers can also accept routing updates that are not encrypted. | FALSE |
What is the administrative distance for OSPF? | 110 |
What are the components of OSPF? | Data Structures Routing Protocol Messages Algorithm |
OSPF's data structures consists of ____, ____, and ____. | Adjacency database Link-state database (LSDB) Forwarding database |
Creates the neighbor table. | Adjacency database |
Creates the topology table. | Link-state database (LDSB) |
Creates the routing table. | Forwarding database |
These are [the Routing Protocol Messages] used to discover neighboring routers and also to exchange routing information to maintain accurate information about the network. | Hello packet Database description packet Link-state request packet Link-state update packet Link-state acknowledgement packet |
The SPF algorithm is based on the _____ to reach a destination. | Cost |
The SPF algorithm creates an ____. | SPF tree |
OSPF places the best routes into the ___, which is used to make the ____. | Forwarding database Routing table |
It is a list of all neighbor routers to which a router has established bidirectional communication. | Adjacency database Neighbor Table |
T or F: The Neighbor Table is unique for each router. | TRUE |
Command to view the neighbor table. | show ip ospf neighbor |
Lists information about all other routers in the network. | Topology Table |
It represents the network topology. | Link-state Database (LDSB) |
T or F: All routers within an area have different Link-state Database (LDSB). | FALSE |
Command to view the topology table. | show ip ospf database |
List of routes generated when an algorithm is run on the link-state database. | Routing table |
T or F: Each router's routing table is unique. | TRUE |
Command to view the routing table. | show ip route |
Area 0 is called the ____. | Backbone area |
Interconnecting routers are called ____. | Area Border Routers (ABRs) |
T or F: Single-Area OSPF is useful in smaller networks with few routers. | TRUE |
OSPF messages are transmitted over a/an ____. | Ethernet link |
OSPF messages contain the following: | Data Link Frame Header IP Packet Header OSPF Packet Header OSPF Packet Type |
OSPF uses ____ to establish and maintain neighbor adjacencies and exchange routing updates. | Link-state Packets (LSPs) |
Used to establish and maintain adjacency with other OSPF routers. | Hello Packet |
Contains the abbreviated list of the sending router's LDSB. | Database Description (DBD) packet |
Used by the receiving routers to request more information about an entry in the DBD. | Link-State Request (LSR) packet |
Used to reply to LSRs and to announce new information. | Link-State Update (LSU) packet |
This is sent to confirm receipt of the LSU. | Link-State Acknowledgment (LSAck) packet |
T or F: the LSAck data field is empty. | TRUE. |
Used to discover OSPF neighbors and establish neighbor adjacencies. | Hello Packet |
Hello packets elect the ____ and ____ on ____ networks like Ethernet and Frame Relay. | Designated Router Backup Designated Router Multiaccess |
T or F: Point-to-point links require DR or BDR. | FALSE |
It is a 32-bit value expressed in dotted decimal notation (an IPv4 address) used to uniquely identifying the originating router. | Router ID |
Subnet mask associated with the sending interface. | Network Mask |
Area from which the packet originated. | Area ID |
Specifies the frequency, in seconds, at which a router sends Hello packets. | Hello Intval |
The default Hello interval on multiaccess and point-to-point networks is ____. | 10 seconds |
It is used in a DR/ BDR election. | Router Priority |
What is the default priority for all OSPF routers? | 1 |
T or F: The lower the value, the more likely the router becomes the DR on the link. | FALSE |
It is the time in seconds that a router awaits to hear from a neighbor before declaring the neighboring router out of service. | Dead Interval |
What is the default Dead Interval? | Four times the Hello Interval |
What is the default Hello interval on nonbroadcast multiaccess [NBMA] networks; Frame Relay. | 30 seconds |
T or F: If the Dead interval expires before the routers receive a Hello packet, OSPF removes that neighbor from its LSDB. | TRUE |
T or F: The router floods the LSDB with information about the down neighbor out all OSPF-enabled interfaces. | TRUE |
What is the default Dead interval for multiaccess and point-to-point networks? | 40 seconds |
What is the default Dead interval for NBMA networks? | 120 seconds |
State where no Hello packets are received. Router sends Hello packets. | Down State |
State where Hello packets are received from the neighbor. | Init State |
State where electing a DR and BDR happen on Ethernet links. | Two-Way State |
State where negotiation of master/ slave relationship and dbd packet sequence number happen. | ExStart State |
State where routers exchange DBD packets. | Exchange State |
State where LSRs and LSUs are used to gain additional router information. Routers are processed using the SPF algorithm. | Loading State |
The ____ initiates the DBD packet exchange. | master |
State where routers have converged. | Full State |
T or F: More routers = more adjacencies | TRUE |
OSPFv2 is enabled using which commandin the global configuration mode? | router ospf [process-id] |
The process-id value is ranged between? | 1 and 65,535 |
Recommended method (command) to assign a router ID. | router-id rid |
T or F: If the router ID is not explicitly configured, the router chooses the highest IPv4 address of any of configured loopback interfaces. | TRUE |
T or F: If no loopback interfaces are configured, then the router chooses the highest inactive IPv4 address of any of its physical interfaces. | FALSE |
A router ID can also be assigned using a _____. | Loopback interface |
T or F: A 32-bit host route gets advertised as a route to other OSPF routers. | FALSE |
The basic command syntax for enabling OSPF on interfaces is? | network network-address wildcard-mask area area-id |
OSPF metric is ___. | Cost |
T or F: Higher bandwidth = Lower cost | TRUE |
T or F: The cost of an interface is inversely proportional to the bandwidth of the interface. | TRUE |
What is the default reference bandwidth? | 100,000,000 |
OSPF cost formula is: | Cost = reference bandwidth / interface bandwidth |
T or F: When adjusting the reference bandwidth, the command must be configured on every router in the OSPF domain. | TRUE |
T or F: The bandwidth must be adjusted at each end of the serial links. | TRUE |
This command is a quick way to verify vital OSPF configuration information. | show ip protocols |
This command is used to verify OSPF Process Information. | show ip ospf |
It is the OSPFv2 equivalent for exchanging IPv6 prefixes. | OSPFv3 |
What OSPFv3 feature supports both IPv4 and IPv6? | OSPFv3 Address Families |
T or F: IPv6 and IPv4 routing protocols are basically the same and run dependently with each other. | FALSE |
T or F: OSPFv2 and OSPFv3 each have separate adjacency tables, OSPF topology tables, and IP routing tables. | TRUE |
Source/ Destination address for OSPFv3. | IPv6 link-local address |
Authentication used for OSPFv3. | IPv6 authentication |
T or F: IPv6 unicast forwarding is enabled by default. | FALSE |
____ are automatically created when an IPv6 global unicast address is assigned to the interface. | Link-local Address |
Want to create your own Flashcards for free with GoConqr? Learn more.