cisco 2 ch 4

Card Set Information

Author:
koolp123
ID:
23574
Filename:
cisco 2 ch 4
Updated:
2010-06-14 22:03:06
Tags:
routing
Folders:

Description:
cisco 2 ch 4
Show Answers:

Home > Flashcards > Print Preview

The flashcards below were created by user koolp123 on FreezingBlue Flashcards. What would you like to do?


  1. Which 4 statements are true regarding distance vector routing protocols?

    1. Hop counts can be used for path selection.
    2. They scale well
    3. Routing updates are broadcast at intervals.
    4. EIGRP can do unequal-cost load balancing
    5. RIPv1 multicasts its routing updates
    6. RIP sends its entire rotuing table to directly connected neighbors.
    1.,3.,4., and 6.
  2. Which conditions cause distant vector routing protocols to send routing table updates? (choose 3)

    1. when the hold down timer expires
    2. when a change occurs in the network topology
    3. when the update timer value expires
    4. when a triggered update is received from another router
    5. when a packet is received that is destined for an unknown network
    6. when there have been no routing table changes for 30 minutes
    2.,3., and 4.
  3. What are the 2 characterstics of EIGRP updates? (choose 2)

    1. include all EIGRP routes
    2. include the full routing table
    3. independent of architecture
    4. only triggered for route topology chnages
    5. broadcast to affected neighbors
    6. bounded to affected next hop routers
    4. and 6.
  4. What feature was added to RIP to help with synchronization errors?

    1. holdown timer
    2. RIP_JITTER
    3. RIP_DELAY
    4. Jitter Control
    2.
  5. Which 2 of the following are timers used for RIP?

    1. Invalid
    2. Refresh
    3. Flush
    4. Deadlink
    5. Hello
    1. and 3.
  6. Which statement is true concerning the advantages of a distance vector protocol?

    1. periodic updates speed up convergence
    2. convergence times make routing loops impossible
    3. ease of implementation makes configuration simple
    4. they work well in complex networks
    5. their convergence times are faster than link state routing protocols
    3.
  7. Which mechanism can be used to avoid a count to infinity loop?

    1. split horizon
    2. route poisoning
    3. holddown timers
    4. triggered updates
    5. split horizon with poison reverse
    3.
  8. What allows distance vector protocols to avoid loops by advertising a metric of infinity?

    1. split horizon
    2. route poisoning
    3. holddown timers
    4. maximum hop count
    5. time to live (TTL) field of IP header
    2.
  9. Which field in the IP header ensures that packets will not loop endlessly on a network?

    1. CRC
    2. TOS
    3. TTL
    4. Ckecksum
    3.

What would you like to do?

Home > Flashcards > Print Preview