chp 3 dynamic routing Flashcards
1
Q
purpose of dynamic routing protocols
A
- discovery of remote networks
- choosing best path to destination networks
- maintaining up to date router information
- find new path if current path is no longer available
2
Q
dynamic routing protocol components
A
- routing protocol messages
- algorithm
- data structures
3
Q
advantages of dynamic routing
A
- automatically connected
- less administrative overhead
- less time consuming
- determine best path
4
Q
disadvantages of dynamic routing
A
- complex to implement
- less secure
- requires more resources
- path is decided by protocol
5
Q
routing protocol clssification
A
- interior gateway protocols
- exterior gateway protocols
6
Q
interior gateway protocols
A
- distance vector
- link state
7
Q
distance vector routing protocols
A
- rip
- eigrp
- uses distance (through how many routers) and direction to calculate best path
- routers do not have complete view of network
8
Q
link state routing protocols
A
- ospf
- is-is
- use spf algorithm and bandwidth to calculate best path
- creates complete network topology by exchanging routing messages
9
Q
exterior gateway protocols
A
-path vector
10
Q
path vector routing protocols
A
-bgp
11
Q
rip
A
- distance vector
- maximum hop count of 15
- split horizon rule
- send routing messages every 30 seconds
- ripv1 has broadcast messages
- ripv2 has multicast messages
12
Q
lan router messages impact
A
- wasted bandwidth
- wasted resources
- security risk
13
Q
routng table terms
A
- ultimate route
- level 1 route
- level 1 parent route
- level 2 child route
14
Q
ultimate route
A
-next hop ip or exit interface
15
Q
level 1 route
A
- network route
- supernet route (summary route)
- default route
