Networking II > Ch7 Dynamic Routing > Flashcards

Ch7 Dynamic Routing Flashcards

(80 cards)

Study These Flashcards
1
Q

Three Types of Routing Protocols

A
  1. Distance Vector
  2. Link-State
  3. Path Vectror
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Purpose of Dynamic Routing Protocols (4)

A
  1. Discovery of remote networks.
  2. Maintain up-to-date routing information
  3. Choose best path to destination.
  4. Ability to find alternate paths to destination.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Components of Dynamic Routing Protocols (3)

A
  1. Data Structures - tables / databases stored in RAM
  2. Routing Protocol Messages
  3. Algorithm
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

EIGRP Data Tables (3)

A
  1. Topology Table
  2. Neighbor Table
  3. Best path(s) in routing table.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

EIGRP Protocol Messages (5)

A
  1. Acknowledgements
  2. Queries
  3. Updates
  4. Replies
  5. Hellos
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Static Routing Advantages (4)

A
  1. Easy to Implement in small network
  2. Very Secure/ No Advertisement
  3. Route to destination is always the same.
  4. Low CPU/RAM overhead; no updates / routing algorithms.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Static Routing Disadvantages (3)

A
  1. Suitable only in smaller / simple networks; default static route
  2. Configuration complexity increases as network grows.
  3. High administrative overhead needed.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Dynamic Routing Advantages (7)

A
  1. Automatically shares information about remote networks.
  2. Determine the best path to each network and add this information to their routing tables.
  3. Requires less administrative overhead than static routing
  4. Suitable in all topologies where multiple routers are required.
  5. Generally independent of network size ( scales well).
  6. Automatically adapts topology to reroute traffic if possible.
  7. Helps the network admin manage configuring and maintaining static routes.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Dynamic Routing Disadvantages (4)

A
  1. Can be more complex to implement
  2. Less Secure / advertisement of network(s)
  3. Requires higher CPU/RAM overhead and link bandwidth.
  4. Route depends on current topology.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Basic Operations of Dynamic Routing Protocol (4)

A
  1. Router sends and receives routing messages on interfaces.
  2. Routers share routing messages and routing information with other routers that are using the same routing protocol.
  3. Routers exchange routing information about remote networks.
  4. Advertises changes in topology to other routers as the changes occur.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

convergence time

A

Amount of time it takes routers to share information, calculate best paths, and update routing tables.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

autonomous system (AS)

A

Collection of routers under common administration.

AKA Routing Domain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Interior Gateway Protocol

A
  1. Used for routing within an AS.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Exterior Gateway Protocol (3)

A
  1. Used for routing between AS
  2. Border Gateway Protocol (BGP) only currently-viable EGP used on Internet
  3. Used for situations where organization is multihomed
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

multihome

A

Being connected to multiple ISP.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Distance Vector Protocol Characteristics

A
  1. Routes determined by distance (hop count,cost, delay, etc) and vector (next-hop or exit interface)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Four IPv4 Distance Vector Protocols

A
  1. RIPv1
  2. RIPv2
  3. IGRP - Interior Gateway Routing Protocol
  4. EIGRP - Enhanced Interior Gateway Routing Protocol
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Link State Protocol Characteristics (3)

A
  1. Creates full topology map.
  2. Updates when topology (link-state) changes.
  3. Based on shortest path first protocols
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Two IPv4 Link State Protocols

A
  1. OSPF - Open Shortest Path First

2. IS-IS - Intermediate System to Intermediate System.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

When to use Link-State Protocols (3)

A
  1. Network design is hierarchical
  2. Fast convergence is crucial.
  3. Admin have a good knowledge of implemented link-state protocols.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Path-Vector Protocols

A

Refers to Border Gateway Protocols (BGP)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Classful (Legacy) Protocol Characteristics

A

Does not send subnet masks in routing updates.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Classless Protocol Characteristic

A

Sends subnet mask /prefix length in routing updates.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Routing Protocol Classifications (3)

A
  1. Purpose (Interior/Exterior Gateways)
  2. Operation - how it works (distance vector / link-state)
  3. Behavior (Classfull / Classless)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
