Dynamic Routing

A routing protocol

• exchanges information about routes between routers
• runs on a switch
• can replace Spanning Tree
• helps to update static routes

Dynamic routing helps routers

• achieve convergence
• work with no RAM
• defeat hackers
• reduce CPU usage

One purpose of a routing protocol is to

• learn and fill the routing table with routes to all networks
• waste CPU time on the router
• update static routes on the router
• remove route entries that nobody is using

One purpose of a routing protocol is to

• remote route entries that are no longer valid
• ensure that routing loops exist
• prevent end devices from using the Internet
• cause the Internet to melt down

One common route metric is

• bandwidth
• available memory
• speed of the PC
• type of router purchased

Which metric does RIP use?

• hop count
• bandwidth
• delay
• reliability

One type of routing protocol is

• distance vector
• spanning tree
• open routing
• link delay

One type of routing protocol is

• link state
• discrete vector
• scanning tree
• rip curl

A Distance Vector routing protocol

• learns by "word of mouth" from its neighbour routers
• gets its routes from humans
• never learns about new networks
• always trows away anything it learns

Does a Distance Vector router have a full map of the Internet

• Yes
• No
• Only a partial network
• It uses Google instead