Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Distance-Vector Routing Algorithm

Choose difficulty:

Beginner

Intermediate

Advanced

What does each node use to estimate the shortest path to a destination?

a: IP address of the destination Explanation

Explanation

b: Routing table of the entire network Explanation

Explanation

c: Distance vector received from neighbors Explanation

Explanation

d: MAC addresses of all network devices Explanation

Explanation

What is the main challenge of the Distance Vector Algorithm?

a: High bandwidth consumption Explanation

Explanation

b: Slow convergence and count-to-infinity problem Explanation

Explanation

c: Incompatibility with IP addresses Explanation

Explanation

d: Requirement for a central router Explanation

Explanation

What triggers a node to send its updated distance vector to neighbors?

a: A periodic timer expires Explanation

Explanation

b: It receives an updated distance vector from a neighbor and its own vector changes Explanation

Explanation

c: It receives a data packet from another node Explanation

Explanation

d: A new device connects to the network Explanation

Explanation

What mechanism helps reduce the Count-to-Infinity problem?

a: Hop count limit Explanation

Explanation

b: Subnetting Explanation

Explanation

c: Increasing update intervals Explanation

Explanation

d: Switching to Link-State Routing Explanation

Explanation

How does a node decide which neighbor to use for forwarding packets?

a: It selects the neighbor with the lowest cost in its distance vector Explanation

Explanation

b: It randomly selects a neighbor Explanation

Explanation

c: It forwards packets to all neighbors Explanation

Explanation

d: It always forwards packets to the central router Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)