RIPv1 (2)
1. Routing Information Protocol. | 2. Legacy, Interior Gateway Protocol, distance vector, classfull protocol.
26
IGRP (2)
1. Interior Gateway Routing Protocol | 2. Legacy, IGP, distance vector, classful protocol, Cisco developed.
27
RIPv2 (2)
1. Routing Information Protocol V2 | 2. IGP, distance vector, classless protocol.
28
EIGRP (2)
1. Enhanced Interior Gateway Protocol | 2. IGP, Classless, Distance Vector
29
OSPF (2)
1. Open Shortest Path First | 2. IGP, link-state, classless protocol.
30
OSPF Router Setup (2)
1. router ospf process_id - activates OSPF on router 2. router-id router_ip_address 3. network network_ip_address wildcard_mask area area_number- activates and advertises OSPF on network.
31
IS-IS (2)
1. Intermediate System to Intermediate System | 2. IGP, link-state, classless protocol
32
BGP(2)
1. Border Gateway Protocol. | 2. Exterior Gateway Protocol, path vector, classless protocol.
33
Routing Protocol Characteristics (5)
1. Speed of convergence. 2. Scalability - how large can network become 3. Classful/Classless 4. Resource Usage 5. Implementation and Maintainence.
34
Basic RIP Setup on Router (2)
1. router rip - enables rip on router | 2. network network_address - enables and advertises on network address
35
auto-summary (RIP cmd)
enables automatic network number summarization
36
default-information (RIP cmd)
Control distribution of default information
37
network network_address (RIP cmd)
Enables routing on ip interface and advertises network in RIP update
38
passive-interface interface_id (RIP cmd)
suppresses routing updates on an interface.
39
passive-interface default (RIP cmd)
sets all interfaces to passive
40
version version_number (RIP cmd) (2)
1. sets RIP version to 1 or 2 | 2. no version - sets RIPv1 to default - sends in RIPv1 but listens for v1 and v2; ignores v2 additional data.
41
show ip protocols
Command that displays IPv4 protocol set on router.
42
Propagate Default Route Defined and Procedure for (RIP)
Method to place default route on edge router and propagate to other RIP routers. 1. ip route 0.0.0.0 0.0.0.0 exit interface | next_hop_ip 2. default-information originate - instructs router to originate default information, by propagating the static default route in RIP updates.
43
Enabling RIPng (3)
1. ipv6 unicast-routing 2. interface interface_id 3. ipv6 rip domain_name enable
44
Propagate Default Route Procedure for RIPng
1. ipv6 route ::/0 exit_interface | next-hop | 2. ipv6 rip domain_name default-information originate.
45
show ipv6 protocols
display IPv6 routing protocols on device
46
show ipv6 route
displays ipv6 routing table
47
Link State Routing Process (5)
1. Each router learns about each of its own directly connected neighbors. 2. Each router is responsible for saying hello to its neighbors on directly connected networks. 3. Each router builds a Link-State packet containing the state of each directly connected link. 4. Each router floods the LSP to all neighbors who then store all LSP's received in a database. 5. Each router uses the database to construct a complete map of the topology and computes the best path to each destination network. (Shortest Path First table)
48
Link State Packet Information Contents (4)
1. Interfaces IPv4/6 address and subnet mask/prefix 2. Type of network broadcast (ethernet) or point to point (serial) 3. Cost of the link. (metric information) 4. Neighbor routers on the link.
49
Link-State Routing Protocol Advantages (4)
1. Each router has complete topological map. 2. Faster convergence due to LSP flooding. 3. LSP's are sent only when topology changes and contains only the information regarding the change. 4. Hierarchical design used when implementing multiple areas.
50
Link-State Routing Protocol Disadvantages (3)
1. Maintaining a link-state db and SPF tree requires additional memory. 2. Calculating SPF algorithm requires additional CPU processing. 3. Bandwidth can be adversely affected by link-state packet flooding.
51
Routing Table Source Codes (6)
1. C - Connected Network 2. L - Local Route 3. S - Static Route 4. D - Learned by EIGRP 5. O - Learned by OSPF 6. R - Learned by RIP
52
Routing Table Entry
Route Source | Dest. Network Address | [AD/Metric] | Next-Hop IP | Route Timestamp | Outgoing Interface
53
Ultimate Route
Routing table entry that contains next-hop and/or exit interface
54
Level 1 Route
Route with subnet mask equal to or less than the classfull mask of the network address.
55
Level 1 Parent Route
Level 1 network route that is subnetted.
56
Level 2 Child Route
Route that is a subnet of a classfull network address.
57
Route Look-up Process (8)
1. If best match is a level 1 Ultimate Route this route is used to forward packet. 2. If level 1 Parent is best match proceed to step 3. 3. Child routes of Level 1 Parent best match is examined. 4. If Level 2 child route matches, that subnet is used to forward packet. 5. If no level 2 child routes match proceed to step 5. 6. Level 1 Supernet routes are searched (including default route if it exists) 7. If lesser match with a level 1 supernet exists or default route the packets are forwarded over that route. 8. If no match exists in routing table; packed is dropped.
58
How Do Routers Determine Best Match
Matches determined by finding the routes that have the most far-left matching bits when IP addresses are resolved to binary.
59
IPv6 Ultimate Routes
All IPv6 are level 1 ultimate routes; parent / child routes do not exist due to classless design.
60
Which Algorithm does RIP use.
Bellman-Ford Algorithm
61
RIP Update Method
Routing updates broadcast (255.255.255.255) every 30 sec Uses UDP port 520.
62
Algorithm for EIGRP
Diffusing Update Algorithm (DUAL)
63
How Does EIGRP Update Router Information
Bounded Triggered Updates multicast to 224.0 .0.10
64
Max Hop Count for EIGRP
255
65
How does EIGRP support no IP protocols.
Uses Protocol Dependent Messages to support protocols other than Ip4/6
66
How does EIGRP maintain adjacencies.
Uses Hello keepalive messages to maintain adjacencies with neighboring routers.
67
How Does RIPv2 Update Router Information
Updates multicast to 224.0.0.9. | Uses UDP port 520
68
How Do Distance Vector Protocols Update
Updates on periodic intervals
69
How Do Distance Vector Protocols See the Network
Only aware of next-hop and/or exit-interface
70
Displaying RIPng Routes
show ipv6 route rip
71
Ultimate Route Examples
Directly Connected / Dynamic Learned / Local Routes
72
Level 1 Route Examples
Network Route / Supernet Route / Default Route
73
Is IPv6 Classfull or Classless
All IPv6 is considered classless.
74
List One Problem With Classfull Routing Protocols
Can cause inefficiencies in data transfer with discontiguous networks.
75
Metric for RIP
Hop Count
76
IGRP Metric
Bandwidth, delay, load, and reliability composite metric.
77
How Often Does IGRP Update
Every 90 seconds.
78
Two Feature Improvements from RIPv1 to RIPv2
1. Supports route summarization | 2. Supports authentication
79
How Does EIGRP See the Network
Maintains topology table; maintains all routes not just best paths.
80
What is EIGRP's Speed of Convergence
Rapid Convergence
Networking II
flashcards
Decks in class (15)
# Cards
Brainscape helps you reach your goals faster, through stronger study habits.
© 2026 Bold Learning Solutions. Terms and Conditions