🧪 Routing MCQ Quiz Hub

Routing Mcq Question Set 2

Choose a topic to test your knowledge and improve your Routing skills

1. In ______, the router forwards the received packet through only one of its interfaces.




2. In _______, the router may forward the received packet through several of its interfaces.




3. Emulation of ________ through _______ is not efficient and may create long delays.




4. In unicast routing, each router in the domain has a table that defines a ______ path tree to possible destinations.




5. In multicast routing, each involved router needs to construct a ________ path tree for each group.




6. In the _______ tree approach, each router needs to have one shortest path tree for each group.




7. In the group-shared tree approach, _________ involved in multicasting.




8. Multicast link state routing uses the _______ tree approach.




9. The Multicast Open Shortest Path First (MOSPF) protocol is an extension of the OSPF protocol that uses multicast routing to create source-based trees. The protocol is based on _______ routing.




10. MOSPF is a _______ protocol.




11. ______ broadcasts packets, but creates loops in the systems.




12. In RPF, a router forwards only the copy that has traveled the _______ path from the source to the router.




13. RPF eliminates the ________ in the flooding process.




14. RPF guarantees that each network receives only ____ of the multicast packet.




15. RPB creates a shortest path _______ tree from the source to each destination.




16. RPB guarantees that each destination receives _________ of the packet.




17. In ________, the multicast packet must reach only those networks that have active members for that particular group.




18. ____ adds pruning and grafting to _______ to create a multicast shortest path tree that supports dynamic membership changes.




19. ______ is an implementation of multicast distance vector routing. It is a source-based routing protocol, based on RIP.




20. DVMRP is a ________routing protocol, based on RIP.




21. Pruning and grafting are strategies used in _______.




22. A _______ message tells an upstream router to stop sending multicast messages for a specific group through a specific router.




23. A _______ message tells an upstream router to start sending multicast messages for a specific group through a specific router.




24. CBT is a ________ protocol that uses a core as the root of the tree.




25. PIM-DM is used in a _______ multicast environment, such as a LAN.




26. PIM-SM is used in a _______multicast environment such as a WAN.




27. In _______, a logical tunnel is established by encapsulating the multicast packet inside a unicast packet.




28. If routing information is automatically updated by routers when changes are made to the network configuration are called




29. If two or more routers are available in distributed routing, which route should be selected




30. Multi-path routing can be achieved in




31. Distance vector protocols are




32. Which function allows dumping of invalid packets for a specific network instead of forwarding ?




33. In source routing bridges each LAN has a unique ................. bit number.




34. In adaptive tree walk protocol we use .............. and ............ searching.




35. The routing algorithm within each network is .........




36. In link state routing, after the construction of link state packets new routes are computed using .......




37. Count-to-Infinity problem occurs in .............




38. In distance vector routing algorithm, each router maintains a separate routing table with the following entries.




39. Link state packets are built in ........




40. In which routing method do all the routers have a common database?




41. In distance vector routing algorithm, the routing tables are updated ............




42. Distance vector routing algorithm is implemented in Internet as ............




43. Which of the following routing algorithm takes into account the current network load.




44. In distance vector routing the delay metric is ........




45. In AODV routing algorithm for MANETs, the route is discovered at time




46. In multicast routing with spanning tree method, a network with n groups, each with an average of m members, for each group we require .........




47. To do multicast routing, each router computes a ..........




48. A well -defined groups that are numerically large in size but small compared to the network as a whole are used in .......




49. The processes that keep track of hosts whose home is in the area, but who currently visiting another area is ........




50. In ........ to send a multicast message a host sends it to the core, which then does the multicast along the spanning tree.