Dv Routing Algorithms — Test 1

Correct Answer: B. B. Bellman €? ford algorithm
Explanation: DVR is a dynamic and intra-domain routing protocol which is developed by Bellman and ford. It is the evolved version of the original ARPANET and it is more efficient than flooding.

Correct Answer: C. C. By interchanging the information with neighbour nodes
Explanation: In distance vector routing algorithm, routing tables exchange their information only with their neighbour nodes. So, gradually tables will be updated with least distance routes for each destination and it will have information about next hop for each route.

Correct Answer: B. B. Using less setup
Explanation: Both flooding technique and distance vector routing are used to find shortest paths for the destinations. But flooding requires less setup than DVR because, nodes in it need to know information about their neighbors only. And it needs less memory with less setup.

Correct Answer: B. B. Routing tables have entry for all the nodes in the network
Explanation: In distance vector routing, routing tables have single entry for each node which is present in the network. But each router exchanges the information with neighboring nodes only.

Correct Answer: C. C. Infinite distance that is unreachable
Explanation: In DVR, if nodes are neighbors, they can send messages to find distance between them. But if the nodes are not neighbors then the distance between them is infinite initially. Later this infinity will be replaced with distance by the router.

Correct Answer: C. C. Triggered update
Explanation: Triggered update may happen when there is change in the routing table of the node or failure of neighboring links. It can happen at any time if a node is subjected to changes.

Correct Answer: A. A. Distance vector and link state routing
Explanation: Distance vector routing and link state routing are used with in an autonomous system and cannot work well in between autonomous systems. Scalability differs between intra-domain and inter-domain routing protocols.

Correct Answer: C. C. Reverse path forwarding
Explanation: Basically, flooding in distance vector routing causes the loops in multicast routing. In order to overcome this problem, reverse path forwarding does not allow the router to send the packets to the link that on which it has received the packet.

Correct Answer: C. C. Multicast distance vector routing
Explanation: Multicast distance vector routing uses the multicast routing technique and source based trees. Router uses its own uni-cast routing table and evanescent shortest path trees for forwarding packets instead of exchanging routing table for information.

Correct Answer: A. A. True
Explanation: Distance vector routing uses dynamic routing tables and these routing tables make use of dynamic routing protocols. The routing tables update themselves dynamically, according to the changes in the inter network.