01. Which event will cause a triggered update?
- an update routing timer expires
- a corrupt update message is received
- a route is installed in the routing table
- the network is converged
02. Three routers running a distance-vector routing protocol lost all power, including the battery backups. When the routers reload, what will happen?
- They will share all routes saved in NVRAM prior to the power loss with their directly connected neighbors.
- They will multicast hello packets to all other routers in the network to establish neighbor adjacencies.
- They will send updates that include only directly connected routes to their directly connected neighbors.
- They will broadcast their full routing table to all routers in the network.
- ensures an invalid route has a metric of 15
- prevents a router from sending any updates after it has introduced a routing loop into the network
- ensures every new route is valid before sending an update
- instructs routers to ignore updates, for a specified time or event, about possible inaccessible routes
- updates are broadcast only when there are changes to the topology
- updates are broadcast at regular intervals
- broadcast are sent to 0.0.0.0
- broadcasts are sent to 255.255.255.255
- updates contain the entire network topology
- only changes are included in the updates
- uses a broadcast to update all other routers in the network every 60 seconds
- uses a multicast address to update other routers every 90 seconds
- will send out an update if there is a failure of a link
- updates only contain information about routes that have changed since last update
- EIGRP can be used with Cisco and non-Cisco routers.
- EIGRP sends triggered updates whenever there is a change in topology that influences the routing information.
- EIGRP has an infinite metric of 16.
- EIGRP sends a partial routing table update, which includes just routes that have been changed.
- EIGRP broadcasts its updates to all routers in the network.
- It prevents the synchronization of routing updates by buffering the updates as they leave the router interfaces.
- It prevents the synchronization of routing updates by subtracting a random length of time ranging from 0% to 15% of the specified interval time from the next routing update interval.
- It prevents the synchronization of routing updates by causing the router to skip every other scheduled update time.
- It prevents the synchronization of routing updates by forcing the router to listen when its time for other updates on the lines before sending its update.
- RouterB will include network 123.92.76.0 and 136.125.85.0 in its update to RouterA.
- During the next update interval, RouterB will send a RIP update out both ports that includes the inaccessible network.
- During the next update interval, RouterC will send an update to RouterB stating that network 114.125.16.0 is accessible in 2 hops.
- Router C will learn of the loss of connectivity to network 114.125.16.0 from RouterB.
- RouterB will include network 123.92.76.0 and 136.125.85.0 in its update to RouterC.
- Routing updates are split in half to reduce the update time.
- Information learned from one source is not distributed back to that source.
- New route information must be learned from multiple sources to be accepted.
- The time between updates is split in half to speed convergence.
- New route information is suppressed until the system has converged.
- split horizon
- error condition
- hold-down timer
- route poisoning
- count to infinity
- used to mark routes as unreachable in updates sent to other routers
- prevents regular update messages from reinstating a route that may have gone bad
- prevents a router from advertising a network through the interface from which the update came
- limits the time or hops that a packet can traverse through the network before it should be discarded
- defines a maximum metric value for each distance vector routing protocol by setting a maximum hop count
- routing loops
- inconsistent traffic forwarding
- no traffic forwarding until system converges
- inconsistent routing table entries
- routing table updates sent to wrong destinations
- The Holddown timer will wait to remove the route from the table for 60 seconds.
- The Invalid timer will mark the route as unusable if an update has not been received in 180 seconds.
- The Update timer will request an update for routes that were learned from Router B.
- The Hello timer will expire after 10 seconds and the route will be flushed out of the routing table.
- EIGRP uses periodic updates.
- EIGRP only updates affected neighbors.
- EIGRP uses broadcast updates.
- EIGRP updates are partial.
- EIGRP uses the efficient Bellman-Ford algorithm.
- The path will be router A -> router B -> router C -> router E.
- The path will be router A -> router D -> router E.
- Router A will load balance between the router A -> router D -> router E and router A -> router B -> router C -> router E paths.
- Packets will alternate paths depending on the order they arrive at router A.
- RIPv1
- EIGRP
- OSPF
- IS-IS
- RIPv2
- a packet bouncing back and forth between two loopback interfaces on a router
- a condition where a return path from a destination is different from the outbound path forming a “loop”
- a condition where a packet is constantly transmitted within a series of routers without ever reaching its intended destination
- the distribution of routes from one routing protocol into another
- random jitter
- implementation of classful addressing
- inconsistent routing tables
- incorrectly configured static routes
- a network converging too quickly
- 0
- 15
- 16
- 224
- 255
- 1
- 2
- 3
- 4
- 5
- 6
No comments:
Post a Comment