adplus-dvertising
frame-decoration

Question

In Broadcast routing, if the router does not know anything all about spanning tree, ................... method is preferred.

a.

Reverse Path forwarding

b.

Multidestination

c.

Flooding

d.

Spanning tree

Posted under Networking

Answer: (a).Reverse Path forwarding

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In Broadcast routing, if the router does not know anything all about spanning tree, ................... method is preferred.

Similar Questions

Discover Related MCQs

Q. The method of Broadcast routing in which each packet contains either a list of destinations or a bit map indicating the desired destinations is ...................

Q. Sending a message to a well defined group that are numerically large in size but small compared to the network as a whole is called ...................

Q. ................ do not base their routing decisions on measurements or estimates of the current traffic and topology.

Q. The method of network routing where every possible path between transmitting and receiving DTE is used is called ...............

Q. In Hierarchical routing, the routers are divided into what is called as .................

Q. The regions in Hierarchical routing are grouped in to .................

Q. If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as .................

Q. In shortest path routing algorithm, the path length is measured based on .................

Q. Flooding always choose the ....................

Q. In military applications where large number of routers may be blown to bits at any instant, we use ...................

Q. In distributed applications, it is sometimes necessary to update all the databases concurrently, we use .......................

Q. The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as .................

Q. Adaptive routing algorithms get their information from .............

Q. If the route from I to J is computed in advance, off line, and downloaded to the routers when the network is booted is called as ...................

Q. In Hierarchical routing for N router subnet, the optimal number of levels is ..............

Q. The router algorithm takes the decision to changes the route when .................

Q. If route from router I to router J is computed on line based on the current statistics, then it is called as ....................

Q. If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as.................

Q. ................. change their routing decisions to reflect changes in the topology.

Q. If router J is on the optimal path from router I to router K, then the path from J to K along the same route is ..................