WN-Destination Sequence distance vector

1. What is the Destination Sequence Distance Vector (DSDV) routing algorithm?

• A proactive routing algorithm for mobile ad-hoc networks
• A reactive routing algorithm for mobile ad-hoc networks
• A proactive routing algorithm for wired networks
• A reactive routing algorithm for wired networks

2. What is the main feature of the DSDV routing algorithm?

• Continuously updates routes to destinations
• Updates routes to destinations only when required
• Does not update routes to destinations
• Updates routes in a random manner

3. How does the DSDV routing algorithm handle link breakages?

• By adding a sequence number to each route advertisement
• By removing the route from the routing table
• By ignoring the link breakage
• By updating the routing table in a random manner

4. What is the purpose of the sequence number in the DSDV routing algorithm?

• To prevent routing loops
• To ensure that routes are always up-to-date
• To reduce control traffic
• To minimize overhead on the network

5. What is a routing loop in the context of the DSDV routing algorithm?

• A situation where a packet is continuously forwarded in a circular path
• A situation where a packet is blocked from reaching its intended destination
• A situation where a packet is limited from reaching its intended destination
• A situation where a packet is filtered from reaching its intended destination

6. What is the main disadvantage of the DSDV routing algorithm?

• High overhead on the network
• Routes are not up-to-date
• High latency in updating routes
• High bandwidth utilization

7. How does the DSDV routing algorithm handle multiple routes to the same destination?

• By selecting the route with the highest sequence number
• By selecting the route with the lowest sequence number
• By selecting the route with the highest bandwidth
• By selecting the route with the lowest delay

8. What is the purpose of the destination sequence number in the DSDV routing algorithm?

• To ensure that routes are always up-to-date
• To prevent routing loops
• To reduce control traffic
• To minimize overhead on the network

9. How does the DSDV routing algorithm handle changes in the network topology?

• By updating the routing table continuously
• By updating the routing table only when required
• By not updating the routing table
• By updating the routing table in a random manner

10. What is the main advantage of using the DSDV routing algorithm in mobile ad-hoc networks?

• Routes are always up-to-date
• No control traffic is required
• Routes are updated in real-time
• Low overhead on the network